The Riesz Representation Theorem

⚡ Key Takeaways

The Riesz Representation Theorem identifies the dual of a Hilbert space with the space itself: every continuous linear functional ff on a Hilbert space HH is given by inner product with a unique vector yf∈Hy_f \in H, i.e. f(x)=⟨x,yf⟩f(x) = \langle x, y_f \rangle. Applies to all (real or complex) Hilbert spaces; foundational in functional analysis, PDE, quantum mechanics, and probability. Proved by Frigyes Riesz and Maurice Fréchet (1907); a separate measure-theoretic "Riesz representation theorem" for C(X)∗C(X)^* is due to Riesz (1909) and refined by Markov–Kakutani–Banach.

💡 The Core Insight

A Hilbert space possesses orthogonal projection: for any closed subspace MM, every vector splits uniquely as x=Px+(x−Px)x = Px + (x - Px) with Px∈MPx \in M and x−Px⊥Mx-Px \perp M. Given a nonzero continuous functional ff, its kernel is a closed hyperplane. The one-dimensional orthogonal complement of the kernel singles out a direction; rescaling a unit vector in that direction by f‾\overline{f} of itself produces the representing vector. Geometry (perpendicularity) thus encodes the entirely algebraic notion of a linear functional.

Formal Statement

DefinitionContinuous Dual and Inner Product Conventions

Let HH be a Hilbert space over K∈{R,C}\mathbb{K}\in\{\mathbb{R},\mathbb{C}\} with inner product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle, linear in the first argument and conjugate-linear in the second (the physics convention is opposite; see the warning). The continuous (topological) dual H∗H^* is the space of bounded linear functionals f:H→Kf:H\to\mathbb{K} with operator norm

1
∥f∥  =  sup⁡∥x∥≤1 ∣f(x)∣.\quad \|f\| \;=\; \sup_{\|x\|\le 1}\,|f(x)|.

Derivation hint: ∥f∥\|f\| is the smallest constant CC with ∣f(x)∣≤C∥x∥|f(x)|\le C\|x\| for all xx; boundedness is equivalent to continuity for linear maps. The norm on HH is induced by the inner product:

2
∥x∥  =  ⟨x,x⟩1/2.\quad \|x\| \;=\; \langle x, x\rangle^{1/2}.

Derivation hint: positive-definiteness of ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle guarantees ⟨x,x⟩≥0\langle x,x\rangle \ge 0 with equality iff x=0x=0; the square root defines a genuine norm via Cauchy–Schwarz and the parallelogram law.

TheoremRiesz–Fréchet Representation Theorem

Let HH be a Hilbert space. For every f∈H∗f \in H^* there exists a unique yf∈Hy_f \in H such that

3
f(x)  =  ⟨x,yf⟩for all x∈H,\quad f(x) \;=\; \langle x, y_f\rangle \qquad \text{for all } x \in H,

and moreover

4
∥f∥H∗  =  ∥yf∥H.\quad \|f\|_{H^*} \;=\; \|y_f\|_{H}.

The map Φ:H∗→H\Phi: H^* \to H, Φ(f)=yf\Phi(f) = y_f, is a conjugate-linear, isometric bijection. In the real case Φ\Phi is linear, and H≅H∗H \cong H^* as Banach spaces; in the complex case H∗H^* is conjugate-linearly isometric to HH. Derivation hint for [3]–[4]: existence via orthogonal projection onto (ker⁡f)⊥(\ker f)^\perp; uniqueness because ⟨x,y⟩=⟨x,y′⟩ ∀x\langle x, y\rangle=\langle x, y'\rangle\ \forall x forces y−y′⊥Hy-y'\perp H; the norm identity follows from Cauchy–Schwarz with equality attained at x=yfx=y_f.

Why It Holds / Derivation

ProofExistence, Uniqueness, and Isometry

Let f∈H∗f \in H^*.

Step 1 — Trivial case. If f=0f = 0, take yf=0y_f = 0; then f(x)=⟨x,0⟩=0f(x) = \langle x, 0\rangle = 0. Assume henceforth f≠0f \neq 0.

