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 that induces a length , 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 under the 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 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 . In a separable Hilbert space it is countable, every vector is rebuilt as a generalized Fourier series 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.
- A Hilbert space 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 , and every vector expands uniquely as with coefficients .
- Bessel's inequality holds for any orthonormal set; it upgrades to Parseval's equality exactly when the set is a complete basis.
- The canonical examples are (square-summable sequences) and (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 — expand any vector in components , and read lengths and overlaps from Parseval, and .
Completeness plus a countable orthonormal basis lets you treat an infinite-dimensional space exactly like : expand any vector in components , and read off lengths and overlaps from Parseval — , .
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 , gates are unitaries preserving the inner product, and an outcome's probability is a squared coefficient — 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 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" , with and , fully rigorous.
The physical picture
Think of a Hilbert space as carried to , but done with care. Choose an orthonormal basis and the components of a vector are just inner products, ; 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).
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 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.
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.
where: — Hermitian inner product, linear in , conjugate-linear in ; — 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.
where: — a sequence of vectors in ; — its limit, required to belong to . 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.
where: — any two vectors. Reading: you cannot project more of onto than the whole of ; 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.
where: — an orthonormal family; — Kronecker delta, if and otherwise; — the -th coefficient of . 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 the set cannot represent.
where: — total squared weight captured by the set; — 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.
where: the sum in converges in norm (mean-square), not necessarily pointwise; . Reading: expand, and lengths and overlaps are computed coordinate by coordinate exactly as in . 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.
where: — the identity operator; — the orthogonal projector onto the line through ; — a bounded linear functional; — its representing vector. Reading: inserting between operators is the completeness relation of quantum mechanics, and every bra is a vector.
The inequality 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 both sides vanish and the claim is trivial, so take . Positive-definiteness applied to gives, for every scalar , the inequality . 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 .
Step 2. Choose , the coefficient that projects onto and minimizes the quadratic. Substituting and using , three terms collapse and the expression becomes . Why: any other gives a weaker bound; the minimizing choice extracts the sharpest inequality the square can yield, which is what makes the constant optimal.
Step 3. Multiply by to get and take square roots. Equality holds precisely when the perfect square vanishes, , meaning and 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
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 be orthonormal, set , and form the partial sum . Expand the residual by sesquilinearity: . Why: is the orthogonal projection of onto the span, so its residual is the part of the set cannot see, and its length is what we must control.
Step 2. Because , each cross sum equals , and the three coefficient terms collapse to a single one, leaving . Why: orthonormality diagonalizes every sum, so the messy expansion reduces to the Pythagorean bookkeeping "whole = projection + remainder".
Step 3. A norm is never negative, so gives ; letting leaves a bounded increasing series, hence a convergent one — the coefficient sequence lies in . This is Bessel's inequality. Why: the deficit 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 if and only if the residual vanishes: . This equality is Parseval's relation, and it holds for every 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
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 sequences a perfect two-way street, so Fourier series always converge to something real.
Step 1. Given and an orthonormal set , form . For orthonormality gives . Why: Pythagoras turns the squared length of an increment into a bare sum of , converting a question about vectors into a question about a numerical tail.
Step 2. Since , its tail as , so is a Cauchy sequence in . Why: square-summability is precisely the statement that the leftover energy beyond index 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 for some . 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: , so the constructed vector has precisely the prescribed coefficients. Why: this closes the loop — combined with Bessel it makes an isometry of onto , the concrete meaning of " looks like ". *The crux of the argument is the Cauchy estimate 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.
| Case | Result | Meaning |
|---|---|---|
| Finite dimension | every finite-dimensional inner-product space is automatically complete — ordinary linear algebra with orthonormal bases and the Hermitian dot product | |
| Square-summable sequences | the prototype separable infinite-dimensional Hilbert space; the coefficients of any expansion in a countable basis live here, by Parseval | |
| Square-integrable functions | complete by Riesz–Fischer; the home of wavefunctions and of Fourier and eigenfunction expansions | |
| Continuous functions in | not complete | a pre-Hilbert space with holes; its completion is , which is why one works in from the start |
| Non-separable | uncountable | bases 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 use the orthonormal sine family to expand , then apply Parseval's relation to evaluate . This is Euler's Basel sum, produced here purely by completeness.
Step 1. Compute the coefficients . The integrand is even, and integrating by parts gives , so . Hence and .
Step 2. Compute the squared norm directly: . Numerically this is , 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: , i.e. . Solve for the sum: .
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 by something smaller. The Basel sum 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 in with the standard orthonormal basis . Keep only the incomplete set , find the Bessel deficit, then restore completeness and confirm Parseval.
Step 1. The coefficients are , so , , . The full squared length is , so .
Step 2. With the truncated set the partial sum is , capturing . Bessel's inequality holds with room to spare: . The residual is , whose squared length is the Bessel deficit — precisely , the direction cannot represent.
Step 3. Restore the missing element. The set is complete, so Parseval must hold: . 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
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 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 is complete and that its elements correspond exactly to 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.
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- / perfect-square method; Bessel and Parseval follow from expanding ; and the Riesz–Fischer argument turns on the Cauchy estimate . The worked numbers are: sawtooth coefficients with giving ; finite example with , two-term partial sum , and deficit . The Fourier example uses the orthonormal family on .
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 , or why the completeness relation 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 succeeds where 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 means — the mean-square error shrinks to zero. That is a statement about the integral of , 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 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 .
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 rather than by an uncountable label. This holds for , for 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 , 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, ; 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 , 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 , which in Dirac notation becomes — the identity written as a sum of projectors onto basis states. Inserting this "" between operators is the workhorse move of nearly every quantum-mechanics computation: it turns into , a sum over intermediate states. The Riesz representation theorem licenses the notation in the first place, identifying each bra with a genuine vector. For continuous spectra the sum becomes an integral , 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 is an isometry of onto , so lengths, overlaps, and projections are computed coordinate by coordinate exactly as in ; this is the payoff of completeness plus a basis. The genuinely new features are all about infinity: sums must converge (only 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, intuition is exactly right; for the analysis of operators and limits, the infinite dimension demands its own care.