If you have worked in finite-dimensional Euclidean space, you have used a fact so often that it becomes invisible: every linear functional $f(x)=a\cdot x$ is given by an inner product with a unique vector $a$. Hilbert spaces preserve exactly this phenomenon, but only because the inner product supplies enough geometry to identify vectors with continuous linear functionals.
The Riesz representation theorem is the mechanism. It turns the continuous dual $H^\ast$ into a copy of $H$, clarifies what “gradient” means in infinite dimensions, and makes adjoints, weak formulations, and energy methods feel inevitable rather than ad hoc.
Premium Audio PickWireless ANC Over-Ear HeadphonesBeats Studio Pro Premium Wireless Over-Ear Headphones
Beats Studio Pro Premium Wireless Over-Ear Headphones
A broad consumer-audio pick for music, travel, work, mobile-device, and entertainment pages where a premium wireless headphone recommendation fits naturally.
- Wireless over-ear design
- Active Noise Cancelling and Transparency mode
- USB-C lossless audio support
- Up to 40-hour battery life
- Apple and Android compatibility
Why it stands out
- Broad consumer appeal beyond gaming
- Easy fit for music, travel, and tech pages
- Strong feature hook with ANC and USB-C audio
Things to know
- Premium-price category
- Sound preferences are personal
This article proves Riesz representation, keeps careful track of the complex case, and then shows how the theorem becomes an everyday tool across analysis.
What is being represented
Let $H$ be a Hilbert space over $\mathbb{R}$ or $\mathbb{C}$. A bounded linear functional is a linear map $\ell:H\to \mathbb{F}$ ($\mathbb{F}=\mathbb{R}$ or $\mathbb{C}$) such that
Boundedness is equivalent to continuity. The set of all bounded linear functionals is the continuous dual $H^\ast$.
The inner product produces a large family of functionals: for any $y\in H$,
Cauchy–Schwarz gives $|\ell_y(x)|\le \|x\|\,\|y\|$, so $\ell_y\in H^\ast$. The theorem says there are no others.
Riesz Representation Theorem
Riesz Representation Theorem (Hilbert spaces).
For every $\ell\in H^\ast$, there exists a unique vector $y\in H$ such that
Moreover, $\|\ell\|=\|y\|$, where $\|\ell\|=\sup_{\|x\|=1}|\ell(x)|$.
In a complex Hilbert space, the standard convention is that the inner product is linear in the first argument and conjugate-linear in the second (some texts swap). With the convention above, the representation is exactly $\ell(x)=\langle x,y\rangle$. If your convention is the reverse, the representing vector appears in the first slot instead; the substance is the same.
Proof via orthogonal projection onto the kernel
The proof is a perfect demonstration of how the projection theorem drives deeper results.
If $\ell=0$, take $y=0$. Assume $\ell\ne 0$.
Let
Because $\ell$ is continuous, $M$ is a closed subspace of $H$.
Choose any $x_0\in H$ with $\ell(x_0)\ne 0$. Consider the orthogonal decomposition with respect \to $M$:
The component $z$ is the orthogonal projection residual: $z = x_0 – P_M x_0$. Since $x_0\notin M$, we have $z\ne 0$.
Now observe:
- $\ell(m)=0$ because $m\in M$.
- $\ell(x_0)=\ell(m+z)=\ell(z)$, so $\ell(z)\ne 0$.
- For any $x\in H$, the vector
lies in $M$ because applying $\ell$ gives $\ell(x)-\ell(x)=0$.
Because this vector lies in $M$, it is orthogonal \to $z$ (since $z\in M^\perp$):
Rearrange:
Solve for $\ell(x)$:
Define
in the complex case (and $y=\frac{\ell(z)}{\|z\|^2}z$ in the real case), so that the conjugation matches the chosen linearity convention of the inner product. Then for all $x$,
Uniqueness: if $\langle x,y\rangle=\langle x,y'\rangle$ for all $x$, then $\langle x,y-y'\rangle=0$ for all $x$. Taking $x=y-y’$ gives $\|y-y'\|^2=0$, hence $y=y’$.
Norm identity: from $\ell(x)=\langle x,y\rangle$ and Cauchy–Schwarz,
On the other hand, take $x=y/\|y\|$ (if $y\ne 0$):
So $\|\ell\|=\|y\|$.
That completes the proof.
What the theorem really gives you
Riesz representation is more than a correspondence. It is an identification with geometry attached:
- $H^\ast$ is not merely isomorphic \to $H$; it is isometrically isomorphic.
- Hyperplanes (kernels of functionals) are orthogonal complements of lines: $\ker(\ell)=y^\perp$.
- Minimization with linear constraints becomes orthogonal projection.
These translate analysis questions into geometric ones, which are often easier to reason about.
Adjoints and the Riesz viewpoint
Given a bounded linear operator $A:H\to H$, the adjoint $A^\ast$ is defined by
Riesz representation provides existence and uniqueness of $A^\ast$. Fix $y$. The map $x\mapsto \langle Ax,y\rangle$ is a bounded linear functional in $x$, so there exists a unique vector $z$ such that
Define $A^\ast y=z$. This definition makes the adjoint a theorem, not a guess.
Consequences that are immediate from this construction:
- $\|A^\ast\|=\|A\|$.
- $(AB)^\ast = B^\ast A^\ast$.
- $A$ is self-adjoint iff $A=A^\ast$.
- Normal equations in least squares are $A^\ast(Ax-b)=0$, which are simply orthogonality of the residual to the range of $A$.
When you see $A^\ast$ appear in analysis, it is usually because someone is applying Riesz representation \to a functional and naming the representing vector.
Gradients and variational derivatives in Hilbert spaces
In finite dimensions, the gradient $\nabla F(x)$ is the unique vector satisfying
for all directions $h$. In a Hilbert space, the differential $DF(x)$ is a bounded linear functional of $h$ whenever it exists and is continuous. Riesz representation then guarantees there is a unique vector $\nabla F(x)\in H$ such that
This is the correct definition of the gradient in Hilbert spaces: it is the Riesz representative of the differential.
A crucial subtlety: in a general Banach space, there is no inner product, so you cannot identify the differential with a vector without extra structure. That is one reason Hilbert spaces dominate energy methods and many optimization frameworks.
Weak formulations: why test functions appear
Suppose you want to solve an equation in a Hilbert space:
where $A$ is an operator. A common tactic is to test against all $v\in H$ and require
This turns the problem into a family of scalar equations. Riesz representation explains why this is a good idea: for fixed $u$, the map $v\mapsto \langle Au,v\rangle$ is a functional in $v$. If you can show it is continuous, then it corresponds to an element of $H$. The equation $\langle Au,v\rangle=\langle f,v\rangle$ for all $v$ is then equivalent \to $Au=f$ as elements of $H$.
In PDE, the operator $A$ is often defined indirectly by a bilinear form:
For fixed $u$, $v\mapsto a(u,v)$ is a functional, and Riesz representation identifies it with an element of $H$, which is the abstract version of “moving derivatives onto test functions.”
Reproducing kernels as a Riesz phenomenon
A Hilbert space of functions $H\subset \mathbb{C}^X$ is called a reproducing kernel Hilbert space (RKHS) if evaluation at each point is continuous: for each $x\in X$, the map
is a bounded linear functional on $H$.
Riesz representation then guarantees: for each $x\in X$, there exists $k_x\in H$ such that
Define $K(x,y)=k_y(x)$. This $K$ is the reproducing kernel, and it is automatically positive definite. In other words, RKHS theory is built by applying Riesz representation to evaluation functionals.
This is a clean example of a general lesson: once you have a Hilbert space structure, every continuous measurement is an inner product against a unique representer.
A minimization principle: representers and orthogonality
Riesz representation interacts beautifully with the projection theorem. Consider minimizing a functional subject to linear constraints, for instance:
Each constraint functional $\ell_i$ has a Riesz representative $y_i$. The feasible set is an affine subspace. The minimizer is the orthogonal projection of $0$ onto that affine subspace, hence lies in the finite span of the $y_i$. This “representer” phenomenon is a cornerstone of many regularized estimation methods: the solution lives in the span of the measurement representers because orthogonality forces it.
Even when the ambient space is infinite-dimensional, the optimizer often has a finite-dimensional description because the constraints are finite and the geometry is orthogonal.
How to recognize when you should invoke Riesz
You are in Riesz territory whenever you see a continuous functional and you want a vector.
- A linear measurement $x\mapsto \ell(x)$ that is bounded: replace it with $x\mapsto \langle x,y\rangle$.
- An expression involving $\langle Ax,y\rangle$ where you want to move $A$ off $x$: introduce $A^\ast$.
- A differential $DF(x)[h]$ that is continuous in $h$: define the gradient as the Riesz representer.
- A function space where evaluation seems meaningful: check continuity of evaluation and, if it holds, a reproducing kernel appears automatically.
The theorem is short to state and quick to prove, but its consequences are long. It is the bridge that lets Hilbert-space geometry control analysis.
Leave a Reply