5.4  The Dual Map and the Transpose

So far each space has had its own dual, but the duals of different spaces have not talked to each other. Linear algebra is about maps, so the question is: what does a linear map T:V→W do to functionals? This section shows that T moves vectors forward but moves measurements backward, giving the dual map T′:W∗→V∗. In dual bases its matrix is the transpose of the matrix of T, which finally explains what the transpose of Chapter 0 means. The kernel and image of T′ are annihilators of the image and kernel of T, and counting dimensions gives a third proof that row rank equals column rank. At the end we return to the double dual and prove that the evaluation map is compatible with every linear map.

5.4.1. Pulling functionals back

After spaces come the maps between them. We have a linear map T:V→W and the two spaces of measurements V∗ and W∗. We want to know how T relates them.

Start with the standard example, a matrix map TA:Fn→Fm, x↦Ax, with A∈Mm×n(F). A functional on Fm is ψ(y)=b⊤y for a unique b∈Fm (Theorem 5.1.1). Given ψ, there is one obvious way to measure a vector x∈Fn: move it to Fm with TA, then measure. The result is ψ(TAx)=b⊤Ax=(A⊤b)⊤x, using (A⊤b)⊤=b⊤A (Theorem 0.9.5). So “move, then measure” is again a functional, now on Fn, and it is given by the vector A⊤b. The transpose appears by itself. The recipe “compose with T” makes sense for any linear map, and it deserves a name.

The dual map pulls a measurement of W back to a measurement of V: first move the vector with T, then measure it in W.

Definition 5.4.1 (Dual Map)

Let V and W be vector spaces over F, and let T∈L(V,W). The dual map of T is the map T′:W∗→V∗,T′(ψ):=ψT=ψ∘T. That is, (T′ψ)(v)=ψ(Tv) for every ψ∈W∗ and every v∈V.

In words, clause by clause:

  • The input of T′ is a functional on the codomain W, and the output is a functional on the domain V. The arrow is reversed.
  • The formula (T′ψ)(v)=ψ(Tv) has two steps: to measure v with T′ψ, send v to W with T, then apply ψ there.
  • No basis and no finite dimension are involved.

Well-definedness. Two things must be checked. First, T′ψ must lie in V∗: it is the composite of the linear maps T:V→W and ψ:W→F, so it is linear by Theorem 2.4.2 (a). Second, T′ should be linear, so that T′∈L(W∗,V∗). By the distributive laws in Theorem 2.4.2 (d), for ψ1,ψ2∈W∗ and c∈F, T′(ψ1+ψ2)=(ψ1+ψ2)T=ψ1T+ψ2T=T′ψ1+T′ψ2,T′(cψ)=(cψ)T=c(ψT)=cT′ψ.

Example (Dual Maps in Four Settings)
  • (a) For A∈Mm×n(F), describe TA′ in terms of the vectors b and A⊤b that represent functionals.
  • (b) Let D:R[x]≤3→R[x]≤2, D(p)=p′, and let ε2∈(R[x]≤2)∗ be ε2(q)=q(2). Compute D′(ε2).
  • (c) Let S:F[x]→F[x], S(p)=xp, and let φk∈F[x]∗ send a polynomial to its coefficient of xk. Compute S′(φk) for every k∈N.
  • (d) Find (idV)′, the dual map of the zero map V→W, and the dual map of the inclusion ι:U→V, ι(u)=u, of a subspace U⊆V.

Solution.

  • (a) If ψ(y)=b⊤y, the computation before the definition shows (TA′ψ)(x)=(A⊤b)⊤x. So, identifying a functional with its vector, TA′ is b↦A⊤b. In row language: TA′ sends the row b⊤ to the row b⊤A.

  • (b) For p∈R[x]≤3, (D′ε2)(p)=ε2(Dp)=p′(2). So D′ turns “the value at 2” into “the slope at 2”.

  • (c) (S′φk)(p)=φk(xp). Multiplying by x shifts every coefficient up one place, so the coefficient of xk in xp is the coefficient of xk−1 in p when k≥1, and 0 when k=0. Hence S′φk=φk−1 for k≥1, and S′φ0=0. Here F[x] is infinite-dimensional, and the definition works all the same.

  • (d) (idV)′φ=φ∘idV=φ, so (idV)′=idV∗. For the zero map 0:V→W, (0′ψ)(v)=ψ(0)=0 (Theorem 2.1.1), so 0′ is the zero map W∗→V∗. For the inclusion, (ι′φ)(u)=φ(u) for u∈U, so ι′φ=φ|U is the restriction of φ to U. The restriction map V∗→U∗ is thus a dual map; we study it further in the next section.

