A symmetric matrix is diagonalised by an orthonormal basis of eigenvectors with real eigenvalues. The infinite-dimensional statement fails for general operators, which need have no eigenvectors at all, but it survives intact for one class, the compact self-adjoint operators, where the unit ball is squeezed tightly enough that an extremal eigenvector must exist. This post proves the spectral theorem for that class, the engine behind every eigenfunction expansion. The proof combines the compactness of metric spaces with the quadratic-form bound for self-adjoint operators [@rudinFA1991; @reedSimon1980]. Throughout is a real Hilbert space.
#Compact operators
An operator is compact when every bounded sequence has a subsequence for which converges in .
Equivalently, carries the unit ball to a set of compact closure. In finite dimensions every operator is compact, by the Bolzano-Weierstrass theorem, but in infinite dimensions the identity is not, since an orthonormal sequence is bounded yet has no convergent subsequence, its terms staying distance apart. Compactness is the property that recovers the finite-dimensional behaviour, and it is built from the simplest operators by completion.
Every operator of finite rank is compact, and a limit in operator norm of compact operators is compact. Consequently every norm limit of finite-rank operators is compact.
Let have finite-dimensional range and be bounded, . Then is bounded in the finite-dimensional space , which is complete and closed in , so the Bolzano-Weierstrass limit lies in and converges in ; thus is compact. Now let in operator norm with each compact, and let be bounded by . Since is compact, extract a subsequence indexed by on which converges; since is compact, extract on which converges, and inductively on which converges. The compactness of each , not merely of the norm-limit , supplies each . The diagonal sequence whose -th index is the -th element of is eventually a subsequence of every , so converges for every fixed ; call this diagonal sequence . For this subsequence,
Given , fix with , then choose large so the middle term is below . Hence is Cauchy, and converges by completeness, so is compact.
The proposition identifies the compact operators with the closure of the finite-rank operators. The spectral theorem will exhibit a compact self-adjoint operator as exactly such a limit, with the approximating ranks spanned by eigenvectors.
#The norm is an eigenvalue
For a general operator the supremum defining the norm need not be attained. Compactness forces attainment, and self-adjointness makes the maximiser an eigenvector.
Let be compact and self-adjoint with . There is a unit vector and a scalar with and .
By the quadratic-form identity, , so there are unit vectors with . Since is real, for every , so each is real, and along a subsequence with and . The vectors are approximate eigenvectors, and by symmetry of the real inner product , so
using and . By compactness a subsequence has , and then . Since , , a unit vector as the limit of unit vectors. Continuity of gives .
The lemma already contains the induction step of the theorem. It produces the largest eigenvalue and its eigenvector, and the rest of the spectrum is found by removing that direction and repeating.
#The spectral theorem
Let be a compact self-adjoint operator on . There is a finite or countably infinite orthonormal system of eigenvectors with real eigenvalues satisfying , tending to if infinite, such that
the series converging in .
Build the system by exhaustion, as an induction on . Set and ; the base case is that is -invariant. Suppose are -invariant and are eigenvectors of . Given the compact self-adjoint on the closed subspace , if stop. Otherwise Lemma 3 gives a unit eigenvector with and ; since is -invariant, , so is a genuine eigenvector of . Set . This is -invariant, because for and every self-adjointness gives , so , that is , completing the induction. The restriction is again compact and self-adjoint with , whence .
If the process stops at stage , then vanishes on , and writing with gives since , which is Equation (3) with a finite sum.
If it never stops, the eigenvalues tend to . Were for all , the bounded sequence would have for by orthonormality, so would have no convergent subsequence, contradicting compactness. Hence . For the expansion, fix and set , which lies in with by Bessel's inequality. Then
using to pull the finite sum out of and . The partial sums converge to , which is Equation (3).
The eigenvectors with nonzero eigenvalue span the closure of the range of , and adjoining an orthonormal basis of the kernel completes them to an orthonormal basis of when is separable, the basis in which is the diagonal operator . The decay is the residue of compactness. It is why the operator is approximated in norm by its finite-rank truncations , with error .
#Positive operators and the square root
The operators arising as covariances are not merely self-adjoint but positive, and positivity pins the sign of the spectrum.
A self-adjoint operator is positive, written , when for all .
A compact positive operator has for every , and the expansion Equation (3) has nonnegative coefficients. Its eigenvalues are summable against the squared coordinates of any vector, .
For an eigenvector, by positivity. Pairing Equation (3) with and using continuity of the inner product gives , a sum of nonnegative terms.
This is the exact structure a covariance operator carries, and the spectral theorem applied to it is the Karhunen-Loeve expansion, whose eigenvalues are the variances of the uncorrelated coordinates and whose eigenvectors are the principal directions of the process. When the operator is the integral operator of a continuous kernel, the same decomposition with its eigenfunctions made continuous is Mercer's theorem, the bridge from the abstract spectral theorem to the explicit series a covariance function admits. Among infinite-dimensional operators, the compact self-adjoint ones are uniquely as transparent as a symmetric matrix, and the spectral theorem is why.