11.5  The Riesz Representation Theorem

Chapter 5 built the dual space V∗ of all linear functionals on V, proved that dim⁡V∗=dim⁡V in finite dimension, and then delivered a warning: the resulting isomorphism V≅V∗ is not canonical. Every basis of V 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 evV:V→V∗∗ 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 w∈V and let φw(v)=⟨v,w⟩. Because the inner product is linear in the first slot, φw is a linear functional. The Riesz Representation Theorem says that in finite dimension there are no others.

Throughout, V is a finite-dimensional inner product space over F=R or F=C, unless the text says otherwise.

11.5.1. Every functional is an inner product

In Fn, Theorem 5.1.1 already told us that every functional has the form x↦a1x1+⋯+anxn for a unique row of coefficients. With the standard inner product ⟨x,y⟩=∑ixiyi―, that reads φ(x)=⟨x,w⟩ with w=(a1―,…,an―). 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 V be a finite-dimensional inner product space over F and let φ∈V∗. Then there is a unique w∈V such that φ(v)=⟨v,w⟩for every v∈V. If (e1,…,en) is any orthonormal basis of V, then w=∑i=1nφ(ei)―ei.

Idea. Fix an orthonormal basis. Then a linear functional is determined by the n numbers φ(ei), and a vector is determined by its n coordinates, which Theorem 11.2.1 reads off as inner products. Matching the two lists tells us what w must be, and the only care needed is the conjugate: w 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 (e1,…,en) be an orthonormal basis of V, which exists by Theorem 11.2.2, and put w=∑i=1nφ(ei)―ei. For each j, conjugate-linearity in the second slot and ⟨ej,ei⟩=δij give ⟨ej,w⟩=∑i=1nφ(ei)――⟨ej,ei⟩=φ(ej). So the two linear functionals v↦⟨v,w⟩ 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 ⟨v,w⟩=⟨v,w′⟩ for every v. Then ⟨v,w−w′⟩=0 for every v, by additivity in the second slot. Taking v=w−w′ gives ‖w−w′‖2=0, so w=w′ by positive definiteness.

Call w the Riesz vector of φ. The formula is worth reading twice: the coordinates of w in an orthonormal basis are the conjugates of the values of φ on that basis. Over R the conjugation is invisible, which is why real textbooks can omit it and complex ones cannot.

Example (Two Riesz vectors)
  • (a) On V=R[x]≤1 with ⟨p,q⟩=∫01p(t)q(t)dt, find the Riesz vector of φ(p)=p(0).
  • (b) On V=Mn(C) with the Frobenius inner product ⟨A,B⟩=tr(B∗A), find the Riesz vector of φ(A)=trA.

Solution.

  • (a) We look for w=a+bx with ⟨p,w⟩=p(0) for all p. By linearity it is enough to impose this on the basis (1,x): ∫01(a+bt)dt=a+b2=1,∫01t(a+bt)dt=a2+b3=0. The second equation gives a=−23b; substituting into the first gives −23b+12b=−16b=1, so b=−6 and a=4. Hence w=4−6x.

    Check. ∫01(4−6t)dt=4−3=1 and ∫01t(4−6t)dt=2−2=0, as required; and for a general p=c+dx the pairing gives c⋅1+d⋅0=c=p(0). Note how little w resembles “evaluation at 0”: the Riesz vector is manufactured by the inner product, not by the point 0.

  • (b) We look for W with tr(W∗A)=trA for every A. Taking W=In works, since In∗=In and tr(InA)=trA. By uniqueness, W=In 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.)

11.5.2. 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 V be a finite-dimensional inner product space over F. Define Φ:V→V∗,Φ(w)=⟨⋅,w⟩. Then Φ is a bijection, and for all w,w′∈V and c∈F, Φ(w+w′)=Φ(w)+Φ(w′),Φ(cw)=c―Φ(w). In particular Φ is an isomorphism of vector spaces when F=R, and is conjugate-linear when F=C.

Proof. Each Φ(w) lies in V∗ 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 Φ(w)=Φ(w′), then w=w′). For the two rules, evaluate at an arbitrary v: additivity in the second slot gives ⟨v,w+w′⟩=⟨v,w⟩+⟨v,w′⟩, and conjugate-homogeneity in the second slot gives ⟨v,cw⟩=c―⟨v,w⟩. Over R we have c―=c, so Φ is linear, and a linear bijection is an isomorphism (Theorem 0.4.7).