Here is a non-example by minimal change. Try to push functionals forward instead: for T:V→W and φ∈V∗, look for a ψ∈W∗ with ψT=φ, and call it “T∗φ”. Take T:R→R2, T(t)=(t,0), and φ(t)=t. Then ψ(x,y)=x+cy satisfies ψ(T(t))=t for every c∈R, so there is no single answer. And for the zero map R→R2, no ψ at all satisfies ψ∘0=φ. What fails is well-definedness: a function must assign exactly one value. Composition with T goes only one way, on the right, and that forces the direction W∗→V∗.

Why this definition. From T:V→W and ψ:W→F, the only composite we can form is ψT; the non-example shows that the other direction is not a function. Linearity of T′ comes for free from the distributive laws. The name “dual map” says that T′ is the map T induces between the duals. It is also called the transpose of T, for a reason that the matrix theorem below makes exact. We write T′ rather than T∗, because T∗ is reserved for the adjoint of Chapter 11, which is related to T′ but needs an inner product.

Warning. The dual map goes backwards. For T:V→W, the dual map is T′:W∗→V∗, not V∗→W∗. As a result, composition reverses order: if T:U→V and S:V→W, then (ST)′=T′S′, just as (AB)⊤=B⊤A⊤. The other order S′T′ does not even make sense: T′ lands in U∗, where S′ is not defined.

Quick check. Let T:R3→R2, T(x,y,z)=(x−z,2y), and ψ(u,v)=u+v. Compute T′ψ. If T′ is written as a matrix in some bases, what is its size?

Solution. (T′ψ)(x,y,z)=ψ(x−z,2y)=x+2y−z. The map T′ goes from (R2)∗, of dimension 2, to (R3)∗, of dimension 3 (Corollary 5.1.4), so its matrix is 3×2, the size of the transpose of the 2×3 matrix of T.

The first payoff is that duals behave well under the operations on maps, with one reversal.

Theorem 5.4.1 (Properties of the Dual Map)

Let U,V,W be vector spaces over F.

  • (a) For S,T∈L(V,W) and a,b∈F, (aS+bT)′=aS′+bT′.
  • (b) For T∈L(U,V) and S∈L(V,W), (ST)′=T′S′.
  • (c) (idV)′=idV∗.
  • (d) If T∈L(V,W) is invertible, then T′ is invertible and (T′)−1=(T−1)′.

Idea. Each identity is an equality of maps into a dual space, so we evaluate both sides at a functional, and then evaluate the resulting functionals at a vector. After that, each line is the definition of T′ read twice. Part (d) needs no computation: apply (b) and (c) to T−1T=idV and TT−1=idW.

Proof.

  • (a) Let ψ∈W∗ and v∈V. Using the linearity of ψ and the pointwise operations (Definition 2.4.1), ((aS+bT)′ψ)(v)=ψ(aSv+bTv)=aψ(Sv)+bψ(Tv)=(aS′ψ+bT′ψ)(v). Hence (aS+bT)′ψ=(aS′+bT′)ψ for every ψ, and (aS+bT)′=aS′+bT′.

  • (b) Let ψ∈W∗. By Definition 5.4.1 and associativity of composition (Theorem 2.4.2 (b)), (ST)′ψ=ψ(ST)=(ψS)T=T′(ψS)=T′(S′ψ)=(T′S′)ψ. Hence (ST)′=T′S′.

  • (c) This is Example (Dual Maps in Four Settings) (d).

  • (d) Suppose T is invertible with inverse T−1∈L(W,V). By (b) and (c), T′(T−1)′=(T−1T)′=(idV)′=idV∗,(T−1)′T′=(TT−1)′=(idW)′=idW∗. The map (T−1)′ is linear, so by Definition 2.5.1 T′ is invertible with inverse (T−1)′. This proves the theorem.

