Hilbert Spaces and Orthonormal Bases

A Hilbert space is the arena in which quantum mechanics, Fourier analysis, and the spectral theory of operators are actually done. It is built in two moves. First take an inner-product space — a vector space carrying a Hermitian, positive-definite product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle that induces a length ∥f∥=⟨f,f⟩\lVert f\rVert=\sqrt{\langle f,f\rangle}, so that angle, orthogonality, and projection all make sense. Then add one decisive ingredient: completeness. A space is complete when it has no holes — every sequence whose terms crowd arbitrarily close together (a Cauchy sequence) actually converges to a vector still inside the space. In finite dimensions this second move is free: every finite-dimensional inner-product space is automatically complete, and one is simply doing linear algebra with orthonormal bases. In infinite dimensions completeness becomes the whole story. The continuous functions on [a,b][a,b] under the L2L^2 inner product are not complete — Cauchy sequences of them can slide toward a discontinuous limit that is no longer continuous — whereas the square-integrable functions L2[a,b]L^2[a,b] are complete, the content of the Riesz–Fischer theorem. That completeness is exactly what makes a Fourier series or an eigenfunction expansion converge to a genuine element of the space. The reward is an orthonormal basis {en}\{e_n\}. In a separable Hilbert space it is countable, every vector is rebuilt as a generalized Fourier series f=∑n⟨en,f⟩enf=\sum_n \langle e_n,f\rangle e_n with coefficients read off as inner products, and Parseval's relation recovers the length as an infinite Pythagoras — the seed of the spectral theorem and the whole Dirac formalism.

Key takeaways
  • A Hilbert space H\mathcal{H} is an inner-product space that is complete: every Cauchy sequence converges to a limit still inside the space.
  • Completeness is what separates a Hilbert space from a mere pre-Hilbert space; it is automatic in finite dimensions but a real restriction in infinite dimensions.
  • A separable Hilbert space has a countable orthonormal basis {en}\{e_n\}, and every vector expands uniquely as f=∑n⟨en,f⟩ enf=\sum_n \langle e_n,f\rangle\,e_n with coefficients cn=⟨en,f⟩c_n=\langle e_n,f\rangle.
  • Bessel's inequality ∑n∣cn∣2≤∥f∥2\sum_n|c_n|^2\le\lVert f\rVert^2 holds for any orthonormal set; it upgrades to Parseval's equality ∑n∣cn∣2=∥f∥2\sum_n|c_n|^2=\lVert f\rVert^2 exactly when the set is a complete basis.
  • The canonical examples are ℓ2\ell^2 (square-summable sequences) and L2L^2 (square-integrable functions); the Riesz–Fischer theorem guarantees they are complete.
  • Key idea: completeness plus a countable orthonormal basis lets you treat an infinite-dimensional space exactly like Cn\mathbb{C}^n — expand any vector in components cn=⟨en,f⟩c_n=\langle e_n,f\rangle, and read lengths and overlaps from Parseval, ∥f∥2=∑n∣cn∣2\lVert f\rVert^2=\sum_n|c_n|^2 and ⟨f,g⟩=∑ncn‾ dn\langle f,g\rangle=\sum_n\overline{c_n}\,d_n.
The core insight

Completeness plus a countable orthonormal basis lets you treat an infinite-dimensional space exactly like Cn\mathbb{C}^n: expand any vector in components cn=⟨en,f⟩c_n=\langle e_n,f\rangle, and read off lengths and overlaps from Parseval — ∥f∥2=∑n∣cn∣2\lVert f\rVert^2=\sum_n|c_n|^2, ⟨f,g⟩=∑ncn‾ dn\langle f,g\rangle=\sum_n\overline{c_n}\,d_n.

Where this lives today