This is the payoff Chapter 5 promised. There, V≅V∗ was proved by choosing a basis B and sending vi↦φi, and the warning was that the isomorphism changes when B 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 V≅V∗ from a counting fact into a formula.

The two descriptions fit together neatly. Let B=(v1,…,vn) be an orthonormal basis of V, with dual basis (φ1,…,φn) (Theorem 5.1.3). Then Φ(vi) is the functional v↦⟨v,vi⟩, which sends vj to δij; that is, Φ(vi)=φi(i=1,…,n), over either field. Over R, where Φ is linear, this says that Φ is Chapter 5’s basis-dependent isomorphism vi↦φi, for the inner product that declares B orthonormal. Choosing a basis and choosing an inner product are two ways of supplying the same missing data.

Quick check. Let B=(v1,…,vn) be an orthonormal basis of a complex inner product space and let (φ1,…,φn) be its dual basis. What is the Riesz vector of iφ1?

Solution. By the identity Φ(vi)=φi above, which holds over C as well, φ1 has Riesz vector v1. For iφ1, use conjugate-homogeneity in reverse: Φ(−iv1)=(−i)―Φ(v1)=iφ1. So the Riesz vector of iφ1 is −iv1, not iv1. Alternatively, apply the formula of Theorem 11.5.1: the coordinates of the Riesz vector are (iφ1)(vj)―=iδ1j―=−iδ1j.

Warning. Over C, 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 R, but Φ(iw)=−iΦ(w). Complex spaces V and V∗ 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 R2 let φ(x)=x1+x2. With the dot product, φ(x)=⟨x,(1,1)⟩, so w=(1,1). With the weighted inner product ⟨x,y⟩=2x1y1+x2y2, we need 2w1=1 and w2=1, so w=(12,1). Same functional, different representing vector. Whenever two inner products are in play, the notation must say which Φ is meant.

11.5.3. Annihilators become orthogonal complements

Section 3 warned that the annihilator U0⊆V∗ and the orthogonal complement U⊥⊆V 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 V be a finite-dimensional inner product space over F, let U be a subspace, and let Φ be the Riesz map. Then Φ(U⊥)=U0. Equivalently, a functional φ∈V∗ annihilates U if and only if its Riesz vector lies in U⊥.

Proof. Let w∈V. Then Φ(w)∈U0⟺⟨u,w⟩=0 for every u∈U⟺w∈U⊥, the first equivalence being the definition of the annihilator (Definition 5.2.1) applied to the functional Φ(w)=⟨⋅,w⟩, and the second the definition of the orthogonal complement (Definition 11.3.1). Since Φ is a bijection (Corollary 11.5.2), the set Φ(U⊥) is therefore exactly U0.

The dimension count now has a reason rather than a coincidence: dim⁡U0=dim⁡V−dim⁡U (Theorem 5.2.2) and dim⁡U⊥=dim⁡V−dim⁡U (Theorem 11.3.2 (c)) agree because the two spaces correspond under a bijection. (Over C the bijection is only conjugate-linear, but a conjugate-linear bijection still carries subspaces to subspaces of the same dimension, since cΦ(w)=Φ(c―w).)

Here is the correspondence in R3. Let U=span((1,2,0)) with the dot product. Then U⊥={(a,b,c):a+2b=0}=span((2,−1,0),(0,0,1)), and U0 consists of the functionals x↦αx1+βx2+γx3 with α+2β=0, spanned by 2x1−x2 and x3. These are precisely Φ((2,−1,0)) and Φ((0,0,1)).

Section 6 uses Theorem 11.5.3 in the same way for maps: the dual map T′:W∗→V∗ of Chapter 5 and the adjoint T∗:W→V are the same map, read through the two Riesz maps.

11.5.4. What happens in infinite dimension

The proof used an orthonormal basis of the whole of V, so finite dimension was essential, and the theorem genuinely fails without it.

Example (A functional with no Riesz vector)

Let V=R[x] with the coefficient inner product ⟨p,q⟩=∑k≥0akbk for p=∑kakxk and q=∑kbkxk (a finite sum, and an inner product by Exercise (C2: A subspace with no orthogonal complement) (a)). Show that φ(p)=p(1) has no Riesz vector.

Solution. Suppose w=∑kbkxk satisfied ⟨p,w⟩=p(1) for every p∈V. Taking p=xi gives bi=⟨xi,w⟩=φ(xi)=1i=1for every i≥0. So every coefficient of w equals 1. But a polynomial has only finitely many nonzero coefficients, so no such w exists.