Part (a) says that T↦T′ is itself a linear map L(V,W)→L(W∗,V∗). Part (b) is the reversal of the warning. Parts (c) and (d) say that dualizing turns isomorphisms into isomorphisms, so isomorphic spaces have isomorphic duals.

5.4.2. The matrix of the dual map

Now we fix bases and compute. Let B=(v1,…,vn) be a basis of V with dual basis B∗=(φ1,…,φn) (Definition 5.1.3), and C=(w1,…,wm) a basis of W with dual basis C∗=(ψ1,…,ψm). The map T has the m×n matrix [T]BC (Definition 4.1.1). The dual map T′:W∗→V∗ has input basis C∗ and output basis B∗, so its matrix is [T′]C∗B∗, of size n×m. The size already suggests the answer, and Example (Dual Maps in Four Settings) (a) suggests it for matrix maps.

Theorem 5.4.2 (The Matrix of the Dual Map Is the Transpose)

Let V and W be finite-dimensional vector spaces over F, with ordered bases B of V and C of W, and let B∗ and C∗ be their dual bases. For every T∈L(V,W), [T′]C∗B∗=([T]BC)⊤.

Idea. Both matrices are tables of the same numbers ψi(Tvj). In [T]BC, the (i,j) entry is the wi-coordinate of Tvj, and a dual basis vector reads off a coordinate: that coordinate is ψi(Tvj). In [T′]C∗B∗, column i holds the B∗-coordinates of T′ψi, and the φj-coordinate of a functional is its value at vj: that is (T′ψi)(vj)=ψi(Tvj). The same number sits at (i,j) in one matrix and at (j,i) in the other.

Proof. Write B=(v1,…,vn), B∗=(φ1,…,φn), C=(w1,…,wm), C∗=(ψ1,…,ψm), and A=(akj)=[T]BC. By Definition 4.1.1, aij is the i-th entry of [Tvj]C, and by Theorem 5.1.3 (a) that entry is read off by ψi: (∗)ψi(Tvj)=aij. Next, by Theorem 5.1.3 (c), every φ∈V∗ satisfies φ=∑j=1nφ(vj)φj. Since B∗ is a basis, coordinates in it are unique (Theorem 1.5.1), so [φ]B∗=(φ(v1),…,φ(vn)).

By Definition 4.1.1, column i of [T′]C∗B∗ is [T′ψi]B∗. By the previous paragraph and (∗), its j-th entry is (T′ψi)(vj)=ψi(Tvj)=aij. So the (j,i) entry of [T′]C∗B∗ is aij, which is the (j,i) entry of A⊤ (Definition 0.9.10). Both matrices are n×m, so [T′]C∗B∗=A⊤. This proves the theorem.

This is the meaning of the transpose. In Chapter 0, Definition 0.9.10 was a rule for rearranging entries. Now we see it as the matrix shadow of pulling functionals back: transposing a matrix is dualizing the map, provided we use dual bases on both sides. Every property of the transpose becomes a property of dual maps, and conversely; for instance, Theorem 5.4.1 (b) and this theorem together give (AB)⊤=B⊤A⊤ a second time (Exercise B3 below).

Example (A 2×3 Example)

Let T:R[x]≤2→R2, T(p)=(p(1),p′(1)). Use the basis B=(1,x,x2), whose dual basis B∗=(φ0,φ1,φ2) consists of φ0(p)=p(0), φ1(p)=p′(0), φ2(p)=p″(0)/2 (Example (Dual Bases in R[x]≤2)), and the standard basis C=(e1,e2) of R2, with dual basis C∗=(η1,η2), η1(u,v)=u, η2(u,v)=v.

  • (a) Find A=[T]BC.
  • (b) Compute T′η1 and T′η2 directly as combinations of φ0,φ1,φ2, write down [T′]C∗B∗, and compare with A⊤.
  • (c) Use the matrix to compute T′ψ for ψ=−2η1+η2, and check the answer directly.