Step 2 — The kernel is a proper closed subspace. Since ff is continuous, M:=ker⁡f=f−1({0})M := \ker f = f^{-1}(\{0\}) is closed; since f≠0f\neq 0, M≠HM \neq H. By the projection theorem (valid because HH is complete), H=M⊕M⊥H = M \oplus M^\perp with M⊥≠{0}M^\perp \neq \{0\}.

Step 3 — The complement is one-dimensional. Pick z∈M⊥z \in M^\perp with z≠0z \neq 0; rescale so f(z)=1f(z) = 1 is unnecessary, but note for any x∈Hx \in H,

5
u  :=  f(x) z−f(z) x  ∈  M,since f(u)=f(x)f(z)−f(z)f(x)=0.\quad u \;:=\; f(x)\,z - f(z)\,x \;\in\; M, \qquad\text{since } f(u) = f(x)f(z) - f(z)f(x) = 0.

Derivation hint: linearity of ff collapses the combination to zero; this is the standard trick exhibiting any xx modulo the kernel as a multiple of zz.

Step 4 — Project onto the kernel. Because u∈Mu \in M and z∈M⊥z \in M^\perp, we have ⟨u,z⟩=0\langle u, z\rangle = 0. Expanding:

6
0  =  ⟨f(x)z−f(z)x,  z⟩  =  f(x) ∥z∥2−f(z) ⟨x,z⟩.\quad 0 \;=\; \langle f(x)z - f(z)x,\; z\rangle \;=\; f(x)\,\|z\|^2 - f(z)\,\langle x, z\rangle.

Derivation hint: use linearity of the inner product in the first slot and ⟨z,z⟩=∥z∥2\langle z,z\rangle = \|z\|^2.

Step 5 — Solve for f(x)f(x). Rearranging [6],

7
f(x)  =  f(z)∥z∥2 ⟨x,z⟩  =  ⟨x,  f(z)‾∥z∥2 z⟩.\quad f(x) \;=\; \frac{f(z)}{\|z\|^2}\,\langle x, z\rangle \;=\; \Big\langle x,\; \frac{\overline{f(z)}}{\|z\|^2}\,z \Big\rangle.

Derivation hint: divide by ∥z∥2≠0\|z\|^2\neq0; the scalar f(z)/∥z∥2f(z)/\|z\|^2 moves into the conjugate-linear second argument as its complex conjugate. Define

8
yf  :=  f(z)‾∥z∥2 z.\quad y_f \;:=\; \frac{\overline{f(z)}}{\|z\|^2}\,z.

Derivation hint: this is the unique representing vector read off from [7]; it lies in M⊥M^\perp, the direction orthogonal to the kernel. Then f(x)=⟨x,yf⟩f(x) = \langle x, y_f\rangle for all xx, proving existence.

Step 6 — Uniqueness. If ⟨x,yf⟩=⟨x,y′⟩\langle x, y_f\rangle = \langle x, y'\rangle for all xx, then ⟨x,yf−y′⟩=0\langle x, y_f - y'\rangle = 0 for all xx; choosing x=yf−y′x = y_f - y' gives ∥yf−y′∥2=0\|y_f - y'\|^2 = 0, hence yf=y′y_f = y'.

Step 7 — Isometry [4]. By Cauchy–Schwarz, ∣f(x)∣=∣⟨x,yf⟩∣≤∥x∥ ∥yf∥|f(x)| = |\langle x, y_f\rangle| \le \|x\|\,\|y_f\|, so ∥f∥≤∥yf∥\|f\| \le \|y_f\|. Conversely, taking x=yfx = y_f (assuming yf≠0y_f\neq0),

9
∥f∥  ≥  ∣f(yf)∣∥yf∥  =  ⟨yf,yf⟩∥yf∥  =  ∥yf∥.\quad \|f\| \;\ge\; \frac{|f(y_f)|}{\|y_f\|} \;=\; \frac{\langle y_f, y_f\rangle}{\|y_f\|} \;=\; \|y_f\|.