Hilbert space is the daily working language of quantitative science. Every quantum computation runs in one: a register of qubits is a unit vector in C2N\mathbb{C}^{2^N}, gates are unitaries preserving the inner product, and an outcome's probability is a squared coefficient ∣cn∣2|c_n|^2 — Parseval as the statement that the probabilities sum to one. In signal processing the discrete Fourier and wavelet transforms are changes of orthonormal basis, and Parseval's relation ("energy in time equals energy in frequency") is what lets JPEG and MP3 discard small coefficients while controlling the norm error. Spectral and finite-element PDE solvers are orthogonal projection onto a finite basis, the residual bounded exactly by the Bessel deficit. Quantum chemistry expands molecular orbitals in finite basis sets and lives or dies by how completely they span the true L2L^2 space — the "basis-set incompleteness error" that benchmark calculations chase toward the complete-basis limit. And an active frontier is rigged Hilbert space, the extension that makes Dirac's continuous "bases" ∣x⟩|x\rangle, with ⟨x∣x′⟩=δ(x−x′)\langle x|x'\rangle=\delta(x-x') and ∫dx ∣x⟩⟨x∣=1\int\mathrm{d}x\,|x\rangle\langle x|=\mathbb{1}, fully rigorous.

The physical picture

Think of a Hilbert space as Cn\mathbb{C}^n carried to n→∞n\to\infty, but done with care. Choose an orthonormal basis and the components of a vector are just inner products, cn=⟨en,f⟩c_n=\langle e_n,f\rangle; the schoolbook fact that "the squared length is the sum of the squared components" survives intact as Parseval's relation, provided completeness is there to make the infinite sums land somewhere. The first figure keeps honest books on that transfer: for a concrete vector it shows how much of the squared length a truncated basis captures (Bessel), and how a complete basis fills the budget exactly (Parseval).

Figure
Bessel and Parseval as an energy budget: for f = (2, 3, 6) with ‖f‖² = 49, a two-vector orthonormal set captures c₁² + c₂² = 4 + 9 = 13 ≤ 49 (Bessel), leaving a deficit of 36; adding the third basis vector restores 4 + 9 + 36 = 49 = ‖f‖² (Parseval)
Parseval fills the budget that Bessel can only bound: Σ|cₙ|² ≤ ‖f‖², equality for a complete basis f = (2, 3, 6), standard orthonormal basis e₁,e₂,e₃, cₙ = ⟨eₙ,f⟩ = 2, 3, 6 ‖f‖² = ⟨f,f⟩ = 4 + 9 + 36 = 49 |c₁|²=4 |c₂|²=9 |c₃|² = 36 Bessel partial sum S₂ : 4 + 9 = 13 ≤ 49 deficit ‖f − S₂‖² = 36 Keep only e₁,e₂ and Bessel bounds you: 13 ≤ 49, with 36 unaccounted for. Add e₃ and the set is complete — Parseval closes the gap: Σₙ |cₙ|² = 4 + 9 + 36 = 49 = ‖f‖². The deficit is the squared length of the part of f orthogonal to the chosen set — zero exactly for a basis.

Completeness of the space is felt best through its failure. Picture a family of continuous ramps that steepen around a single point until they mimic a jump: each ramp is continuous and the terms crowd together in mean-square (they are Cauchy), yet the vector they converge toward is a discontinuous step that no longer belongs to the space of continuous functions. That space has a hole exactly where the step should sit; passing to L2L^2 fills every such hole, just as passing from the rationals to the reals adds the missing limit points. The second figure makes that hole visible with a real convergence rate.

Figure
Completeness by its failure: continuous ramps fₙ for n = 1, 2, 4 steepen toward a discontinuous step at t = ½; they form a Cauchy sequence in L² with ‖fₙ − f‖² = 1/(12n) → 0, yet the limit is not continuous, so it escapes the space of continuous functions and lives only in the completion L² on the unit interval
A Cauchy sequence with no continuous limit — the hole that L² completeness fills 1 0 t = ½ 1 value f(t) the hole: limit ∉ C[0,1] f₁ f₂ f₄ step (limit) ‖fₙ − f‖² = 1/(12n) → 0 as n → ∞ Cauchy in L², but the limit is discontinuous — so C[0,1] is not complete.

The core equations

The starting datum is the inner product and the length it induces; a Hilbert space carries the physics convention throughout, linear in the second argument and conjugate-linear in the first. Everything geometric — projection, orthogonality, the reconstruction of a vector from its coefficients — is downstream of these two objects.

⟨f,g⟩∈C,∥f∥=⟨f,f⟩(1)\langle f,g\rangle\in\mathbb{C},\qquad \lVert f\rVert=\sqrt{\langle f,f\rangle} \qquad (1)

where: ⟨f,g⟩\langle f,g\rangle — Hermitian inner product, linear in gg, conjugate-linear in ff; ∥f∥\lVert f\rVert — the norm, the length induced by the inner product. Reading: the inner product measures overlap, and a vector's self-overlap is the square of its length. The one axiom that promotes an inner-product space to a Hilbert space is completeness. It is a statement not about any single vector but about the space as a whole: the limit that a Cauchy sequence is straining toward must exist and must live inside the space.

(fn) Cauchy  ⟺  ∥fn−fm∥→0;H complete  ⟺  ∃ f∈H: ∥fn−f∥→0(2)(f_n)\ \text{Cauchy}\iff \lVert f_n-f_m\rVert\to0;\qquad \mathcal{H}\ \text{complete}\iff \exists\,f\in\mathcal{H}:\ \lVert f_n-f\rVert\to0 \qquad (2)

where: (fn)(f_n) — a sequence of vectors in H\mathcal{H}; ff — its limit, required to belong to H\mathcal{H}. Reading: no Cauchy sequence may point at a hole; if the terms bunch up, something real is there to catch them. The Cauchy–Schwarz inequality holds in any inner-product space, before completeness enters. It bounds an overlap by the product of lengths and is the fact that makes the cosine legal, the triangle inequality true, and the inner product continuous.

∣⟨f,g⟩∣≤∥f∥ ∥g∥,equality  ⟺  f,g linearly dependent(3)|\langle f,g\rangle|\le\lVert f\rVert\,\lVert g\rVert,\qquad \text{equality}\iff f,g\ \text{linearly dependent} \qquad (3)

where: f,gf,g — any two vectors. Reading: you cannot project more of ff onto gg than the whole of ff; equality only when the two are parallel. A family of vectors is orthonormal when distinct members are perpendicular and each has unit length; its members' overlaps with a target vector are the generalized Fourier coefficients.

⟨em,en⟩=δmn,cn=⟨en,f⟩(4)\langle e_m,e_n\rangle=\delta_{mn},\qquad c_n=\langle e_n,f\rangle \qquad (4)

where: {en}\{e_n\} — an orthonormal family; δmn\delta_{mn} — Kronecker delta, 11 if m=nm=n and 00 otherwise; cnc_n — the nn-th coefficient of ff. Reading: an orthonormal basis is a coordinate frame in which the metric is the identity, so overlaps become conjugated coordinate sums. For any orthonormal set the coefficients can never store more squared length than the vector has — Bessel's inequality. The gap between the two sides is the squared length of the part of ff the set cannot represent.

∑n∣cn∣2≤∥f∥2(5)\sum_n|c_n|^2\le\lVert f\rVert^2 \qquad (5)

where: ∑n∣cn∣2\sum_n|c_n|^2 — total squared weight captured by the set; ∥f∥2\lVert f\rVert^2 — the full squared length. Reading: a truncated basis always loses something, and Bessel bounds exactly how much. When the orthonormal set is complete — maximal, so that no nonzero vector is orthogonal to all of it — Bessel's inequality becomes Parseval's equality and the vector is fully reconstructed by its coefficients. These two lines are the operational heart of the subject.

f=∑ncn en,∥f∥2=∑n∣cn∣2,⟨f,g⟩=∑ncn‾ dn(6)f=\sum_n c_n\,e_n,\qquad \lVert f\rVert^2=\sum_n|c_n|^2,\qquad \langle f,g\rangle=\sum_n\overline{c_n}\,d_n \qquad (6)

where: the sum in f=∑ncnenf=\sum_n c_n e_n converges in norm (mean-square), not necessarily pointwise; dn=⟨en,g⟩d_n=\langle e_n,g\rangle. Reading: expand, and lengths and overlaps are computed coordinate by coordinate exactly as in Cn\mathbb{C}^n. Two structural relations close the circle. The resolution of the identity repackages completeness as an operator statement, and the Riesz representation theorem identifies every continuous linear functional with a vector — the rigorous basis of Dirac's bra–ket notation.

∑nen ⟨en,⋅⟩=1,ϕ(f)=⟨gϕ,f⟩  for a unique gϕ∈H(7)\sum_n e_n\,\langle e_n,\cdot\rangle=\mathbb{1},\qquad \phi(f)=\langle g_\phi,f\rangle\ \ \text{for a unique }g_\phi\in\mathcal{H} \qquad (7)

where: 1\mathbb{1} — the identity operator; en⟨en,⋅⟩e_n\langle e_n,\cdot\rangle — the orthogonal projector onto the line through ene_n; ϕ\phi — a bounded linear functional; gϕg_\phi — its representing vector. Reading: inserting 1=∑n∣en⟩⟨en∣\mathbb{1}=\sum_n|e_n\rangle\langle e_n| between operators is the completeness relation of quantum mechanics, and every bra is a vector.

Derivation ACauchy–Schwarz from a single perfect square

The inequality ∣⟨f,g⟩∣≤∥f∥ ∥g∥|\langle f,g\rangle|\le\lVert f\rVert\,\lVert g\rVert is the load-bearing wall of the subject: from it descend the triangle inequality, the legality of angles, the continuity of the inner product, and the convergence estimates that make orthonormal expansions work. The proof is one idea — the self-overlap of a cleverly built vector can never be negative — and squeezing that non-negativity for the best choice of a free parameter extracts the inequality, equality case included.

Step 1. If g=0g=0 both sides vanish and the claim is trivial, so take g≠0g\neq0. Positive-definiteness applied to f−λgf-\lambda g gives, for every scalar λ\lambda, the inequality 0≤⟨f−λg, f−λg⟩=∥f∥2−λ⟨f,g⟩−λ‾⟨g,f⟩+∣λ∣2∥g∥20\le\langle f-\lambda g,\,f-\lambda g\rangle=\lVert f\rVert^2-\lambda\langle f,g\rangle-\overline{\lambda}\langle g,f\rangle+|\lambda|^2\lVert g\rVert^2. Why: the axiom hands us a non-negative real for free, and expanding it by sesquilinearity turns an abstract inequality into an algebraic one in the single unknown λ\lambda.

Step 2. Choose λ=⟨g,f⟩/∥g∥2\lambda=\langle g,f\rangle/\lVert g\rVert^2, the coefficient that projects ff onto gg and minimizes the quadratic. Substituting and using ⟨g,f⟩=⟨f,g⟩‾\langle g,f\rangle=\overline{\langle f,g\rangle}, three terms collapse and the expression becomes ∥f∥2−∣⟨f,g⟩∣2/∥g∥2≥0\lVert f\rVert^2-|\langle f,g\rangle|^2/\lVert g\rVert^2\ge0. Why: any other λ\lambda gives a weaker bound; the minimizing choice extracts the sharpest inequality the square can yield, which is what makes the constant ∥f∥∥g∥\lVert f\rVert\lVert g\rVert optimal.

Step 3. Multiply by ∥g∥2>0\lVert g\rVert^2>0 to get ∣⟨f,g⟩∣2≤∥f∥2∥g∥2|\langle f,g\rangle|^2\le\lVert f\rVert^2\lVert g\rVert^2 and take square roots. Equality holds precisely when the perfect square vanishes, f=λgf=\lambda g, meaning ff and gg are linearly dependent. Why: the whole inequality is the statement that a square is non-negative, so it saturates exactly when that square is zero — a clean geometric test for parallelism.

Go deeper · Derivation B · 1 minBessel's inequality and the Parseval upgrade
Derivation BBessel's inequality and the Parseval upgrade

The goal is to turn the geometric slogan "project onto a subspace, keep the perpendicular remainder" into the two central inequalities of the theory, and to pin down completeness as the single condition that turns the inequality into an equality. We compute the squared distance from a vector to its projection onto a finite orthonormal set, read off Bessel from the fact that this distance cannot be negative, and identify Parseval as the case where the distance is driven to zero.

Step 1. Let {en}n=1N\{e_n\}_{n=1}^N be orthonormal, set cn=⟨en,f⟩c_n=\langle e_n,f\rangle, and form the partial sum SN=∑n=1NcnenS_N=\sum_{n=1}^N c_n e_n. Expand the residual by sesquilinearity: ∥f−SN∥2=∥f∥2−∑ncn‾⟨en,f⟩−∑ncn⟨en,f⟩‾+∑n∣cn∣2\lVert f-S_N\rVert^2=\lVert f\rVert^2-\sum_{n}\overline{c_n}\langle e_n,f\rangle-\sum_n c_n\overline{\langle e_n,f\rangle}+\sum_n|c_n|^2. Why: SNS_N is the orthogonal projection of ff onto the span, so its residual is the part of ff the set cannot see, and its length is what we must control.

Step 2. Because cn=⟨en,f⟩c_n=\langle e_n,f\rangle, each cross sum equals ∑n∣cn∣2\sum_n|c_n|^2, and the three coefficient terms collapse to a single one, leaving ∥f−SN∥2=∥f∥2−∑n=1N∣cn∣2\lVert f-S_N\rVert^2=\lVert f\rVert^2-\sum_{n=1}^N|c_n|^2. Why: orthonormality ⟨em,en⟩=δmn\langle e_m,e_n\rangle=\delta_{mn} diagonalizes every sum, so the messy expansion reduces to the Pythagorean bookkeeping "whole = projection + remainder".

Step 3. A norm is never negative, so 0≤∥f−SN∥20\le\lVert f-S_N\rVert^2 gives ∑n=1N∣cn∣2≤∥f∥2\sum_{n=1}^N|c_n|^2\le\lVert f\rVert^2; letting N→∞N\to\infty leaves a bounded increasing series, hence a convergent one — the coefficient sequence lies in ℓ2\ell^2. This is Bessel's inequality. Why: the deficit ∥f∥2−∑∣cn∣2\lVert f\rVert^2-\sum|c_n|^2 is a squared length and cannot go below zero, which caps the coefficients no matter how many you take.

Step 4. The partial sums converge to ff if and only if the residual vanishes: SN→f  ⟺  ∥f−SN∥→0  ⟺  ∑n∣cn∣2=∥f∥2S_N\to f\iff\lVert f-S_N\rVert\to0\iff\sum_n|c_n|^2=\lVert f\rVert^2. This equality is Parseval's relation, and it holds for every ff exactly when the set is complete — maximal, with no nonzero vector orthogonal to all of it. Why: "complete basis" means the deficit is always zero, which is the same as saying the expansion reproduces every vector; anything less is an orthonormal set that is not a basis.

Go deeper · Derivation C · 1 minRiesz–Fischer: why ℓ² coefficients always build a vector
Derivation CRiesz–Fischer: why ℓ² coefficients always build a vector

Bessel guarantees that the coefficients of any vector are square-summable; the Riesz–Fischer theorem is the converse, and it is where completeness of the space does its indispensable work. The aim is to show that any square-summable list of coefficients, paired with an orthonormal set, assembles a genuine vector whose coefficients are exactly that list — making the correspondence between vectors and ℓ2\ell^2 sequences a perfect two-way street, so Fourier series always converge to something real.

Step 1. Given (cn)∈ℓ2(c_n)\in\ell^2 and an orthonormal set {en}\{e_n\}, form SN=∑n=1NcnenS_N=\sum_{n=1}^N c_n e_n. For M>NM>N orthonormality gives ∥SM−SN∥2=∥∑n=N+1Mcnen∥2=∑n=N+1M∣cn∣2\lVert S_M-S_N\rVert^2=\lVert\sum_{n=N+1}^M c_n e_n\rVert^2=\sum_{n=N+1}^M|c_n|^2. Why: Pythagoras turns the squared length of an increment into a bare sum of ∣cn∣2|c_n|^2, converting a question about vectors into a question about a numerical tail.

Step 2. Since ∑n∣cn∣2<∞\sum_n|c_n|^2<\infty, its tail ∑n=N+1M∣cn∣2→0\sum_{n=N+1}^M|c_n|^2\to0 as N,M→∞N,M\to\infty, so (SN)(S_N) is a Cauchy sequence in H\mathcal{H}. Why: square-summability is precisely the statement that the leftover energy beyond index NN can be made arbitrarily small, which is the definition of Cauchy for these partial sums.

Step 3. Now invoke completeness: a Cauchy sequence in a Hilbert space converges, so SN→fS_N\to f for some f∈Hf\in\mathcal{H}. Why: this is the one step that fails in a mere inner-product space — the limit might point at a hole — and it is exactly what the Hilbert-space axiom supplies.

Step 4. Continuity of the inner product lets the limit pass inside: ⟨em,f⟩=lim⁡N→∞⟨em,SN⟩=lim⁡N→∞∑n=1Ncnδmn=cm\langle e_m,f\rangle=\lim_{N\to\infty}\langle e_m,S_N\rangle=\lim_{N\to\infty}\sum_{n=1}^N c_n\delta_{mn}=c_m, so the constructed vector has precisely the prescribed coefficients. Why: this closes the loop — combined with Bessel it makes f↦(cn)f\mapsto(c_n) an isometry of H\mathcal{H} onto ℓ2\ell^2, the concrete meaning of "H\mathcal{H} looks like C∞\mathbb{C}^\infty". *The crux of the argument is the Cauchy estimate ∥SM−SN∥2=∑n=N+1M∣cn∣2\lVert S_M - S_N\rVert^2 = \sum_{n=N+1}^{M}|c_n|^2 over the tail, which converts square-summability of the coefficients directly into the Cauchy condition for the partial sums.*

Limiting cases

Hilbert space specializes to familiar settings according to dimension and the choice of measure; each row is a fully valid instance a physicist meets in practice.

CaseResultMeaning
Finite dimensionH=Cn\mathcal{H}=\mathbb{C}^nevery finite-dimensional inner-product space is automatically complete — ordinary linear algebra with orthonormal bases and the Hermitian dot product
Square-summable sequencesℓ2={(cn):∑n∣cn∣2<∞}\ell^2=\{(c_n):\sum_n|c_n|^2<\infty\}the prototype separable infinite-dimensional Hilbert space; the coefficients of any expansion in a countable basis live here, by Parseval
Square-integrable functionsL2(Ω,dμ)={f:∫Ω∣f∣2 dμ<∞}L^2(\Omega,\mathrm{d}\mu)=\{f:\int_\Omega|f|^2\,\mathrm{d}\mu<\infty\}complete by Riesz–Fischer; the home of wavefunctions and of Fourier and eigenfunction expansions
Continuous functions in L2L^2C[a,b]C[a,b] not completea pre-Hilbert space with holes; its completion is L2[a,b]L^2[a,b], which is why one works in L2L^2 from the start
Non-separabledim⁡HilbertH\dim_{\text{Hilbert}}\mathcal{H} uncountablebases can be uncountable (e.g. almost-periodic functions), but the countable case suffices for quantum mechanics

Worked examples

1 · Parseval on the sawtooth and the Basel problem (fully worked)

On L2[−π,π]L^2[-\pi,\pi] use the orthonormal sine family un(x)=sin⁡(nx)/πu_n(x)=\sin(nx)/\sqrt{\pi} to expand f(x)=xf(x)=x, then apply Parseval's relation to evaluate ∑n=1∞1/n2\sum_{n=1}^\infty 1/n^2. This is Euler's Basel sum, produced here purely by completeness.

Step 1. Compute the coefficients an=⟨un,f⟩=1π∫−ππxsin⁡(nx) dxa_n=\langle u_n,f\rangle=\frac{1}{\sqrt{\pi}}\int_{-\pi}^{\pi}x\sin(nx)\,\mathrm{d}x. The integrand is even, and integrating by parts gives ∫0πxsin⁡(nx) dx=π(−1)n+1/n\int_0^\pi x\sin(nx)\,\mathrm{d}x=\pi(-1)^{n+1}/n, so ∫−ππxsin⁡(nx) dx=2π(−1)n+1/n\int_{-\pi}^{\pi}x\sin(nx)\,\mathrm{d}x=2\pi(-1)^{n+1}/n. Hence an=2π (−1)n+1na_n=\dfrac{2\sqrt{\pi}\,(-1)^{n+1}}{n} and ∣an∣2=4π/n2|a_n|^2=\mathbf{4\pi/n^2}.

Step 2. Compute the squared norm directly: ∥f∥2=∫−ππx2 dx=[13x3]−ππ=2π3/3\lVert f\rVert^2=\int_{-\pi}^{\pi}x^2\,\mathrm{d}x=\big[\tfrac13x^3\big]_{-\pi}^{\pi}=\mathbf{2\pi^3/3}. Numerically this is 20.670920.6709, the total squared length that Parseval must account for.

Step 3. Parseval's relation says the squared norm equals the sum of the squared coefficients: ∥f∥2=∑n=1∞∣an∣2\lVert f\rVert^2=\sum_{n=1}^\infty|a_n|^2, i.e. 2π33=∑n=1∞4πn2=4π∑n=1∞1n2\dfrac{2\pi^3}{3}=\sum_{n=1}^\infty\dfrac{4\pi}{n^2}=4\pi\sum_{n=1}^\infty\dfrac{1}{n^2}. Solve for the sum: ∑n=1∞1n2=2π3/34π=π26≈1.64493\displaystyle\sum_{n=1}^\infty\frac{1}{n^2}=\frac{2\pi^3/3}{4\pi}=\boxed{\dfrac{\pi^2}{6}}\approx1.64493.

Step 4. The point is where this number came from: not from clever series manipulation but from completeness. Parseval is an equality only because the sine family is a complete orthonormal basis; a single missing mode would replace π2/6\pi^2/6 by something smaller. The Basel sum ∑1/n2=π2/6\sum 1/n^2=\pi^2/6 is Parseval's relation for the sawtooth, exact because the basis is complete.

2 · The Bessel deficit of a truncated basis (confidence builder)

Work the figure's example in full. Take f=(2,3,6)f=(2,3,6) in C3\mathbb{C}^3 with the standard orthonormal basis {e1,e2,e3}\{e_1,e_2,e_3\}. Keep only the incomplete set {e1,e2}\{e_1,e_2\}, find the Bessel deficit, then restore completeness and confirm Parseval.

Step 1. The coefficients are cn=⟨en,f⟩c_n=\langle e_n,f\rangle, so c1=2c_1=2, c2=3c_2=3, c3=6c_3=6. The full squared length is ∥f∥2=22+32+62=4+9+36=49\lVert f\rVert^2=2^2+3^2+6^2=4+9+36=\mathbf{49}, so ∥f∥=7\lVert f\rVert=7.

Step 2. With the truncated set {e1,e2}\{e_1,e_2\} the partial sum is S2=2e1+3e2=(2,3,0)S_2=2e_1+3e_2=(2,3,0), capturing ∣c1∣2+∣c2∣2=4+9=13|c_1|^2+|c_2|^2=4+9=\mathbf{13}. Bessel's inequality holds with room to spare: 13≤4913\le49. The residual is f−S2=(0,0,6)f-S_2=(0,0,6), whose squared length is the Bessel deficit =36=36 — precisely ∣c3∣2|c_3|^2, the direction {e1,e2}\{e_1,e_2\} cannot represent.

Step 3. Restore the missing element. The set {e1,e2,e3}\{e_1,e_2,e_3\} is complete, so Parseval must hold: ∑n∣cn∣2=4+9+36=49=∥f∥2\sum_n|c_n|^2=4+9+36=49=\lVert f\rVert^2. The deficit has vanished. A truncated orthonormal set obeys Bessel (13 ≤ 49) with a deficit equal to the discarded squared components; only the complete basis achieves Parseval equality (49 = 49).

Physics of the portrait

Hilbert space is one of the rare abstractions that were needed before they were named: analysts were manipulating infinite orthonormal expansions for a century before anyone axiomatized the space in which they live.

Origins · 1 minhilbert space and how this was discovered
HS
hilbert space
the complete inner-product space ℋ with a countable orthonormal basis · functional analysis and quantum mechanics

The pieces arrived out of order. The Marquis de Parseval stated his summation identity in 1799 as a formal trick for products of series, and Friedrich Bessel derived his inequality around 1828 while fitting trigonometric series to the perturbations of planetary orbits — both handling orthogonal expansions long before there was a vector space to house them. The decisive abstraction grew from David Hilbert's study of integral equations between 1904 and 1912, whose space of square-summable sequences ℓ2\ell^2 became the first infinite-dimensional inner-product space treated geometrically; his student Erhard Schmidt supplied the language of orthogonality that made "Hilbert space" a working object. The completeness that gives the space its power was secured in 1907, when Frigyes Riesz and Ernst Fischer independently proved that L2L^2 is complete and that its elements correspond exactly to ℓ2\ell^2 sequences of Fourier coefficients — the Riesz–Fischer theorem, the underpinning of every eigenfunction expansion. Riesz also proved the representation theorem identifying bounded linear functionals with vectors. The arc closed with John von Neumann, who in 1927 gave the abstract axioms of Hilbert space and made it the foundation of quantum mechanics, where a state is a unit vector, an amplitude is an inner product, and total probability is Parseval's relation. The infinite-dimensional Pythagoras that Parseval half-glimpsed is now the conservation of probability itself.

History
1799
— Parseval states the summation identity that now carries his name
1828
— Bessel derives his inequality while fitting series to orbital perturbations
1907
— Riesz and Fischer prove L² complete, the Riesz–Fischer theorem
1907
— Riesz proves the representation theorem identifying functionals with vectors
1912
— Hilbert's integral-equation work makes ℓ² the first infinite-dimensional example
1927
— von Neumann gives the abstract axioms of Hilbert space for quantum mechanics

Going further

Texts. Stone & Goldbart, Mathematics for Physics, Ch. 2 (Function Spaces) · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed., Ch. 5 · Hassani, Mathematical Physics, Chs. 5–6 (Hilbert spaces, generalized functions) · Byron & Fuller, Mathematics of Classical and Quantum Physics, Ch. 5 · Kreyszig, Introductory Functional Analysis with Applications, Ch. 3 · Reed & Simon, Methods of Modern Mathematical Physics I: Functional Analysis. The key derivations rest on three checkpoints: Cauchy–Schwarz follows from the optimal-λ\lambda / perfect-square method; Bessel and Parseval follow from expanding ∥f−SN∥2=∥f∥2−∑∣cn∣2\lVert f-S_N\rVert^2=\lVert f\rVert^2-\sum|c_n|^2; and the Riesz–Fischer argument turns on the Cauchy estimate ∥SM−SN∥2=∑N+1M∣cn∣2\lVert S_M-S_N\rVert^2=\sum_{N+1}^M|c_n|^2. The worked numbers are: sawtooth coefficients ∣an∣2=4π/n2|a_n|^2=4\pi/n^2 with ∥x∥2=2π3/3\lVert x\rVert^2=2\pi^3/3 giving ∑1/n2=π2/6=1.64493\sum 1/n^2=\pi^2/6=1.64493; finite example f=(2,3,6)f=(2,3,6) with ∥f∥2=49\lVert f\rVert^2=49, two-term partial sum 1313, and deficit 3636. The Fourier example uses the orthonormal family un=sin⁡(nx)/πu_n=\sin(nx)/\sqrt{\pi} on [−π,π][-\pi,\pi].

Prerequisites. Inner-Product Spaces and Norms · Orthogonality and the Gram–Schmidt Process · Vector Spaces and Subspaces · Linear Independence, Basis, and Dimension. Leads to. Adjoint and Hermitian Operators · Diagonalization and the Spectral Decomposition · Linear Operators and Matrix Representations · Change of Basis and Similarity Transformations.

Ask the tutor: Want to see how Parseval turns the sawtooth into π2/6\pi^2/6, or why the completeness relation ∑∣n⟩⟨n∣=1\sum|n\rangle\langle n|=\mathbb{1} is the move behind nearly every quantum-mechanics calculation? Ask and we will work it line by line.

What is the difference between a complete space and a complete orthonormal set?

They use the same word for two different ideas, and confusing them is the classic trap. A complete space is one in which every Cauchy sequence converges — the defining Hilbert-space axiom, a global property that fills in holes so that L2L^2 succeeds where C[0,1]C[0,1] fails. A complete set of orthonormal vectors is a maximal one: the only vector orthogonal to all of it is zero, equivalently Parseval holds and the set is a basis. A single Hilbert space can contain many orthonormal sets that are not complete (not bases). You need both: completeness of the space guarantees expansions converge to something, and completeness of the set guarantees they converge to the right thing.

Why does an orthonormal expansion converge "in norm" but maybe not pointwise?

Convergence in a Hilbert space is measured by the norm, so f=∑ncnenf=\sum_n c_n e_n means ∥f−SN∥→0\lVert f-S_N\rVert\to0 — the mean-square error shrinks to zero. That is a statement about the integral of ∣f−SN∣2|f-S_N|^2, an averaged quantity, and it can hold even while the partial sums misbehave at individual points, as a Fourier series does near a jump (the Gibbs phenomenon leaves a fixed overshoot that never dies pointwise but carries vanishing L2L^2 weight). Norm convergence is exactly the right notion for physics: probabilities, energies, and overlaps are all integrals, so an expansion that converges in norm reproduces every measurable quantity even if it wobbles pointwise. Stronger (uniform or pointwise) convergence needs extra smoothness beyond mere membership in L2L^2.

What makes a Hilbert space "separable," and does physics ever need the non-separable kind?

A Hilbert space is separable when it has a countable orthonormal basis, so that vectors are indexed by n=1,2,3,…n=1,2,3,\dots rather than by an uncountable label. This holds for ℓ2\ell^2, for L2L^2 over any reasonable region, and hence for essentially all of standard quantum mechanics — one energy level, one photon number, one angular-momentum state per integer. Non-separable Hilbert spaces exist, for instance the almost-periodic functions with their uncountable family {eiωx}\{e^{i\omega x}\}, and they surface in corners of quantum field theory and algebraic statistical mechanics. But for the wavefunctions, spins, and oscillators of ordinary physics, separability holds and the countable Fourier-style expansion is all one ever needs.

If Bessel's inequality always holds, why bother proving Parseval separately?

Because Bessel is a one-sided bound and physics needs the equality. Bessel guarantees only that the coefficients capture at most the vector's squared length, ∑∣cn∣2≤∥f∥2\sum|c_n|^2\le\lVert f\rVert^2; the gap can be anything from zero to the whole norm depending on how much of the vector the set misses. Parseval is the sharp statement ∑∣cn∣2=∥f∥2\sum|c_n|^2=\lVert f\rVert^2, and it is what says the expansion loses nothing — total probability is conserved, no information leaks into a discarded orthogonal complement. The upgrade from inequality to equality is precisely the assertion that the orthonormal set is complete, so proving Parseval is proving you actually have a basis. Reporting Bessel where Parseval is needed would silently permit an incomplete set and a lossy expansion.

How does the resolution of the identity relate to Dirac's bra–ket notation?

They are the same statement in two costumes. In an orthonormal basis the completeness relation reads ∑nen⟨en,⋅⟩=1\sum_n e_n\langle e_n,\cdot\rangle=\mathbb{1}, which in Dirac notation becomes ∑n∣n⟩⟨n∣=1\sum_n|n\rangle\langle n|=\mathbb{1} — the identity written as a sum of projectors onto basis states. Inserting this "11" between operators is the workhorse move of nearly every quantum-mechanics computation: it turns ⟨ϕ∣A∣ψ⟩\langle\phi|A|\psi\rangle into ∑n⟨ϕ∣A∣n⟩⟨n∣ψ⟩\sum_n\langle\phi|A|n\rangle\langle n|\psi\rangle, a sum over intermediate states. The Riesz representation theorem licenses the notation in the first place, identifying each bra ⟨ϕ∣\langle\phi| with a genuine vector. For continuous spectra the sum becomes an integral ∫dx ∣x⟩⟨x∣=1\int\mathrm{d}x\,|x\rangle\langle x|=\mathbb{1}, which the rigged-Hilbert-space extension makes rigorous.

Can I always treat an infinite-dimensional Hilbert space just like ℂⁿ?

Almost — and knowing where "almost" bites is the whole subject. With a countable orthonormal basis, the map f↦(cn)f\mapsto(c_n) is an isometry of H\mathcal{H} onto ℓ2\ell^2, so lengths, overlaps, and projections are computed coordinate by coordinate exactly as in Cn\mathbb{C}^n; this is the payoff of completeness plus a basis. The genuinely new features are all about infinity: sums must converge (only ℓ2\ell^2 lists give vectors), convergence is in norm rather than pointwise, and bounded operators can have continuous spectra with no eigenvectors in the space. For expanding vectors and reading off Parseval, Cn\mathbb{C}^n intuition is exactly right; for the analysis of operators and limits, the infinite dimension demands its own care.

Before this

Where this leads