Spectral Theory of Compact Operators

From Eigenvalues to the Spectrum The Adjoint & Self-Adjoint Operators Compact Operators The Spectral Theorem Functional PCA & The Path to Kernels

From Eigenvalues to the Spectrum

In Eigenvalues & Eigenvectors, we learned that every square matrix \(A \in \mathbb{C}^{n \times n}\) has eigenvalues, the scalars \(\lambda\) for which \(A\mathbf{v} = \lambda\mathbf{v}\) has a nonzero solution. Equivalently, \(\lambda\) is an eigenvalue if and only if the operator \(A - \lambda I\) is not invertible, that is, \(\det(A - \lambda I) = 0\). In finite dimensions, every linear operator has at least one eigenvalue (over \(\mathbb{C}\)), and the Spectral Theorem for Symmetric Matrices guarantees that symmetric matrices possess a complete orthonormal eigenbasis.

In infinite dimensions, the situation is far more subtle. The characteristic polynomial \(\det(T - \lambda I) = 0\) is no longer available. Determinants are not defined for operators on infinite-dimensional spaces. We must replace this algebraic criterion with a topological one: invertibility of the operator \(T - \lambda I\).

Convention. Throughout this page we take \(\mathcal{X}\) and \(\mathcal{H}\) to be complex Banach and Hilbert spaces (that is, \(\mathbb{F} = \mathbb{C}\)). Spectral theory over \(\mathbb{R}\) is strictly poorer. A rotation of \(\mathbb{R}^2\) by an angle that is not a multiple of \(\pi\) has empty spectrum when viewed as a real operator, since its characteristic polynomial has no real roots. The passage to \(\mathbb{C}\) restores the fundamental theorem of algebra. It is a foundational fact of spectral theory that \(\sigma(T) \neq \emptyset\) for any \(T \in \mathcal{B}(\mathcal{X})\) on a nonzero space. We take this fact on faith at this stage.

The Resolvent and Spectrum

Definition: Resolvent Set and Spectrum

Let \(\mathcal{X}\) be a Banach space and \(T \in \mathcal{B}(\mathcal{X})\) a bounded linear operator. The resolvent set of \(T\) is \[ \rho(T) = \bigl\{\lambda \in \mathbb{C} : T - \lambda I \text{ is bijective with inverse in } \mathcal{B}(\mathcal{X})\bigr\}. \] The spectrum of \(T\) is its complement: \[ \sigma(T) = \mathbb{C} \setminus \rho(T). \]

In finite dimensions, the spectrum equals the set of eigenvalues. In infinite dimensions, the operator \(T - \lambda I\) can fail to be invertible in fundamentally different ways, giving rise to three distinct parts of the spectrum.

Definition: Decomposition of the Spectrum

The spectrum \(\sigma(T)\) decomposes into three disjoint parts:

(a) Point Spectrum \(\sigma_p(T)\):
The set of \(\lambda\) for which \(T - \lambda I\) is not injective. These are the true eigenvalues. There exists a nonzero \(x\) with \(Tx = \lambda x\).

(b) Continuous Spectrum \(\sigma_c(T)\):
The set of \(\lambda\) for which \(T - \lambda I\) is injective, has dense range, but is not surjective.

(c) Residual Spectrum \(\sigma_r(T)\):
The set of \(\lambda\) for which \(T - \lambda I\) is injective but does not have dense range.

These three cases are disjoint and, via the inverse mapping theorem, exhaust \(\sigma(T)\). The only configuration not listed is that \(T - \lambda I\) is injective, has dense range, and is surjective. Such an operator is bijective, so the theorem bounds its inverse and places \(\lambda\) in \(\rho(T)\). If \(T - \lambda I\) is injective with dense range and its inverse is bounded on that range, the inverse extends to a bounded inverse on all of \(\mathcal{X}\). This again places \(\lambda\) in \(\rho(T)\). The "inverse" in case (b) is therefore necessarily unbounded. Among the three, the continuous spectrum is the genuinely new phenomenon of infinite dimensions. Let us see it in action.

Example: The Right Shift Operator on \(\ell^2\)

Define the right shift \(S : \ell^2 \to \ell^2\) by \(S(x_1, x_2, x_3, \ldots) = (0, x_1, x_2, x_3, \ldots)\).

This operator has no eigenvalues. If \(S\mathbf{x} = \lambda\mathbf{x}\), then \(0 = \lambda x_1\), \(x_1 = \lambda x_2\), \(x_2 = \lambda x_3\), and so on. For \(\lambda = 0\), we get \(\mathbf{x} = 0\). For \(\lambda \neq 0\), the first equation gives \(x_1 = 0\), and the remaining equations then force \(x_n = 0\) for every \(n\). So \(\sigma_p(S) = \emptyset\).

Yet the spectrum is nonempty. A standard computation, which we take on faith here, gives \(\sigma(S) = \{\lambda \in \mathbb{C} : |\lambda| \leq 1\}\), the entire closed unit disk. Specifically, the open disk \(\{|\lambda| \lt 1\}\) forms the residual spectrum, and the boundary \(\{|\lambda| = 1\}\) forms the continuous spectrum. The residual claim, at least, will become a short exercise once the adjoint and the exchange of range and kernel are established in the next section. This phenomenon has no finite-dimensional counterpart.

This example reveals why infinite-dimensional spectral theory requires new tools. A general bounded operator on a Hilbert space may have spectrum that is a continuous "smear" rather than a discrete set of points. To recover the clean, discrete eigenvalue structure of finite-dimensional linear algebra, we need to impose additional structure on our operators.

Connection to the Graph Laplacian

In Graph Laplacians & Spectral Methods and Spectral Clustering, we exploited the eigenvalues and eigenvectors of the (finite) graph Laplacian \(\mathbf{L} = \mathbf{D} - \mathbf{W}\) to partition data. The Spectral Theorem for symmetric matrices guaranteed that \(\mathbf{L}\) is orthogonally diagonalizable. This page generalizes that machinery to continuous operators on infinite-dimensional spaces. Integral operators replace the discrete graph Laplacian, and eigenfunctions replace finite eigenvectors.

The Adjoint & Self-Adjoint Operators

In finite-dimensional linear algebra, the transpose (or conjugate transpose) of a matrix plays a central role. Symmetric matrices (\(A = A^\top\)) have real eigenvalues and orthogonal eigenvectors. We now generalize this to Hilbert spaces using the inner product.

The Hilbert Space Adjoint

Theorem: Existence of the Adjoint

Let \(\mathcal{H}\) be a Hilbert space and \(T \in \mathcal{B}(\mathcal{H})\). There exists a unique operator \(T^* \in \mathcal{B}(\mathcal{H})\), called the adjoint of \(T\), satisfying \[ \langle Tx, y \rangle = \langle x, T^* y \rangle \quad \text{for all } x, y \in \mathcal{H}. \] Moreover, \(\|T^*\| = \|T\|\).

Proof:

The existence of \(T^*\) follows from the Riesz Representation Theorem: for each fixed \(y\), the map \(x \mapsto \langle Tx, y \rangle\) is a continuous linear functional on \(\mathcal{H}\). By Riesz, there exists a unique vector, denoted \(T^* y\), such that \(\langle Tx, y \rangle = \langle x, T^* y \rangle\). The map \(y \mapsto T^* y\) is linear (it is the composition of two conjugate-linear maps: \(y \mapsto \varphi_y\) where \(\varphi_y(x) = \langle Tx, y\rangle\), and the Riesz sharp map \(\varphi \mapsto \varphi^\sharp\), which is conjugate-linear).