What fails is not “infinite dimension” as a slogan. Two things are missing at once, and the same example shows both. First, V has gaps: Exercise (C2: A subspace with no orthogonal complement) exhibits polynomials pm∈kerφ with ‖pm−1‖=1/m, so the vectors pm crowd around the polynomial 1 without any limit being forced to lie in kerφ. Second, φ is wildly discontinuous with respect to ‖⋅‖: along the same sequence, φ(pm)=0 for every m, while φ(1)=1.

Repairing both defects — completing the space, and restricting attention to functionals φ with |φ(v)|≤C‖v‖ — 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 w∈V, the map ⟨⋅,w⟩ is a linear functional. Only the converse needs finite dimension.

11.5.5. 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 C, the Riesz map Φ:V→V∗ is a linear isomorphism. Justify your answer.
  • (d) In what sense does an inner product answer the question Chapter 5 left open about V≅V∗?
  • (e) Under Φ, which subspace of V∗ corresponds to U⊥?
  • (f) Give an example showing that the theorem fails in infinite dimension.

Solution.

  • (a) If V is a finite-dimensional inner product space over R or C and φ∈V∗, then there is a unique w∈V with φ(v)=⟨v,w⟩ for all v∈V (Theorem 11.5.1).

  • (b) w=∑iφ(ei)―ei for any orthonormal basis (e1,…,en). The conjugate appears because w occupies the second slot, where scalars come out conjugated: to make ⟨ej,w⟩ equal φ(ej), the coefficient of ej in w must be φ(ej)―.

  • (c) False. Φ is a bijection, but Φ(cw)=c―Φ(w), so it is conjugate-linear and not C-linear (Corollary 11.5.2). It is linear over R, and over R it is an isomorphism.

  • (d) Chapter 5 showed V≅V∗ 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 Φ(w)=⟨⋅,w⟩, 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) U0, the annihilator of U (Theorem 11.5.3).

  • (f) On R[x] with the coefficient inner product, φ(p)=p(1) has no Riesz vector: such a vector would need every coefficient equal to 1 (Example (A functional with no Riesz vector)).

B. Practice

Exercise (B1: Riesz vectors for evaluation)

On V=R[x]≤2 use the node inner product ⟨p,q⟩=p(−1)q(−1)+p(0)q(0)+p(1)q(1). Find the Riesz vectors of φ(p)=p(0) and of ψ(p)=p(1).

Solution. Since −1,0,1 are three distinct nodes and dim⁡V=3, a polynomial of V is determined by its values there (Theorem 3.7.3). Writing w for a candidate Riesz vector of φ, the requirement ⟨p,w⟩=p(0) reads p(−1)w(−1)+p(0)w(0)+p(1)w(1)=p(0)for all p∈V. Taking for p the three Lagrange polynomials at the nodes, which have value 1 at one node and 0 at the others (Definition 6.6.1), the three equations become w(−1)=0, w(0)=1, w(1)=0. The unique quadratic with those values is w=1−x2.

For ψ the same argument gives w(−1)=0, w(0)=0, w(1)=1, whose interpolant is w=12x(x+1).

Check. For p=3+2x−x2 we get p(−1)=0, p(0)=3, p(1)=4. Pairing with 1−x2, whose values are 0,1,0, gives 3=p(0); pairing with 12x(x+1), whose values are 0,0,1, gives 4=p(1).

Exercise (B2: Riesz vectors on matrices)

On Mn(C) with the Frobenius inner product ⟨A,B⟩=tr(B∗A), find the Riesz vector of:

  • (a) φ(A)=a12 (assume n≥2);
  • (b) φC(A)=tr(CA), for a fixed C∈Mn(C).

Solution.

  • (a) Let E12 be the matrix unit with a 1 in position (1,2) and zeros elsewhere. Then E12∗=E21, and (E21A)kk=∑j(E21)kjajk, which is 0 unless k=2, where it equals a12. Hence tr(E12∗A)=a12=φ(A), and by uniqueness in Theorem 11.5.1 the Riesz vector is E12.

  • (b) We need W with tr(W∗A)=tr(CA) for all A. Taking W∗=C, that is W=C∗, works. By uniqueness it is the only answer. Part (a) is the case C=E21, and the example in the text is the case C=In.

Exercise (B3: The correspondence in R4)

In R4 with the dot product, let U=span((1,0,1,0),(0,1,0,1)). Find a basis of U⊥ and a basis of U0, and verify that Φ carries the first to the second.

