Overview
The compact self-adjoint spectral theorem extends orthogonal diagonalization of real symmetric or complex Hermitian matrices. It replaces a matrix's finite list of orthogonal eigenvectors by a possibly infinite orthonormal family, with convergence understood in the Hilbert norm.
The qualifications matter. Compactness controls the size and multiplicity of nonzero spectral values; self-adjointness gives real eigenvalues and orthogonality. The theorem here is not the general spectral theorem for arbitrary bounded or unbounded self-adjoint operators, which can involve continuous spectrum and spectral measures.
Prerequisites
Know Hilbert spaces, orthonormal expansions, and compact operators. Take the inner product linear in its first argument. A bounded operator is self-adjoint when for all . An eigenvector is nonzero, and its eigenvalue satisfies . The spectrum uses failure of a bounded inverse, a condition broader than existence of an eigenvector.
Definition and conventions
Let be a real or complex separable Hilbert space and compact and self-adjoint. There is an orthonormal basis consisting of eigenvectors. Write for those with nonzero eigenvalues , repeated according to multiplicity, and let be the orthogonal projection onto . Then
Both sums converge in norm. The nonzero eigenvalues are real and have finite-dimensional eigenspaces. If there are infinitely many, . The list may also be finite or empty. The kernel can be infinite-dimensional, so its basis must be included to obtain a basis of all of .
Intuition
The operator stretches mutually perpendicular directions independently. Compactness forces the stretches on infinitely many orthogonal directions to become small: otherwise their images would remain separated and could not contain a convergent subsequence. Directions in the kernel are stretched by zero and may account for a large part of the space.
Examples and non-examples
On , the map has eigenvectors and eigenvalues . Its kernel is zero, and the coordinate basis is already the required eigenbasis. Ordering by decreasing eigenvalue magnitude, truncation after terms has operator-norm error .
Zero is nevertheless a spectral value: the formal inverse would multiply coordinate by , which is unbounded. It is not an eigenvalue in this example. This separates a spectral limit point from an actual kernel vector.
Multiplication by on is bounded and self-adjoint but has no nonzero eigenvectors: forces to be supported on a measure-zero singleton. It is not compact. Conversely, a finite-rank operator need not be diagonalizable: a nonzero two-dimensional nilpotent Jordan block is compact but not self-adjoint.
Important properties
A proof sketch starts by finding an eigenvector for a nonzero eigenvalue of maximal absolute value. Compactness supplies the limiting vector needed in the extremal argument. The orthogonal complement of that eigenvector is invariant under by self-adjointness, so the construction can be repeated there.
If the process continues indefinitely, compactness forces the selected eigenvalues to tend to zero. The norm of the remaining restriction tends to zero; otherwise another nontrivial extremal direction remains. This proves completeness after adding the kernel. Likewise, an infinite orthonormal family in a nonzero eigenspace would have images separated by , contradicting compactness.
For an infinite list ordered by , the spectral truncation satisfies
This is a uniform approximation over the unit ball, stronger than convergence for each fixed input. For a finite list, retaining all nonzero eigenvalues gives the operator exactly.
Connections and further reading
On a bounded smooth domain, apply this theorem to the compact, self-adjoint inverse of the positive Dirichlet Laplacian on . Eigenvalues of the inverse tending to zero correspond to Laplacian eigenvalues tending to infinity; the differential operator itself is unbounded. Hunter, §4.10 explains this bridge to PDEs, while MIT, Lecture 22 develops the proof mechanism.