For the norm equality, \(\|T^*y\| = \|\varphi_y\|_{\mathcal{H}^*} \leq \|T\|\|y\|\) gives \(\|T^*\| \leq \|T\|\). To see that \((T^*)^* = T\), note that \(\langle T^*y, x\rangle = \overline{\langle x, T^*y\rangle} = \overline{\langle Tx, y\rangle} = \langle y, Tx\rangle\), so \(T\) satisfies the same defining relation that characterizes the adjoint of \(T^*\). Uniqueness in the theorem, applied to \(T^*\) in place of \(T\), then gives \((T^*)^* = T\). The reverse inequality follows from that identity combined with the same inequality applied to \(T^*\).

Example: Adjoints of Familiar Operators

Matrices.
For \(A \in \mathbb{C}^{n \times n}\) acting on \(\mathbb{C}^n\), the adjoint is the conjugate transpose: \(A^* = \overline{A}^\top\). Over \(\mathbb{R}\), this is simply \(A^\top\).

Integral operators.
Let \(K\) be a square-integrable kernel on \([a,b] \times [a,b]\), a condition studied in detail later on this page. If \(T : L^2([a,b]) \to L^2([a,b])\) is defined by \[ (Tf)(x) = \int_a^b K(x, t)\, f(t)\, dt, \] then the adjoint is \[ (T^* g)(x) = \int_a^b \overline{K(t, x)}\, g(t)\, dt. \] That is, the kernel is "transposed and conjugated": \(K^*(x, t) = \overline{K(t, x)}\). The verification is a direct computation with Fubini's theorem, which the square-integrability of \(K\) licenses.

One consequence of the defining relation is worth isolating before we specialise to \(T = T^*\). It converts a statement about the reach of an operator into a statement about the kernel of its adjoint, and it is the mechanism by which injectivity of \(S^*\) upgrades to surjectivity of \(S\).

Theorem: Range and Kernel Exchanged by the Adjoint

Let \(S \in \mathcal{B}(\mathcal{H})\). Then \[ \operatorname{Range}(S)^\perp = \ker(S^*). \] In particular, if \(\ker(S^*) = \{0\}\) and \(\operatorname{Range}(S)\) is closed, then \(S\) is surjective.

Proof:

Fix \(y \in \mathcal{H}\). By the definition of the orthogonal complement, \(y \in \operatorname{Range}(S)^\perp\) means \(\langle y, Sx \rangle = 0\) for every \(x \in \mathcal{H}\). Hermitian symmetry and the defining relation of the adjoint give \[ \langle y, Sx \rangle = \overline{\langle Sx, y \rangle} = \overline{\langle x, S^* y \rangle}, \] so the condition is equivalent to \(\langle x, S^* y \rangle = 0\) for every \(x \in \mathcal{H}\). Choosing \(x = S^* y\) yields \(\|S^* y\|^2 = 0\), that is \(S^* y = 0\). Conversely, if \(S^* y = 0\) then \(\langle x, S^* y \rangle = 0\) for every \(x\), hence \(\langle y, Sx \rangle = 0\) for every \(x\). This proves \(\operatorname{Range}(S)^\perp = \ker(S^*)\).

For the second statement, \(\operatorname{Range}(S)\) is a subspace because \(S\) is linear, and it is closed by hypothesis. The Projection Theorem therefore applies to it and gives \[ \mathcal{H} = \operatorname{Range}(S) \oplus \operatorname{Range}(S)^\perp = \operatorname{Range}(S) \oplus \ker(S^*) = \operatorname{Range}(S) \oplus \{0\}, \] so \(\operatorname{Range}(S) = \mathcal{H}\).

Self-Adjoint Operators

Definition: Self-Adjoint (Hermitian) Operator

A bounded operator \(T \in \mathcal{B}(\mathcal{H})\) is self-adjoint if \(T = T^*\), that is, \[ \langle Tx, y \rangle = \langle x, Ty \rangle \quad \text{for all } x, y \in \mathcal{H}. \]

Self-adjoint operators are the infinite-dimensional generalization of real symmetric (or Hermitian) matrices. They inherit the crucial spectral properties:

Theorem: Spectral Properties of Self-Adjoint Operators

Let \(T = T^* \in \mathcal{B}(\mathcal{H})\). Then:

(a) Every eigenvalue of \(T\) is real.

(b) Eigenvectors corresponding to distinct eigenvalues are orthogonal.

(c) The entire spectrum \(\sigma(T) \subseteq \mathbb{R}\).

(d) \(\|T\| = \sup_{\|x\| = 1} |\langle Tx, x \rangle|\).

Proof:

(a)
If \(Tx = \lambda x\) with \(x \neq 0\), then \(\lambda \langle x, x \rangle = \langle Tx, x \rangle = \langle x, Tx \rangle = \overline{\lambda} \langle x, x \rangle\). Since \(\langle x, x \rangle \neq 0\), we get \(\lambda = \overline{\lambda}\), so \(\lambda \in \mathbb{R}\).

(b)
If \(Tx = \lambda x\) and \(Ty = \mu y\) with \(\lambda \neq \mu\), then \[ \lambda \langle x, y \rangle = \langle Tx, y \rangle = \langle x, Ty \rangle = \overline{\mu} \langle x, y \rangle = \mu \langle x, y \rangle, \] where the last step uses \(\mu \in \mathbb{R}\) from part (a). Since \(\lambda \neq \mu\), we conclude \(\langle x, y \rangle = 0\).

(c)
For \(\lambda = \alpha + i\beta \in \mathbb{C}\) with \(\beta \neq 0\), self-adjointness gives the identity \[ \|(T - \lambda I)x\|^2 = \|(T - \alpha I)x\|^2 + \beta^2 \|x\|^2 \geq \beta^2 \|x\|^2, \] which is verified by expanding the left-hand side. Since \(\alpha\) is real, \(T - \alpha I\) is self-adjoint, so \(\langle (T - \alpha I)x, x\rangle\) equals its own conjugate and is therefore real. Writing \((T - \lambda I)x = (T - \alpha I)x - i\beta x\), \[ \|(T - \lambda I)x\|^2 = \|(T - \alpha I)x\|^2 + \beta^2\|x\|^2 - 2\operatorname{Re}\bigl\langle (T - \alpha I)x,\, i\beta x \bigr\rangle , \] and conjugate-linearity in the second slot turns the cross term into \(-i\beta \langle (T - \alpha I)x, x\rangle\), which is purely imaginary and so has zero real part. Hence \(T - \lambda I\) is bounded below: taking square roots, \(\|(T - \lambda I)x\| \geq |\beta|\,\|x\|\) for every \(x\). Injectivity is immediate, since \(\|(T-\lambda I)x\| = 0\) then forces \(\|x\| = 0\). The range is closed as well. Let \(z\) be a boundary point of \(\operatorname{Range}(T - \lambda I)\), so that \(\operatorname{dist}(z, \operatorname{Range}(T - \lambda I)) = 0\) and we may pick \(x_n\) with \(\|(T - \lambda I)x_n - z\| \lt 1/n\). The triangle inequality and the lower bound then give, for all \(m, n\), \[ \|x_n - x_m\| \leq \frac{1}{|\beta|}\,\|(T - \lambda I)x_n - z\| + \frac{1}{|\beta|}\,\|z - (T - \lambda I)x_m\| \lt \frac{1}{|\beta|}\left(\frac{1}{n} + \frac{1}{m}\right), \] so \(\{x_n\}\) is Cauchy and converges to some \(x \in \mathcal{H}\) by completeness. Since \(T - \lambda I\) is continuous, \((T - \lambda I)x_n \to (T - \lambda I)x\), while by construction \((T - \lambda I)x_n \to z\). The two limits must agree because limits in a metric space are unique, so \(z = (T - \lambda I)x\) lies in the range. The imaginary part of \(\overline{\lambda}\) is \(-\beta \neq 0\), so the same estimate applied to \(T - \overline{\lambda}I\) shows that it too is injective, giving \(\ker(T - \overline{\lambda}I) = \{0\}\). Since \(T\) is self-adjoint, the adjoint of \(S := T - \lambda I\) is \(S^* = T^* - \overline{\lambda}I = T - \overline{\lambda}I\), the conjugate appearing because the inner product is conjugate-linear in its second slot. So this says \(\ker(S^*) = \{0\}\). With the range of \(S\) already known to be closed, the exchange of range and kernel under the adjoint turns injectivity of \(S^*\) into surjectivity of \(S\): \[ \operatorname{Range}(T - \lambda I) = \mathcal{H}. \] Thus \(T - \lambda I\) is bijective. The bound \(\|(T-\lambda I)x\| \geq |\beta|\|x\|\) from the initial inequality forces \(\|(T-\lambda I)^{-1}\| \leq 1/|\beta|\), so \(\lambda \notin \sigma(T)\), giving \(\sigma(T) \subseteq \mathbb{R}\).

