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 <math>A(x)</math> and <math>B(x)</math> are two complex-valued functions on <math>\mathbb{R}</math> of period <math>2 \pi</math> that are square integrable (with respect to the Lebesgue measure) over intervals of period length, with Fourier series
<math display="block">A(x)=\sum_{n=-\infty}^\infty a_ne^{inx}</math>
and<br />
<math display="block">B(x)=\sum_{n=-\infty}^\infty b_ne^{inx}</math>
respectively. Then
where <math>i</math> is the imaginary unit and horizontal bars indicate complex conjugation.
Proof
Substituting <math>A(x)</math> and <math>\overline{B(x)}</math> in the integral:
<math display="block">
\begin{align}
&\frac{1}{2\pi} \int_{-\pi}^\pi \left( \sum_{n=-\infty}^\infty a_ne^{inx} \right) \left( \sum_{n=-\infty}^\infty \overline{b_n}e^{-inx} \right) \, \mathrm{d}x \\[6pt]
&= \frac{1}{2\pi} \int_{-\pi}^\pi \Bigl(a_1e^{i1x} + a_2e^{i2x} + \cdots\Bigr) \Bigl(\overline{b_1}e^{-i1x} + \overline{b_2}e^{-i2x} + \cdots\Bigr) \, \mathrm{d}x \\[6pt]
&= \frac{1}{2\pi} \int_{-\pi}^\pi \left(a_1e^{i1x} \overline{b_1}e^{-i1x} + a_1e^{i1x} \overline{b_2}e^{-i2x} + a_2e^{i2x} \overline{b_1}e^{-i1x} + a_2e^{i2x} \overline{b_2}e^{-i2x} + \cdots \right) \mathrm{d}x \\[6pt]
&= \frac{1}{2\pi} \int_{-\pi}^\pi \left(a_1 \overline{b_1} + a_1 \overline{b_2}e^{-ix} + a_2 \overline{b_1}e^{ix} + a_2 \overline{b_2} + \cdots\right) \mathrm{d}x
\end{align}
</math>
As is the case with the middle terms in this example, many terms will integrate to <math>0</math> over a full period of length <math>2\pi</math> (see harmonics):
<math display="block">
\begin{align}
\frac{1}{2\pi} \left[a_1 \overline{b_1} x + i a_1 \overline{b_2}e^{-ix} - i a_2 \overline{b_1}e^{ix} + a_2 \overline{b_2} x + \cdots\right] _{-\pi} ^{+\pi} &= \frac{1}{2\pi} \left(2\pi a_1 \overline{b_1} + 0 + 0 + 2\pi a_2 \overline{b_2} + \cdots\right) \\[6pt]
&= a_1 \overline{b_1} + a_2 \overline{b_2} + \cdots \\[6pt]
&= \sum_{n=-\infty}^\infty a_n\overline{b_n} \,.
\end{align}</math>
More generally, if <math>A(x)</math> and <math>B(x)</math> are instead two complex-valued functions on <math>\mathbb{R}</math> of period <math>P</math> that are square integrable (with respect to the Lebesgue measure) over intervals of period length, with Fourier series
<math display="block">\begin{align}
A(x) &= \sum_{n=-\infty}^\infty a_n e^{2\pi n i \frac{x}{P \\
B(x) &= \sum_{n=-\infty}^\infty b_n e^{2\pi n i \frac{x}{P
\end{align}</math>
respectively. Then
Even 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<sup>2</sup>(G) and L<sup>2</sup>(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 <math>\mathbb{R}</math>, G^ is also <math>\mathbb{R}</math> and the unitary transform is the Fourier transform on the real line. When G is the cyclic group Z<sub>n</sub>, 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 <math>f(x)</math> is a square-integrable function over <math>[-\pi, \pi]</math> (i.e., <math>f(x)</math> and <math>f^2(x)</math> are integrable on that interval), with the Fourier series
<math display="block">f(x) \simeq \tfrac12 a_0 + \sum_{n=1}^{\infty} \bigl(a_n \cos(nx) + b_n \sin(nx)\bigr).</math>
Then
<math display="block">\frac{1}{\pi} \int_{-\pi}^{\pi} f^2(x) \,\mathrm{d}x = \tfrac12 a_0^2 + \sum_{n=1}^{\infty} \left(a_n^2 + b_n^2 \right).</math>
Notation used in engineering
In electrical engineering, Parseval's theorem is often written as:
<math display="block">\int_{-\infty}^\infty \bigl| x(t) \bigr|^2 \, \mathrm{d}t = \frac{1}{2\pi} \int_{-\infty}^\infty \bigl| X(\omega) \bigr|^2 \, \mathrm{d}\omega = \int_{-\infty}^\infty \bigl| X(2\pi f) \bigr|^2 \, \mathrm{d}f</math>
where <math>X(\omega) = \mathcal{F}_\omega\{ x(t) \}</math> represents the continuous Fourier transform (in non-unitary form) of <math>x(t)</math>, and <math>\omega = 2\pi f</math> is angular 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:
<math display="block">\sum_{n=-\infty}^\infty \bigl| x[n] \bigr|^2 = \frac{1}{2\pi} \int_{-\pi}^\pi \bigl| X_{2\pi}({\phi}) \bigr|^2 \mathrm{d}\phi</math>
where <math>X_{2\pi}</math> is the discrete-time Fourier transform (DTFT) of <math>x</math> and <math>\phi</math> represents the angular frequency (in radians per sample) of <math>x</math>.
Alternatively, for the discrete Fourier transform (DFT), the relation becomes:
<math display="block"> \sum_{n=0}^{N-1} \bigl| x[n] \bigr|^2 = \frac{1}{N} \sum_{k=0}^{N-1} \bigl| X[k] \bigr|^2</math>
where <math>X[k]</math> is the DFT of <math>x[n]</math>, both of length <math>N</math>.
We show the DFT case below. For the other cases, the proof is similar. By using the definition of inverse DFT of <math>X[k]</math>, we can derive
<math display="block">\begin{align}
\frac{1}{N} \sum_{k=0}^{N-1} \bigl| X[k] \bigr|^2
&= \frac{1}{N} \sum_{k=0}^{N-1} X[k]\cdot X^*[k]
= \frac{1}{N} \sum_{k=0}^{N-1} \Biggl(\sum_{n=0}^{N-1} x[n]\,\exp\left(-j\frac{2\pi}{N}k\,n\right)\Biggr) \, X^*[k]
\\[5mu]
&= \frac{1}{N} \sum_{n=0}^{N-1} x[n] \Biggl(\sum_{k=0}^{N-1} X^*[k]\,\exp\left(-j\frac{2\pi}{N}k\,n\right)\Biggr)
= \frac{1}{N} \sum_{n=0}^{N-1} x[n] \bigl(N \cdot x^*[n]\bigr)
\\[5mu]
&= \sum_{n=0}^{N-1} \bigl| x[n] \bigr|^2,
\end{align}</math>
where <math>*</math> 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
External links
- Parseval's Theorem on Mathworld