Derivation hint: the supremum defining ∥f∥\|f\| is attained (or approached) precisely along the representing direction, forcing equality. Hence ∥f∥=∥yf∥\|f\| = \|y_f\|.

Step 8 — Conjugate-linearity of Φ\Phi. For f,g∈H∗f,g\in H^* and scalar α\alpha, Φ(αf+g)\Phi(\alpha f + g) satisfies ⟨x,Φ(αf+g)⟩=αf(x)+g(x)=⟨x,α‾ yf+yg⟩\langle x, \Phi(\alpha f+g)\rangle = \alpha f(x) + g(x) = \langle x, \overline{\alpha}\,y_f + y_g\rangle wait — carefully: αf(x)=α⟨x,yf⟩=⟨x,α‾yf⟩\alpha f(x) = \alpha\langle x,y_f\rangle = \langle x, \overline\alpha y_f\rangle. Thus Φ(αf+g)=α‾ yf+yg\Phi(\alpha f + g) = \overline\alpha\, y_f + y_g, i.e. Φ\Phi is conjugate-linear. Surjectivity is immediate since every y∈Hy\in H defines fy(x)=⟨x,y⟩∈H∗f_y(x)=\langle x,y\rangle\in H^*. ■\blacksquare

∎
⚠️ Completeness is essential

Step 2 invokes the projection theorem, which requires HH to be complete. On a non-complete inner product space the theorem fails: there exist bounded functionals with no representing vector. Completeness is not merely a convenience — it is logically necessary.

mathematician · Frigyes Riesz | 1880–1956

Hungarian mathematician, a founder of functional analysis. In 1907 Riesz and, independently, Maurice Fréchet established the representation of continuous linear functionals on L2L^2 via inner products — the prototype of the modern theorem. Riesz also proved the C(X)∗C(X)^* representation by measures (1909), introduced the spaces now bearing the names LpL^p, and developed the theory of compact (completely continuous) operators. His textbook with Béla Szőkefalvi-Nagy, Leçons d'analyse fonctionnelle (1952), shaped generations. The breadth of his contributions means "the Riesz theorem" can refer to several distinct results; context disambiguates.

Building Intuition

🧠 Intuition

Think of a linear functional as a "measuring device" that assigns a number to each vector. In finite dimensions every such device is dotting against some fixed vector — its gradient. Riesz says this picture survives intact in infinite dimensions provided the space is complete: the functional still has a gradient, a single arrow yfy_f, and the functional reads off the (signed) length of the projection of xx onto that arrow, scaled by ∥yf∥\|y_f\|. The kernel of ff is the hyperplane perpendicular to yfy_f; the further xx sticks out beyond that hyperplane, the larger f(x)f(x). The norm identity ∥f∥=∥yf∥\|f\| = \|y_f\| says: a steeper functional corresponds to a longer gradient arrow.

Figure
Geometry of Riesz representation: the functional as projection onto its gradient direction yfy_f
ker f (M = y_f^⊥) y_f x proj_{y_f} x 0 f(x) = ⟨x, y_f⟩ = (signed length of proj) · ‖y_f‖

Worked Examples

ExampleSequence space ℓ2\ell^2

Given. Define f:ℓ2(C)→Cf:\ell^2(\mathbb{C})\to\mathbb{C} by f(x)=∑n=1∞xnnf(x) = \sum_{n=1}^\infty \dfrac{x_n}{n} for x=(xn)x=(x_n).

Step 1 — Boundedness. By Cauchy–Schwarz, ∣f(x)∣≤(∑∣xn∣2)1/2(∑1/n2)1/2|f(x)| \le \big(\sum |x_n|^2\big)^{1/2}\big(\sum 1/n^2\big)^{1/2}, and ∑1/n2=π2/6\sum 1/n^2 = \pi^2/6. So ff is bounded with ∥f∥≤π/6\|f\| \le \pi/\sqrt6.