(d)
Let \(M = \sup_{\|x\|=1} |\langle Tx, x\rangle|\). The bound \(M \leq \|T\|\) follows from Cauchy-Schwarz. For the reverse, take unit vectors \(h, g \in \mathcal{H}\) and expand \(\langle T(h \pm g), h \pm g\rangle\) using self-adjointness. The cross terms satisfy \[ \begin{align*} \langle Th, g\rangle + \langle Tg, h\rangle &= \langle Th, g\rangle + \overline{\langle Th, g\rangle} \\\\ &= 2\operatorname{Re}\langle Th, g\rangle \end{align*} \] (using self-adjointness \(\langle Tg, h\rangle = \langle g, Th\rangle\) followed by the Hermitian symmetry of the inner product), so \[ \langle T(h \pm g), h \pm g\rangle = \langle Th, h\rangle \pm 2\operatorname{Re}\langle Th, g\rangle + \langle Tg, g\rangle. \] Subtracting the two equations gives \[ 4\operatorname{Re}\langle Th, g\rangle = \langle T(h+g), h+g\rangle - \langle T(h-g), h-g\rangle. \] By homogeneity, the definition of \(M\) gives \(|\langle Tf, f\rangle| \leq M\|f\|^2\) for every \(f \in \mathcal{H}\). Applying this bound and the parallelogram law, \[ 4\operatorname{Re}\langle Th, g\rangle \leq M\bigl(\|h+g\|^2 + \|h-g\|^2\bigr) = 2M\bigl(\|h\|^2 + \|g\|^2\bigr) = 4M. \] If \(\langle Th, g\rangle = 0\) the bound \(|\langle Th, g\rangle| \leq M\) is trivial. Otherwise, over \(\mathbb{C}\), replacing \(h\) with \(e^{-i\theta}h\) for \(\theta = \arg\langle Th, g\rangle\) converts the real part into the modulus (over \(\mathbb{R}\) the inner product is already real and replacing \(h\) with \(\pm h\) does the same). Either way \(|\langle Th, g\rangle| \leq M\) for all unit \(h, g\). Taking the supremum over unit \(g\) yields \(\|Th\| \leq M\), because \[ \|y\| = \sup_{\|g\| = 1} |\langle y, g \rangle| \quad \text{for every } y \in \mathcal{H}. \] That identity is immediate from Cauchy-Schwarz, which bounds \(|\langle y, g \rangle|\) by \(\|y\|\) for every unit \(g\): when \(y \neq 0\) the admissible choice \(g = y / \|y\|\) attains \(\langle y, g \rangle = \|y\|\), and when \(y = 0\) both sides vanish. Taking the supremum over unit \(h\) then yields \(\|T\| \leq M\).

Property (d) is particularly important. It says that the operator norm of a self-adjoint operator is determined by its quadratic form \(\langle Tx, x \rangle\), the infinite-dimensional analogue of the Rayleigh quotient from quadratic forms.

Connection to Quantum Mechanics

In quantum mechanics, observables (position, momentum, energy) are modeled as self-adjoint operators on a Hilbert space. The requirement that eigenvalues be real (property (a)) ensures that measurement outcomes are real numbers. The orthogonality of eigenvectors (property (b)) ensures that distinct measurement outcomes correspond to mutually exclusive states, a fact expressed crisply in the Bra-Ket formalism as \(\langle m | n \rangle = 0\) for \(m \neq n\).

Compact Operators: "Almost Finite-Dimensional"

The right shift example in From Eigenvalues to the Spectrum showed that a general bounded operator can have a continuous spectrum with no eigenvalues at all. To recover the discrete, diagonalizable structure of finite-dimensional linear algebra, we restrict our attention to a special class of operators that are, in a precise sense, "close to finite-dimensional."

Definition: Compact Operator

A bounded linear operator \(T : \mathcal{X} \to \mathcal{Y}\) between normed spaces is called compact if it maps every bounded set in \(\mathcal{X}\) to a relatively compact (precompact) set in \(\mathcal{Y}\). Since \(\mathcal{Y}\) is a metric space, this is equivalent to the following condition. For every bounded sequence \(\{x_n\}\) in \(\mathcal{X}\), the image sequence \(\{Tx_n\}\) has a convergent subsequence in \(\mathcal{Y}\).

The two formulations agree because a subset of a metric space has compact closure exactly when every sequence in it admits a subsequence converging in the ambient space. One direction is the equivalence of compactness applied to that closure. For the other, approximate the terms of a sequence in the closure by points of the set itself with errors tending to zero. A subsequence of those points converges in \(\mathcal{Y}\), the original terms converge to the same limit, and that limit is again a limit of points of the set, so the closure is sequentially compact.

Recall from Intro to Functional Analysis that in infinite dimensions the closed unit ball is not compact, so bounded sequences need not have convergent subsequences. A compact operator "repairs" this. It compresses the infinite-dimensional unit ball into a set that is (relatively) compact. In other words, it "squashes away" the infinite-dimensional directions, leaving behind something that behaves like a finite-dimensional object.

Finite-Rank Operators

The simplest compact operators are those with finite-dimensional range.

Definition: Finite-Rank Operator

An operator \(T \in \mathcal{B}(\mathcal{X}, \mathcal{Y})\) is finite-rank if \(\dim(\operatorname{Range}(T)) \lt \infty\). Every finite-rank operator is compact. A bounded set is mapped into a bounded subset of the finite-dimensional space \(\operatorname{Range}(T)\), and such a subset is relatively compact by the Heine-Borel theorem carried over through the equivalence of norms on finite-dimensional spaces.

The deep connection between compact and finite-rank operators is captured by the following approximation theorem:

Theorem: Compact Operators as Limits of Finite-Rank Operators

Let \(\mathcal{H}\) be a Hilbert space. An operator \(T \in \mathcal{B}(\mathcal{H})\) is compact if and only if there exists a sequence of finite-rank operators \(\{T_n\}\) such that \(\|T - T_n\| \to 0\).

Proof sketch (Hilbert space case):

