Bessel's inequality

Template:Short description In mathematics, especially functional analysis, Bessel's inequality is a statement about the coefficients of an element <math>x</math> in a Hilbert space with respect to an orthonormal sequence. The inequality is named for F. W. Bessel, who derived a special case of it in 1828.<ref name="EoM">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Conceptually, the inequality is a generalization of the Pythagorean theorem to infinite-dimensional spaces. It states that the "energy" of a vector <math>x</math>, given by <math>\|x\|^2</math>, is greater than or equal to the sum of the energies of its projections onto a set of perpendicular basis directions. The value <math>|\langle x, e_k \rangle|^2</math> represents the energy contribution along a specific direction <math>e_k</math>, and the inequality guarantees that the sum of these contributions cannot exceed the total energy of <math>x</math>.

When the orthonormal sequence forms a complete orthonormal basis, Bessel's inequality becomes an equality known as Parseval's identity. This signifies that the sum of the energies of the projections equals the total energy of the vector, meaning no energy is "lost." The inequality is a crucial tool for establishing the convergence of Fourier series and other series expansions in Hilbert spaces.

Statement of the inequality

Let <math>H</math> be a Hilbert space and let <math>e_1, e_2, \dots</math> be an orthonormal sequence in <math>H</math>. Then for any vector <math>x</math> in <math>H</math>, Bessel's inequality states:

<math>\sum_{k=1}^{\infty}\left\vert\left\langle x,e_k\right\rangle \right\vert^2 \le \left\Vert x\right\Vert^2</math>

where ⟨·,·⟩ denotes the inner product in the Hilbert space <math>H</math>, and <math>\|\cdot\|</math> denotes the norm induced by the inner product.<ref>Template:Cite book</ref><ref>Template:Cite book</ref><ref>Template:Cite book</ref>

The terms <math>\langle x,e_k\rangle</math> are the Fourier coefficients of <math>x</math> with respect to the sequence <math>(e_k)</math>. The inequality implies that the series of the squared magnitudes of these coefficients converges. This allows for the definition of the vector <math>x'</math>, which is the projection of <math>x</math> onto the subspace spanned by the orthonormal sequence:

<math>x' = \sum_{k=1}^{\infty}\left\langle x,e_k\right\rangle e_k</math>

Bessel's inequality guarantees that this series converges. If the sequence <math>(e_k)</math> is a complete orthonormal basis, then <math>x' = x</math>, and the inequality becomes an equality known as Parseval's identity.

Proof

The inequality follows from the non-negativity of the norm of a vector. For any natural number <math>n</math>, let

<math>x_n = \sum_{k=1}^n \langle x, e_k \rangle e_k</math>

This vector <math>x_n</math> is the projection of <math>x</math> onto the subspace spanned by the first <math>n</math> basis vectors. The vector <math>x-x_n</math> is orthogonal to this subspace, and thus orthogonal to <math>x_n</math> itself. By the Pythagorean theorem for inner product spaces, we have <math>\|x\|^2 = \|x_n\|^2 + \|x-x_n\|^2</math>. The proof proceeds by computing <math>\|x - x_n\|^2</math>:

<math>\begin{align}

0 \leq \left\| x - \sum_{k=1}^n \langle x, e_k \rangle e_k\right\|^2 &= \left\langle x - \sum_{k=1}^n \langle x, e_k \rangle e_k, \; x - \sum_{j=1}^n \langle x, e_j \rangle e_j \right\rangle \\ &= \|x\|^2 - \sum_{k=1}^n \overline{\langle x, e_k \rangle} \langle x, e_k \rangle - \sum_{j=1}^n \langle x, e_j \rangle \langle e_j, x \rangle + \sum_{k=1}^n \sum_{j=1}^n \overline{\langle x, e_k \rangle} \langle x, e_j \rangle \langle e_k, e_j \rangle \\ &= \|x\|^2 - \sum_{k=1}^n |\langle x, e_k \rangle |^2 - \sum_{j=1}^n |\langle x, e_j \rangle |^2 + \sum_{k=1}^n | \langle x, e_k \rangle |^2 \\ &= \|x\|^2 - \sum_{k=1}^n | \langle x, e_k \rangle |^2 \end{align}</math> This holds for any <math>n \ge 1</math>. Since the partial sums are non-negative and bounded above by <math>\|x\|^2</math>, the series <math>\sum_{k=1}^{\infty}|\langle x,e_k\rangle|^2</math> converges and its sum is less than or equal to <math>\|x\|^2</math>.