Solution.

  • (a) T(1)=(1,0), T(x)=(1,1), T(x2)=(1,2). These are the columns: A=[T]BC=(111012).

  • (b) Let p=a+bx+cx2, so φ0(p)=a, φ1(p)=b, φ2(p)=c. Then (T′η1)(p)=η1(Tp)=p(1)=a+b+c,(T′η2)(p)=η2(Tp)=p′(1)=b+2c. So T′η1=φ0+φ1+φ2 and T′η2=φ1+2φ2. Their coordinate vectors in B∗ are the columns of [T′]C∗B∗=(101112)=A⊤, as Theorem 5.4.2 predicts. Read in words, the first column is Taylor’s formula p(1)=p(0)+p′(0)+12p″(0) for quadratics, and the second is p′(1)=p′(0)+p″(0).

  • (c) [ψ]C∗=(−2,1). By Theorem 4.1.1, [T′ψ]B∗=A⊤(−21)=(−2−10), so T′ψ=−2φ0−φ1. Directly: (T′ψ)(p)=−2p(1)+p′(1)=−2(a+b+c)+(b+2c)=−2a−b, which is (−2φ0−φ1)(p).

Warning. Dual bases on both sides. The transpose rule needs the dual bases C∗ and B∗. With other bases of W∗ and V∗ the matrix of T′ is usually not A⊤. In Example (A 2×3 Example), keep B∗ but use the basis (η1+η2,η2) of (R2)∗: then T′(η1+η2)=φ0+2φ1+3φ2, so the first column is (1,2,3), not the first column (1,1,1) of A⊤.

5.4.3. Kernel and image of the dual map

The kernel and image of T′ are subspaces of W∗ and V∗. The natural candidates for them are annihilators of the subspaces that T defines, and the dictionary swaps kernel and image.

Theorem 5.4.3 (Kernel and Image of the Dual Map)

Let V and W be vector spaces over F, and let T∈L(V,W).

  • (a) kerT′=(imT)0.
  • (b) If V and W are finite-dimensional, then imT′=(kerT)0.

Idea.

  • (a) is a chain of definitions: ψT=0 says that ψ vanishes on every Tv, that is, on imT. For (b), one inclusion is just as easy: ψT kills every vector that T kills. The reverse inclusion asks us to extend a functional given on V to one of the form ψT, which is a construction. Instead we count. Rank–Nullity for T′, together with (a) and the dimension formula for annihilators, gives dim⁡imT′=rankT; the dimension formula in V and Rank–Nullity for T give dim⁡(kerT)0=rankT. Finite dimension is spent exactly on these counts.

Proof.

  • (a) Let ψ∈W∗. Then ψ∈kerT′ iff ψT=0 iff ψ(Tv)=0 for every v∈V iff ψ(w)=0 for every w∈imT (Definition 2.2.2) iff ψ∈(imT)0 (Definition 5.2.1).

  • (b) Let n=dim⁡V and m=dim⁡W, so dim⁡V∗=n and dim⁡W∗=m (Corollary 5.1.4).

Inclusion. Let φ∈imT′, say φ=ψT with ψ∈W∗. For u∈kerT, φ(u)=ψ(Tu)=ψ(0)=0. Hence φ∈(kerT)0, and imT′⊆(kerT)0.

Dimensions. By the Rank–Nullity Theorem (Theorem 2.3.1) for T′:W∗→V∗, then (a), then Theorem 5.2.2 for the subspace imT of W, dim⁡imT′=m−dim⁡kerT′=m−dim⁡(imT)0=m−(m−dim⁡imT)=rankT. By Theorem 5.2.2 for the subspace kerT of V, and Rank–Nullity for T, dim⁡(kerT)0=n−dim⁡kerT=rankT. So imT′ is a subspace of the finite-dimensional space (kerT)0 with the same dimension, and Theorem 1.6.8 gives imT′=(kerT)0. This proves the theorem.

For a matrix map, this is a statement about rows. By Example (Dual Maps in Four Settings) (a), TA′ sends the row b⊤ to b⊤A, so imTA′ is the set of combinations of the rows of A: it is the row space, read as functionals. Part (b) then says that the functionals vanishing on nul(A) are exactly the combinations of the rows of A. Part (a) says that the functionals vanishing on col(A) are the rows b⊤ with b⊤A=0, that is, A⊤b=0.

Example (Kernel and Image of a Dual Map)

