Parseval's Theorem

In mathematics, Parseval's theorem usually refers to the result that the Fourier transform is unitary; loosely, that the sum (or integral) of the square of a function is equal to the sum (or integral) of the square of its transform. It originates from a 1799 theorem about series by Marc-Antoine Parseval, which was later applied to the Fourier series. It is also known as Rayleigh's energy theorem, or Rayleigh's identity, after John William Strutt, Lord Rayleigh.

Although the term "Parseval's theorem" is often used to describe the unitarity of ''any'' Fourier transform, especially in physics, the most general form of this property is more properly called the Plancherel theorem.

Statement of Parseval's theorem

Suppose that $A(x)$ and $B(x)$ are two complex-valued functions on $\mathbb$ of period $2 \pi$ that are square integrable (with respect to the Lebesgue measure) over intervals of period length, with Fourier series

:$A(x)=\sum_^\infty a_ne^$
and

:$B(x)=\sum_^\infty b_ne^$

respectively. Then

where $i$ is the imaginary unit and horizontal bars indicate complex conjugation. Substituting $A(x)$ and $\overline$:

:
\begin
\sum_^\infty a_n\overline
&= \frac \int_^\pi \left( \sum_^\infty a_ne^ \right) \left( \sum_^\infty \overlinee^ \right) \, \mathrmx \\ pt&= \frac \int_^\pi \left(a_1e^ + a_2e^ + \cdots\right) \left(\overlinee^ + \overlinee^ + \cdots\right) \mathrmx \\ pt&= \frac \int_^\pi \left(a_1e^ \overlinee^ + a_1e^ \overlinee^ + a_2e^ \overlinee^ + a_2e^ \overlinee^ + \cdots \right) \mathrmx \\ pt&= \frac \int_^\pi \left(a_1 \overline + a_1 \overlinee^ + a_2 \overlinee^ + a_2 \overline + \cdots\right) \mathrmx
\end

As is the case with the middle terms in this example, many terms will integrate to $0$ over a full period of length $2\pi$ (see harmonics):
:
\begin
\sum_^\infty a_n\overline &= \frac \left _1 \overline x + i a_1 \overlinee^ - i a_2 \overlinee^ + a_2 \overline x + \cdots\right_ ^ \\ pt&= \frac \left(2\pi a_1 \overline + 0 + 0 + 2\pi a_2 \overline + \cdots\right) \\ pt&= a_1 \overline + a_2 \overline + \cdots \\ pt\end

More generally, given an abelian locally compact group ''G'' with Pontryagin dual ''G^'', Parseval's theorem says the Pontryagin–Fourier transform is a unitary operator between Hilbert spaces ''L''²(''G'') and ''L''²(''G^'') (with integration being against the appropriately scaled Haar measures on the two groups.) When ''G'' is the unit circle T, ''G^'' is the integers and this is the case discussed above. When ''G'' is the real line $\mathbb$, ''G^'' is also $\mathbb$ and the unitary transform is the Fourier transform on the real line. When ''G'' is the cyclic group Z_n, again it is self-dual and the Pontryagin–Fourier transform is what is called discrete Fourier transform in applied contexts.

Parseval's theorem can also be expressed as follows:
Suppose $f(x)$ is a square-integrable function over \pi, \pi/math> (i.e., $f(x)$ and $f^2(x)$ are integrable on that interval), with the Fourier series
:$f(x) \simeq \frac + \sum_^ (a_n \cos(nx) + b_n \sin(nx)).$
Then

:$\frac \int_^ f^2(x) \,\mathrmx = \frac + \sum_^ \left(a_n^2 + b_n^2 \right).$

Notation used in engineering

In electrical engineering, Parseval's theorem is often written as:

:$\int_^\infty , x(t) , ^2 \, \mathrmt = \frac \int_^\infty , X(\omega) , ^2 \, \mathrm\omega = \int_^\infty , X(2\pi f) , ^2 \, \mathrmf$

where $X(\omega) = \mathcal_\omega\$ represents the continuous Fourier transform (in normalized, unitary form) of $x(t)$, and $\omega = 2\pi f$ is frequency in radians per second.

The interpretation of this form of the theorem is that the total energy of a signal can be calculated by summing power-per-sample across time or spectral power across frequency.

For discrete time signals, the theorem becomes:

:\sum_^\infty , x , ^2 = \frac \int_^\pi , X_() , ^2 \mathrm\phi

where $X_$ is the discrete-time Fourier transform (DTFT) of $x$ and $\phi$ represents the angular frequency (in radians per sample) of $x$.

Alternatively, for the discrete Fourier transform (DFT), the relation becomes:

: \sum_^ , x , ^2 = \frac \sum_^ , X , ^2

where X /math> is the DFT of x /math>, both of length $N$.

We show the DFT case below. For the other cases, the proof is similar. By using the definition of inverse DFT of X /math>, we can derive

: \frac \sum_^ , X , ^2 = \frac \sum_^ X cdot X^* = \frac \sum_^ \left sum_^_x[n,\exp\left(-j\frack\,n\right)\right.html" ;"title=".html" ;"title="sum_^ x sum_^_x[n,\exp\left(-j\frack\,n\right)\right">.html"_;"title="sum_^_x[n">sum_^_x[n,\exp\left(-j\frack\,n\right)\right\,_X^*[k.html" ;"title="">sum_^ x[n,\exp\left(-j\frack\,n\right)\right">.html" ;"title="sum_^ x[n">sum_^ x[n,\exp\left(-j\frack\,n\right)\right\, X^*[k">">sum_^ x[n,\exp\left(-j\frack\,n\right)\right">.html" ;"title="sum_^ x[n">sum_^ x[n,\exp\left(-j\frack\,n\right)\right\, X^*[k = \frac \sum_^ x \left[\sum_^ X^* ,\exp\left(-j\frack\,n\right)\right]
= \frac \sum_^ x (N \cdot x^*[n]) = \sum_^ , x , ^2,

where $*$ represents complex conjugate.

See also

Parseval's theorem is closely related to other mathematical results involving unitary transformations:
* Parseval's identity
* Plancherel's theorem
* Wiener–Khinchin theorem
* Bessel's inequality

Notes

{{reflist

References

Parseval
''MacTutor History of Mathematics archive''.
* George B. Arfken and Hans J. Weber, ''Mathematical Methods for Physicists'' (Harcourt: San Diego, 2001).
* Hubert Kennedy,
Eight Mathematical Biographies
' (Peremptory Publications: San Francisco, 2002).
* Alan V. Oppenheim and Ronald W. Schafer, ''Discrete-Time Signal Processing'' 2nd Edition (Prentice Hall: Upper Saddle River, NJ, 1999) p 60.
* William McC. Siebert, ''Circuits, Signals, and Systems'' (MIT Press: Cambridge, MA, 1986), pp. 410–411.
* David W. Kammler, ''A First Course in Fourier Analysis'' (Prentice–Hall, Inc., Upper Saddle River, NJ, 2000) p. 74.

External links

on Mathworld

Theorems in Fourier analysis