Fourier series

In the theory of Fourier series, in the particular case of the Fourier orthonormal system, we get if <math>f \colon \mathbb{R} \to \mathbb{C} </math> has period <math>T</math>,

<math>

 \sum_{k \in \mathbb{Z}} \left\vert \int_0^T e^{-2 \pi i k t/T} f (t) \,\mathrm{d}t\right\vert^2 \le T \int_0^T \vert f (t)\vert^2 \,\mathrm{d}t.

</math> In the particular case where <math>f \colon \mathbb{R} \to \mathbb{R} </math>, one has then

<math>

\left\vert \int_0^T f (t) \,\mathrm{d}t\right\vert^2
+ 2 \sum_{n = 1}^\infty \left\vert \int_0^T \cos (2 \pi k t/T) f (t) \,\mathrm{d}t\right\vert^2
+ 2 \sum_{n = 1}^\infty \left\vert \int_0^T \sin (2 \pi k t/T) f (t) \,\mathrm{d}t\right\vert^2 \le T \int_0^T \vert f (t)\vert^2 \,\mathrm{d}t.

</math>

Non countable case

More generally, if <math>H</math> is a pre-Hilbert space and <math>(e_\alpha)_{\alpha \in A}</math> is an orthonormal system, then for every <math>x \in H</math><ref name="EoM" />

<math>

 \sum_{\alpha \in A}  | \langle x, e_\alpha \rangle |^2 \le \lVert x \rVert^2

</math> This is proved by noting that if <math>F \subseteq A</math> is finite, then

<math>

 \sum_{\alpha \in F}  | \langle x, e_\alpha \rangle |^2 \le \lVert x \rVert^2

</math> and then by definition of infinite sum

<math>

  \sum_{\alpha \in A}  | \langle x, e_\alpha \rangle |^2 = \sup \Bigl\{\sum_{\alpha \in F}  | \langle x, e_\alpha \rangle |^2 : F \subseteq A \text{ is finite}\Bigr\}
  \le \lVert x \rVert^2.

</math>

See also

• Cauchy–Schwarz inequality
• Parseval's theorem

External links

• Template:Springer
• Bessel's Inequality the article on Bessel's Inequality on MathWorld.

{{#if: | This article incorporates material from the following PlanetMath articles, which are licensed under the Creative Commons Attribution/Share-Alike License: {{#if: | Bessel inequality | {{#if: 3089 | Bessel inequality | [{{{sourceurl}}} Bessel inequality] }} }}, {{#if: | {{{title2}}} | {{#if: | {{{title2}}} | [{{{sourceurl2}}} {{{title2}}}] }} }}{{#if: | , {{#if: | {{{title3}}} | {{#if: | {{{title3}}} | [{{{sourceurl3}}} {{{title3}}}] }} }} }}{{#if: | , {{#if: | {{{title4}}} | {{#if: | {{{title4}}} | [{{{sourceurl4}}} {{{title4}}}] }} }} }}{{#if: | , {{#if: | {{{title5}}} | {{#if: | {{{title5}}} | [{{{sourceurl5}}} {{{title5}}}] }} }} }}{{#if: | , {{#if: | {{{title6}}} | {{#if: | {{{title6}}} | [{{{sourceurl6}}} {{{title6}}}] }} }} }}{{#if: | , {{#if: | {{{title7}}} | {{#if: | {{{title7}}} | [{{{sourceurl7}}} {{{title7}}}] }} }} }}{{#if: | , {{#if: | {{{title8}}} | {{#if: | {{{title8}}} | [{{{sourceurl8}}} {{{title8}}}] }} }} }}{{#if: | , {{#if: | {{{title9}}} | {{#if: | {{{title9}}} | [{{{sourceurl9}}} {{{title9}}}] }} }} }}. | This article incorporates material from {{#if: | Bessel inequality | Bessel inequality}} on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License. }}