Let T=TA:R3→R3 with A=(10201−1111). Find bases of kerT′ and imT′, written as explicit functionals, and check Theorem 5.4.3.

Solution. The matrix world. The third row of A is the sum of the first two, and subtracting them leaves the RREF (10201−1000). So rankA=2, and Ax=0 gives x=−2z, y=z: kerT=span((−2,1,1)). The pivot columns give imT=span((1,0,1),(0,1,1)) (Theorem 3.5.2).

Kernel of T′. By Theorem 5.4.2 with standard bases and Example (Matrix Maps and the Identity) (a), a functional ψ(u,v,w)=b1u+b2v+b3w lies in kerT′ iff A⊤b=0: b1+b3=0,b2+b3=0,2b1−b2+b3=0. The first two give b=t(1,1,−1), and these satisfy the third. So kerT′=span(ψ0) with ψ0(u,v,w)=u+v−w. Check: ψ0(1,0,1)=0 and ψ0(0,1,1)=0, so ψ0 vanishes on imT; and dim⁡(imT)0=3−2=1 (Theorem 5.2.2). So kerT′=(imT)0.

Image of T′. By Example (Dual Maps in Four Settings) (a), imT′ is spanned by the rows of A read as functionals, and the first two rows already span (the third is their sum): φ1(x,y,z)=x+2z,φ2(x,y,z)=y−z. They are independent (neither is a multiple of the other), so (φ1,φ2) is a basis of imT′. Check: φ1(−2,1,1)=0 and φ2(−2,1,1)=0, so both vanish on kerT, and dim⁡(kerT)0=3−1=2. So imT′=(kerT)0.

Counting dimensions in the proof of Theorem 5.4.3 already gave dim⁡imT′=rankT. We record it, together with its most famous consequence.

Corollary 5.4.4 (Rank of the Dual Map)
  • (a) Let V and W be finite-dimensional vector spaces over F, and T∈L(V,W). Then rankT′=rankT.
  • (b) For every A∈Mm×n(F), rankA⊤=rankA. Equivalently, dim⁡row(A)=dim⁡col(A): row rank equals column rank.

Proof.

This is the third proof of this fact in the book, and each one explains it differently.

  • Chapter 3 (Theorem 3.5.5) counted pivots. Row reduction preserves the row space and the relations among the columns, and in the RREF both dimensions visibly equal the number of pivots. The proof is an algorithm.
  • Chapter 4, §03 factored A=BD through a space of dimension dim⁡col(A), after Proposition 4.3.2, and saw that the rows of A are combinations of the few rows of D. The proof is a factorization.
  • Here there are no row operations and no factorizations. The equality is the dimension formula dim⁡U+dim⁡U0=dim⁡V, applied once to imT in W and once to kerT in V, glued together by Rank–Nullity. The rows of A are the functionals that TA′ produces, and the columns span the image of TA; the two counts agree because pulling back measurements loses exactly as much as pushing forward vectors.

(The dimension formula for annihilators in section 2 was proved by extending a basis of U, without using ranks of matrices, so this proof does not go in a circle.)

The dictionary also swaps injective and surjective.

Corollary 5.4.5 (Injective and Surjective Swap Under Duality)

Let V and W be finite-dimensional vector spaces over F, and T∈L(V,W). Then:

  • (a) T is surjective if and only if T′ is injective;
  • (b) T is injective if and only if T′ is surjective.

Proof. Let n=dim⁡V and m=dim⁡W. A finite-dimensional space is {0} exactly when its dimension is 0.

For TA, part (a) reads: Ax=b is solvable for every b exactly when A⊤y=0 has only the trivial solution. So a question about the columns of A turns into a question about the columns of A⊤, the rows of A. Exercise C1 below sharpens this into a test for a single b.

5.4.4. Naturality of the double dual

In the previous section we called evV:V→V∗∗ natural because it needs no choice, and promised a sharper sense: compatibility with every linear map. With dual maps available, we can state it. A linear map T:V→W has a dual T′:W∗→V∗, and that has a dual in turn, T″:=(T′)′:V∗∗→W∗∗, which points forward again, because we reversed twice.

Theorem 5.4.6 (The Evaluation Map Is Natural)