Step 2 — Identify yfy_f. Write f(x)=⟨x,yf⟩=∑xn(yf)n‾f(x) = \langle x, y_f\rangle = \sum x_n \overline{(y_f)_n}. Matching coefficients, (yf)n‾=1/n\overline{(y_f)_n} = 1/n, i.e. (yf)n=1/n(y_f)_n = 1/n (real). Then yf=(1,12,13,… )∈ℓ2y_f = (1, \tfrac12, \tfrac13, \dots) \in \ell^2 since ∑1/n2<∞\sum 1/n^2 < \infty.

Step 3 — Norm. ∥yf∥=(∑1/n2)1/2=π/6\|y_f\| = \big(\sum 1/n^2\big)^{1/2} = \pi/\sqrt6, and by [4], ∥f∥=∥yf∥\|f\| = \|y_f\| (the Cauchy–Schwarz bound is achieved).

 yf=(1n)n≥1,∥f∥=∥yf∥=π6≈1.2825 \boxed{\,y_f = \left(\tfrac1n\right)_{n\ge1},\qquad \|f\| = \|y_f\| = \dfrac{\pi}{\sqrt{6}} \approx 1.2825\,}

:::example[Function space L2[0,1]L^2[0,1] — point-evaluation surrogate] Given. On H=L2[0,1]H = L^2[0,1], consider f(g)=∫01g(t) t2 dtf(g) = \int_0^1 g(t)\,t^2\,dt.

Step 1 — Boundedness. ∣f(g)∣≤∥g∥2 ∥t2∥2|f(g)| \le \|g\|_{2}\,\|t^2\|_2 by Cauchy–Schwarz.

Step 2 — Representing function. f(g)=⟨g,yf⟩=∫01g(t)yf(t)‾ dtf(g) = \langle g, y_f\rangle = \int_0^1 g(t)\overline{y_f(t)}\,dt. Hence yf(t)‾=t2\overline{y_f(t)} = t^2, so yf(t)=t2y_f(t) = t^2 (real-valued).

Step 3 — Norm. ∥yf∥22=∫01t4 dt=15\|y_f\|_2^2 = \int_0^1 t^4\,dt = \tfrac{1}{5}, so ∥f∥=∥yf∥2=1/5\|f\| = \|y_f\|_2 = 1/\sqrt5.

 yf(t)=t2,∥f∥=15≈0.4472 \boxed{\,y_f(t) = t^2,\qquad \|f\| = \dfrac{1}{\sqrt5} \approx 0.4472\,}

Caveat. True point-evaluation g↦g(t0)g\mapsto g(t_0) is not bounded on L2L^2, so it has no Riesz representative there — but it does in a reproducing kernel Hilbert space, where yfy_f is the kernel section K(⋅,t0)K(\cdot,t_0).

Common Misconceptions

⚠️ Linear vs. conjugate-linear; convention clash

With the inner product linear in the first slot, Φ:H∗→H\Phi:H^*\to H is conjugate-linear. Physicists use ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle linear in the second slot (Dirac), which swaps where the conjugation lands; then the bra ⟨ψ∣\langle\psi| is the Riesz functional of the ket ∣ψ⟩|\psi\rangle, and the map ket ↦\mapsto bra is antilinear. Both communities are consistent internally — always state your convention. A second pitfall: ∥f∥=∥yf∥\|f\| = \|y_f\| is an isometry, but Φ\Phi is not an isometric linear isomorphism over C\mathbb{C} (it reverses scalar multiplication by conjugation).

CounterexampleFailure on an incomplete inner product space

Let H0H_0 be the inner product space of finitely-supported sequences (a dense, non-complete subspace of ℓ2\ell^2), with the ℓ2\ell^2 inner product. Define f(x)=∑nxn/nf(x) = \sum_n x_n/n, bounded with ∥f∥=π/6\|f\| = \pi/\sqrt6. Its only candidate representative is yf=(1/n)ny_f = (1/n)_n, which is not finitely supported, hence yf∉H0y_f \notin H_0. So ff is a bounded functional on H0H_0 with no representing vector in H0H_0. Completeness is genuinely required; Riesz can fail on pre-Hilbert spaces.

