Studies bounded and unbounded linear operators on Hilbert spaces, including their spectra.
IntuitionOperators as infinite-dimensional matrices
A matrix takes a finite list of numbers and outputs another finite list, by mixing the entries linearly. An operator does exactly the same job for functions: differentiation Df=f′ takes a function and linearly produces another function; multiplying by x, convolving with a fixed kernel, or applying a Fourier transform are all operators. Operator theory studies these maps on a Hilbert space H the way linear algebra studies matrices on Rn: what are their eigenvalues (now called the spectrum), which operators are "nice" (self-adjoint, like a symmetric matrix), and — a genuinely new infinite-dimensional phenomenon — which operators are even defined on the whole space at all, since differentiation, unlike matrix multiplication, is not defined for every function in H.
The network of operator classes and how they relate: unitary operators (node U) are a special case of normal operators, which include both self-adjoint operators (node T=T∗) and rotations; compact operators (node K) can be self-adjoint or not, and sit inside all bounded operators, which in turn sit inside the much larger, only densely-defined class of unbounded operators. Highlighting a node traces the chain of inclusions that leads to it.
UndergraduateBounded operators, adjoints, and self-adjointness
Definition: Bounded linear operator and operator norm
A linear map T from a Hilbert space H to itself is bounded if it does not stretch vectors by an unlimited factor: there is a constant c with ∥Tx∥≤c∥x∥ for all x∈H. The smallest such c is the operator norm, ∥T∥=sup∥x∥≤1∥Tx∥ — the largest factor by which T can stretch a unit vector. Boundedness is exactly equivalent to continuity for a linear map, so "bounded operator" and "continuous operator" mean the same thing.
Written as a formula, the operator norm is the supremum of how much T can stretch a unit vector:
∥T∥=∥x∥≤1sup∥Tx∥
Every bounded T on H has a unique adjoint operator T∗, defined by ⟨Tx,y⟩=⟨x,T∗y⟩ for all x,y∈H — it exists by the Riesz representation theorem, applied to the functional x↦⟨Tx,y⟩ for each fixed y. In finite dimensions, taking the adjoint is exactly conjugate-transposing a matrix. T is called self-adjoint (or Hermitian) if T=T∗, normal if TT∗=T∗T, and unitary if T∗T=TT∗=I — the operator analogues of a symmetric matrix, a matrix that commutes with its transpose, and a rotation matrix, respectively.
Self-adjointness is the single most important property in the theory, because it is exactly the condition that forces the spectrum to be real and gives access to a spectral theorem (proved below). Written out, T is self-adjoint precisely when moving T from one side of the inner product to the other never changes anything:
⟨Tx,y⟩=⟨x,Ty⟩∀x,y∈H
Compare this with a real symmetric matrix A=AT, for which ⟨Ax,y⟩=⟨x,Ay⟩ holds automatically — self-adjointness is exactly the infinite-dimensional version of matrix symmetry. Different operator classes have sharply different spectra, summarized below.
Operator classes and their spectra
Class
Defining condition
Spectrum σ(T)
Self-adjoint
T=T∗
Real: σ(T)⊂R
Unitary
T∗T=TT∗=I
Unit circle: σ(T)⊂{∣z∣=1}
Compact self-adjoint
T=T∗, T compact
Discrete, λn→0
Multiplication by x on L2[0,1]
Tf(x)=xf(x)
Continuous: σ(T)=[0,1], no eigenvalues
UndergraduateTwo pillars: the spectral theorem and the Hellinger–Toeplitz theorem
Let T be a compact self-adjoint operator on a Hilbert space H. Then there is an orthonormal basis of H consisting of eigenvectors e1,e2,… of T, with real eigenvalues λ1,λ2,… such that λn→0 if H is infinite-dimensional, and Tx=∑nλn⟨x,en⟩en for every x∈H.
Why is it true?
It says a compact self-adjoint operator, however complicated it looks, is secretly a diagonal matrix in the right orthonormal basis — exactly as a symmetric matrix in linear algebra is always diagonalizable by an orthonormal eigenbasis. This is what makes it possible to define functions of the operator, solve Tx=y, and decompose signals or images by their dominant eigen-directions (principal component analysis is this theorem in disguise).
Proof
First, every eigenvalue of a self-adjoint operator is real: if Tx=λx with x=0, then λ∥x∥2=⟨Tx,x⟩=⟨x,Tx⟩=λˉ∥x∥2 (using self-adjointness on the middle step), so λ=λˉ. Similarly, eigenvectors for distinct eigenvalues λ=μ are orthogonal: λ⟨x,y⟩=⟨Tx,y⟩=⟨x,Ty⟩=μ⟨x,y⟩ forces ⟨x,y⟩=0.
Next, compactness guarantees an eigenvalue of maximal absolute value actually exists: the operator norm satisfies ∥T∥=sup∥x∥=1∣⟨Tx,x⟩∣ for self-adjoint T, and compactness lets one extract a convergent subsequence from a maximizing sequence for ∣⟨Tx,x⟩∣, producing a unit vector e1 with Te1=λ1e1 where ∣λ1∣=∥T∥.
Now induct: having found orthonormal eigenvectors e1,…,en−1 with eigenvalues λ1,…,λn−1, restrict T to the closed subspace Hn={e1,…,en−1}⊥. Because T maps Hn into itself (self-adjointness makes the orthogonal complement of an invariant subspace invariant too) and remains compact and self-adjoint there, the same maximal-eigenvalue argument produces the next eigenvector en∈Hn with ∣λn∣≤∣λn−1∣.
Finally, if this process does not terminate, λn→0: otherwise infinitely many ∣λn∣ would stay above some δ>0, but then {Ten}={λnen} would have no convergent subsequence (since ∥λnen−λmen∥2≥δ2⋅2 for n=m by orthonormality), contradicting compactness of T. One then checks that the closed span of {en} together with kerT exhausts H, and that T acts as 0 on kerT, giving the eigen-expansion Tx=∑nλn⟨x,en⟩en for all x∈H.
Let T be a linear operator defined on the entire Hilbert space H (not just a dense subspace) that is symmetric, meaning ⟨Tx,y⟩=⟨x,Ty⟩∀x,y∈H. Then T is automatically bounded.
Why is it true?
This is the theorem that explains why unbounded operators are unavoidable in quantum mechanics: physically important symmetric operators like position, momentum, and the Hamiltonian genuinely cannot be defined on every vector of H (only on a dense domain), because if they were, this theorem would force them to be bounded — but they demonstrably are not.
Proof
We use the closed graph theorem (a standard consequence of the Baire category theorem): a linear operator defined on all of a Hilbert space is bounded if and only if its graph {(x,Tx):x∈H} is closed in H×H, i.e. whenever xn→x and Txn→y, we must have y=Tx.
Suppose xn→x and Txn→y. We must show y=Tx. For any fixed z∈H, symmetry gives ⟨Txn,z⟩=⟨xn,Tz⟩ for every n.
Taking n→∞ on both sides: the left side ⟨Txn,z⟩→⟨y,z⟩ because Txn→y and the inner product is continuous; the right side ⟨xn,Tz⟩→⟨x,Tz⟩ because xn→x. So ⟨y,z⟩=⟨x,Tz⟩=⟨Tx,z⟩ (using symmetry once more on the right).
Since ⟨y,z⟩=⟨Tx,z⟩ holds for everyz∈H, we get ⟨y−Tx,z⟩=0 for all z; taking z=y−Tx gives ∥y−Tx∥2=0, so y=Tx. The graph of T is therefore closed, and the closed graph theorem concludes T is bounded.
UndergraduateReal-World Applications and Worked Examples
Operator theory is the mathematical language of quantum mechanics (observables are self-adjoint operators, energies are eigenvalues of the Hamiltonian), of vibration and stability analysis in engineering (natural frequencies are eigenvalues of a compact operator), and of data science (principal component analysis diagonalizes a compact self-adjoint covariance operator). It is also where subtle mathematical care becomes physically essential: unbounded operators cannot be handled as casually as matrices.
Example: Engineering and data science: diagonalizing a symmetric matrix
A 2×2 symmetric matrix, seen as a compact self-adjoint operator on R2, is a coupling between two identical masses connected by springs: A=(2112). Find its eigenvalues, i.e. its normal-mode frequencies (in this toy stiffness-matrix model).
Solution
Eigenvalues solve the characteristic equation det(A−λI)=0. With A=(2112), this is det(2−λ112−λ)=0.
Expanding the determinant of this 2×2 matrix gives (2−λ)(2−λ)−(1)(1)=0, i.e. (2−λ)2−1=0.
This factors as [(2−λ)−1][(2−λ)+1]=0, i.e. (1−λ)(3−λ)=0, so λ1=1 and λ2=3.
As the spectral theorem predicts, these are both real (the matrix is symmetric), and the corresponding eigenvectors (1,−1)/2 and (1,1)/2 are orthogonal: the two normal modes are the masses swinging out of phase (lower frequency, weaker effective stiffness λ1=1) and in phase (higher frequency, stronger effective stiffness λ2=3).
Example: Physics and signal processing: why is differentiation unbounded?
On L2[0,1], consider the differentiation operator Df=f′ on smooth functions vanishing at the endpoints. Using the test functions fn(x)=sin(nπx) for n=1,2,3,…, show that T cannot satisfy a bound ∥Df∥2≤c∥f∥2 for any constant c — i.e. D is unbounded, consistent with the Hellinger–Toeplitz theorem (since D is only densely defined, not on all of L2[0,1]).
Solution
First compute ∥fn∥22=∫01sin2(nπx)dx=21 for every n (the average of sin2 over a whole number of periods is 21), so ∥fn∥2=1/2 stays constant as n grows.
Next, differentiate: Dfn(x)=fn′(x)=nπcos(nπx). Its norm squared is ∥Dfn∥22=∫01(nπ)2cos2(nπx)dx=(nπ)2⋅21, so ∥Dfn∥2=2nπ, growing linearly in n with no upper bound.
Suppose toward contradiction that ∥Df∥2≤c∥f∥2 held for some fixed c and all such f. Applying it to fn gives 2nπ≤c⋅21, i.e. nπ≤c for every n=1,2,3,… — impossible, since the left side grows without bound while c is fixed.
So no such c exists: D is unbounded, exactly as the Hellinger–Toeplitz theorem forces for a symmetric operator that is only densely defined. Physically, this is why the momentum operator p^=−iℏdxd in quantum mechanics — differentiation up to a constant — has no universal bound on how much it can amplify a wavefunction's higher-frequency components.
ResearchOpen frontier: spectral theory of random and many-body operators
If T is a self-adjoint operator on a Hilbert space H and Tx=λx for some x=0, what must be true of λ?
What are the eigenvalues of the Hermitian matrix A=(2112)?
What does the Hellinger–Toeplitz theorem say about a symmetric linear operator T defined on the entire Hilbert space H?
In the fn(x)=sin(nπx) example, why does the ratio ∥Dfn∥2/∥fn∥2 grow without bound as n→∞, showing the differentiation operator is unbounded?