Let V and W be vector spaces over F, and let T∈L(V,W). Then T″evV=evWT. That is, T″(evv)=evTv for every v∈V. If V and W are finite-dimensional, then T″=evWTevV−1.

The statement says that the square below commutes, for every linear map T: going right then down (apply T, then evaluate) equals going down then right (evaluate, then apply T″).

Diagram. Labels: T, T'', operatorname ev_V, operatorname ev_W, V, W, V^**, W^**

Proof. Let v∈V. Both T″(evv) and evTv are functionals on W∗, so let ψ∈W∗. By Definition 5.4.1 applied to T′, then to T, (T″(evv))(ψ)=evv(T′ψ)=(T′ψ)(v)=ψ(Tv)=evTv(ψ). Hence T″(evv)=evTv for every v, which is T″evV=evWT. If V is finite-dimensional, evV is an isomorphism (Theorem 5.3.2); composing on the right with evV−1 gives T″=evWTevV−1.

So, once V is identified with V∗∗ and W with W∗∗ through evaluation, the double dual map T″ is T. The matrices agree: by Theorem 5.3.2, ev carries B and C to the dual bases B∗∗ and C∗∗ of B∗ and C∗, and two applications of Theorem 5.4.2 give [T″]B∗∗C∗∗=(([T]BC)⊤)⊤=[T]BC (Theorem 0.9.5). The rule (A⊤)⊤=A is the matrix form of naturality.

Remark. No such statement holds for V≅V∗. Suppose that for every finite-dimensional real space V we had an isomorphism θV:V→V∗, compatible with isomorphisms in the only way the directions allow: θV=T′θWT for every isomorphism T:V→W. Take V=W=R and T=2id. Then T′=2id by Theorem 5.4.1 (a) and (c), so θR=2⋅2⋅θR=4θR, which forces θR=0, not an isomorphism. The dual space is isomorphic to V, but not naturally.

5.4.5. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the dual map T′ of T∈L(V,W), including its domain and codomain.
  • (b) State the relation between [T′]C∗B∗ and [T]BC, with its hypotheses.
  • (c) True or false: (ST)′=S′T′ whenever ST is defined. Justify your answer.
  • (d) True or false: kerT′=(kerT)0 for every linear map between finite-dimensional spaces. Justify your answer.
  • (e) True or false: for T∈L(R4,R3), the dual map T′ is never surjective. Justify your answer.
  • (f) Name the two tools combined to prove rankT′=rankT.

Solution.

  • (a) For T:V→W, T′:W∗→V∗, T′(ψ)=ψT (Definition 5.4.1).

  • (b) If V,W are finite-dimensional with bases B,C and dual bases B∗,C∗, then [T′]C∗B∗=([T]BC)⊤ (Theorem 5.4.2).

  • (c) False. The correct rule is (ST)′=T′S′ (Theorem 5.4.1 (b)); for T:U→V, S:V→W with U≠W, the composite S′T′ is not even defined.

  • (d) False. kerT′=(imT)0. For the zero map T:R→R, kerT=R, so (kerT)0={0}, while T′=0 has kernel R∗≠{0}.

  • (e) True. T′ maps (R3)∗, of dimension 3, to (R4)∗, of dimension 4, so it cannot be surjective (Corollary 2.3.2 (d)). This matches Corollary 5.4.5: T cannot be injective.

  • (f) The Rank–Nullity Theorem (Theorem 2.3.1) and the dimension formula for annihilators, dim⁡U+dim⁡U0=dim⁡V (Theorem 5.2.2), together with kerT′=(imT)0.

B. Practice

Exercise (B1: Differentiation in dual bases)

Let D:R[x]≤2→R[x]≤2, D(p)=p′, and let B=(1,x,x2) with dual basis B∗=(φ0,φ1,φ2), φk(p)= the coefficient of xk in p. Compute D′φ0, D′φ1, D′φ2 directly, write down [D′]B∗B∗, and check that it is ([D]BB)⊤. Hence describe kerD′ and imD′, and verify Theorem 5.4.3.

