Section 1 built the dual space , the space of
linear measurements on . Now we connect
subspaces of with
subspaces of .
A plane in
can be described by a spanning list or by an equation,
and an equation is a functional. This section collects
all the equations that a set of vectors satisfies into
one subspace of , the annihilator,
counts its dimension, and shows that it turns sums into
intersections and intersections into sums.
The
equations a subspace satisfies
Every object comes with its subobjects. The dual
space has
subspaces of its own, and the question is which of them
are attached to subspaces of . The standard example
shows the way.
Let , a plane in . The functional
vanishes on both spanning vectors, so by
linearity it vanishes on all of : the plane satisfies
the equation . So do and the trivial equation . Which functionals
vanish on ? By Theorem 5.1.1 a functional
is . It vanishes on the two spanning vectors if
and only if and , that is, . So the equations
of the plane form the line in .
For the -axis
,
the same computation gives : the equations are , a
plane in . A bigger
subspace satisfies fewer equations, and in both cases
the dimensions add up to . The set of equations
deserves a name, and the pattern deserves a theorem.
The annihilator of a set of vectors is the space
of all linear equations that every one of those vectors
satisfies.
Definition
5.2.1 (Annihilator)
Let be a
vector space over , and let be
any subset. The
annihilator of is
In words:
is a subset of the dual space , not of . A functional belongs
to it when it vanishes at every vector
of ; a single
non-zero value disqualifies it. The set needs no structure: it
may be a subspace, a finite list of vectors, or even
empty. The superscript recalls the value that
the functionals take on .
Well-definedness. The definition
makes sense for every subset. What needs checking is
that the result is a subspace, which is what makes its
dimension meaningful.
Proposition
5.2.1 (The Annihilator Is a Subspace)
Let be a
vector space over , and let . Then is a subspace of
.
Proof. We use the subspace test (Theorem 1.2.1) in
. The zero
functional sends every to , so it lies in . Let
and . For
every , the
pointwise operations of Definition 5.1.2 give
Hence and , and
is a subspace
of .
Example
(First Annihilators)
- (a) For any vector
space , find , and .
- (b) In , find the
annihilator of the single matrix .
- (c) In , find the
annihilator of .
Solution.
(a) Every
functional sends
to (Theorem 2.1.1), so
.
The condition “for all ” holds vacuously, so .
A functional in takes the value
at every vector,
so it is the zero functional, and . These
degenerate cases fix the direction of everything that
follows: the smallest subspace of has the largest
annihilator, and the largest has the smallest.
(b) Let be the dual basis of the standard basis
. By Theorem 5.1.3 (c), every
is . Such a lies in exactly
when . Hence the functionals . It has dimension , and .
(c) Let be the dual basis of , so reads off the
coefficient of .
A functional lies in exactly when ,
that is, when . So :
the only equations satisfied by both and are the multiples of
“the coefficient of is ”.
Non-example by minimal change. Shift
the plane of the opening example off the origin: . The set is still cut out by the
same left-hand side, but takes the value , not , on , so the defining clause
fails and . In fact : the set
contains , and , and a
functional vanishing at these three vectors has .
Annihilators record only homogeneous
equations.
Why this definition. We allow any
subset , not only
subspaces, because subspaces are usually handed to us by
spanning lists, and we want to test a functional on the
list alone. The theorem at the end of this section shows
that this loses nothing: .
The name is literal. To annihilate is to reduce to
nothing, and the functionals in reduce every vector
of to .
Warning. lives in , and it is not a
complement of . It is
tempting to turn the functional into the vector
and to
picture as a
subspace of
“perpendicular” to . Over this picture fails
completely. Let . A functional
vanishes on
exactly when
, that is,
, so .
The functional corresponds to the vector , which lies
in . So the “picture” of
is itself, not a
complement. Perpendicularity needs an inner product,
which is the orthogonal complement of Chapter 11; the
annihilator needs nothing.
The payoff of the definition is the pattern we saw in
the opening example. The equations of a subspace take up
exactly the dimensions that the subspace leaves
free.
Counting
equations
Theorem
5.2.2 (Dimension of the Annihilator)
Let be a
finite-dimensional vector space over , and let be a subspace of . Then More precisely, if is a basis of extending a basis of
, with dual basis
, then is a basis of .
Idea. This is a dimension formula,
so we start from the smallest subspace, , take a basis and
extend it to . The
dual basis now splits in two. The last functionals vanish
on every , by
the delta, so they vanish on . The first do not. To see that
nothing else is in , expand a
functional in the dual basis: its coefficients are
its values on the basis, and the first values are .
Proof. Since is a subspace of the
finite-dimensional space , it has a basis (Theorem 1.6.7, Corollary 1.5.5),
and by the Basis Extension Theorem (Theorem 1.6.5) it
extends to a basis of
, where . Let be the dual basis of (Theorem 5.1.3).
The with lie in . Let and , say . By Theorem 2.1.4, , since for .
They span . Let . By Theorem 5.1.3 (c), because for . Hence , and the reverse inclusion holds
because is a
subspace (Proposition 5.2.1, Theorem 1.3.1).
They are independent, being part of the
basis of . Therefore is a basis of , and . This proves the theorem.
Alternatively, restrict functionals to . The map ,
, is linear, and its kernel is by definition. It
is surjective: given , Theorem 2.1.5 gives
with and , and
then because both agree on a basis of . By the Rank–Nullity
Theorem (Theorem 2.3.1) and Corollary 5.1.4, . This route
shows why the formula holds: a
functional on is
a functional on
plus a choice of values off , and measures that
choice.
The theorem is the second signature move of the
chapter: pass to the dual and count.
One immediate consequence: if is a
proper subspace of a finite-dimensional
, then , so
some non-zero functional vanishes on
. Equivalently, a
list spans a finite-dimensional if and only if the only
functional that kills every vector of the list is : apply the previous
sentence to the span of the list, and note
that a functional kills every vector of the list exactly
when it kills , by
Theorem 2.1.4.
In the whole
computation becomes elimination, because functionals are
rows.
Example
(An Annihilator as a Null Space)
Find a basis of for , and check the dimension
formula.
Solution. By Theorem 5.1.1, every
functional is for a unique . By
linearity, vanishes on
if and only if it
vanishes on the two spanning vectors (a combination of
vectors killed by is killed,
by Theorem 2.1.4). These
two conditions are the matrix whose rows are the
spanning vectors. So if
and only if . Subtracting twice row 2 from row 1
gives the RREF with
free. By Theorem 3.5.4,
. Hence with Check: and . The two spanning vectors are independent
(neither is a multiple of the other), so , and , as Theorem 5.2.2 predicts. As
a by-product, is
the plane : , both have dimension (Proposition 5.1.2), and Theorem 1.6.8 gives
equality.
The same recipe works in general. For , let have rows .
Then , and the isomorphism of Theorem 5.1.1 carries a
basis of
to a basis of .
Away from ,
counting often replaces the computation entirely.
Example
(The Equations of a Root Condition)
Let . Find .
Solution. Let ,
a linear functional (Example (Four Families of Functionals)).
By definition , so .
Since , , and Proposition 5.1.2 gives
.
By Theorem 5.2.2, .
Now is a
subspace of
(Proposition 5.2.1) of
dimension , so
by Theorem 1.6.8.
We never found a basis of and never solved an
equation. The conclusion is concrete: a functional on
vanishes on every polynomial with a root at only
if it is a multiple of .
Quick check. Let . What is ? Name a basis of without solving a
system.
Solution. by
Theorem 5.2.2. The
functionals
and vanish at
, hence on
, and they are
independent: in , the coefficient of gives , and then . Two independent
vectors in a -dimensional space form
a basis (Theorem 1.6.4).
Sums,
intersections and spans
Taking annihilators reverses inclusions: more vectors
satisfy fewer common equations. It also exchanges sums
with intersections. In , let be the -plane and the -plane. Then and
,
writing for
the coordinate functionals. The intersection is the -axis, with annihilator
. The sum has annihilator .
The theorem says this always happens.
Theorem
5.2.3 (Properties of Annihilators)
Let be a
vector space over .
- (a) If , then .
- (b) For every subset
,
.
- (c) For subspaces
of , .
- (d) If is
finite-dimensional, then for subspaces
of , .
Idea. Parts (a)–(c) are unwinding
definitions: fix a functional in one side and test it on
the vectors of the other. In (d), the inclusion is also direct. The reverse inclusion is
the hard half. Given vanishing on
, we would
have to split it as with killing and killing , and nothing in sight
tells us how. So we count instead: one inclusion plus
equal dimensions gives equality. The plan is ① compute
by the dimension formula for sums inside ; ② replace by using (c); ③
turn every annihilator dimension into a dimension in
with Theorem 5.2.2; ④ recognize
the dimension formula in . Finite dimension is
spent in step ③.
Proof.
(a) Let . Every
lies in
, so . Hence
.
(b) Since (Theorem 1.3.1), part
(a) gives . Conversely, let and
, say
with and . By Theorem 2.1.4, . Hence .
(c) Since and
(Theorem 1.7.1), part
(a) gives and , so . Conversely,
let , and let with , . Then . Hence .
(d) Let
with
and ,
and let . Since and , . Hence .
Let
. The
subspaces , , (Theorem 1.2.2) and
(Theorem 1.7.1) of
are
finite-dimensional by Theorem 1.6.7. The
space has
dimension by Corollary 5.1.4, so its
subspaces ,
are
finite-dimensional too. By the Dimension Formula for
Sums (Theorem 1.7.3) in
, then (c),
By Theorem 5.2.2 applied to
, and , the right-hand
side is where the last equality is Theorem 1.7.3 in
. By Theorem 5.2.2 once more,
. So is a
subspace of (by and Theorem 1.7.1) with
the same finite dimension, and Theorem 1.6.8 gives
. This proves the theorem.
Part (b) is what made the computations of this
section legitimate: to find the annihilator of a
subspace, test functionals on a spanning list only.
Parts (c) and (d) form a dictionary. A subspace given as
a sum has equations obtained by
intersecting equation spaces; a
subspace given as an intersection has
equations obtained by adding them.
Later in this chapter this dictionary becomes a
practical method for computing sums and intersections of
subspaces.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define the
annihilator
of a subset of a
vector space .
- (b) True or false:
is a subspace
of . Justify your
answer.
- (c) Let be a -dimensional subspace of
. What is
?
- (d) For a
finite-dimensional , what are and ?
- (e) True or false:
if
are subspaces of a finite-dimensional , then .
Justify your answer.
- (f) To compute for , which matrix do you row reduce,
and why?
B. Practice
Exercise
(B1: Computing annihilators)
- (a) Let . Find a basis
of , and
verify that .
- (b) Let . Show that , where .
Solution.
(a) Let have the three
spanning vectors as rows. As in Example (An Annihilator as a Null Space),
if and only if . Subtracting
times row 1 from
row 2 and row 1 from row 3 gives rows , , ; subtracting
row 2 from row 3 and then row 2 from row 1 gives the
RREF The free variables are and , and Theorem 3.5.4 gives
. Hence has the basis Check on the first two spanning vectors: ,
, , ; the third vector is
their difference, . The RREF has two pivots, so
(Theorem 3.5.5), and
.
(b) By definition
.
Independent: if , applying it to gives and applying it to
gives . Dimension of
: the map
, , is linear with kernel , and its image contains
and , which span . So and by Theorem 2.3.1. By Theorem 5.2.2, . Hence the
-dimensional
subspace of is all of (Theorem 1.6.8).
Exercise
(B2: Equations of the symmetric matrices)
Let . Find , and verify the
dimension formula.
Solution. Every symmetric matrix is
, so . Let be the
dual basis of the standard basis, so that every is
with
(Theorem 5.1.3 (c)). By Theorem 5.2.3 (b), if and
only if kills
the three spanning matrices: So ,
and : the
only equation of the symmetric matrices, up to scaling,
is . The three spanning matrices are independent
(they involve disjoint sets of entries), so , and .
Exercise
(B3: The equations of a hyperplane)
Let be a
finite-dimensional vector space over , and let be
non-zero. Prove that .
Solution. By definition of the
kernel,
vanishes on , so , and by Proposition 5.2.1. Since
,
, and Proposition 5.1.2 gives
. By Theorem 5.2.2, . A -dimensional subspace of
a -dimensional
space is the whole space (Theorem 1.6.8), so
.
C. Going deeper
Exercise
(C1: The intersection formula without counting)
Let be
subspaces of a vector space over , and let .
- (a) Suppose is finite-dimensional.
Construct and with , without using any dimension
formula.
- (b) Explain how to
modify the construction when is
infinite-dimensional. Deduce that holds in every vector space.
Hint: extend a basis of to a basis of
and, separately,
to a basis of .
Solution.
- (a) Let be a
basis of
(Theorem 1.2.2, Theorem 1.6.7).
Extend it to a basis of and to a basis of
(Theorem 1.6.5).
The combined list is independent.
Let . Then lies in and in , hence in , so for some . Since is a basis of
, all and are . Then , and since is a basis of , all and are .
Extend the combined list to a basis of by vectors (Theorem 1.6.5). By
Theorem 2.1.5 there is
with
Then
kills a basis of ,
so
(Theorem 5.2.3 (b)). Put
. Then , because and ; and . So kills a basis of
, and . Hence
.
- (b) Replace the
finite lists by sets. By Theorem 1.8.3, has a basis
, and by Theorem 1.8.2 it
extends to a basis of and
to a basis
of , with . First, : a
vector of
lies in , which contradicts the independence of . So every vector
of
lies in exactly one of , , . A linear relation
among finitely many distinct vectors of splits
into an -part, a
-part and a -part, and the
independence argument of (a) applies word for word; so
is
independent. By Theorem 1.8.2 it
extends to a basis of . Every is a finite
combination of distinct vectors of , with unique
coefficients because is independent. Define
a finite sum over the vectors of that occur. Adding or
scaling expansions gives expansions, so by uniqueness
the coefficients add and scale, and is linear. It
vanishes on and agrees with on , so the rest of (a) is
unchanged: and kills the basis of . Together with the
inclusion of Theorem 5.2.3 (d), which
used no finiteness, this gives in every vector space.
Exercise
(C2: Equations of a double root)
Let , and let
and . Prove that . Deduce that does not vanish on
.
Solution. Both and are linear
(evaluation, and differentiation followed by
evaluation), and they vanish on by definition.
Independent: if , applying it to gives , and applying it to
gives . Dimension of
: the linear
map , , has kernel , and , , so
is surjective. By
Theorem 2.3.1, , and
by Theorem 5.2.2, . The -dimensional subspace
of is therefore all of
(Theorem 1.6.8).
For the deduction, suppose . Then
. Applying both sides to gives , so ; applying them to
gives , so . Then . But
and , a contradiction. Hence . Check
with an explicit witness: has .
Exercise
(C3: Dual of a direct sum decomposition)
- (a) Let be finite-dimensional
with . Prove that .
- (b) In , let and
.
Write as with and .
Solution.
(a) Since the sum
is direct, (Theorem 1.7.4), and
. By Theorem 5.2.3 (c) and Example (First Annihilators)
(a), . By Theorem 5.2.3 (d), . So ,
and the sum is direct by Theorem 1.7.4.
(b) A functional
vanishes on
if and only
if , so . It
vanishes on
if and only if , so . Solving gives
and , so : By (a) this decomposition is unique.