Solution. A vector (a,b,c,d) lies in U⊥ exactly when a+c=0 and b+d=0 (Proposition 11.3.1, testing against the two spanning vectors). So U⊥=span((1,0,−1,0), (0,1,0,−1)), of dimension 2=4−2.

A functional φ(x)=αx1+βx2+γx3+δx4 lies in U0 exactly when it kills both spanning vectors, that is, when α+γ=0 and β+δ=0. So U0=span(φ1,φ2) with φ1(x)=x1−x3,φ2(x)=x2−x4. Over R, Φ(w)(x)=⟨x,w⟩=∑ixiwi, so Φ((1,0,−1,0))=φ1 and Φ((0,1,0,−1))=φ2. Since Φ is linear over R 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 V be a finite-dimensional inner product space and let φ∈V∗ be nonzero. Write K=kerφ.

  • (a) Prove that dim⁡K⊥=1.
  • (b) Let u span K⊥ with ‖u‖=1. Prove that w=φ(u)―u satisfies φ(v)=⟨v,w⟩ for all v∈V.
  • (c) Deduce Theorem 11.5.1, including the case φ=0.

Hint for (b): split v using V=K⊕K⊥.

Solution.

  • (a) Since φ≠0, its image is a nonzero subspace of the 1-dimensional space F, so imφ=F and rankφ=1. By Theorem 2.3.1, dim⁡K=dim⁡V−1, and by Theorem 11.3.2 (c), dim⁡K⊥=dim⁡V−dim⁡K=1.

  • (b) By Theorem 11.3.2 (a), V=K⊕K⊥, so each v∈V is v=k+cu with k∈K and c∈F. Then φ(v)=φ(k)+cφ(u)=cφ(u). On the other side, ⟨v,w⟩=⟨k+cu,φ(u)―u⟩=φ(u)(⟨k,u⟩+c⟨u,u⟩)=φ(u)c, using conjugate-homogeneity in the second slot (which conjugates φ(u)― back to φ(u)), then ⟨k,u⟩=0 because u∈K⊥ and k∈K, and ⟨u,u⟩=‖u‖2=1. The two sides agree.

  • (c) If φ=0, then w=0 represents it. If φ≠0, part (a) supplies a unit vector u spanning the line K⊥ — any nonzero vector of that line divided by its norm — and part (b) supplies w. Uniqueness is unchanged: if ⟨v,w⟩=⟨v,w′⟩ for all v, take v=w−w′ to get ‖w−w′‖2=0. Note that this proof never mentions a basis of V; it uses only the orthogonal decomposition along the hyperplane kerφ.

Exercise (C2: Evaluation at 0 is not represented)

Let V=R[x] with ⟨p,q⟩=∫01p(t)q(t)dt, and let φ(p)=p(0). Suppose, for a contradiction, that w=∑j=0dcjxj satisfied ⟨p,w⟩=p(0) for every p∈V.

  • (a) Show that ∑j=0dcjk+j+1=0 for every integer k≥1, and that the same sum equals 1 for k=0.
  • (b) Let N(s)=∑j=0dcj∏i≠j(s+i+1), the product running over i∈{0,…,d}∖{j}. Show that N(k)=0 for every integer k≥1, and deduce that N is the zero polynomial.
  • (c) Deduce that every cj=0, and hence a contradiction.

Solution.

  • (a) Take p=xk. Then p(0)=0 for k≥1 and p(0)=1 for k=0, while ⟨xk,w⟩=∫01tk∑j=0dcjtjdt=∑j=0dcj∫01tk+jdt=∑j=0dcjk+j+1.

  • (b) For an integer k≥1, multiply the identity of (a) by ∏i=0d(k+i+1), a nonzero number. Each term cj/(k+j+1) becomes cj∏i≠j(k+i+1), so the result is exactly N(k)=0. Thus the polynomial N, of degree at most d, has the infinitely many distinct roots 1,2,3,…. A nonzero polynomial of degree d has at most d distinct roots (Corollary 6.1.4), so N=0.

  • (c) Evaluate N at s=−(j0+1) for a fixed j0∈{0,…,d}. Every product ∏i≠j(s+i+1) with j≠j0 contains the factor s+j0+1=0 and so vanishes; the term j=j0 contributes cj0∏i≠j0(i−j0), and that product is nonzero because the factors i−j0 are nonzero integers. Since N=0, we get cj0=0. This holds for every j0, so w=0. But then the case k=0 of (a) reads 0=1, 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.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.