Solution. Let p=a+bx+cx2, so Dp=b+2cx. Then (D′φ0)(p)=φ0(Dp)=b, (D′φ1)(p)=2c, (D′φ2)(p)=0. Hence D′φ0=φ1,D′φ1=2φ2,D′φ2=0. The coordinate vectors (0,1,0), (0,0,2), (0,0,0) are the columns of [D′]B∗B∗. On the other side, D(1)=0, D(x)=1, D(x2)=2x, so [D]BB=(010002000),[D′]B∗B∗=(000100020)=([D]BB)⊤, as Theorem 5.4.2 predicts.

From the formulas, D′(c0φ0+c1φ1+c2φ2)=c0φ1+2c1φ2, which is 0 iff c0=c1=0. So kerD′=span(φ2) and imD′=span(φ1,φ2). On the other hand imD=R[x]≤1=span(1,x), and φ2 is exactly the functional (up to scalars) vanishing on it, since c0φ0+c1φ1+c2φ2 kills 1 and x iff c0=c1=0. So kerD′=(imD)0. Also kerD=span(1), and a functional kills 1 iff c0=0, so (kerD)0=span(φ1,φ2)=imD′.

Exercise (B2: Kernel and image of a dual map)

Let A=(12−1−2−42) and T=TA:R3→R2. Find bases of kerT′ and imT′ as explicit functionals, and verify dim⁡kerT′+dim⁡imT′=2 and rankT′=rankT.

Solution. The second row is −2 times the first, so rankA=1, imT=col(A)=span((1,−2)), and kerT={(x,y,z):x+2y−z=0}, of dimension 2.

Kernel of T′. As in Example (Kernel and Image of a Dual Map), ψ(u,v)=b1u+b2v lies in kerT′ iff A⊤b=0, that is, b1−2b2=0, 2b1−4b2=0, −b1+2b2=0. So b=t(2,1), and kerT′=span(ψ0) with ψ0(u,v)=2u+v. Check: ψ0(1,−2)=0, so ψ0∈(imT)0, which has dimension 2−1=1.

Image of T′. By Example (Dual Maps in Four Settings) (a), imT′ is spanned by the rows of A read as functionals, x+2y−z and −2x−4y+2z. The second is −2 times the first, so imT′=span(φ0) with φ0(x,y,z)=x+2y−z. Check: φ0 vanishes on kerT by the description of kerT, and dim⁡(kerT)0=3−2=1.

Hence dim⁡kerT′+dim⁡imT′=1+1=2=dim⁡(R2)∗, and rankT′=1=rankT.

Exercise (B3: The transpose of a product, again)

Let A∈Mm×n(F) and B∈Mn×p(F). Using TATB=TAB (Chapter 4, §01), Theorem 5.4.1 (b) and Theorem 5.4.2, give a new proof that (AB)⊤=B⊤A⊤.

Solution. Let Ep,En,Em be the standard bases, with dual bases Ep∗,En∗,Em∗. By Example (Matrix Maps and the Identity) (a), [TA]EnEm=A, [TB]EpEn=B, and [TAB]EpEm=AB. Since TAB=TATB, Theorem 5.4.1 (b) gives TAB′=TB′TA′. Taking matrices, with Theorem 4.1.2 in the middle and Theorem 5.4.2 on the outside, (AB)⊤=[TAB′]Em∗Ep∗=[TB′TA′]Em∗Ep∗=[TB′]En∗Ep∗[TA′]Em∗En∗=B⊤A⊤. The reversal of order is now explained: it is the reversal of arrows under duality.

C. Going deeper

Exercise (C1: The Fredholm alternative)
  • (a) Let V,W be finite-dimensional, T∈L(V,W) and w∈W. Prove that Tv=w has a solution v∈V if and only if ψ(w)=0 for every ψ∈kerT′.
  • (b) Deduce: for A∈Mm×n(F) and b∈Fm, the system Ax=b is consistent if and only if y⊤b=0 for every y∈Fm with A⊤y=0.
  • (c) Let A=(111213). Find a single linear condition on b=(b1,b2,b3)∈R3 that is equivalent to consistency of Ax=b.

Hint: for (a), combine Theorem 5.4.3 with the description of a subspace by its annihilator in the previous section.

