{
  "id": "parsevals-identity",
  "title": "Parseval's Identity",
  "lang": "en",
  "source_lang": "en",
  "summary": "Parseval's identity equates the squared norm of a vector or function with the sum of the squared magnitudes of its coefficients in a complete orthonormal expansion.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Parseval identity",
    "Parseval's equality",
    "Parseval's formula"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/parsevals-identity/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/parsevals-identity/",
      "json": "https://aiwiki.page/zh/parsevals-identity.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Parseval's identity is an equality expressing preservation of squared length under expansion in a complete orthonormal system. In its classical form for Fourier series, it states that the integral of the squared magnitude of a function equals an appropriately normalized sum of the squared magnitudes of its Fourier coefficients. More generally, it holds for expansions in an orthonormal basis of a Hilbert space. Named after the French mathematician Marc-Antoine Parseval, the identity is fundamental to harmonic analysis and provides the mathematical basis for interpreting Fourier coefficients as a distribution of signal energy among frequencies."
    },
    {
      "heading": "Hilbert-space formulation",
      "text": "Let \\(H\\) be a real or complex Hilbert space, with inner product \\(\\langle\\cdot,\\cdot\\rangle\\) and induced norm \\(\\|x\\|=\\sqrt{\\langle x,x\\rangle}\\). Adopt the convention that the inner product is linear in its first argument. If \\((e_n)_{n=1}^{\\infty}\\) is a complete orthonormal sequence in \\(H\\), then every \\(x\\in H\\) satisfies\n\n\\[\\boxed{\\|x\\|^2=\\sum_{n=1}^{\\infty}|\\langle x,e_n\\rangle|^2.}\\]\n\nOrthonormality means that \\(\\langle e_n,e_m\\rangle\\) is \\(1\\) when \\(n=m\\) and \\(0\\) otherwise. Completeness means that finite linear combinations of the \\(e_n\\) are dense in \\(H\\). It is this completeness, not merely orthogonality, that guarantees equality for every vector.\n\nThe associated expansion is\n\n\\[x=\\sum_{n=1}^{\\infty}\\langle x,e_n\\rangle e_n,\\]\n\nwhere convergence is in the norm of \\(H\\). Parseval's identity therefore generalizes the Pythagorean theorem from finitely many perpendicular components to an infinite orthonormal expansion.\n\nA corresponding two-vector identity is\n\n\\[\\langle x,y\\rangle = \\sum_{n=1}^{\\infty} \\langle x,e_n\\rangle \\overline{\\langle y,e_n\\rangle}.\\]\n\nThis series converges absolutely by the Cauchy–Schwarz inequality. Taking \\(y=x\\) gives the squared-norm identity.\n\nIncomplete orthonormal systems\n\nIf an orthonormal sequence is not complete, the general statement is Bessel's inequality:\n\n\\[\\sum_{n=1}^{\\infty}|\\langle x,e_n\\rangle|^2 \\leq \\|x\\|^2.\\]\n\nLet \\(M\\) be the closed linear span of the sequence, and let \\(P_Mx\\) be the orthogonal projection of \\(x\\) onto \\(M\\). Then\n\n\\[\\sum_{n=1}^{\\infty}|\\langle x,e_n\\rangle|^2 = \\|P_Mx\\|^2,\\]\n\nand\n\n\\[\\|x\\|^2 = \\sum_{n=1}^{\\infty}|\\langle x,e_n\\rangle|^2 + \\|x-P_Mx\\|^2.\\]\n\nThus equality holds for a particular \\(x\\) precisely when \\(x\\in M\\). Equality holds for every \\(x\\in H\\) precisely when the orthonormal sequence is complete."
    },
    {
      "heading": "Proof by orthogonal projection",
      "text": "Define the partial expansion\n\n\\[S_Nx=\\sum_{n=1}^{N}\\langle x,e_n\\rangle e_n.\\]\n\nThe residual \\(x-S_Nx\\) is perpendicular to every \\(e_n\\) with \\(n\\leq N\\), and hence to \\(S_Nx\\). The Pythagorean theorem gives\n\n\\[\\|x\\|^2 = \\|S_Nx\\|^2+\\|x-S_Nx\\|^2.\\]\n\nOrthonormality also gives\n\n\\[\\|S_Nx\\|^2 = \\sum_{n=1}^{N}|\\langle x,e_n\\rangle|^2.\\]\n\nCombining these equations yields the exact finite identity\n\n\\[\\|x\\|^2 = \\sum_{n=1}^{N}|\\langle x,e_n\\rangle|^2 + \\|x-S_Nx\\|^2.\\]\n\nFor a complete system, \\(\\|x-S_Nx\\|\\to0\\), so passing to the limit proves Parseval's identity. Without completeness, the nonnegative remainder still proves Bessel's inequality.\n\nThis argument also identifies the truncation error:\n\n\\[\\|x-S_Nx\\|^2 = \\sum_{n>N}|\\langle x,e_n\\rangle|^2.\\]"
    },
    {
      "heading": "Fourier-series forms",
      "text": "Complex Fourier series\n\nLet \\(f\\in L^2([-\\pi,\\pi])\\), the space of square-integrable functions, and define\n\n\\[c_n=\\frac{1}{2\\pi}\\int_{-\\pi}^{\\pi} f(x)e^{-inx}\\,dx, \\qquad n\\in\\mathbb Z.\\]\n\nWith the normalized inner product\n\n\\[\\langle f,g\\rangle = \\frac{1}{2\\pi} \\int_{-\\pi}^{\\pi}f(x)\\overline{g(x)}\\,dx,\\]\n\nthe functions \\(e^{inx}\\), indexed by all integers, form a complete orthonormal system. Parseval's identity becomes\n\n\\[\\boxed{ \\frac{1}{2\\pi}\\int_{-\\pi}^{\\pi}|f(x)|^2\\,dx = \\sum_{n=-\\infty}^{\\infty}|c_n|^2. }\\]\n\nThe integrals can be understood as Lebesgue integrals. No continuity assumption is required.\n\nOn an interval of length \\(T\\), define\n\n\\[c_n=\\frac{1}{T}\\int_0^T f(t)e^{-2\\pi int/T}\\,dt.\\]\n\nThen\n\n\\[\\frac{1}{T}\\int_0^T|f(t)|^2\\,dt = \\sum_{n\\in\\mathbb Z}|c_n|^2.\\]\n\nFor a periodic signal, the left-hand side represents its mean-square magnitude over one period, rather than its total energy over the whole real line.\n\nReal trigonometric form\n\nFor a real-valued function written in the \\(L^2\\) sense as\n\n\\[f(x)=\\frac{a_0}{2} +\\sum_{n=1}^{\\infty} \\bigl(a_n\\cos nx+b_n\\sin nx\\bigr),\\]\n\nwhere\n\n\\[a_n=\\frac{1}{\\pi}\\int_{-\\pi}^{\\pi}f(x)\\cos nx\\,dx, \\qquad b_n=\\frac{1}{\\pi}\\int_{-\\pi}^{\\pi}f(x)\\sin nx\\,dx,\\]\n\nParseval's identity is\n\n\\[\\frac{1}{\\pi}\\int_{-\\pi}^{\\pi}|f(x)|^2\\,dx = \\frac{a_0^2}{2} +\\sum_{n=1}^{\\infty}(a_n^2+b_n^2).\\]\n\nThe different factor for the constant term reflects the different norms of \\(1\\), \\(\\cos nx\\), and \\(\\sin nx\\) on this interval.\n\nExample: a reciprocal-square series\n\nFor \\(f(x)=x\\) on \\((-\\pi,\\pi)\\), the cosine coefficients vanish and\n\n\\[b_n=\\frac{2(-1)^{n+1}}{n}.\\]\n\nConsequently,\n\n\\[\\frac{1}{\\pi}\\int_{-\\pi}^{\\pi}x^2\\,dx = 4\\sum_{n=1}^{\\infty}\\frac{1}{n^2}.\\]\n\nEvaluating the integral gives\n\n\\[\\sum_{n=1}^{\\infty}\\frac{1}{n^2} = \\frac{\\pi^2}{6}.\\]\n\nThe endpoint jump in the periodic extension of \\(f\\) does not invalidate this calculation: Parseval's identity concerns \\(L^2\\) expansions, not pointwise agreement at every point."
    },
    {
      "heading": "Fourier transforms and Plancherel's theorem",
      "text": "For the Fourier transform convention\n\n\\[\\widehat f(\\xi) = \\int_{\\mathbb R}f(x)e^{-2\\pi ix\\xi}\\,dx,\\]\n\nthe analogous norm identity is\n\n\\[\\int_{\\mathbb R}|f(x)|^2\\,dx = \\int_{\\mathbb R}|\\widehat f(\\xi)|^2\\,d\\xi.\\]\n\nThe corresponding inner-product identity is\n\n\\[\\int_{\\mathbb R}f(x)\\overline{g(x)}\\,dx = \\int_{\\mathbb R} \\widehat f(\\xi)\\overline{\\widehat g(\\xi)}\\,d\\xi.\\]\n\nThese equalities are closely associated with Plancherel's theorem, which extends the Fourier transform from suitable integrable functions to a surjective norm-preserving map on \\(L^2(\\mathbb R)\\). Terminology varies: “Parseval's identity” often denotes the inner-product equality, while “Plancherel's identity” denotes the squared-norm equality.\n\nFor an arbitrary \\(L^2\\) function, the displayed Fourier integral need not exist as an absolutely convergent integral. Its transform is then defined through the \\(L^2\\) extension.\n\nNormalization is essential. With the angular-frequency convention\n\n\\[F(\\omega)=\\int_{\\mathbb R}f(t)e^{-i\\omega t}\\,dt,\\]\n\nthe norm identity instead reads\n\n\\[\\int_{\\mathbb R}|f(t)|^2\\,dt = \\frac{1}{2\\pi}\\int_{\\mathbb R}|F(\\omega)|^2\\,d\\omega.\\]"
    },
    {
      "heading": "Discrete Fourier transform",
      "text": "For a sequence \\(x_0,\\ldots,x_{N-1}\\), define its discrete Fourier transform by\n\n\\[X_k=\\sum_{n=0}^{N-1}x_n e^{-2\\pi i kn/N}.\\]\n\nThen\n\n\\[\\sum_{n=0}^{N-1}|x_n|^2 = \\frac{1}{N}\\sum_{k=0}^{N-1}|X_k|^2.\\]\n\nIf the transform is normalized with \\(1/\\sqrt N\\) in both directions, the factor \\(1/N\\) disappears. In that convention the transform is represented by a unitary matrix, making Parseval's identity a finite-dimensional preservation-of-length statement.\n\nA fast Fourier transform computes the same transformation more efficiently; it does not change the identity. Numerical implementations satisfy it only up to rounding and other computational errors."
    },
    {
      "heading": "Applications and limitations",
      "text": "Approximation and spectral methods\n\nFor an orthonormal expansion, Parseval's identity converts an error in function space into an error in coefficient space:\n\n\\[\\left\\|x-\\sum_{n\\in I}\\langle x,e_n\\rangle e_n\\right\\|^2 = \\sum_{n\\notin I}|\\langle x,e_n\\rangle|^2,\\]\n\nwhere \\(I\\) is any finite set of retained indices. This supports approximation theory, coefficient-based compression, and spectral methods for partial differential equations.\n\nFor fixed retained indices, the orthogonal projection is the best approximation in their span. If any \\(m\\) basis elements may be retained, selecting the \\(m\\) largest coefficient magnitudes minimizes the squared error.\n\nEnergy and mean-square analysis\n\nIn signal analysis, the identity equates time-domain squared magnitude with frequency-domain squared magnitude. For a real periodic function with mean \\(c_0\\),\n\n\\[\\frac{1}{T}\\int_0^T|f(t)-c_0|^2\\,dt = \\sum_{n\\ne0}|c_n|^2.\\]\n\nThus the nonconstant Fourier modes account exactly for variation around the mean. The square root of the total mean-square magnitude is the root-mean-square value.\n\nWhat the identity does not imply\n\nParseval's identity does not establish pointwise convergence or uniform convergence of a Fourier series. Norm convergence allows discrepancies at individual points and does not rule out oscillations near discontinuities.\n\nThe coefficient-square formula also cannot generally be applied unchanged to a nonorthogonal basis: cross terms then appear. Nor does it apply to every function without integrability conditions. In its standard function-space form, the relevant squared magnitude must be integrable, and the normalization of the coefficients must match that of the inner product."
    }
  ],
  "links": [
    "fourier-series",
    "orthonormal-basis",
    "harmonic-analysis",
    "hilbert-space",
    "inner-product",
    "norm-mathematics",
    "pythagorean-theorem",
    "cauchy-schwarz-inequality",
    "linear-span",
    "orthogonal-projection",
    "lp-space",
    "lebesgue-integral",
    "fourier-transform",
    "discrete-fourier-transform",
    "unitary-matrix",
    "fast-fourier-transform",
    "partial-differential-equation",
    "root-mean-square",
    "pointwise-convergence",
    "uniform-convergence"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}