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 do to functionals? This section shows
that moves
vectors forward but moves measurements
backward, giving the dual map . In dual bases its matrix is the
transpose of the matrix of , which finally explains
what the transpose of Chapter 0 means. The kernel and
image of are
annihilators of the image and kernel of , 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.
Pulling
functionals back
After spaces come the maps between them. We have a
linear map and the two spaces of measurements and . We want to know
how relates
them.
Start with the standard example, a matrix map , , with . A functional on is for a
unique
(Theorem 5.1.1). Given
, there is one
obvious way to measure a vector : move it to
with , then measure. The
result is using (Theorem 0.9.5). So
“move, then measure” is again a functional, now on , and it is given by
the vector .
The transpose appears by itself. The recipe “compose
with ” makes sense
for any linear map, and it deserves a name.
The dual map pulls a measurement of back to a measurement
of : first move
the vector with ,
then measure it in .
Definition
5.4.1 (Dual Map)
Let and be vector spaces over
, and let . The
dual map of is the map That is, for every and every
.
In words, clause by clause:
- The input of is a functional on
the codomain , and the output is a
functional on the domain . The arrow is
reversed.
- The formula has two steps: to measure with , send to with , then apply there.
- No basis and no finite dimension are involved.
Well-definedness. Two things must be
checked. First, must lie in
: it is the
composite of the linear maps and
, so it is linear by Theorem 2.4.2 (a).
Second,
should be linear, so that . By the distributive laws in Theorem 2.4.2 (d), for
and ,
Example
(Dual Maps in Four Settings)
- (a) For ,
describe in terms of
the vectors and
that
represent functionals.
- (b) Let , , and let
be .
Compute .
- (c) Let ,
, and let
send a polynomial to its coefficient
of . Compute
for every .
- (d) Find , the dual
map of the zero map , and the dual map of the inclusion ,
, of
a subspace .
Solution.
(a) If , the
computation before the definition shows . So, identifying a functional
with its vector, is . In
row language: sends the row
to the row
.
(b) For ,
. So turns “the value
at ” into “the
slope at ”.
(c) . Multiplying by shifts every
coefficient up one place, so the coefficient of in is the coefficient of
in when , and when . Hence for , and . Here
is
infinite-dimensional, and the definition works all the
same.
(d) , so . For the zero map , (Theorem 2.1.1), so
is the zero
map . For the inclusion, for , so is the restriction
of to . The restriction map
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 and
,
look for a with , and call it “”. Take ,
, and
.
Then satisfies for
every , so there is no single answer. And for the
zero map , no at all satisfies
. What fails is well-definedness: a
function must assign exactly one value.
Composition with
goes only one way, on the right, and that forces the
direction .
Why this definition. From and
, the only composite we can form is ; the non-example
shows that the other direction is not a function.
Linearity of
comes for free from the distributive laws. The name
“dual map” says that is the map induces between the
duals. It is also called the transpose
of , for a reason
that the matrix theorem below makes exact. We write
rather than
, because
is reserved
for the adjoint of Chapter 11, which is related to but needs an inner
product.
Warning. The dual map goes
backwards. For , the dual map is , not . As a
result, composition reverses order: if and
,
then , just as .
The other order does not
even make sense: lands in , where is not
defined.
Quick check. Let ,
, and . Compute . If is written as a
matrix in some bases, what is its size?
Solution. . The map goes from , of dimension
, to , of dimension
(Corollary 5.1.4), so its
matrix is , the size of the transpose of the matrix of
.
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 be
vector spaces over .
- (a) For and
, .
- (b) For and , .
- (c) .
- (d) If is
invertible, then is invertible and
.
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 read twice. Part
(d) needs no computation: apply (b) and (c) to and .
Proof.
(a) Let and . Using the
linearity of
and the pointwise operations (Definition 2.4.1),
Hence for
every , and
.
(b) Let . By Definition 5.4.1 and
associativity of composition (Theorem 2.4.2 (b)),
Hence .
(c) This is Example (Dual Maps in Four Settings)
(d).
(d) Suppose is invertible with
inverse . By (b) and (c), The map is linear,
so by Definition 2.5.1 is invertible with
inverse . This
proves the theorem.
Part (a) says that is itself a linear map . 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.
The matrix
of the dual map
Now we fix bases and compute. Let
be a basis of
with dual basis (Definition 5.1.3), and
a basis of with dual basis . The map has the matrix (Definition 4.1.1).
The dual map has input basis and output basis
, so its
matrix is ,
of size .
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 and be finite-dimensional
vector spaces over , with ordered bases
of and of , and let and be their dual
bases. For every ,
Idea. Both matrices are tables of
the same numbers . In , the
entry is the
-coordinate of
, and a dual
basis vector reads off a coordinate:
that coordinate is . In ,
column holds the
-coordinates
of ,
and the -coordinate of a
functional is its value at : that is . The same number sits at in one matrix and
at in the
other.
Proof. Write , , , , and . By Definition 4.1.1,
is the -th entry of , and
by Theorem 5.1.3 (a) that
entry is read off by : Next, by Theorem 5.1.3 (c), every
satisfies . Since
is a basis,
coordinates in it are unique (Theorem 1.5.1), so
.
By Definition 4.1.1,
column of
is .
By the previous paragraph and , its -th entry is So the entry of
is , which is
the entry of
(Definition 0.9.10).
Both matrices are , so . 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 a
second time (Exercise B3 below).
Example
(A
Example)
Let , . Use the basis , whose
dual basis consists of
, , (Example (Dual Bases in )),
and the standard basis of , with dual basis
, , .
- (a) Find .
- (b) Compute and directly as
combinations of , write down ,
and compare with .
- (c) Use the matrix
to compute for ,
and check the answer directly.
Solution.
(a) , , . These
are the columns:
(b) Let , so
,
,
.
Then So and . Their coordinate vectors in are the columns
of as Theorem 5.4.2 predicts.
Read in words, the first column is Taylor’s formula
for quadratics, and the
second is .
(c) . By Theorem 4.1.1,
so . Directly: ,
which is .
Warning. Dual bases on both
sides. The transpose rule needs the
dual bases and . With other bases
of and the matrix of is usually not
. In Example (A Example),
keep but
use the basis of : then , so the
first column is , not the first column of .
Kernel and
image of the dual map
The kernel and image of are subspaces of
and . The natural
candidates for them are annihilators of the subspaces
that defines, and
the dictionary swaps kernel and image.
Theorem
5.4.3 (Kernel and Image of the Dual Map)
Let and be vector spaces over
, and let .
- (a) .
- (b) If and are finite-dimensional,
then .
Idea.
- (a) is a chain of
definitions: says that vanishes on every
, that is, on
. For (b), one
inclusion is just as easy: kills every vector
that kills. The
reverse inclusion asks us to extend a
functional given on to one of the form
, which is a
construction. Instead we count. Rank–Nullity for , together with (a)
and the dimension formula for annihilators, gives ; the dimension formula in and Rank–Nullity for
give . Finite dimension is spent exactly on these
counts.
Proof.
Inclusion. Let ,
say with . For , . Hence ,
and .
Dimensions. By the Rank–Nullity Theorem (Theorem 2.3.1) for
, then (a), then Theorem 5.2.2 for the
subspace of
, By Theorem 5.2.2 for the
subspace of
, and Rank–Nullity
for , So is a subspace of the finite-dimensional
space
with the same dimension, and Theorem 1.6.8 gives
. This proves the theorem.
For a matrix map, this is a statement about rows. By
Example (Dual Maps in Four Settings)
(a),
sends the row
to , so
is
the set of combinations of the rows of : it is the row space,
read as functionals. Part (b) then says that the
functionals vanishing on are exactly the
combinations of the rows of . Part (a)
says that the functionals vanishing on are the rows
with , that is,
.
Example
(Kernel and Image of a Dual Map)
Let with Find bases of and , written as explicit functionals, and
check Theorem 5.4.3.
Solution. The matrix
world. The third row of is the sum of the
first two, and subtracting them leaves the RREF . So , and gives , : . The pivot columns give (Theorem 3.5.2).
Kernel of . By Theorem 5.4.2 with
standard bases and Example (Matrix Maps and the Identity)
(a), a functional lies in iff : The first two give , and
these satisfy the third. So with . Check: and
, so vanishes on ; and (Theorem 5.2.2). So .
Image of . By Example (Dual Maps in Four Settings)
(a), is
spanned by the rows of read as functionals,
and the first two rows already span (the third is their
sum): They are independent (neither is a multiple of
the other), so is a basis of .
Check:
and , so both vanish on , and . So .
Counting dimensions in the proof of Theorem 5.4.3 already gave
. We record it, together with its most famous
consequence.
Corollary
5.4.4 (Rank of the Dual Map)
- (a) Let and be finite-dimensional
vector spaces over , and . Then
.
- (b) For every ,
. Equivalently, : row rank equals column
rank.
Proof.
(a) This is the
first display in the proof of Theorem 5.4.3
(b).
(b) Let , be the standard
bases. By Example (Matrix Maps and the Identity)
(a), , so by Theorem 5.4.2, . By Theorem 4.1.5
(a), applied to and to , and by (a),
Finally, the transpose
is linear (Theorem 0.9.5) and
bijective (it is its own inverse), and it sends row
of to column of . By Theorem 2.1.4 it maps
onto , so these
spaces are isomorphic and (Theorem 2.5.4, Definition 3.5.4).
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 through a space
of dimension , after Proposition 4.3.2,
and saw that the rows of are combinations of
the few rows of .
The proof is a factorization.
- Here there are no row operations
and no factorizations. The equality is the dimension
formula , applied once to in and once to in , glued together by
Rank–Nullity. The rows of are the functionals
that
produces, and the columns span the image of ; 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 , 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 and be finite-dimensional
vector spaces over , and .
Then:
- (a) is surjective if and
only if is
injective;
- (b) is injective if and
only if is
surjective.
Proof. Let and . A
finite-dimensional space is exactly when its
dimension is .
(a) By Theorem 2.2.3 and Theorem 5.4.3 (a), is injective iff
. By Theorem 5.2.2, , so this holds iff , that is, iff
is surjective (Corollary 2.3.2
(b)).
(b) is surjective iff
,
iff (by Theorem 1.6.8 for
one direction, since ). By Corollary 5.4.4 (a), , so this holds iff , that is, iff
is injective (Corollary 2.3.2
(a)).
For , part
(a) reads: is solvable for every exactly when has only the
trivial solution. So a question about the columns of
turns into a
question about the columns of , the rows of . Exercise C1 below
sharpens this into a test for a single .
Naturality
of the double dual
In the previous section we called
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 has a
dual , and that has a dual in turn, which points forward again,
because we reversed twice.
Theorem
5.4.6 (The Evaluation Map Is Natural)
Let and be vector spaces over
, and let . Then
That is, for every . If and are finite-dimensional,
then .
The statement says that the square below commutes,
for every linear map : going right then down
(apply , then
evaluate) equals going down then right (evaluate, then
apply ).
Proof. Let . Both and
are
functionals on , so let . By Definition 5.4.1 applied
to , then to
, Hence for every , which is . If is
finite-dimensional, is an isomorphism
(Theorem 5.3.2); composing
on the right with gives .
So, once is
identified with and with through
evaluation, the double dual map
is . The matrices agree: by
Theorem 5.3.2, carries and to the dual bases
and of and , and two
applications of Theorem 5.4.2 give (Theorem 0.9.5). The
rule is the matrix form of naturality.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define the dual
map of ,
including its domain and codomain.
- (b) State the
relation between
and , with
its hypotheses.
- (c) True or false:
whenever is defined. Justify
your answer.
- (d) True or false:
for every linear map between
finite-dimensional spaces. Justify your answer.
- (e) True or false:
for , the dual map is never
surjective. Justify your answer.
- (f) Name the two
tools combined to prove .
Solution.
(a) For , , (Definition 5.4.1).
(b) If are
finite-dimensional with bases and dual bases
,
then (Theorem 5.4.2).
(c) False. The
correct rule is (Theorem 5.4.1 (b)); for
,
with , the
composite is not even
defined.
(d) False. . For the zero map ,
, so
, while has kernel .
(e) True. maps , of dimension
, to , of dimension
, so it cannot be
surjective (Corollary 2.3.2 (d)).
This matches Corollary 5.4.5: cannot be
injective.
(f) The
Rank–Nullity Theorem (Theorem 2.3.1) and the
dimension formula for annihilators, (Theorem 5.2.2), together
with .
B. Practice
Exercise
(B1: Differentiation in dual bases)
Let , , and let
with dual basis , the
coefficient of
in . Compute , , directly,
write down ,
and check that it is .
Hence describe and , and verify Theorem 5.4.3.
Solution. Let , so
. Then
, , .
Hence The coordinate vectors , , are the columns
of .
On the other side, , , , so as Theorem 5.4.2
predicts.
From the formulas, ,
which is iff
. So
and . On the other hand , and is exactly the
functional (up to scalars) vanishing on it, since kills and iff . So . Also , and a functional kills iff , so .
Exercise
(B2: Kernel and image of a dual map)
Let and . Find bases of
and
as
explicit functionals, and verify and .
Solution. The second row is times the first, so
, , and , of
dimension .
Kernel of . As in Example (Kernel and Image of a Dual Map),
lies in iff , that is, , , . So , and with .
Check: , so , which has dimension .
Image of . By Example (Dual Maps in Four Settings)
(a), is
spanned by the rows of read as functionals,
and
. The
second is times
the first, so with . Check: vanishes on
by the
description of , and .
Hence ,
and .
Exercise
(B3: The transpose of a product, again)
Let and . Using
(Chapter 4, §01), Theorem 5.4.1 (b) and Theorem 5.4.2, give a new
proof that .
Solution. Let be
the standard bases, with dual bases . By Example (Matrix Maps and the Identity)
(a), , , and . Since ,
Theorem 5.4.1 (b) gives
. Taking matrices, with
Theorem 4.1.2 in
the middle and Theorem 5.4.2 on the
outside, 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 be
finite-dimensional, and . Prove that has a solution
if and
only if for every .
- (b) Deduce: for
and , the system is consistent
if and only if for every with .
- (c) Let . Find a
single linear condition on that is equivalent to consistency of
.
Hint: for (a), combine Theorem 5.4.3 with the
description of a subspace by its annihilator in the
previous section.
Solution.
(a) has a solution
iff .
By Theorem 5.4.3 (a), . By Corollary 5.3.4 applied to
the subspace
of the finite-dimensional space , This is the claim.
(b) Apply (a) to
. By Theorem 5.1.1, every is
for a unique . By Example (Dual Maps in Four Settings)
(a), is
represented by , and the zero
functional by ;
by uniqueness of the representing vector,
iff .
For such ,
.
So (a) says: is consistent iff for every
with .
(c) reads and
. Subtracting, , so . By (b), is consistent
iff for
all these , that
is, iff In words, the system () asks for a
line through the points , and it exists exactly
when the second difference
vanishes. No inner product was used: is just a
functional applied to .
Exercise
(C2: Invariant subspaces and annihilators)
Let be
finite-dimensional, , and a subspace of . Recall that is -invariant if
for every
. Prove
that is -invariant if and only
if is -invariant.
Solution. Suppose
is -invariant, and let
.
For every ,
, because . Hence ,
and is -invariant.
Suppose is
-invariant,
and let .
For every , ,
so . Thus is killed by every
functional in . By Corollary 5.3.4, . Hence is -invariant.
Exercise
(C3: Duality without finite dimension)
Let and be arbitrary vector
spaces over , and
.
- (a) Prove that if
is surjective,
then is
injective.
- (b) Prove that if
is injective,
then is
surjective.
- (c) Check (b) on
, , from Example (Dual Maps in Four Settings)
(c): given , find with . Is
injective?
Hint: for (b), use Theorem 1.8.2 in
.
Solution.
(a) By Theorem 5.4.3 (a), which
needs no finite dimension, . A functional vanishing on all of is the zero functional,
so and is injective (Theorem 2.2.3).
(b) Let . By Theorem 1.8.3, has a basis . Since is injective, is one-to-one on , and is linearly
independent: a finite combination with distinct forces (Theorem 2.2.3), hence
all . By Theorem 1.8.2 there
is a basis of .
By Theorem 2.1.6, there
is
with for , and for ; this is well defined because
each element of is for exactly one . Then and are linear and
agree on the basis , so by the uniqueness part of Theorem 2.1.6. Hence
is
surjective.
(c) Here
and , extended to a basis by adding . The recipe gives for and . Then , so . The
dual map is
not injective: by Example (Dual Maps in Four Settings)
(c). This matches the contrapositive of (a): is not surjective,
since , and indeed is a non-zero
functional vanishing on .