Solution.

  • (a) Tv=w has a solution iff w∈imT. By Theorem 5.4.3 (a), kerT′=(imT)0. By Corollary 5.3.4 applied to the subspace imT of the finite-dimensional space W, imT={w∈W:ψ(w)=0 for every ψ∈(imT)0}={w∈W:ψ(w)=0 for every ψ∈kerT′}. This is the claim.

  • (b) Apply (a) to TA:Fn→Fm. By Theorem 5.1.1, every ψ∈(Fm)∗ is ψ(u)=y⊤u for a unique y∈Fm. By Example (Dual Maps in Four Settings) (a), TA′ψ is represented by A⊤y, and the zero functional by 0; by uniqueness of the representing vector, ψ∈kerTA′ iff A⊤y=0. For such ψ, ψ(b)=y⊤b. So (a) says: Ax=b is consistent iff y⊤b=0 for every y with A⊤y=0.

  • (c) A⊤y=0 reads y1+y2+y3=0 and y1+2y2+3y3=0. Subtracting, y2+2y3=0, so y=t(1,−2,1). By (b), Ax=b is consistent iff y⊤b=0 for all these y, that is, iff b1−2b2+b3=0. In words, the system x1+kx2=bk (k=1,2,3) asks for a line through the points (1,b1),(2,b2),(3,b3), and it exists exactly when the second difference b3−2b2+b1 vanishes. No inner product was used: y⊤b is just a functional applied to b.

Exercise (C2: Invariant subspaces and annihilators)

Let V be finite-dimensional, T∈L(V), and U a subspace of V. Recall that U is T-invariant if Tu∈U for every u∈U. Prove that U is T-invariant if and only if U0 is T′-invariant.

Solution. (⇒) Suppose U is T-invariant, and let φ∈U0. For every u∈U, (T′φ)(u)=φ(Tu)=0, because Tu∈U. Hence T′φ∈U0, and U0 is T′-invariant.

(⇐) Suppose U0 is T′-invariant, and let u∈U. For every φ∈U0, T′φ∈U0, so φ(Tu)=(T′φ)(u)=0. Thus Tu is killed by every functional in U0. By Corollary 5.3.4, Tu∈U. Hence U is T-invariant.

Exercise (C3: Duality without finite dimension)

Let V and W be arbitrary vector spaces over F, and T∈L(V,W).

  • (a) Prove that if T is surjective, then T′ is injective.
  • (b) Prove that if T is injective, then T′ is surjective.
  • (c) Check (b) on S:F[x]→F[x], S(p)=xp, from Example (Dual Maps in Four Settings) (c): given φ∈F[x]∗, find ψ with S′ψ=φ. Is S′ injective?

Hint: for (b), use Theorem 1.8.2 in W.

Solution.

  • (a) By Theorem 5.4.3 (a), which needs no finite dimension, kerT′=(imT)0=W0. A functional vanishing on all of W is the zero functional, so kerT′={0} and T′ is injective (Theorem 2.2.3).

  • (b) Let φ∈V∗. By Theorem 1.8.3, V has a basis B. Since T is injective, T is one-to-one on B, and T(B) is linearly independent: a finite combination ∑ciTbi=T(∑cibi)=0 with distinct bi forces ∑cibi=0 (Theorem 2.2.3), hence all ci=0. By Theorem 1.8.2 there is a basis C⊇T(B) of W. By Theorem 2.1.6, there is ψ∈W∗ with ψ(Tb)=φ(b) for b∈B, and ψ(c)=0 for c∈C∖T(B); this is well defined because each element of T(B) is Tb for exactly one b. Then ψT and φ are linear and agree on the basis B, so T′ψ=ψT=φ by the uniqueness part of Theorem 2.1.6. Hence T′ is surjective.

  • (c) Here B={1,x,x2,…} and S(B)={x,x2,…}, extended to a basis by adding 1. The recipe gives ψ(xk+1)=φ(xk) for k≥0 and ψ(1)=0. Then (S′ψ)(xk)=ψ(xk+1)=φ(xk), so S′ψ=φ. The dual map S′ is not injective: S′φ0=0 by Example (Dual Maps in Four Settings) (c). This matches the contrapositive of (a): S is not surjective, since 1∉imS, and indeed φ0 is a non-zero functional vanishing on imS.

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.