Chapter 5 built the dual space of all linear
functionals on ,
proved that in finite dimension, and then delivered
a warning: the resulting isomorphism is not
canonical. Every basis of gives one, different
bases give different ones, and no argument singles out a
preferred choice (Corollary 5.1.4, and the
contrast with the natural map
of Theorem 5.4.6). The
chapter closed by promising that an inner product would
supply the missing ingredient. This section keeps the
promise.
The mechanism is simple to state. Fix and let . Because the inner product is
linear in the first slot, is a linear
functional. The Riesz Representation Theorem says that
in finite dimension there are no others.
Throughout, is
a finite-dimensional inner product space over or , unless the text
says otherwise.
Every
functional is an inner product
In , Theorem 5.1.1 already told
us that every functional has the form for a unique row of coefficients. With
the standard inner product , that reads with . So in coordinates the theorem is a
restatement of a fact we already have; the content is
that it survives the removal of coordinates.
Theorem
11.5.1 (Riesz Representation Theorem)
Let be a
finite-dimensional inner product space over and let . Then
there is a unique such that If is any orthonormal basis of , then .
Idea. Fix an orthonormal basis.
Then a linear functional is determined by the numbers , and a
vector is determined by its coordinates, which Theorem 11.2.1
reads off as inner products. Matching the two lists
tells us what
must be, and the only care needed is the conjugate:
sits in the
second slot, so its coordinates come out conjugated.
Uniqueness is the standard move — if two vectors pair
identically with everything, subtract and pair the
difference with itself.
Proof. Existence. Let
be an orthonormal basis of , which exists by Theorem 11.2.2, and
put For each , conjugate-linearity in
the second slot and give So the two linear functionals
and agree
on a basis, hence are equal by Theorem 2.1.5. (The
first is linear because the inner product is linear in
the first slot.)
Uniqueness. Suppose for every . Then for every , by additivity in the
second slot. Taking gives , so by positive definiteness.
Call the
Riesz vector of . The formula is
worth reading twice: the coordinates of in an orthonormal
basis are the conjugates of the values of on that basis.
Over the
conjugation is invisible, which is why real textbooks
can omit it and complex ones cannot.
Example
(Two Riesz vectors)
- (a) On with
, find the Riesz vector of .
- (b) On with the
Frobenius inner product , find the Riesz vector of .
Solution.
- (a) We look for
with
for all . By
linearity it is enough to impose this on the basis : The second equation gives ;
substituting into the first gives , so and . Hence .
Check. and , as required; and for a general the pairing
gives . Note how little resembles “evaluation
at ”: the Riesz
vector is manufactured by the inner product, not by the
point .
- (b) We look for
with for
every . Taking
works,
since and . By
uniqueness, is the answer. (This example was not
solved by the basis formula, but by guessing and then
invoking uniqueness — a legitimate and often faster
route.)
The Riesz
map, and the data Chapter 5 was missing
Uniqueness in Theorem 11.5.1 lets
us read the theorem as a statement about a map.
Corollary
11.5.2 (The Riesz map)
Let be a
finite-dimensional inner product space over . Define Then
is a bijection, and for all and
, In particular is an isomorphism of
vector spaces when , and is conjugate-linear
when .
Proof. Each lies in because the inner
product is linear in the first slot. Surjectivity is the
existence half of Theorem 11.5.1 and
injectivity is the uniqueness half (if ,
then ).
For the two rules, evaluate at an arbitrary : additivity in the
second slot gives , and
conjugate-homogeneity in the second slot gives . Over we have , so is linear, and a
linear bijection is an isomorphism (Theorem 0.4.7).
This is the payoff Chapter 5 promised. There, was proved
by choosing a basis and sending ,
and the warning was that the isomorphism changes when
does: a vector
does not come with “its” functional. Here is written down with
no basis at all. It is not free of choices — it depends
on —
but the choice has been made once, in advance, and it is
a choice of geometry rather than of
coordinates. The inner product is exactly the
extra data that turns from a counting fact into a
formula.
The two descriptions fit together neatly. Let
be an orthonormal basis of , with dual basis (Theorem 5.1.3). Then is the
functional , which sends to ; that is,
over either field. Over , where is linear, this says
that
is Chapter 5’s basis-dependent
isomorphism , for the inner product that declares
orthonormal.
Choosing a basis and choosing an inner product are two
ways of supplying the same missing data.
Quick check. Let
be an orthonormal basis of a complex
inner product space and let be its dual basis. What is the Riesz
vector of ?
Solution. By the identity
above, which holds over as well, has Riesz
vector . For
, use
conjugate-homogeneity in reverse: . So the
Riesz vector of is , not . Alternatively,
apply the formula of Theorem 11.5.1: the
coordinates of the Riesz vector are .
Warning. Over , the Riesz map is not
linear, so it is not an isomorphism of complex vector
spaces. It is a bijection, and it is linear
over , but .
Complex spaces
and are still
isomorphic — they have the same dimension — but the
isomorphism produced by an inner product is the
conjugate-linear . Most of what we do
with (Section
6 builds the adjoint from it) is unaffected, because the
conjugation cancels when is used twice.
Warning. The Riesz vector
depends on the inner product, not on alone.
On let .
With the dot product, , so . With the weighted inner product , we need and , so . Same functional, different
representing vector. Whenever two inner products are in
play, the notation must say which is meant.
Annihilators become orthogonal complements
Section 3 warned that the annihilator and
the orthogonal complement are
different objects that happen to have the same
dimension. The Riesz map explains the coincidence: it
carries one onto the other.
Theorem
11.5.3 (Perp corresponds to the
annihilator)
Let be a
finite-dimensional inner product space over , let be a subspace and let
be the Riesz
map. Then Equivalently, a functional
annihilates if
and only if its Riesz vector lies in .
Proof. Let . Then the first equivalence being the definition of
the annihilator (Definition 5.2.1) applied
to the functional , and the second the
definition of the orthogonal complement (Definition 11.3.1).
Since is a
bijection (Corollary 11.5.2),
the set is
therefore exactly .
The dimension count now has a reason rather than a
coincidence: (Theorem 5.2.2) and (Theorem 11.3.2 (c))
agree because the two spaces correspond under a
bijection. (Over the bijection is only
conjugate-linear, but a conjugate-linear bijection still
carries subspaces to subspaces of the same dimension,
since .)
Here is the correspondence in . Let with
the dot product. Then , and consists of the
functionals with ,
spanned by and . These are precisely
and .
Section 6 uses Theorem 11.5.3 in
the same way for maps: the dual map of Chapter 5 and the adjoint are
the same map, read through the two Riesz maps.
What
happens in infinite dimension
The proof used an orthonormal basis of the whole of
, so finite
dimension was essential, and the theorem genuinely fails
without it.
Solution. Suppose
satisfied for every . Taking gives So every coefficient of equals . But a polynomial has
only finitely many non-zero coefficients, so no such
exists.
What fails is not “infinite dimension” as a slogan.
Two things are missing at once, and the same example
shows both. First, has gaps: Exercise (C2: A subspace with no orthogonal complement)
exhibits polynomials with , so the vectors crowd around the
polynomial
without any limit being forced to lie in . Second,
is wildly
discontinuous with respect to : along the
same sequence, for every , while .
Repairing both defects — completing the space, and
restricting attention to functionals with — restores the theorem. That
statement is the Riesz representation theorem for
Hilbert spaces, and it belongs to analysis, not to
linear algebra; we record its existence and go no
further. What survives here with no hypotheses at all is
the easy direction: for every , the map
is a linear functional. Only the converse needs
finite dimension.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) State the Riesz
Representation Theorem, including every hypothesis.
- (b) Write down the
formula for the Riesz vector of in terms of an
orthonormal basis, and say where the conjugate comes
from.
- (c) True or false:
over , the Riesz
map is a linear isomorphism. Justify your
answer.
- (d) In what sense
does an inner product answer the question Chapter 5 left
open about ?
- (e) Under , which subspace of
corresponds
to ?
- (f) Give an example
showing that the theorem fails in infinite
dimension.
Solution.
(a) If is a
finite-dimensional inner product space
over or and , then
there is a unique with for all (Theorem 11.5.1).
(b) for any orthonormal
basis . The conjugate appears because occupies the second
slot, where scalars come out conjugated: to make equal
, the
coefficient of
in must be .
(c) False. is a bijection, but
, so it is conjugate-linear and
not -linear (Corollary 11.5.2).
It is linear over , and over it is an
isomorphism.
(d) Chapter 5
showed by counting dimensions, with an
isomorphism depending on a chosen basis and no preferred
choice available (Corollary 5.1.4). An inner
product supplies a specific map , written without reference to
any basis. The inner product is the extra data; picking
an orthonormal basis and picking an inner product that
makes a given basis orthonormal are the same
act.
(e) , the annihilator of
(Theorem 11.5.3).
(f) On with the
coefficient inner product, has no
Riesz vector: such a vector would need every coefficient
equal to (Example (A functional with no Riesz vector)).
B. Practice
Exercise
(B1: Riesz vectors for evaluation)
On use the node inner product . Find the Riesz vectors of
and of .
Solution. Since are three
distinct nodes and , a polynomial of is determined by its
values there (Theorem 3.7.3).
Writing for a
candidate Riesz vector of , the requirement
reads Taking for the three Lagrange
polynomials at the nodes, which have value at one node and at the others (Definition 6.6.1), the
three equations become , , . The unique quadratic with those values is
.
For the
same argument gives , , , whose interpolant is .
Check. For we get , , . Pairing with
, whose
values are ,
gives ;
pairing with , whose
values are ,
gives .
Exercise
(B2: Riesz vectors on matrices)
On with
the Frobenius inner product , find the Riesz vector of:
- (a)
(assume );
- (b) , for a fixed .
Solution.
(a) Let be the matrix
unit with a in
position and
zeros elsewhere. Then ,
and , which is unless , where it equals
. Hence , and by uniqueness in Theorem 11.5.1 the
Riesz vector is .
(b) We need with
for all . Taking
, that
is ,
works. By uniqueness it is the only answer. Part (a) is
the case , and the example in the text is the
case .
Exercise
(B3: The correspondence in )
In with
the dot product, let .
Find a basis of and a basis of
, and verify
that carries
the first to the second.
Solution. A vector lies in
exactly
when and
(Proposition 11.3.1,
testing against the two spanning vectors). So of dimension .
A functional lies in exactly when it
kills both spanning vectors, that is, when and
.
So with Over ,
, so and . Since is linear over and bijective, it
carries the span of the two vectors onto the span of the
two functionals, confirming Theorem 11.5.3.
C. Going deeper
Exercise
(C1: Riesz without an orthonormal basis)
Let be a
finite-dimensional inner product space and let be
non-zero. Write .
- (a) Prove that .
- (b) Let span with . Prove that
satisfies for all .
- (c) Deduce Theorem 11.5.1,
including the case .
Hint for (b): split using .
Solution.
(a) Since , its image
is a non-zero subspace of the -dimensional space , so and . By Theorem 2.3.1, , and
by Theorem 11.3.2 (c),
.
(b) By Theorem 11.3.2 (a),
, so each is with and . Then . On the other side,
using conjugate-homogeneity in the second slot
(which conjugates back
to ),
then because and , and . The two sides agree.
(c) If , then represents it. If
,
part (a) supplies a unit vector spanning the line
— any
non-zero vector of that line divided by its norm — and
part (b) supplies . Uniqueness is
unchanged: if for all , take to get
. Note that this proof never mentions a basis
of ; it uses only
the orthogonal decomposition along the hyperplane .
Exercise
(C2: Evaluation at is not
represented)
Let
with , and let .
Suppose, for a contradiction, that
satisfied for every .
- (a) Show that for every integer
, and that
the same sum equals for .
- (b) Let , the product running over
. Show that for every
integer ,
and deduce that
is the zero polynomial.
- (c) Deduce that
every , and
hence a contradiction.
Solution.
(a) Take . Then for and for , while
(b) For an
integer ,
multiply the identity of (a) by , a non-zero number. Each term becomes
, so the result is exactly . Thus the
polynomial , of
degree at most ,
has the infinitely many distinct roots . A
non-zero polynomial of degree has at most distinct roots (Corollary 6.1.4), so
.
(c) Evaluate
at for a
fixed . Every product with contains the factor and so
vanishes; the term contributes , and that product is non-zero because the
factors are
non-zero integers. Since , we get . This holds for every , so . But then the case
of (a) reads
, a
contradiction. Hence no Riesz vector exists.
The moral matches Example (A functional with no Riesz vector):
point evaluation is a perfectly good linear functional,
but on an infinite-dimensional space it is not
represented by any vector, whichever of these two inner
products we use.