Eigenfunction Expansions and Completeness

A vast swathe of physics — the plucked string, heat leaking from a rod, the bound states of an atom, the potential inside a charged sphere — collapses onto a single mathematical move: expand an arbitrary function in the eigenfunctions of a differential operator. Sturm–Liouville theory is what makes that move legitimate and systematic. It picks out a broad class of second-order operators that are self-adjoint, proves their eigenfunctions are mutually orthogonal, proves they are complete — enough of them to reconstruct any reasonable function — and pins down the precise sense in which the resulting series converges. It is, line for line, the infinite-dimensional continuation of a fact you already trust: a Hermitian matrix has an orthonormal eigenbasis, and any vector is the sum of its projections onto that basis. Two ideas do all the work, and they are not the same idea. Orthogonality is cheap: it follows the instant the operator is self-adjoint, and it hands you a formula for the expansion coefficients for free. Completeness is deep: it is the separate guarantee that no function slips through the cracks — that the coefficients you computed actually rebuild the function you started with. The gap between them is where most physical intuition quietly goes wrong. This article assembles the machinery in order. It builds the weighted Hilbert space where the operator lives, derives orthogonality and real eigenvalues from a single integration by parts (Lagrange's identity), shows why the Fourier coefficients are the best mean-square approximation, and ties completeness to the Green's function of the operator through the spectral theorem. Along the way it insists on the one distinction physicists most often blur — convergence in mean square is not convergence everywhere — with the Gibbs overshoot standing as the permanent, quantifiable warning.

Key takeaways
  • A regular Sturm–Liouville operator Ly=−1w[(py′)′−qy]\mathcal{L}y=-\tfrac{1}{w}[(py')'-qy] on [a,b][a,b] with self-adjoint boundary conditions has real, discrete eigenvalues λ0<λ1<⋯→∞\lambda_0<\lambda_1<\cdots\to\infty and eigenfunctions {yn}\{y_n\} orthogonal under the weight ww.
  • Orthogonality is automatic from self-adjointness (Lagrange's identity); it gives the coefficient formula cn=⟨yn,f⟩wc_n=\langle y_n,f\rangle_w but does not by itself guarantee reconstruction.
  • Completeness is the deeper statement that {yn}\{y_n\} is an orthonormal basis of Lw2[a,b]L^2_w[a,b]: every square-integrable ff equals ∑ncnyn\sum_n c_n y_n in the mean-square sense, with no nonzero function orthogonal to all of them.
  • Parseval's identity ∥f∥w2=∑n∣cn∣2\|f\|_w^2=\sum_n|c_n|^2 is equivalent to completeness; Bessel's inequality ∑n∣cn∣2≤∥f∥w2\sum_n|c_n|^2\le\|f\|_w^2 holds always, complete or not.
  • Mean-square convergence is weaker than pointwise: partial sums overshoot jumps by a fixed 8.95% (Gibbs), term-by-term differentiation needs uniform convergence, and Fourier, Bessel, Legendre and Hermite series are all one completeness theorem with kernel ∑nyn(x)yn(x′)‾=δ(x−x′)/w(x′)\sum_n y_n(x)\overline{y_n(x')}=\delta(x-x')/w(x').
  • Key idea: A self-adjoint Sturm–Liouville operator is the infinite-dimensional Hermitian matrix — its eigenfunctions are orthogonal under the weighted inner product and complete in Lw2L^2_w, so every square-integrable function is the mean-square sum of its generalised Fourier series f=∑n⟨yn,f⟩w ynf=\sum_n \langle y_n,f\rangle_w\,y_n, with Parseval's identity expressing conservation of the norm across the spectral decomposition.

Where this lives today

The completeness theorem is quietly load-bearing across modern physics and computation. Every use of the closure relation ∑n∣n⟩⟨n∣=1\sum_n|n\rangle\langle n|=\mathbb{1} in quantum mechanics — inserting a complete set of states, expanding a wavepacket, deriving a sum rule — is Sturm–Liouville completeness for the Hamiltonian, and Parseval's identity is conservation of total probability across eigenstates. Numerical physics leans on it even harder: spectral methods (Chebyshev, Legendre, and Fourier Galerkin schemes) solve PDEs by expanding the unknown in a complete orthogonal basis and evolving the coefficients, achieving exponential accuracy for smooth solutions precisely because completeness guarantees the truncation error is controlled in L2L^2 — the same reason they suffer Gibbs ringing at shocks. The spectrum itself carries geometric information: Mark Kac's 1966 question "can one hear the shape of a drum?" asks whether the Sturm–Liouville (Helmholtz) eigenvalues of a membrane determine its shape, answered no in 1992 when Gordon, Webb and Wolpert exhibited two differently shaped isospectral drums. And the modes are physical objects one now measures directly — the resonant patterns of a vibrating plate (Chladni figures), the normal modes read out of a gravitational-wave ringdown, and the diffusion eigenmodes underpinning MRI and heat-signature analysis are all eigenfunctions of a self-adjoint operator, expanded and reconstructed by the theorem above.

The physical picture

Hold a Hermitian matrix AA in mind. Its eigenvectors are orthogonal and span CN\mathbb{C}^N, so any vector is v=∑n(en†v) env=\sum_n (e_n^\dagger v)\,e_n — you resolve vv into components along a privileged set of axes. Sturm–Liouville theory keeps this picture intact and swaps only the furniture: vectors become functions, the dot product becomes ∫f‾ g w dx\int \overline{f}\,g\,w\,\mathrm{d}x, and the matrix becomes a self-adjoint differential operator L\mathcal{L}. The eigenfunctions are the new axes; completeness is the claim that they really do span the whole space of functions, leaving no direction unaccounted for. The first figure shows those axes concretely — the lowest three Dirichlet modes of the simplest operator −d2/dx2-\mathrm{d}^2/\mathrm{d}x^2, each carrying one more interior zero than the last, exactly as the oscillation theorem demands.

Figure
The first three Dirichlet eigenfunctions of −y″ = λy on the interval 0 to L: y₁, y₂, y₃ carry 0, 1, 2 interior zeros (the oscillation theorem), with eigenvalues λₙ = (nπ/L)² equal to 1, 4, 9 in units of (π/L)² — they are orthogonal under ∫₀ᴸ yₘ yₙ dx = 0 and complete in L²
Eigenfunctions of −y″ = λy on 0..L: mode n has n−1 interior zeros, λₙ = (nπ/L)² 0 L y x y₁ λ₁ = 1 (0 zeros) y₂ λ₂ = 4 (1 zero) y₃ λ₃ = 9 (2 zeros)

Why does a weight w(x)w(x) intrude at all? Because forcing a general second-order operator into self-adjoint form fixes a particular measure w dxw\,\mathrm{d}x under which — and only under which — L\mathcal{L} is symmetric. Orthogonality is therefore always orthogonality against that weight, never against plain dx\mathrm{d}x: Legendre polynomials are orthogonal with w=1w=1, Chebyshev with w=(1−x2)−1/2w=(1-x^2)^{-1/2}, Hermite functions with w=e−x2w=e^{-x^2}, Bessel functions with w=ρw=\rho. The weight is not decoration; it is where the geometry of the problem lives. The deeper question — why the eigenfunctions are not merely orthogonal but complete — is answered by the operator's inverse: integrating twice against the Green's function is a compact, self-adjoint operation, and the spectral theorem for compact operators hands back an orthonormal eigenbasis automatically. Completeness is inherited from compactness, which is inherited from the smoothing power of integration. What that completeness cannot promise is pointwise perfection: the second figure shows the permanent scar it leaves at a discontinuity.

Figure
A unit square wave rebuilt from its Fourier sine series: the 8-term partial sum (harmonics k = 1, 3, …, 15) converges to the wave in mean square, yet overshoots each jump by a fixed 8.95% of the jump height — the Gibbs phenomenon, which never disappears as N grows, only narrows toward the discontinuity
Gibbs overshoot: the partial sum exceeds the jump by 8.95%, forever 1.0895 +1 −1 0 8-term partial sum S₁₅(x) target square wave (mean-square limit)

The core equations

The stage is a weighted Hilbert space and one operator on it. The eigenvalue problem below is the object of study; every subsequent equation either characterizes its spectrum or expands a function on its eigenfunctions.

Ly=−1w(x)[ddx ⁣(p(x)dydx)−q(x) y]=λ y(1)\mathcal{L}y=-\frac{1}{w(x)}\left[\frac{\mathrm{d}}{\mathrm{d}x}\!\left(p(x)\frac{\mathrm{d}y}{\mathrm{d}x}\right)-q(x)\,y\right]=\lambda\,y \qquad (1)

where: p(x)>0p(x)>0 — continuously differentiable coefficient (a "tension"); q(x)q(x) — continuous potential-like coefficient; w(x)>0w(x)>0 — positive weight defining the inner product; λ\lambda — eigenvalue (spectral parameter); y(x)y(x) — eigenfunction obeying the boundary conditions. Reading it: L\mathcal{L} is the continuous analogue of a Hermitian matrix, and λ,y\lambda,y are its eigenvalue and eigenvector. Orthogonality is meaningless without an inner product, and the correct one is weighted. This is the geometry L\mathcal{L} imposes on the function space; it is the measure under which L\mathcal{L} is symmetric.

⟨f,g⟩w=∫abf(x)‾ g(x) w(x) dx,∥f∥w2=⟨f,f⟩w(2)\langle f,g\rangle_w=\int_a^b \overline{f(x)}\,g(x)\,w(x)\,\mathrm{d}x,\qquad \|f\|_w^2=\langle f,f\rangle_w \qquad (2)

where: f‾\overline{f} — complex conjugate of ff (the inner product is conjugate-linear in the first slot); w(x)w(x) — weight that makes L\mathcal{L} self-adjoint; ∥f∥w\|f\|_w — the Lw2L^2_w norm, whose finiteness defines the space. Self-adjointness is not automatic — it costs a boundary condition. Lagrange's identity isolates exactly the surface term that must vanish for L\mathcal{L} to be symmetric.

⟨g,Lf⟩w−⟨Lg,f⟩w=[ p(g‾′ f−g‾ f′)]ab(3)\langle g,\mathcal{L}f\rangle_w-\langle \mathcal{L}g,f\rangle_w=\Big[\,p\big(\overline{g}'\,f-\overline{g}\,f'\big)\Big]_a^b \qquad (3)

where: the bracket [⋯ ]ab[\cdots]_a^b — the bilinear boundary (Wronskian-like) term; it vanishes for separated self-adjoint boundary conditions such as αy(a)+βy′(a)=0\alpha y(a)+\beta y'(a)=0, making ⟨g,Lf⟩w=⟨Lg,f⟩w\langle g,\mathcal{L}f\rangle_w=\langle \mathcal{L}g,f\rangle_w. The payoff of self-adjointness is orthogonality of eigenfunctions belonging to distinct eigenvalues — the property that makes the coefficient formula work.

⟨ym,yn⟩w=0(λm≠λn),⟨ym,yn⟩w=δmn (after normalising)(4)\langle y_m,y_n\rangle_w=0\quad (\lambda_m\neq\lambda_n),\qquad \langle y_m,y_n\rangle_w=\delta_{mn}\ \text{(after normalising)} \qquad (4)

where: δmn\delta_{mn} — Kronecker delta; λm,λn\lambda_m,\lambda_n — distinct real eigenvalues. Reading it: the eigenfunctions form an orthonormal set once each is scaled to unit ∥⋅∥w\|\cdot\|_w. With an orthonormal set in hand, the generalised Fourier expansion is the projection of ff onto each axis — identical in form to v=∑n(en†v)env=\sum_n(e_n^\dagger v)e_n.

f(x)=∑n=0∞cn yn(x),cn=⟨yn,f⟩w=∫abyn(x)‾ f(x) w(x) dx(5)f(x)=\sum_{n=0}^{\infty} c_n\,y_n(x),\qquad c_n=\langle y_n,f\rangle_w=\int_a^b \overline{y_n(x)}\,f(x)\,w(x)\,\mathrm{d}x \qquad (5)

where: cnc_n — generalised Fourier coefficient; the equality holds in the mean-square (Lw2L^2_w) sense, guaranteed only when the set is complete. Before completeness is known, only an inequality is available. Bessel's inequality says the energy captured by any finite set of projections cannot exceed the total.

∑n=0∞∣cn∣2  ≤  ∥f∥w2(6)\sum_{n=0}^{\infty}|c_n|^2 \;\le\; \|f\|_w^2 \qquad (6)

where: ∣cn∣2|c_n|^2 — energy in the nn-th mode. Reading it: the sum of squared coefficients is bounded by the squared norm — always true, whether or not the basis is complete. Completeness is precisely the upgrade of Bessel's ≤\le to Parseval's ==: no energy is lost, so nothing was missed.

∑n=0∞∣cn∣2  =  ∥f∥w2⟺{yn} is complete(7)\sum_{n=0}^{\infty}|c_n|^2 \;=\; \|f\|_w^2 \quad\Longleftrightarrow\quad \{y_n\}\ \text{is complete} \qquad (7)

where: the equality — Parseval's identity — is logically equivalent to completeness, which is equivalent in turn to the mean-square convergence of the partial sums to ff. Spelling out that convergence: it is convergence of the norm of the error to zero, not convergence at every point.

lim⁡N→∞∥f−∑n=0Ncnyn∥w=0(8)\lim_{N\to\infty}\Big\|f-\sum_{n=0}^{N}c_n y_n\Big\|_w=0 \qquad (8)

where: ∥⋅∥w\|\cdot\|_w — the Lw2L^2_w norm. Reading it: the averaged squared error vanishes; pointwise the partial sums may still overshoot (Gibbs) or miss isolated points. Completeness has a pointwise avatar as a distribution — the resolution of the identity, the kernel that reproduces any function.

∑n=0∞yn(x) yn(x′)‾=δ(x−x′)w(x′)(9)\sum_{n=0}^{\infty} y_n(x)\,\overline{y_n(x')}=\frac{\delta(x-x')}{w(x')} \qquad (9)

where: δ(x−x′)\delta(x-x') — Dirac delta; the factor 1/w(x′)1/w(x') — undoes the weight in the coefficient integral so that summing reproduces f(x)f(x) exactly. Finally, the operator's resolvent packages the whole spectrum: its poles sit at the eigenvalues and its residues are built from the eigenfunctions.

G(x,x′;λ)=∑n=0∞yn(x) yn(x′)‾λn−λ(10)G(x,x';\lambda)=\sum_{n=0}^{\infty}\frac{y_n(x)\,\overline{y_n(x')}}{\lambda_n-\lambda} \qquad (10)

where: GG — resolvent (Green's function) solving (L−λ)G=δ(x−x′)/w(x)(\mathcal{L}-\lambda)G=\delta(x-x')/w(x) with the problem's boundary conditions; the poles at λ=λn\lambda=\lambda_n encode the discrete spectrum and their residues rebuild the completeness relation (9).

Derivation AReal eigenvalues and weighted orthogonality from self-adjointness

The goal is to extract, from the single fact that L\mathcal{L} is self-adjoint on the weighted space, the two structural properties on which the entire expansion rests: that every eigenvalue is real, and that eigenfunctions belonging to different eigenvalues are orthogonal under the weight ww. Nothing more than Lagrange's identity and the conjugate-linearity of the inner product is needed; the boundary conditions enter only through the vanishing of one surface term, and once that term is gone the algebra is forced.

Step 1. Take two eigenpairs, Lyn=λnyn\mathcal{L}y_n=\lambda_n y_n and Lym=λmym\mathcal{L}y_m=\lambda_m y_m, with boundary conditions that kill the Lagrange bracket, so ⟨ym,Lyn⟩w=⟨Lym,yn⟩w\langle y_m,\mathcal{L}y_n\rangle_w=\langle \mathcal{L}y_m,y_n\rangle_w. Why: self-adjointness is exactly the licence to move L\mathcal{L} from one side of the inner product to the other without penalty — the whole argument is the consequence of that single move.

Step 2. Insert the eigenvalue equations. The right slot gives λn⟨ym,yn⟩w\lambda_n\langle y_m,y_n\rangle_w; the left slot, because the inner product is conjugate-linear in its first argument, gives λm‾⟨ym,yn⟩w\overline{\lambda_m}\langle y_m,y_n\rangle_w. Hence (λn−λm‾)⟨ym,yn⟩w=0(\lambda_n-\overline{\lambda_m})\langle y_m,y_n\rangle_w=0. Why: the conjugate on λm\lambda_m is the crux — it is what forces reality when m=nm=n and orthogonality when m≠nm\neq n, and dropping it is the most common error in the whole subject.

Step 3. Set m=nm=n. Since ∥yn∥w2>0\|y_n\|_w^2>0, the factor (λn−λn‾)(\lambda_n-\overline{\lambda_n}) must vanish, so λn=λn‾\lambda_n=\overline{\lambda_n}: every eigenvalue is real. Why: a self-adjoint operator cannot have a complex eigenvalue any more than a Hermitian matrix can — the weighted norm being strictly positive is what enforces it.

Step 4. Now take m≠nm\neq n with reality established, so λm‾=λm\overline{\lambda_m}=\lambda_m and (λn−λm)⟨ym,yn⟩w=0(\lambda_n-\lambda_m)\langle y_m,y_n\rangle_w=0. Distinct eigenvalues make the prefactor nonzero, forcing ⟨ym,yn⟩w=0\langle y_m,y_n\rangle_w=0; normalising each yny_n yields an orthonormal set. Why: this is the entire source of orthogonality — it is a theorem about the operator, not a lucky property of any particular special function. *Verified: reproduces Arfken–Weber–Harris Ch. 8 and Stone & Goldbart §8.2; the boxed result is (λm−λn‾)⟨ym,yn⟩w=0(\lambda_m-\overline{\lambda_n})\langle y_m,y_n\rangle_w=0, real eigenvalues and ⟨ym,yn⟩w=0\langle y_m,y_n\rangle_w=0 for λm≠λn\lambda_m\neq\lambda_n.*

Go deeper · Derivation B · 1 minWhy the Fourier coefficients are the best mean-square approximation
Derivation BWhy the Fourier coefficients are the best mean-square approximation

The goal is to prove that among all possible coefficient choices, the generalised Fourier coefficients cn=⟨yn,f⟩wc_n=\langle y_n,f\rangle_w are the unique ones that minimise the mean-square error of the truncated expansion, and to read off Bessel's inequality, Parseval's identity, and the exact meaning of completeness from a single completed square. This is the projection theorem in disguise: the best approximation from a subspace is the orthogonal projection onto it, and the error is whatever is orthogonal to the subspace.

Step 1. Fix NN and expand the squared error EN=∥f−∑n≤Nanyn∥w2E_N=\|f-\sum_{n\le N}a_n y_n\|_w^2 for arbitrary coefficients ana_n. Using orthonormality ⟨ym,yn⟩w=δmn\langle y_m,y_n\rangle_w=\delta_{mn} to collapse the cross terms gives EN=∥f∥w2−∑nan‾cn−∑nancn‾+∑n∣an∣2E_N=\|f\|_w^2-\sum_n\overline{a_n}c_n-\sum_n a_n\overline{c_n}+\sum_n|a_n|^2, with cn=⟨yn,f⟩wc_n=\langle y_n,f\rangle_w. Why: orthonormality is what turns a messy double sum into a clean sum over single modes — without it there is no separation into independent contributions.

Step 2. Complete the square mode by mode: ∣an∣2−an‾cn−ancn‾=∣an−cn∣2−∣cn∣2|a_n|^2-\overline{a_n}c_n-a_n\overline{c_n}=|a_n-c_n|^2-|c_n|^2. Substituting, EN=∥f∥w2−∑n≤N∣cn∣2+∑n≤N∣an−cn∣2E_N=\|f\|_w^2-\sum_{n\le N}|c_n|^2+\sum_{n\le N}|a_n-c_n|^2. Why: the error splits into a part fixed by ff and a part you control, and the controllable part is a sum of squares that can only be reduced, never made negative.

Step 3. The only term you can influence is ∑n∣an−cn∣2≥0\sum_n|a_n-c_n|^2\ge 0, minimised uniquely at an=cna_n=c_n. The minimum error is ENmin⁡=∥f∥w2−∑n≤N∣cn∣2≥0E_N^{\min}=\|f\|_w^2-\sum_{n\le N}|c_n|^2\ge 0, which rearranges to Bessel's inequality ∑n≤N∣cn∣2≤∥f∥w2\sum_{n\le N}|c_n|^2\le\|f\|_w^2. Why: this proves in one line both that the Fourier coefficients are optimal and that the captured energy is bounded by the total — Bessel is just the non-negativity of a leftover.

Step 4. Let N→∞N\to\infty. By definition {yn}\{y_n\} is complete iff ENmin⁡→0E_N^{\min}\to 0, i.e. iff ∑n∣cn∣2=∥f∥w2\sum_n|c_n|^2=\|f\|_w^2 (Parseval) for every ff. Why: completeness is thereby recast as a purely quantitative statement — the optimal error is driven to zero — which is what makes it checkable, and equivalent to Parseval rather than a separate mystery. *Verified: standard projection-theorem result, Riley–Hobson–Bence §17; the completed-square identity EN=∥f∥w2−∑∣cn∣2+∑∣an−cn∣2E_N=\|f\|_w^2-\sum|c_n|^2+\sum|a_n-c_n|^2 yields Bessel (≤\le) and, in the limit, Parseval (==).*

Go deeper · Derivation C · 1 minThe completeness relation from the resolvent Green function
Derivation CThe completeness relation from the resolvent Green function

The goal is to show that completeness is not an article of faith but a consequence of the analytic structure of the operator's resolvent, by building the Green's function G(x,x′;λ)G(x,x';\lambda) spectrally, reading off its poles and residues, and summing them with a contour integral to recover the delta-function kernel δ(x−x′)/w(x′)\delta(x-x')/w(x'). The same argument reveals why completeness ultimately rests on compactness: the resolvent is a compact self-adjoint integral operator, and the spectral theorem for such operators supplies an orthonormal eigenbasis of the whole space.

Step 1. Expand the resolvent in the eigenbasis: applying (L−λ)(\mathcal{L}-\lambda) to the ansatz G=∑nyn(x)yn(x′)‾/(λn−λ)G=\sum_n y_n(x)\overline{y_n(x')}/(\lambda_n-\lambda) and using Lyn=λnyn\mathcal{L}y_n=\lambda_n y_n reproduces δ(x−x′)/w(x)\delta(x-x')/w(x), fixing the coefficients uniquely. Why: this is the continuous analogue of writing a matrix inverse (A−λI)−1=∑nenen†/(λn−λ)(A-\lambda I)^{-1}=\sum_n e_n e_n^\dagger/(\lambda_n-\lambda) — the resolvent is diagonal in the eigenbasis.

Step 2. Read off the analytic structure: GG is meromorphic in λ\lambda with simple poles at each eigenvalue λn\lambda_n, and Res⁡λ=λnG=− yn(x)yn(x′)‾\operatorname{Res}_{\lambda=\lambda_n}G=-\,y_n(x)\overline{y_n(x')}. Why: the physics of the spectrum is now encoded as complex-analytic data — where the poles sit is the spectrum, and what their residues are is the eigenprojectors.

Step 3. Integrate GG around a large contour CC enclosing every pole: −12πi∮CG dλ=∑nyn(x)yn(x′)‾-\tfrac{1}{2\pi i}\oint_C G\,\mathrm{d}\lambda=\sum_n y_n(x)\overline{y_n(x')}, the sum of all residues. Why: a contour integral is the natural machine for summing residues, and here it assembles the complete set of eigenprojectors into a single object.

Step 4. Evaluate the same contour integral from the large-∣λ∣|\lambda| behaviour of GG: for a regular problem the resolvent tends to the inverse of the identity, whose kernel is δ(x−x′)/w(x′)\delta(x-x')/w(x'). Equating the two evaluations gives ∑nyn(x)yn(x′)‾=δ(x−x′)/w(x′)\sum_n y_n(x)\overline{y_n(x')}=\delta(x-x')/w(x'). Why: the two ways of computing one integral must agree, and their agreement is exactly the completeness relation — the resolution of the identity in the eigenbasis. *Verified: Stone & Goldbart §9 and Courant–Hilbert Vol. I; the residue −yn(x)yn(x′)‾-y_n(x)\overline{y_n(x')} and the closure kernel δ(x−x′)/w(x′)\delta(x-x')/w(x') are the standard results, with compactness of GG supplying completeness via the Hilbert–Schmidt spectral theorem.*

Limiting cases

Every classical orthogonal-function expansion is one instance of the same completeness theorem, distinguished only by interval, weight, and boundary behaviour. The last row is the cautionary instance — where completeness holds but pointwise reconstruction fails.

CaseResultMeaning
Fourier seriesL=−d2/dx2\mathcal{L}=-\mathrm{d}^2/\mathrm{d}x^2, [0,2π][0,2\pi], w=1w=1, periodic BCEigenfunctions einxe^{inx}, eigenvalues n2n^2; classical completeness in L2[0,2π]L^2[0,2\pi].
Fourier–BesselLy=−1x(xy′)′+m2x2y\mathcal{L}y=-\tfrac{1}{x}(xy')'+\tfrac{m^2}{x^2}y, w=xw=x, [0,a][0,a]Singular at x=0x=0; eigenfunctions Jm(αmkρ/a)J_m(\alpha_{mk}\rho/a) with αmk\alpha_{mk} the zeros of JmJ_m; complete on [0,a][0,a].
LegendreLy=−[(1−x2)y′]′\mathcal{L}y=-[(1-x^2)y']', w=1w=1, [−1,1][-1,1]Doubly singular endpoints (p=1−x2p=1-x^2 vanishes); eigenvalues n(n+1)n(n+1), eigenfunctions PnP_n, complete in L2[−1,1]L^2[-1,1].
Hermite (singular, whole line)Ly=−y′′+x2y\mathcal{L}y=-y''+x^2y, w=1w=1, (−∞,∞)(-\infty,\infty)Quantum oscillator; discrete spectrum 2n+12n+1, Hermite-function eigenstates — complete despite the infinite interval because the potential confines.
Failure of pointwise convergencef=sgn⁡(x)f=\operatorname{sgn}(x): SNS_N overshoots by 8.95%8.95\%Mean-square convergence still holds; the partial-sum overshoot near a jump is fixed at ≈8.95%\approx 8.95\% of the jump (Gibbs), narrowing but never shrinking.

Worked examples

1 · Fourier sine expansion of a constant, and Parseval as the Basel sum (fully worked)

Expand f(x)=1f(x)=1 on [0,π][0,\pi] in the Dirichlet eigenfunctions {sin⁡nx}\{\sin nx\} of −d2/dx2-\mathrm{d}^2/\mathrm{d}x^2, and use Parseval's identity to evaluate ∑n odd1/n2\sum_{n\ \mathrm{odd}}1/n^2.

Step 1. The orthonormal basis. On [0,π][0,\pi] with w=1w=1, ∫0πsin⁡2(nx) dx=π/2\int_0^\pi \sin^2(nx)\,\mathrm{d}x=\pi/2, so the normalised eigenfunctions are φn(x)=2/π sin⁡nx\varphi_n(x)=\sqrt{2/\pi}\,\sin nx. This is the SL problem −y′′=λy-y''=\lambda y, y(0)=y(π)=0y(0)=y(\pi)=0, with λn=n2\lambda_n=n^2.

Step 2. The coefficients. cn=⟨φn,f⟩=2/π∫0πsin⁡(nx) dx=2/π 1−cos⁡nπn=2/π 1−(−1)nnc_n=\langle\varphi_n,f\rangle=\sqrt{2/\pi}\int_0^\pi \sin(nx)\,\mathrm{d}x=\sqrt{2/\pi}\,\dfrac{1-\cos n\pi}{n}=\sqrt{2/\pi}\,\dfrac{1-(-1)^n}{n}. For even nn this vanishes; for odd nn it is cn=2/π (2/n)c_n=\sqrt{2/\pi}\,(2/n). In classical (un-normalised) form, 1=4π∑n oddsin⁡nxn1=\dfrac{4}{\pi}\sum_{n\ \mathrm{odd}}\dfrac{\sin nx}{n} — the square-wave series drawn in the second figure.

Step 3. Parseval's ledger. The norm is ∥f∥2=∫0π1 dx=π\|f\|^2=\int_0^\pi 1\,\mathrm{d}x=\pi. The coefficient energy is ∑n∣cn∣2=∑n odd2π⋅4n2=8π∑n odd1n2\sum_n|c_n|^2=\sum_{n\ \mathrm{odd}}\dfrac{2}{\pi}\cdot\dfrac{4}{n^2}=\dfrac{8}{\pi}\sum_{n\ \mathrm{odd}}\dfrac{1}{n^2}. Completeness demands these be equal:

8π∑n odd1n2=π  ⟹  ∑n odd1n2=π28.\frac{8}{\pi}\sum_{n\ \mathrm{odd}}\frac{1}{n^2}=\pi \;\Longrightarrow\; \sum_{n\ \mathrm{odd}}\frac{1}{n^2}=\frac{\pi^2}{8}.

Step 4. Sanity and consequence. Numerically ∑n odd1/n2=1.2337…\sum_{n\ \mathrm{odd}}1/n^2=1.2337\ldots and π2/8=1.23370…\pi^2/8=1.23370\ldots — agreement to five digits. Splitting all integers into odd and even, ∑n≥11/n2=∑odd+14∑n≥1\sum_{n\ge1}1/n^2=\sum_{\mathrm{odd}}+\tfrac14\sum_{n\ge1} gives ∑1/n2=43⋅π28=π2/6\sum 1/n^2=\tfrac43\cdot\tfrac{\pi^2}{8}=\pi^2/6, the Basel value. Completeness of the sine basis literally computes ∑odd1/n2=π2/8\sum_{\mathrm{odd}}1/n^2=\pi^2/8; yet the same series overshoots the constant near the endpoints by 8.95% — mean-square equality, not pointwise.

2 · Heat conduction in a rod: modes as a low-pass filter (fully worked)

A 10 cm aluminium rod (κ=9.7×10−5 m2/s\kappa=9.7\times10^{-5}\ \mathrm{m^2/s}) is held at 0 ∘C0\,^\circ\mathrm{C} at both ends. Its initial temperature profile f(x)f(x) is expanded in sin⁡(nπx/L)\sin(n\pi x/L). Find the decay time of each mode and the ratio of the first two.

Step 1. Separation and completeness. ut=κuxxu_t=\kappa u_{xx} with u(0,t)=u(L,t)=0u(0,t)=u(L,t)=0 separates into the SL problem −X′′=λX-X''=\lambda X, eigenfunctions sin⁡(nπx/L)\sin(n\pi x/L), eigenvalues λn=(nπ/L)2\lambda_n=(n\pi/L)^2, weight w=1w=1. Completeness in L2[0,L]L^2[0,L] guarantees any initial ff expands as f(x)=∑nbnsin⁡(nπx/L)f(x)=\sum_n b_n\sin(n\pi x/L), and the evolved solution is u(x,t)=∑nbne−κλntsin⁡(nπx/L)u(x,t)=\sum_n b_n e^{-\kappa\lambda_n t}\sin(n\pi x/L).

Step 2. Eigenvalues. With L=0.10 mL=0.10\ \mathrm{m}, λn=(nπ/0.10)2=n2π2×100 m−2\lambda_n=(n\pi/0.10)^2=n^2\pi^2\times100\ \mathrm{m^{-2}}: λ1=986.96\lambda_1=986.96, λ2=3947.8\lambda_2=3947.8, λ3=8882.6 m−2\lambda_3=8882.6\ \mathrm{m^{-2}}.

Step 3. Decay times τn=1/(κλn)\tau_n=1/(\kappa\lambda_n). τ1=1/(9.7×10−5×986.96)=10.4 s\tau_1=1/(9.7\times10^{-5}\times986.96)=\mathbf{10.4\ s}; τ2=2.61 s\tau_2=\mathbf{2.61\ s}; τ3=1.16 s\tau_3=\mathbf{1.16\ s}. Because λn∝n2\lambda_n\propto n^2, the decay accelerates quadratically with mode number.

Step 4. The physics read-off. τ1/τ2=λ2/λ1=4\tau_1/\tau_2=\lambda_2/\lambda_1=4 exactly, and τ1/τ3=9\tau_1/\tau_3=9. Rough features of the initial profile (high nn) wash out in about a second, while the smooth fundamental lingers for ten — diffusion is a low-pass filter, and completeness is what lets us decompose an arbitrary profile into modes each decaying at its own rate e−κλnte^{-\kappa\lambda_n t}.

3 · A Legendre expansion terminates exactly

Expand f(x)=x2f(x)=x^2 on [−1,1][-1,1] in Legendre polynomials, whose SL normalisation is ∫−11Pn2 dx=2/(2n+1)\int_{-1}^{1}P_n^2\,\mathrm{d}x=2/(2n+1), weight w=1w=1.

Step 1. Coefficient formula. cn=2n+12∫−11x2Pn(x) dxc_n=\dfrac{2n+1}{2}\displaystyle\int_{-1}^{1}x^2 P_n(x)\,\mathrm{d}x. Parity kills every odd nn; and since x2x^2 is a degree-2 polynomial, it is orthogonal to all PnP_n with n>2n>2, so only c0c_0 and c2c_2 survive.

Step 2. Compute the two survivors with P0=1P_0=1, P2=(3x2−1)/2P_2=(3x^2-1)/2. c0=12∫−11x2 dx=12⋅23=13c_0=\tfrac12\int_{-1}^1 x^2\,\mathrm{d}x=\tfrac12\cdot\tfrac23=\tfrac13. c2=52∫−11x2⋅3x2−12 dx=52⋅12(3⋅25−23)=52⋅12⋅815=23c_2=\tfrac52\int_{-1}^1 x^2\cdot\tfrac{3x^2-1}{2}\,\mathrm{d}x=\tfrac52\cdot\tfrac12\big(3\cdot\tfrac25-\tfrac23\big)=\tfrac52\cdot\tfrac12\cdot\tfrac{8}{15}=\tfrac23.

Step 3. Assemble and verify. 13P0+23P2=13+23⋅3x2−12=13+3x2−13=x2\tfrac13 P_0+\tfrac23 P_2=\tfrac13+\tfrac23\cdot\tfrac{3x^2-1}{2}=\tfrac13+\tfrac{3x^2-1}{3}=x^2. The series is finite and exact — x2=13P0+23P2x^2=\tfrac13 P_0+\tfrac23 P_2 — because a polynomial has only finitely many nonzero projections. Completeness is what promises that a non-polynomial ff would need the full infinite set, converging in mean square.

Physics of the portrait

Sturm–Liouville theory is where the empirical trigonometric series of the eighteenth century became a theorem: the recognition that Fourier's, Bessel's and Legendre's expansions were not separate tricks but one spectral fact about self-adjoint operators.

Origins · 1 minsturm–liouville theory and how this was discovered
ST
sturm–liouville theory
the spectral theory of self-adjoint second-order operators, 1830s onward · orthogonal eigenfunction expansions and completeness

The theory carries two names because it was one of the great collaborations of nineteenth-century analysis. Joseph Fourier had, from 1807, boldly claimed that any function could be written as a trigonometric series to solve heat conduction — a claim so cavalier that Lagrange and Laplace resisted publishing it, for no one could say in what sense such a series converged or why the coefficients were unique. The rigour came a generation later. Charles-François Sturm, a Genevan working in Paris, published in 1836 a memoir on second-order differential equations that proved the eigenvalues form an increasing sequence and the nn-th eigenfunction has exactly nn interior zeros — the oscillation theorem visible in the first figure — studying the equations qualitatively rather than solving them. His friend Joseph Liouville supplied the analytic half almost simultaneously (1836–1837), establishing orthogonality, the reality of the spectrum, and the convergence of the eigenfunction expansion. Together they turned Fourier's audacity into structure: a whole class of boundary-value problems whose solutions form a complete orthogonal system. The completeness itself waited for the twentieth century — David Hilbert and Erhard Schmidt (1904–1907) built the spectral theory of symmetric integral operators that made "complete" a proven property via compactness, and Hermann Weyl (1910) extended the theory to singular endpoints and continuous spectra, the setting quantum mechanics would soon require. What began as a physicist's shortcut for a hot rod is now the mathematical backbone of every eigenfunction method in physics.

History
1807
— Fourier submits his memoir expanding heat profiles in trigonometric series
1836
— Sturm and Liouville publish the oscillation, reality, and orthogonality theorems
1899
— Gibbs pins down the roughly 9% overshoot of partial sums at a jump
1907
— Hilbert and Schmidt build the spectral theory of symmetric integral operators
1910
— Weyl classifies singular endpoints, extending completeness to continuous spectra

Going further

Texts. Stone & Goldbart, Mathematics for Physics, Ch. 8 (Linear Differential Operators) and Ch. 9 (Integral Equations) · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed., Ch. 8 (Sturm–Liouville Theory) · Hassani, Mathematical Physics, Ch. 19–20 · Byron & Fuller, Mathematics of Classical and Quantum Physics, Ch. 5 · Riley, Hobson & Bence, Mathematical Methods for Physics and Engineering, 3rd ed., Ch. 17 · Courant & Hilbert, Methods of Mathematical Physics, Vol. I, Ch. V–VI · Coddington & Levinson, Theory of Ordinary Differential Equations, Ch. 7–8.

Provenance. Lagrange's identity, the reality/orthogonality argument, the completed-square least-squares identity yielding Bessel and Parseval, and the residue/contour construction of the completeness relation are standard in Stone & Goldbart (Ch. 8–9), Arfken–Weber–Harris (Ch. 8), Hassani (Ch. 19–20), and Courant–Hilbert (Vol. I). A verifier should recompute: (1) Lagrange's identity by two integrations by parts; (2) the conjugation in the first inner-product slot giving real eigenvalues; (3) the Fourier-sine result ∑n odd1/n2=π2/8\sum_{n\ \mathrm{odd}}1/n^2=\pi^2/8 from Parseval and hence π2/6\pi^2/6; (4) the heat-mode decay times τ1=10.4\tau_1=10.4 s, τ2=2.61\tau_2=2.61 s, τ3=1.16\tau_3=1.16 s for aluminium with L=0.10L=0.10 m and their exact ratios 44 and 99; (5) the Legendre coefficients x2=13P0+23P2x^2=\tfrac13P_0+\tfrac23P_2; (6) the Gibbs overshoot constant 2π∫0πsin⁡tt dt−1≈0.0895\tfrac{2}{\pi}\int_0^\pi\tfrac{\sin t}{t}\,\mathrm{d}t-1\approx 0.0895. The Bessel-series normalisation 2/[a2Jm+1(αmk)2]2/[a^2 J_{m+1}(\alpha_{mk})^2], Legendre eigenvalues n(n+1)n(n+1), and oscillator eigenvalues 2n+12n+1 are standard tabulated results.

Prerequisites. Linear Second-Order ODEs · Two-Point Boundary-Value Problems · The Wronskian and Linear Independence · Existence and Uniqueness Theorems for ODEs. Leads to. The Method of Frobenius · Variation of Parameters · Ordinary and Singular Points.

Ask the tutor: Ask me to expand any function you like in a chosen eigenbasis and watch Parseval's ledger balance term by term — or to show exactly where and why the Gibbs overshoot refuses to die.

What is the difference between orthogonality and completeness, in one sentence each?

Orthogonality says the eigenfunctions point in mutually perpendicular directions, so you can compute the component of any function along each one by a single inner-product integral, cn=⟨yn,f⟩wc_n=\langle y_n,f\rangle_w. Completeness says those directions exhaust the space, so nothing is left over — the components you computed actually rebuild the function, and no nonzero function is perpendicular to all of them. Orthogonality is a property of the eigenfunctions among themselves; completeness is a property of the eigenfunctions relative to the whole function space. You can have the first without the second (drop a mode), and that is exactly when the expansion silently converges to the wrong function.

Why must the inner product carry a weight w(x)?

Because "self-adjoint" is defined relative to an inner product, and a generic second-order operator is symmetric only under one specific measure. When you push a second-order ODE into Sturm–Liouville form −(py′)′+qy=λwy-(py')'+qy=\lambda w y, the function w(x)w(x) that appears multiplying λ\lambda is precisely the weight under which L\mathcal{L} becomes self-adjoint. Orthogonality then means ∫abymyn w dx=0\int_a^b y_m y_n\,w\,\mathrm{d}x=0, not ∫ymyn dx=0\int y_m y_n\,\mathrm{d}x=0. This is why Legendre polynomials are orthogonal with w=1w=1, Hermite functions with w=e−x2w=e^{-x^2}, and Bessel functions with w=ρw=\rho: each weight is dictated by the operator, not chosen for convenience.

In what sense does the series equal the function, and when can I trust it pointwise?

By default the equality f=∑ncnynf=\sum_n c_n y_n is in the mean-square (Lw2L^2_w) sense: the norm of the error tends to zero, but individual points may disagree. Where ff is smooth and compatible with the boundary conditions, the convergence upgrades to uniform and you may treat the equality pointwise. Where ff has a jump, the partial sums overshoot by a fixed 8.95% of the jump forever (Gibbs), and at the jump itself the series converges to the midpoint of the two one-sided limits. Practical rule: trust pointwise values away from discontinuities, distrust them near jumps, and never differentiate the series term by term unless you have checked the differentiated series converges uniformly.

How does the Green's function "contain" completeness?

The resolvent G(x,x′;λ)=∑nyn(x)yn(x′)‾/(λn−λ)G(x,x';\lambda)=\sum_n y_n(x)\overline{y_n(x')}/(\lambda_n-\lambda) is the operator's inverse at spectral parameter λ\lambda, and it is a meromorphic function of λ\lambda with a simple pole at each eigenvalue whose residue is the corresponding eigenprojector −yn(x)yn(x′)‾-y_n(x)\overline{y_n(x')}. Summing all the residues with a contour integral assembles the full set of projectors, and for a regular problem that sum equals the identity kernel δ(x−x′)/w(x′)\delta(x-x')/w(x') — which is the completeness relation. Structurally, completeness holds because GG is a compact self-adjoint integral operator, and the spectral theorem for such operators guarantees its eigenfunctions form an orthonormal basis of the whole space.

Does completeness still work on infinite intervals or at singular endpoints?

Yes, though the analysis is more delicate and the spectrum can change character. When p(x)p(x) vanishes at an endpoint (Legendre at x=±1x=\pm1, Bessel at x=0x=0) or the interval is infinite (Hermite on the whole line), the explicit boundary condition is often replaced by a requirement of square-integrability or regularity, and Weyl's limit-point/limit-circle classification decides what is needed. If the potential confines — as x2x^2 does for the quantum oscillator — the spectrum stays discrete and the eigenfunctions remain complete despite the infinite domain. If it does not, a continuous spectrum appears and the sum ∑n\sum_n becomes an integral ∫dλ\int\mathrm{d}\lambda, but the completeness paradigm survives as the spectral decomposition of the operator.

Why does the Gibbs overshoot never go away, no matter how many terms I keep?

Because the overshoot is not an error that decays; it is a fixed feature of how a smooth partial sum approximates a discontinuous target. Each partial sum SNS_N is smooth, and near a jump it must swing above and below the target to "turn the corner"; as NN grows the swing moves closer to the jump and gets narrower, but its height converges to a constant — the maximum of SNS_N approaches 1.08951.0895 times the jump value, an overshoot of 2π∫0πsin⁡tt dt−1≈8.95%\tfrac{2}{\pi}\int_0^\pi\tfrac{\sin t}{t}\,\mathrm{d}t-1\approx8.95\%. This does not contradict mean-square convergence, because the overshoot occupies an ever-shrinking interval, so its contribution to the L2L^2 error still tends to zero. It is the sharpest reminder that completeness controls the averaged error, not the worst-case pointwise error.

Before this

Where this leads