Connections

connection · Where Riesz sits in functional analysis

The theorem is the linchpin connecting several pillars. It yields adjoint operators: given bounded T:H→HT:H\to H, the functional x↦⟨Tx,y⟩x\mapsto \langle Tx, y\rangle is represented by T∗yT^*y, defining T∗T^* — the gateway to the Spectral Theorem for self-adjoint and normal operators. It powers the Lax–Milgram theorem and hence existence/uniqueness of weak solutions to elliptic Partial Differential Equations. Within Banach Space Duality it shows Hilbert spaces are reflexive and self-dual, a sharp contrast with L1L^1, C(X)C(X), etc. It also undergirds Reproducing Kernel Hilbert Spaces, where bounded point evaluation forces a kernel function, and connects to the Radon–Nikodym Theorem (Riesz functional ⟷ density), which von Neumann used to prove Radon–Nikodym via Riesz.

Real-World Applications

🔬 Named uses across science

Historical Development

⏳ History
- 1902–1906 — Lebesgue's integration theory creates the function spaces (L2L^2) on which the theorem will live.
- 1907 — Frigyes Riesz and, independently, Maurice Fréchet publish the representation of continuous linear functionals on L2L^2 as integrals against an L2L^2 function — the original Riesz–Fréchet theorem.
- 1909 — Riesz proves the measure-theoretic representation: positive linear functionals on C[0,1]C[0,1] are integrals against (Stieltjes) measures.
- 1910–1913 — Riesz develops LpL^p spaces and the duality Lp∗≅LqL^p{}^* \cong L^{q}; the p=2p=2 case is the inner-product theorem.
- 1927 — John von Neumann axiomatizes Hilbert space; the abstract projection theorem makes the modern, geometry-based proof possible and universal.
- 1932 — Stefan Banach's Théorie des opérations linéaires systematizes dual spaces, placing Riesz within general duality theory.
- 1940s–50s — Kakutani, Markov, Banach generalize the C(X)∗C(X)^* theorem to locally compact Hausdorff XX with Radon measures (the modern "Riesz–Markov–Kakutani" theorem).
- 1950 — Lax & Milgram extend the representation to bounded coercive sesquilinear forms, enabling the variational theory of PDE.
- 1955 — Riesz–Szőkefalvi-Nagy textbook canonizes the proof and terminology used today.

Subtleties & Limits

open-problem · Boundaries of the principle

The Hilbert-space theorem is complete and not open, but its boundaries are subtle and active. (i) Non-Hilbert duality is irregular: L1(μ)∗=L∞(μ)L^1(\mu)^* = L^\infty(\mu) only under σ\sigma-finiteness; C(X)∗C(X)^* requires the full Radon-measure machinery; spaces like L∞L^\infty and ℓ∞\ell^\infty are not even reflexive, and their precise duals invoke finitely-additive measures and Stone–Čech compactifications — describing these "exotic" functionals concretely is genuinely hard. (ii) Riesz on non-self-adjoint / indefinite forms. Krein-space and Pontryagin-space analogues replace positive-definiteness with an indefinite metric; the representing element exists but the clean isometry [4] degrades, and open questions persist about operator representations on indefinite inner-product spaces. (iii) Quantitative/effective versions. In computable and constructive analysis, the non-constructive projection step means the representative yfy_f may not be effectively computable from ff without additional modulus-of-continuity data — characterizing exactly when it is computable remains a research theme. (iv) Operator-valued and rigged-Hilbert-space extensions (Gelfand triples) handle unbounded functionals like point evaluation and the Dirac delta, but the precise distributional duality is delicate.

See Also

Hilbert Spaces · Orthogonal Projection Theorem · Lax–Milgram Theorem · Spectral Theorem · Reproducing Kernel Hilbert Spaces · Radon–Nikodym Theorem · Riesz–Markov–Kakutani Theorem · Banach Space Duality · Adjoint Operators