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.
Hilbert-space formulation
Let be a real or complex Hilbert space, with inner product and induced norm . Adopt the convention that the inner product is linear in its first argument. If is a complete orthonormal sequence in , then every satisfies
Orthonormality means that is when and otherwise. Completeness means that finite linear combinations of the are dense in . It is this completeness, not merely orthogonality, that guarantees equality for every vector.
The associated expansion is
where convergence is in the norm of . Parseval's identity therefore generalizes the Pythagorean theorem from finitely many perpendicular components to an infinite orthonormal expansion.
A corresponding two-vector identity is
This series converges absolutely by the Cauchy–Schwarz inequality. Taking gives the squared-norm identity.
Incomplete orthonormal systems
If an orthonormal sequence is not complete, the general statement is Bessel's inequality:
Let be the closed linear span of the sequence, and let be the orthogonal projection of onto . Then
and
Thus equality holds for a particular precisely when . Equality holds for every precisely when the orthonormal sequence is complete.
Proof by orthogonal projection
Define the partial expansion
The residual is perpendicular to every with , and hence to . The Pythagorean theorem gives
Orthonormality also gives
Combining these equations yields the exact finite identity
For a complete system, , so passing to the limit proves Parseval's identity. Without completeness, the nonnegative remainder still proves Bessel's inequality.
This argument also identifies the truncation error:
Fourier-series forms
Complex Fourier series
Let , the space of square-integrable functions, and define
With the normalized inner product
the functions , indexed by all integers, form a complete orthonormal system. Parseval's identity becomes
The integrals can be understood as Lebesgue integrals. No continuity assumption is required.
On an interval of length , define
Then
For 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.
Real trigonometric form
For a real-valued function written in the sense as
where
Parseval's identity is
The different factor for the constant term reflects the different norms of , , and on this interval.
Example: a reciprocal-square series
For on , the cosine coefficients vanish and
Consequently,
Evaluating the integral gives
The endpoint jump in the periodic extension of does not invalidate this calculation: Parseval's identity concerns expansions, not pointwise agreement at every point.
Fourier transforms and Plancherel's theorem
For the Fourier transform convention
the analogous norm identity is
The corresponding inner-product identity is
These equalities are closely associated with Plancherel's theorem, which extends the Fourier transform from suitable integrable functions to a surjective norm-preserving map on . Terminology varies: “Parseval's identity” often denotes the inner-product equality, while “Plancherel's identity” denotes the squared-norm equality.
For an arbitrary function, the displayed Fourier integral need not exist as an absolutely convergent integral. Its transform is then defined through the extension.
Normalization is essential. With the angular-frequency convention
the norm identity instead reads
Discrete Fourier transform
For a sequence , define its discrete Fourier transform by
Then
If the transform is normalized with in both directions, the factor disappears. In that convention the transform is represented by a unitary matrix, making Parseval's identity a finite-dimensional preservation-of-length statement.
A 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.
Applications and limitations
Approximation and spectral methods
For an orthonormal expansion, Parseval's identity converts an error in function space into an error in coefficient space:
where is any finite set of retained indices. This supports approximation theory, coefficient-based compression, and spectral methods for partial differential equations.
For fixed retained indices, the orthogonal projection is the best approximation in their span. If any basis elements may be retained, selecting the largest coefficient magnitudes minimizes the squared error.
Energy and mean-square analysis
In signal analysis, the identity equates time-domain squared magnitude with frequency-domain squared magnitude. For a real periodic function with mean ,
Thus 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.
What the identity does not imply
Parseval'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.
The 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.