(\(\Leftarrow\)) Suppose \(T_n \to T\) in operator norm with each \(T_n\) finite-rank (hence compact). Given a bounded sequence \(\{x_k\}\) with \(\|x_k\| \leq B\), iteratively extract subsequences. The sequence \(\{T_1 x_{k}\}\) has a convergent subsequence indexed by \(k_1(j)\). Within that, \(\{T_2 x_{k_1(j)}\}\) has a convergent subsequence indexed by \(k_2(j)\), and so on. The diagonal \(y_j := x_{k_j(j)}\) then has the property that \(\{T_n y_j\}_{j \geq n}\) converges for each fixed \(n\). For any \(\varepsilon \gt 0\), choose \(n\) with \(\|T - T_n\| \lt \varepsilon/(3B)\). Then for \(j, j'\) large enough that \(\|T_n y_j - T_n y_{j'}\| \lt \varepsilon/3\), \[ \begin{align*} \|T y_j - T y_{j'}\| &\leq \|(T - T_n)y_j\| + \|T_n y_j - T_n y_{j'}\| + \|(T_n - T)y_{j'}\| \\\\ &\lt \tfrac{\varepsilon}{3} + \tfrac{\varepsilon}{3} + \tfrac{\varepsilon}{3} = \varepsilon. \end{align*} \] Hence \(\{Ty_j\}\) is Cauchy in \(\mathcal{H}\), and converges by the Cauchy criterion for completeness. Thus \(T\) is compact.

(\(\Rightarrow\)) Separability of \(\overline{\operatorname{Range}(T)}\) (which follows from compactness, since \(\overline{\operatorname{Range}(T)} = \overline{\bigcup_n T(\overline{B}_n)}\) is the closure of a countable union of relatively compact, hence separable, sets) lets us pick a finite or countable orthonormal basis \(\{e_n\}\) for it. Let \(P_n\) be orthogonal projection onto \(\operatorname{span}\{e_1, \ldots, e_n\}\), and set \(T_n = P_n T\). Each \(T_n\) is finite-rank.

Since \(T(\overline{B}_\mathcal{H})\) has compact closure, the equivalence of compactness applied to that closure makes it a totally bounded subset of \(\mathcal{H}\). Fix \(\varepsilon \gt 0\) and cover the set by finitely many balls of radius \(\varepsilon/4\). Discarding the balls that miss the set and replacing each remaining ball by the \(\varepsilon/2\)-ball around one of its points from \(T(\overline{B}_\mathcal{H})\) yields a finite cover by \(\varepsilon/2\)-balls whose centers \(y_1, \ldots, y_k\) lie in \(T(\overline{B}_\mathcal{H})\). Each \(y_j\) therefore lies in \(\operatorname{Range}(T)\), hence in the closed span of \(\{e_n\}\). Choose \(N\) so that \(\|y_j - P_n y_j\| \lt \varepsilon/2\) for all \(j\) and \(n \geq N\) (possible because \(P_n y_j \to y_j\) for each fixed \(y_j\) in the closed span of \(\{e_n\}\)). For unit \(x \in \overline{B}_\mathcal{H}\), pick \(j\) with \(\|Tx - y_j\| \lt \varepsilon/2\). Then \[ \begin{align*} \|(T - T_n) x\| = \|(I - P_n) Tx\| &\leq \|(I - P_n)(Tx - y_j)\| + \|(I - P_n) y_j\| \\\\ &\leq \|Tx - y_j\| + \|y_j - P_n y_j\| \\\\ &\lt \varepsilon, \end{align*} \] using \(\|I - P_n\| \leq 1\). Taking sup over unit \(x\) gives \(\|T - T_n\| \leq \varepsilon\) for \(n \geq N\).

Remark. This characterization relies on the Hilbert space structure through the orthogonal projections \(P_n\). A Banach space in which every compact operator arriving from an arbitrary Banach space is a norm limit of finite-rank operators is said to have the approximation property. Famously, there exist separable Banach spaces without it.

This is the functional-analytic analogue of the truncated SVD. A compact operator can be approximated arbitrarily well by operators with finite-dimensional range, just as any matrix can be approximated by low-rank matrices obtained by discarding small singular values.

The Canonical Example: Integral Operators

Definition: Hilbert-Schmidt Integral Operators

Let \(K : [a,b] \times [a,b] \to \mathbb{C}\) be a square-integrable kernel, meaning \[ \int_a^b \int_a^b |K(x,t)|^2 \, dx\, dt \lt \infty. \] The integral operator defined by \[ (Tf)(x) = \int_a^b K(x, t)\, f(t)\, dt \] is a compact operator on \(L^2([a,b])\). Such operators are called Hilbert-Schmidt operators. Like the compact operators below, they form a two-sided ideal in \(\mathcal{B}(L^2)\), a fact we state without proof and will not need.

The Hilbert-Schmidt norm is \[ \|T\|_{\text{HS}} = \left(\int_a^b \int_a^b |K(x,t)|^2 \, dx\, dt\right)^{1/2}, \] and it satisfies \(\|T\| \leq \|T\|_{\text{HS}}\) (the operator norm is bounded by the Hilbert-Schmidt norm).

Proof sketch (compactness and norm bound):

Norm bound. For \(f \in L^2([a,b])\), Cauchy-Schwarz applied pointwise in \(x\) gives \[ |(Tf)(x)|^2 = \left|\int_a^b K(x,t) f(t)\, dt\right|^2 \leq \left(\int_a^b |K(x,t)|^2\, dt\right) \|f\|_2^2. \] Integrating in \(x\) yields \(\|Tf\|_2^2 \leq \|T\|_{\text{HS}}^2 \|f\|_2^2\), that is, \(\|T\| \leq \|T\|_{\text{HS}}\).

Compactness. Fix an orthonormal basis \(\{\varphi_i\}\) of \(L^2([a,b])\). Then \(\{\varphi_i(x)\varphi_j(t)\}\) is an orthonormal basis of \(L^2([a,b]^2)\). Orthonormality follows from Fubini's theorem, which factors the double integral into a product of two inner products. Completeness holds because a kernel orthogonal to every product \(\varphi_i(x)\varphi_j(t)\) has, for almost every \(x\), a slice \(K(x, \cdot)\) orthogonal to every \(\varphi_j\), and therefore vanishes almost everywhere. Expand \(K = \sum_{i,j} c_{ij}\, \varphi_i(x)\varphi_j(t)\) and let \(K_N\) be the truncation to \(i, j \leq N\). The corresponding operator \(T_N\) is finite-rank, and \(\|T - T_N\| \leq \|T - T_N\|_{\text{HS}} \to 0\) by Parseval. By the finite-rank approximation theorem above, \(T\) is compact.

These integral operators are the "continuous matrices" of functional analysis. The kernel function \(K(x,t)\) plays the role of the matrix entries \(a_{ij}\), and the integral replaces the finite sum. When the kernel is Hermitian (\(K(x,t) = \overline{K(t,x)}\)), the integral operator is self-adjoint, the continuous analogue of a Hermitian matrix. For real-valued kernels this condition is the familiar symmetry \(K(x,t) = K(t,x)\).

Key Properties of Compact Operators

Theorem: Properties of Compact Operators

(a) If \(\mathcal{Y}\) is a Banach space, the set of compact operators \(\mathcal{K}(\mathcal{X}, \mathcal{Y})\) is a closed subspace of \(\mathcal{B}(\mathcal{X}, \mathcal{Y})\).

(b) If \(T\) is compact and \(S\) is bounded, then both \(ST\) and \(TS\) are compact (compact operators form a two-sided ideal in \(\mathcal{B}(\mathcal{H})\)).

(c) If \(\mathcal{H}\) is a Hilbert space and \(T \in \mathcal{B}(\mathcal{H})\) is compact, then \(T^*\) is compact (Schauder's theorem).

(d) The identity operator \(I\) on an infinite-dimensional space is never compact (since the closed unit ball is not compact).

Proof:

(a) Linearity (closure under addition and scalar multiplication) is straightforward from the subsequence-extraction characterization. Closedness in operator norm was proved as the (\(\Leftarrow\)) direction of Compact Operators as Limits of Finite-Rank Operators for the Hilbert case. The same diagonal argument works for general normed spaces once "finite-rank" is replaced by "compact" throughout, since that argument never uses finite-rank approximability. A sequence \(\{T_n\}\) of compact operators with \(T_n \to T\) in norm and a bounded \(\{x_k\}\) admit, by iterated subsequence extraction, a diagonal \(\{y_j\}\) on which every \(T_n\) converges. The \(3\varepsilon\) argument then gives \(\{Ty_j\}\) Cauchy, hence convergent in the Banach space \(\mathcal{Y}\) by the Cauchy criterion for completeness.

(b) Let \(\{x_n\}\) be a bounded sequence in \(\mathcal{X}\). For \(TS\): \(\{Sx_n\}\) is bounded (\(\|Sx_n\| \leq \|S\|\|x_n\|\)), so by compactness of \(T\), \((TS)x_n = T(Sx_n)\) has a convergent subsequence. For \(ST\): by compactness of \(T\), \(\{Tx_n\}\) has a convergent subsequence \(Tx_{n_k} \to y\). By continuity of \(S\), \(S(Tx_{n_k}) \to Sy\), so \((ST)x_n\) has a convergent subsequence. Hence both \(ST\) and \(TS\) are compact.

(c) On a Hilbert space the result follows from the finite-rank approximation already established. Write \(T\) as a norm limit of finite-rank operators \(T_n\), as in Compact Operators as Limits of Finite-Rank Operators. Each \(T_n^*\) is again finite-rank. Choose an orthonormal set \(v_1, \ldots, v_m\) spanning \(\operatorname{Range}(T_n)\), so that \(T_n x = \sum_i \langle T_n x, v_i\rangle v_i\) for every \(x\). Moving \(T_n\) across the inner product gives \(T_n^* y = \sum_i \langle y, v_i\rangle\, T_n^* v_i\), so \(\operatorname{Range}(T_n^*)\) lies in the span of \(T_n^* v_1, \ldots, T_n^* v_m\). Since the adjoint is norm-preserving, \(\|T^* - T_n^*\| = \|(T - T_n)^*\| = \|T - T_n\| \to 0\), so \(T^*\) is itself a norm limit of finite-rank operators and therefore compact.

(d) If \(I\) were compact, the image of the unit ball under \(I\), which is the unit ball itself, would be relatively compact. But in infinite dimensions, the closed unit ball is not compact. This is exactly the Riesz characterization of finite-dimensionality.

Property (d) highlights the key distinction. Compact operators are the "well-behaved" operators that do not include the identity, and they necessarily "lose dimensions" in the sense that their image cannot contain an open set. We state this last fact without proof.

Connection to Machine Learning: Kernel Matrices as Finite Approximations

In Kernel PCA, we compute the Gram matrix \(K_{ij} = K(x_i, x_j)\) for \(N\) data points and extract its eigenvectors. This \(N \times N\) matrix is a finite-dimensional discretization of the underlying integral operator \((Tf)(x) = \int K(x, t) f(t)\, d\mu(t)\) on the function space, obtained by replacing the measure \(\mu\) with the empirical measure \(\mu_N = \tfrac{1}{N}\sum_i \delta_{x_i}\).

Spectral perturbation results for integral operators guarantee the following. As \(N \to \infty\) and \(\mu_N \to \mu\) (for example, by the Glivenko-Cantelli theorem when the samples are i.i.d.), the eigenvalues of the Gram matrix, rescaled by \(1/N\), converge to the eigenvalues of the underlying compact integral operator. The eigenvectors converge to the eigenfunctions up to the usual ambiguity within eigenspaces. This is why kernel methods extract meaningful spectral structure from finite data.

The Spectral Theorem for Compact Self-Adjoint Operators

We now arrive at the central result of this page, the infinite-dimensional generalization of the Spectral Theorem for Symmetric Matrices. The orthonormal basis definition is formulated for infinite sequences. Throughout this section we allow an orthonormal basis of a closed subspace to be a finite or empty orthonormal set, subject to the same closed-span condition.

Theorem: Spectral Theorem (Compact Self-Adjoint Operators)

Let \(\mathcal{H}\) be a separable Hilbert space and \(T = T^* \in \mathcal{B}(\mathcal{H})\) a compact, self-adjoint operator. Then:

(a) There exists a finite or countably infinite orthonormal sequence of eigenvectors \(\{e_n\}_{n=1}^N\) (\(N \leq \infty\)) with corresponding real eigenvalues \(\{\lambda_n\}\), listed with multiplicity and arranged so that \(|\lambda_1| \geq |\lambda_2| \geq \cdots\), such that \[ Tx = \sum_{n=1}^{N} \lambda_n \langle x, e_n \rangle \, e_n \quad \text{for all } x \in \mathcal{H}. \]

(b) If \(N = \infty\), then \(\lambda_n \to 0\) as \(n \to \infty\).

(c) Each nonzero eigenvalue has finite multiplicity (its eigenspace is finite-dimensional).

(d) The only possible accumulation point of \(\{\lambda_n\}\) is \(0\).

(e) The eigenvectors \(\{e_n\}\) together with an orthonormal basis for \(\ker(T)\) form a complete orthonormal basis for \(\mathcal{H}\).

Comparison: Finite vs. Infinite Dimensions

Property Symmetric Matrix \(A \in \mathbb{R}^{n \times n}\) Compact Self-Adjoint \(T \in \mathcal{B}(\mathcal{H})\)
Eigenvalues Finitely many (\(n\)), all real Countably many, all real, \(\lambda_n \to 0\)
Eigenvectors Orthonormal basis for \(\mathbb{R}^n\) Orthonormal sequence \(\{e_n\}\) spanning \(\overline{\operatorname{Range}(T)}\). Together with an orthonormal basis of \(\ker(T)\), it forms an orthonormal basis of \(\mathcal{H}\)
Decomposition \(A\mathbf{x} = \sum_{i=1}^{n} \lambda_i \langle \mathbf{x}, \mathbf{v}_i\rangle \mathbf{v}_i\) (equivalently \(A = Q\Lambda Q^\top\)) \(Tx = \sum_{n=1}^{N} \lambda_n \langle x, e_n \rangle \, e_n\) (\(N \leq \infty\))
Truncation Low-rank approximation (\(\|A - A_k\|_2 = |\lambda_{k+1}|\), Eckart-Young) Finite-rank approximation (\(\|T - T_k\| = |\lambda_{k+1}|\))
Zero eigenvalue Present iff \(A\) is singular (\(\ker(A) \neq \{0\}\)) May or may not be an eigenvalue (\(0 \in \sigma_p(T) \iff \ker(T) \neq \{0\}\)). But \(0 \in \sigma(T)\) is automatic when \(\dim\mathcal{H} = \infty\). An inverse would make \(I = TT^{-1}\) compact via the two-sided ideal property of compact operators, yet the identity is never compact in infinite dimensions

Proof Sketch

The proof proceeds by an iterative maximization argument that parallels the Rayleigh quotient construction from finite-dimensional linear algebra.

Proof Sketch:

Step 1: Find the first eigenvector.
If \(T = 0\), the theorem holds trivially with \(N = 0\) and any orthonormal basis of \(\ker(T) = \mathcal{H}\), so assume \(T \neq 0\). Since \(T\) is self-adjoint, \(\|T\| = \sup_{\|x\|=1} |\langle Tx, x \rangle|\). Because every Hilbert space is reflexive, we have weak compactness of the unit ball, and Eberlein-Šmulian turns it into the sequential statement that every bounded sequence has a weakly convergent subsequence. Together with compactness of \(T\), this produces \(x_* \in \overline{B}_\mathcal{H}\) achieving \(|\langle Tx_*, x_* \rangle| = \|T\|\). The mechanism deserves its own paragraph.

Why the supremum is attained.
Compactness of \(T\) upgrades weak convergence to strong convergence of images along bounded sequences. Suppose \(\{x_n\}\) is bounded, \(x_n \rightharpoonup x\), and some subsequence of \(\{Tx_n\}\) stays at distance at least \(\delta \gt 0\) from \(Tx\). Compactness extracts from it a further subsequence with \(Tx_{n_k} \to y\) strongly. Boundedness of \(T\) makes it weakly continuous, because \(\langle Tx_n, z \rangle = \langle x_n, T^*z \rangle \to \langle x, T^*z \rangle = \langle Tx, z \rangle\) for every \(z \in \mathcal{H}\). The extracted subsequence therefore converges to \(Tx\) weakly and to \(y\) strongly, and testing the difference against \(z = y - Tx\) yields \(y = Tx\), a contradiction. Hence \(Tx_n \to Tx\) strongly. Splitting \(\langle Tx_n, x_n \rangle - \langle Tx, x \rangle = \langle Tx_n - Tx, x_n \rangle + \langle Tx, x_n - x \rangle\) and using boundedness of \(\{x_n\}\) then gives \(\langle Tx_n, x_n \rangle \to \langle Tx, x \rangle\) for every bounded sequence with \(x_n \rightharpoonup x\). A maximizing sequence for \(|\langle Tx, x \rangle|\) on \(\overline{B}_\mathcal{H}\) has a weakly convergent subsequence, and its weak limit \(x_*\) attains the supremum. Since the sup over \(\overline{B}\) equals the sup over the unit sphere (by positive homogeneity of \(|\langle Tx, x\rangle|\) in \(\|x\|^2\)), we may assume \(\|x_*\| = 1\). We set \(e_1 = x_*\) and \(\lambda_1 = \langle Te_1, e_1 \rangle\).

Variational argument for \(Te_1 = \lambda_1 e_1\).
For any \(v \perp e_1\) and \(t \in \mathbb{R}\), consider \[ \phi(t) = \langle T(e_1 + tv), e_1 + tv \rangle / \|e_1 + tv\|^2. \] Since \(t = 0\) maximises \(|\phi|\) and \(T\) is self-adjoint, differentiating at \(t = 0\) gives \[ \phi'(0) = 2\operatorname{Re} \langle Te_1 - \lambda_1 e_1, v \rangle = 0. \] Replacing \(v\) with \(iv\) over \(\mathbb{C}\) gives the imaginary part, so \(\langle Te_1 - \lambda_1 e_1, v \rangle = 0\) for all \(v \perp e_1\). Thus \[ Te_1 - \lambda_1 e_1 \in \{e_1\}^{\perp\perp} = \operatorname{span}\{e_1\} \] (since \(\operatorname{span}\{e_1\}\) is one-dimensional, hence closed, and span-invariance together with the double orthogonal complement identifies \(\{e_1\}^{\perp\perp}\) with it). Combined with \(\langle Te_1 - \lambda_1 e_1, e_1\rangle = 0\) by construction, this gives \(Te_1 = \lambda_1 e_1\).

Step 2: Restrict and repeat.
The subspace \(\{e_1\}^\perp\) is invariant under \(T\), because \(v \perp e_1\) gives \(\langle Tv, e_1 \rangle = \langle v, Te_1 \rangle = \lambda_1 \langle v, e_1 \rangle = 0\) by self-adjointness and the eigenvector relation \(Te_1 = \lambda_1 e_1\). The restriction \(T|_{\{e_1\}^\perp}\) is still compact and self-adjoint, so we repeat Step 1 to find \(e_2\) with \(|\lambda_2| = \|T|_{\{e_1\}^\perp}\| \leq |\lambda_1|\). If \(\|T|_{\{e_1, \ldots, e_n\}^\perp}\| = 0\) at some stage, the process stops and \(N = n\). Otherwise every \(\lambda_n\) is nonzero and the construction continues.

Step 3: Convergence to zero.
The sequence \(\{|\lambda_n|\}\) is nonincreasing and bounded below by 0, so it converges. If it converged to some \(\varepsilon \gt 0\), the orthonormal sequence \(\{e_n\}\) would satisfy \(\|Te_m - Te_n\|^2 = \lambda_m^2 + \lambda_n^2 \geq 2\varepsilon^2\), contradicting the compactness of \(T\) (which requires \(\{Te_n\}\) to have a convergent subsequence). Hence \(\lambda_n \to 0\).

Closing the remaining claims.
Steps 1-3 yield (b) directly. Statement (d) follows because the construction enumerates the eigenvalues in nonincreasing order of \(|\lambda_n|\), so any accumulation point must equal \(\lim |\lambda_n| = 0\). For (c), if some nonzero eigenvalue \(\mu\) had infinite multiplicity, an orthonormal basis \(\{u_k\}\) of its eigenspace would give \(\|Tu_k - Tu_l\|^2 = 2\mu^2\) for \(k \neq l\), again contradicting compactness.

For (e), the constructed \(\{e_n\}\) span \(\overline{\operatorname{Range}(T)}\). Any vector \(v\) orthogonal to all \(e_n\) satisfies \[ \|Tv\| \leq \|T|_{\{e_1,\ldots,e_n\}^\perp}\| \cdot \|v\| = |\lambda_{n+1}| \|v\| \to 0, \] forcing \(Tv = 0\), hence \(v \in \ker(T)\). Since \(\mathcal{H}\) is separable, the closed subspace \(\ker(T)\) is also separable and admits a countable orthonormal basis. Concatenating \(\{e_n\}\) with such a basis of \(\ker(T)\) gives a complete orthonormal basis of \(\mathcal{H} = \overline{\operatorname{Range}(T)} \oplus \ker(T)\). The expansion in (a) then follows. Writing \(x = x_R + x_K\) with \(x_R \in \overline{\operatorname{Range}(T)}\) and \(x_K \in \ker(T)\), Parseval gives \(x_R = \sum_n \langle x, e_n\rangle e_n\). Thus, \[ Tx = Tx_R = \sum_n \lambda_n \langle x, e_n\rangle e_n \] by linearity and continuity.

Notice that Step 1 uses the Rayleigh quotient characterization, Step 2 uses the orthogonal complement (Hilbert space structure), and Step 3 uses compactness to force the eigenvalues to decay. Each ingredient is essential.

The Singular Value Decomposition in Infinite Dimensions

Just as the finite-dimensional SVD extends the Spectral Theorem from symmetric to general matrices, there is an infinite-dimensional SVD for compact operators.

Theorem: Singular Value Decomposition (Compact Operators)

Let \(T \in \mathcal{B}(\mathcal{H})\) be a compact operator (not necessarily self-adjoint). Then there exist orthonormal sequences \(\{e_n\}_{n=1}^N\) and \(\{f_n\}_{n=1}^N\) (\(N \leq \infty\)) and a nonincreasing sequence of strictly positive reals \(\sigma_1 \geq \sigma_2 \geq \cdots \gt 0\) (the singular values) such that \[ Tx = \sum_{n=1}^{N} \sigma_n \langle x, e_n \rangle \, f_n. \] The singular values are the positive square roots of the nonzero eigenvalues of \(T^*T\), equivalently of \(TT^*\). The two operators share their nonzero eigenvalues with matching multiplicities. Moreover, \(\sigma_n \to 0\) when \(N = \infty\).

Proof sketch:

By Schauder's theorem, \(T^*\) is compact. Hence \(T^*T\) is compact, self-adjoint (\(\langle T^*Tx, y\rangle = \langle Tx, Ty\rangle = \langle x, T^*Ty\rangle\) by two uses of the defining relation), and positive (\(\langle T^*Tx, x\rangle = \|Tx\|^2 \geq 0\)). No separability of \(\mathcal{H}\) is needed here, even though the Spectral Theorem assumes it. The image of a ball under a compact operator has compact closure and is therefore totally bounded, so it contains a countable dense subset. Since \(\operatorname{Range}(T^*T)\) is a countable union of such images, the closed subspace \(\mathcal{H}_0 = \overline{\operatorname{Range}(T^*T)}\) is a separable Hilbert space. It is invariant under \(T^*T\), and the restriction \(T^*T|_{\mathcal{H}_0}\) is compact, self-adjoint, and injective: if \(x \in \mathcal{H}_0\) satisfies \(T^*Tx = 0\), then \(x \in \ker(T^*T) = \operatorname{Range}(T^*T)^\perp\) by the range-kernel exchange under the adjoint, so continuity of the inner product makes \(x\) orthogonal to all of \(\mathcal{H}_0\), and in particular to itself, so \(x = 0\). The Spectral Theorem applied to \(T^*T|_{\mathcal{H}_0}\) yields nonzero eigenvalues \(\{\sigma_n^2\}_{n=1}^N\) (\(\sigma_n^2 \gt 0\), nonincreasing, \(\sigma_n^2 \to 0\) when \(N = \infty\)) with corresponding orthonormal eigenvectors \(\{e_n\}\) forming an orthonormal basis of \(\mathcal{H}_0\). The basis property is conclusion (e) of that theorem, since the kernel of the restriction is trivial and contributes an empty orthonormal set. Define \(\sigma_n = \sqrt{\sigma_n^2} \gt 0\) and \(f_n = Te_n / \sigma_n\). Direct computation gives \[ \begin{align*} \langle f_n, f_m\rangle &= \langle Te_n, Te_m\rangle/(\sigma_n \sigma_m) \\\\ &= \langle T^*Te_n, e_m\rangle/(\sigma_n\sigma_m) \\\\ &= \sigma_n^2\delta_{nm}/(\sigma_n\sigma_m) \\\\ &= \delta_{nm}, \end{align*} \] so \(\{f_n\}\) is orthonormal.

For the expansion, note that \(\ker(T^*T) = \ker(T)\), since \(T^*Tx = 0\) implies \(\|Tx\|^2 = \langle T^*Tx, x\rangle = 0\), hence \(Tx = 0\), and conversely. Taking orthogonal complements in the range-kernel exchange and applying the double orthogonal complement identifies \(\mathcal{H}_0\) with \(\ker(T^*T)^\perp\). Decompose any \(x \in \mathcal{H}\) as \(x = x_R + x_K\) with \(x_R \in \mathcal{H}_0 = \ker(T^*T)^\perp = \ker(T)^\perp\) and \(x_K \in \ker(T)\). By Parseval on the orthonormal basis \(\{e_n\}\) of \(\mathcal{H}_0\), \(x_R = \sum_n \langle x, e_n\rangle e_n\). Since \(Tx_K = 0\) and \(T\) is continuous, \[ Tx = Tx_R = \sum_n \langle x, e_n\rangle Te_n = \sum_n \sigma_n \langle x, e_n\rangle f_n. \]

Finally, the \(\{f_n\}\) are themselves eigenvectors of \(TT^*\) with the same eigenvalues \(\sigma_n^2\): \(TT^* f_n = TT^*(Te_n/\sigma_n) = T(T^*T)e_n/\sigma_n = T(\sigma_n^2 e_n)/\sigma_n = \sigma_n^2 f_n\). The map \(e_n \mapsto f_n\) preserves orthonormality, so no multiplicity is lost in this direction. Exchanging the roles of \(T\) and \(T^*\) runs the same construction from \(TT^*\) back to \(T^*T\), so the nonzero eigenvalues of the two operators coincide with matching multiplicities. That is the sense in which \(T^*T\) and \(TT^*\) "see" the same singular values from the two sides of \(T\).

This is the precise infinite-dimensional analogue of \(A = U\Sigma V^\top\). The \(\{e_n\}\) are the "right singular vectors," the \(\{f_n\}\) are the "left singular vectors," and the \(\sigma_n\) decay to zero because \(T\) is compact.

Functional PCA & The Path to Kernels

The Spectral Theorem is not merely an abstract result. It is the mathematical engine behind several of the most important algorithms in machine learning and statistics. In this final section, we connect the theory to three concrete applications.

Application 1: The Karhunen-Loève Expansion (Functional PCA)

In PCA, we performed eigendecomposition on the covariance matrix \(\Sigma \in \mathbb{R}^{n \times n}\) of a finite-dimensional random vector. But what if our data consists of random functions, for example time series, curves, or images viewed as functions on a domain?

Let \(X(t)\) be a centered, square-integrable stochastic process on \([a,b]\), with covariance function \[ C(s, t) = \mathbb{E}[X(s)\, \overline{X(t)}]. \] The kernel \(C\) is Hermitian symmetric (\(C(s,t) = \overline{C(t,s)}\)) and positive semi-definite. The most common ML setting takes \(X\) real-valued, in which case the conjugate is a no-op and \(C\) reduces to a real symmetric kernel \(C(s,t) = \mathbb{E}[X(s) X(t)]\). The formulation here covers both this classical case and complex-valued processes (for example, complex baseband signals in communications and quantum stochastic processes).

The covariance operator \(\mathcal{C} : L^2([a,b]) \to L^2([a,b])\) is defined by \[ (\mathcal{C}f)(s) = \int_a^b C(s, t)\, f(t)\, dt. \] This is a Hilbert-Schmidt integral operator with a Hermitian, positive semi-definite kernel, so it is compact and self-adjoint. The Spectral Theorem applies directly.

Theorem: Karhunen-Loève Expansion

Let \(X(t)\) be a centered, jointly measurable, square-integrable stochastic process on \([a,b]\) with continuous covariance function \(C(s,t)\). Let \(\{\lambda_n, e_n\}\) be the eigenvalues and eigenfunctions of the covariance operator \(\mathcal{C}\). Then \[ X(t) = \sum_{n=1}^{\infty} Z_n \, e_n(t), \] where \(Z_n = \langle X, e_n \rangle = \int_a^b X(t)\, \overline{e_n(t)}\, dt\) are uncorrelated random variables with \(\mathbb{E}[Z_n] = 0\) and \(\operatorname{Var}(Z_n) = \lambda_n\). The convergence is in mean square in \(L^2([a,b])\): \[ \mathbb{E}\Bigl\|X - \sum_{n=1}^{N} Z_n e_n\Bigr\|_{L^2([a,b])}^2 \longrightarrow 0 \quad \text{as } N \to \infty. \]

Proof sketch:

Apply the Spectral Theorem to the compact self-adjoint covariance operator \(\mathcal{C}\) to obtain orthonormal eigenfunctions \(\{e_n\}\) with eigenvalues \(\lambda_n \geq 0\) (positivity from \(\langle \mathcal{C}f, f\rangle = \mathbb{E}[|\langle X, f\rangle|^2] \geq 0\), real-valuedness of \(\lambda_n\) from self-adjointness). Define \(Z_n = \langle X, e_n\rangle\). Centering of \(X\) gives \(\mathbb{E}[Z_n] = 0\). By Fubini's theorem and the eigenvalue equation \(\mathcal{C}e_m = \lambda_m e_m\), \[ \begin{align*} \mathbb{E}[Z_n\, \overline{Z_m}] &= \int_a^b \!\!\int_a^b C(s,t)\, \overline{e_n(s)}\, e_m(t)\, ds\, dt \\\\ &= \langle \mathcal{C}e_m, e_n\rangle \\\\ &= \lambda_m \langle e_m, e_n\rangle \\\\ &= \lambda_m\, \delta_{nm}, \end{align*} \] giving uncorrelatedness and \(\operatorname{Var}(Z_n) = \mathbb{E}[|Z_n|^2] = \lambda_n\).

For the expansion, note first that \(X\) lies almost surely in \(\overline{\operatorname{Range}(\mathcal{C})}\), whose orthogonal complement is \(\ker\mathcal{C}\) by self-adjointness. Indeed, if \(\mathcal{C}f = 0\) then \(\mathbb{E}[|\langle X, f\rangle|^2] = \langle \mathcal{C}f, f\rangle = 0\), so \(\langle X, f\rangle = 0\) almost surely. Applying this to each member of a countable dense subset of \(\ker\mathcal{C}\), available because \(L^2([a,b])\) is separable, leaves a single exceptional set of probability zero, off which \(\langle X, \cdot\rangle\) vanishes on that dense subset and hence, being continuous, on all of \(\ker\mathcal{C}\). Parseval on the orthonormal basis \(\{e_n\}\) of \(\overline{\operatorname{Range}(\mathcal{C})}\) therefore gives, pathwise, \[ \Bigl\|X - \sum_{n=1}^{N} Z_n e_n\Bigr\|_{L^2([a,b])}^2 = \sum_{n \gt N} |Z_n|^2 , \] and taking expectations turns the right-hand side into \(\sum_{n \gt N} \lambda_n\) (monotone convergence licenses the exchange of expectation and sum). This is the tail of the convergent series \(\sum_n \lambda_n = \mathbb{E}\|X\|_{L^2([a,b])}^2\). Continuity of \(C\) enters this argument only through the finiteness of \(\int_a^b C(t,t)\, dt\), which makes the trace series \(\sum_n \lambda_n\) converge. Its full strength upgrades the conclusion to convergence in mean square at each fixed \(t\), uniformly in \(t\), through the pointwise kernel expansion taken up in the bridge to kernel methods below.

This is literally infinite-dimensional PCA. The eigenfunctions \(\{e_n\}\) are the principal components (the directions of maximum variance), the eigenvalues \(\lambda_n\) give the variance in each direction, and the random coefficients \(Z_n\) are the "scores." The decay \(\lambda_n \to 0\) guarantees that truncating after \(k\) terms captures most of the variance, the continuous analogue of the scree plot.

Application 2: Spectral Clustering via the Continuous Laplacian

In Spectral Clustering, we used eigenvectors of the discrete graph Laplacian \(\mathbf{L} = \mathbf{D} - \mathbf{W}\) to embed data into a low-dimensional space and then applied K-means. The continuous analogue replaces the graph with a smooth domain and the discrete Laplacian with the Laplace-Beltrami operator on a manifold.

On a compact Riemannian manifold (or on a bounded domain with appropriate boundary conditions), the negative Laplace-Beltrami operator \(-\Delta\) is a positive self-adjoint unbounded operator with compact resolvent \((-\Delta + I)^{-1}\). Being unbounded, \(-\Delta\) itself lies outside the scope of the spectral theorem developed here. Applying the Spectral Theorem to its compact self-adjoint resolvent nevertheless yields an orthonormal basis of eigenfunctions \(\{e_n\}\) for \(L^2\) on the manifold. These are simultaneously eigenfunctions of \(-\Delta\), with eigenvalues \(0 \leq \lambda_0 \leq \lambda_1 \leq \cdots \to \infty\).

The first few eigenfunctions, the "low-frequency modes," capture the large-scale geometry of the manifold, precisely as the Fiedler vector captures the main partition of a graph in the discrete case.

From Graphs to Manifolds: The Convergence

As the number of data points \(N \to \infty\) and the graph becomes denser, the discrete graph Laplacian converges (in a suitable sense) to the Laplace-Beltrami operator on the underlying data manifold. The eigenvectors of the graph Laplacian converge to the eigenfunctions of the continuous operator. This is the rigorous justification for spectral clustering. The discrete algorithm is a finite-sample approximation of a well-defined continuous operation, and the Spectral Theorem guarantees that the continuous object has the orthogonal eigenfunction structure we need.

Application 3: The Bridge to Mercer's Theorem and RKHS

Consider a continuous, Hermitian (\(K(x,t) = \overline{K(t,x)}\)), positive semi-definite kernel \(K : [a,b] \times [a,b] \to \mathbb{C}\). The integral operator \[ (T_K f)(x) = \int_a^b K(x, t)\, f(t)\, dt \] is compact, self-adjoint, and positive (all eigenvalues \(\lambda_n \geq 0\)). The Spectral Theorem, combined with the product-basis expansion from the compactness proof above, gives the eigenfunction expansion \[ K(x, t) = \sum_{n=1}^{\infty} \lambda_n \, e_n(x)\, \overline{e_n(t)}, \] with convergence in \(L^2([a,b]^2)\), and Mercer's theorem, which uses the continuity of \(K\), upgrades the \(L^2\) convergence of this expansion to absolute and uniform convergence.

The most common ML setting uses real-symmetric kernels (Gaussian, polynomial, Laplacian, Matérn, and so on). In that case the conjugate is a no-op and the formula reduces to \(K(x,t) = \sum_n \lambda_n e_n(x) e_n(t)\). This real-symmetric case is the setting of Mercer's theorem.

This eigenfunction expansion has a profound consequence. The kernel \(K\) defines an implicit feature map \[ \Phi(x) = \bigl(\sqrt{\lambda_1}\, e_1(x), \sqrt{\lambda_2}\, e_2(x), \ldots\bigr) \in \ell^2, \] such that \(K(x, t) = \langle \Phi(x), \Phi(t) \rangle_{\ell^2}\). In the linear-in-first-argument convention the second slot conjugates, which recovers the Hermitian \(\overline{e_n(t)}\) automatically. The kernel "trick" is mathematically grounded in this spectral decomposition. The trick computes inner products in a high-dimensional feature space without ever forming \(\Phi\) explicitly.

Summary: The Spectral Thread

Let us trace the spectral idea through our entire curriculum:

  1. Finite-dimensional (Symmetry & SVD): \(A = Q\Lambda Q^\top\). Discrete eigenvalues, finite eigenvectors. Powers PCA, SVD.
  2. Discrete infinite (Graph Laplacians): \(\mathbf{L} = \mathbf{D} - \mathbf{W}\). Discrete eigenvalues of growing matrices. Powers Spectral Clustering, Graph Fourier Transform.
  3. Continuous infinite (this page): \(Tx = \sum \lambda_n \langle x, e_n \rangle e_n\). Countable eigenvalues decaying to 0. Powers Functional PCA, continuous Laplacians.
  4. Ahead: Mercer's Theorem converts the spectral decomposition of a positive kernel into an explicit feature space, the mathematical foundation of SVMs, Gaussian Processes, and Kernel PCA.