A subspace of
gives two new
vector spaces:
itself, and the quotient of Chapter 4. Each
has a dual space, and so far and have nothing to
do with . This
section connects them. The answer is a swap: the dual of
the quotient is a subspace of , namely the
annihilator ,
and the dual of the subspace is a
quotient of , namely . Both
identifications come from the First Isomorphism Theorem,
and neither needs a basis. At the end we use them to
describe hyperplanes, the subspaces cut out by a single
equation, in any dimension.
Restricting
functionals to a subspace
Let be a
subspace of . A
functional measures every vector of , so in particular it
measures the vectors of . Forgetting the rest
gives the restriction , , which is a functional on . This defines the
restriction map It is not a new kind of map. Let ,
, be
the inclusion. Its dual map (Definition 5.4.1) sends
to , and
. So , and in
particular is
linear.
Two questions decide what does. Which
functionals restrict to zero? By Definition 5.2.1, exactly
those in . And
does every functional on come from one on ? That is an extension
problem, and it has a positive answer in every
dimension.
Theorem
5.5.1 (Dual of a Subspace)
Let be a
vector space over , of any dimension, and
let be a subspace
of . The
restriction map , , is linear and surjective, and . Hence
is a well-defined isomorphism, and .
Idea. The kernel is the definition
of read
aloud. The real content is surjectivity: given on , we must extend it to
all of . A basis
tells us how. Extend a basis of to a basis of ; a linear map may be
prescribed freely on a basis, so declare the extension
to agree with
on the basis of
and to be on the
new basis vectors. Then the First Isomorphism Theorem
turns “surjective with kernel ” into the
isomorphism.
Proof. We saw above that is
linear. For , means
for
every ,
which is by Definition 5.2.1. So .
Surjective. Let . By Theorem 1.8.3, has a basis . It is a linearly
independent subset of , so by Theorem 1.8.2 there
is a basis of
with . By Theorem 2.1.6 there is
a linear map with Then and are linear maps
that agree
on the basis of
, so by the
uniqueness part of Theorem 2.1.6. Thus
, and is surjective. (If
is
finite-dimensional, the finite versions Corollary 1.5.5, Theorem 1.6.5 and Theorem 2.1.5 suffice,
and no choice principle is needed.)
By the First Isomorphism Theorem (Theorem 4.4.7),
is a well-defined isomorphism
. Since and , this is
the claimed isomorphism.
In words: a functional on is a functional on
, up to adding
something that vanishes on . Two
extensions of the same differ by an element
of , and every
element of
can be added.
When is
finite-dimensional, taking dimensions recovers the count
of this chapter. By Corollary 5.1.4, and
, and by Theorem 4.4.5,
. So the isomorphism says , which is Theorem 5.2.2 again.
Functionals
on a quotient
Now the other space. A functional on measures cosets.
Composing with the quotient map ,
,
turns it into a measurement of vectors, .
This functional on cannot tell apart two
vectors in the same coset, so in particular it is zero
on . The theorem
says that nothing is lost and nothing else appears: the
functionals on
are exactly the functionals on that vanish on .
Theorem
5.5.2 (Dual of a Quotient)
Let be a
vector space over , of any dimension, let
be a subspace,
and let be the quotient map. Then the dual map
is injective, and its image is . Hence is an
isomorphism from onto , and .
Idea. Injectivity uses only that
is surjective:
if
is zero, then
is zero on every coset. For the image, one inclusion is
“ kills ”. The other inclusion
asks us to build a functional on from a functional on
that vanishes on
, and that is
exactly what the universal property of the quotient
does.
Proof. The map is linear by Definition 5.4.1.
Injective. Suppose . Every element of is for some , because is surjective (Theorem 4.4.4
(c)). Then for every , so . By Theorem 2.2.3, is
injective.
. For , is the zero
vector of , so
. Hence .
. Let . Then
, so by Theorem 4.4.10
(a) there is a linear map
with . This lies in , and .
So is
an injective linear map with image ; regarded as a map
onto it is a
linear bijection, hence an isomorphism.
Concretely, the inverse isomorphism is
, where . The formula is well defined
precisely because vanishes on : if , then
.
The two theorems fit together as a mirror:
| its dual is |
a quotient of : |
a subspace of : |
| the map |
:
restrict |
:
compose with |
| the map is |
surjective |
injective |
The last row is no accident: is injective and
is surjective,
and dualizing swaps the two properties.
Alternatively, in finite dimension
both theorems follow from Theorem 5.4.3, which says
and . For : , whose
annihilator is , and , so is injective
with image .
For :
, so
, and , whose annihilator is all of
, so is surjective.
The proofs above avoid dimension counts, which is why
they work in every dimension.
Quick check. Let be a vector space of
dimension and
a subspace of
dimension . Find
, , and , and
check that the two theorems are consistent with these
numbers.
A line in
, in
coordinates
The theorems name their isomorphisms without choosing
anything. To see them act, we now choose bases and
compute. Recall that a functional on is determined by
its values on (Theorem 5.1.1). So every
has the form , with . We write such a functional
simply as .
Example
(Both isomorphisms for a line)
Let and .
- (a) Find a basis of
.
- (b) Find a basis of
, its dual
basis of , and the
images .
- (c) Describe the
restriction map and the isomorphism .
Solution.
(a) By Theorem 5.2.3 (b), , so
exactly when , that is,
. Taking
and
gives They are independent (look at the coefficients
of and ), and by
Theorem 5.2.2, so is
a basis of
(Theorem 1.6.4).
(b) The list
is
independent: in , the third
entry gives ,
and then .
It has length 3, so it is a basis of , and by Theorem 4.4.5
is a basis of . Its dual basis
consists of the with (Theorem 5.1.3).
The functional on takes the values
at ,
at ,
and
at . Writing it
as ,
this says ,
and , so . Similarly has
, , . Hence So carries the dual
basis of onto the
basis of
found in (a), as Theorem 5.5.2 predicts.
Read backwards: and . These are well defined, since adding changes
by and by .
- (c) The space is one-dimensional,
with basis the functional determined by (the dual
basis of ). A
functional restricts to , since both sides take the value
at . So is “evaluate at
”. Its kernel is
, and it is surjective, since . The
isomorphism of Theorem 5.5.1 is For instance , because ; both restrict to .
Why
“natural” matters here
In the example, bases entered only when we wanted
numbers. The maps and were defined
before any basis was chosen: restrict a functional, or
compose it with . That is what makes
the two isomorphisms natural, in the
sense of the discussion of the double dual. They are
part of the structure of and , not of a coordinate
system.
There is a tempting shortcut that is
not natural. Since is a quotient of
, one might
try to find a copy of
inside , as a subspace.
This can be done, but only by making a choice. Pick a
complement of
, so . A
functional that vanishes on is determined by its
values on , so the
restriction
maps
isomorphically onto (Exercise (C2: Complements and a choice of copy of )). But
different complements give different subspaces .
Warning. is not a subspace
of .
Its elements are functionals on , which cannot be
evaluated at vectors outside . To place inside one must extend
each functional, and extensions are not unique. In the
example above, the complement
of gives , while
gives . These are different lines in , and both
restrict isomorphically onto : and . The
choice-free statement is ,
a quotient.
The same caution applies on the other side, in
reverse.
is naturally a subspace of , namely , but itself is not a
subspace of .
Duality turns the quotient, which has no natural home
inside , into a
subspace, which does.
Codimension
and hyperplanes
The quotient measures how far a subspace is from
filling the whole space. In a plane through the
origin misses “one direction” and a line misses “two
directions”. For finite-dimensional the number of missing
directions is . But this formula is useless in , where and may both be
infinite, although misses only one direction: every
polynomial is a constant plus an element of . The quotient gives the
right number in every case.
The codimension of counts the directions
in that is missing.
Definition
5.5.1 (Codimension)
Let be a
subspace of a vector space over . If is
finite-dimensional, the codimension of
in is If is
infinite-dimensional, we say that has infinite
codimension.
In words: we do not compare the sizes of and . We collapse to zero and measure
what is left. The codimension depends on the ambient
space, so when that is unclear we write “codimension of
in ”.
Definition
5.5.2 (Hyperplane)
A hyperplane in is a subspace of of codimension
exactly , that is, with .
Examples.
- Finite dimension. If is finite-dimensional,
then by Theorem 4.4.5.
The hyperplanes of are its subspaces of
dimension :
the lines through in and the planes
through in .
- Trace. In with , the trace-zero
matrices are the kernel of .
This map is linear and onto, since , so
by Theorem 4.4.7,
and the trace-zero matrices form a hyperplane.
- Polynomials. In , let .
Evaluation at is
a linear map with kernel , and it is surjective
because the constant maps to . By Theorem 4.4.7,
, so
is a hyperplane
in the infinite-dimensional space . In the same way
has codimension 2 (Exercise (B3: Dimension computations)).
- Degenerate cases. , since is the zero space,
and when
is finite-dimensional. In particular itself is
not a hyperplane, and the only
hyperplane of a one-dimensional space is . The zero space
has no
hyperplanes at all.
Non-example by minimal change. In
, the plane
is a hyperplane. Replace it by the line . It is still a subspace, but
its codimension is , so the clause “codimension
exactly 1” fails. Replace it instead by
: now it is not a subspace at all, so it has
no codimension. It is a coset of a hyperplane, an object
we return to in the next section.
Why this definition. Codimension is
the dual notion of dimension, and the duality theorems
make this precise. If has finite codimension,
then by Theorem 5.5.2, Corollary 5.1.4 and Theorem 2.5.4, and this holds even when is
infinite-dimensional. So dimension counts
vectors, and codimension counts independent
equations. For finite-dimensional this is Theorem 5.2.2 again: .
Warning. In infinite
dimension a hyperplane need not be “smaller” than the
whole space. In , the hyperplane
is isomorphic to itself, via : this map is
linear, injective (if then ) and onto . So you cannot detect
codimension by comparing with up to isomorphism, and
the formula must never be used outside finite
dimension. Always compute , or count
equations.
Hyperplanes are exactly the subspaces cut out by
one non-trivial linear equation. In
this is
familiar: with the not all zero defines
a subspace of dimension . The quotient makes the statement true in
every dimension.
Theorem
5.5.3 (Hyperplanes Are Kernels of
Functionals)
Let be a
vector space over , of any dimension, and
let be a subspace
of . Then is a hyperplane if and
only if for some non-zero
.
Idea. A non-zero functional maps
onto the one-dimensional space , so the First
Isomorphism Theorem makes
one-dimensional. Conversely, if is one-dimensional,
it “is” after
choosing an isomorphism, and composing that isomorphism
with gives a
functional whose kernel is .
Proof. Suppose
is non-zero. Then is a subspace of (Theorem 2.2.2)
containing a non-zero scalar, so , and by Theorem 1.6.8. By Theorem 4.4.7,
, so ,
and is
a hyperplane.
Suppose . By Theorem 2.5.4 there is
an isomorphism . Let , where is the quotient map. It is
linear as a composition of linear maps (Theorem 2.4.2), so
.
For , means
,
which holds exactly when is the zero coset, since is injective; and
means
by Lemma 4.4.3 (b).
So .
Finally : since , we have , so some .
The functional is not unique, but almost: two
functionals with the same kernel are scalar multiples of
each other (Exercise (C1: Functionals with the same kernel);
Exercise (B2: Functionals with the same kernel)
gives a second proof). So hyperplanes of correspond to non-zero
functionals up to a non-zero scalar,
just as the plane is also .
A hyperplane together with any one vector outside it
fills the space.
Quick check. Decide which of the
following are hyperplanes, and for each hyperplane give
a non-zero functional with that kernel.
- (a) The symmetric
matrices in .
- (b) The symmetric
matrices in .
- (c) in .
Solution.
(a) Yes. is symmetric exactly
when , so the symmetric matrices are the kernel of
, which is linear and non-zero (it takes
the value at
). By Theorem 5.5.3 this is a
hyperplane.
(b) No. The
symmetric matrices form a subspace of dimension (choose the entries on
and above the diagonal freely), so the codimension is
.
(c) Yes. It is
the kernel of , which is linear (Theorem 0.8.5) and
non-zero (it sends the constant to ).
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) State the
theorem identifying with a subspace
of , including
the map.
- (b) Define the
codimension of a subspace, and define a hyperplane.
- (c) True or false:
is a subspace
of . Justify
your answer.
- (d) Let be a subspace of
dimension in
. Find and
.
- (e) Is a hyperplane in ? Justify your
answer.
- (f) True or false:
every non-zero linear functional is
surjective. Justify your answer.
Solution.
(a) For a
subspace of with quotient map , the dual map , , is injective with image ; so (Theorem 5.5.2).
(b) If is
finite-dimensional, ; otherwise has infinite
codimension. A hyperplane is a subspace of codimension
exactly .
(c) False.
Elements of
are defined only on , so they are not
elements of .
What is true is , a quotient (Theorem 5.5.1).
(d) , by Corollary 5.1.4 and Theorem 4.4.5. So
.
(e) No. The
subspace is , of dimension 2, so its codimension is
.
(f) True, in any
dimension. This is Proposition 5.1.2: is a subspace
of the one-dimensional space containing a non-zero
element, so it is .
B. Practice
Exercise
(B1: The dual of a quotient of )
Let , and write
functionals on as .
- (a) Find a basis
of .
- (b) Let be the functionals with . Compute and at the coset .
- (c) Find a basis of
whose dual
basis is .
Solution.
(a) A functional
lies in
exactly when it vanishes at both spanning vectors (Theorem 5.2.3 (b)), that
is, The second gives , and the
first gives . Taking and gives and , that is,
Check: , , , . They are independent
(compare the coefficients of and ). The spanning
vectors of are
independent (compare first entries, then second), so
by Theorem 5.2.2, and is
a basis by Theorem 1.6.4.
(b) By Theorem 5.5.2, . So and .
(c) We need
cosets
with . The vector has and
, and has ,
. Put and . If , applying and gives and ; so is
independent, and since it is a
basis (Theorem 1.6.4). By
construction , so is its
dual basis (Theorem 5.1.3).
Exercise
(B2: Functionals with the same kernel)
Let be a
vector space over , of any dimension, and
let be non-zero. Prove that if
and only if for some non-zero . (Exercise (C1: Functionals with the same kernel)
proved by a
different route; here use the hyperplane
decomposition.)
Hint: the remark after Theorem 5.5.3.
Solution. If with
, then if and only
if , if and only if , since
is invertible. So
.
Suppose . Since , choose
with ; then
, so
also . Put , which is non-zero,
and . Then vanishes on , because both and do, and . By Theorem 5.5.3 is a hyperplane, and by
the remark after it . A linear map vanishing on
and on vanishes on every
, hence
on . So , that is, .
Exercise
(B3: Dimension computations)
- (a) Let and . Find , , and .
- (b) In , let
. Using the map , , find
and , and write as an intersection of
two hyperplanes.
- (c) Hence find a
basis of
consisting of evaluation functionals.
Solution.
(a) by Corollary 5.1.4. by
Theorem 5.2.2, so (Theorem 4.4.5),
consistent with Theorem 5.5.1. , consistent with Theorem 5.5.2, and .
(b) is linear because
evaluation is (Theorem 0.8.5), and
. It is
surjective: and span . By Theorem 4.4.7,
, so
, and
by Theorem 4.4.5.
Writing and ,
we have , and
both kernels are hyperplanes by Theorem 5.5.3, since both
functionals send
to .
(c) Both and lie in
. They are
independent: if , evaluating at gives , and then
evaluating at
gives . Since
, is a basis of (Theorem 1.6.4).
C. Going deeper
Exercise
(C1: Subspaces of finite codimension are intersections
of hyperplanes)
Let be a
vector space over , of any dimension, and
let be a subspace
of finite codimension .
- (a) Prove that there
are non-zero with . Deduce that is an intersection of
hyperplanes.
- (b) Prove that is not an intersection
of fewer than
hyperplanes.
Hint: for (a), take a dual basis of ; for (b),
consider the map , .
Solution.
- (a) Let be
the quotient map. Since , choose a
basis of and let
be its dual basis (Theorem 5.1.3). Put . By Theorem 5.5.2, , and
because is
injective and .
Since each lies in ,
for each .
Conversely, let ,
and write . Applying gives for every . So is the zero coset,
and by Lemma 4.4.3 (b).
This proves . Each is a
hyperplane by Theorem 5.5.3.
- (b) Suppose with hyperplanes . By Theorem 5.5.3, for
non-zero . The map , , is linear, since each entry is,
and . By Theorem 4.4.7,
, a
subspace of .
Hence by Theorem 1.6.7. So at
least hyperplanes
are needed.
Exercise
(C2: Complements and a choice of copy of )
Let be
finite-dimensional, and let be subspaces with
.
- (a) Prove that without using Theorem 5.2.3 (d). (This
is Exercise (C3: Dual of a direct sum decomposition)
(a), which used it.)
- (b) Deduce that the
restriction map restricts to an isomorphism
.
- (c) In , let , and
. Find and , and find the
element of each that restricts to the functional with . Conclude
that the copy of inside depends on the
complement.
Solution.
(a) Let . If , then vanishes on and on , hence on every , that is, on
; so . By Theorem 5.2.2, , using
for a direct sum (Theorem 1.7.4). By
Theorem 1.7.3, , so (Theorem 1.6.8), and
the sum is direct because the intersection is .
(b) The
restriction of
to is linear.
Its kernel is by Theorem 5.5.1 and (a), so
it is injective. Its domain has dimension . An injective linear map between spaces
of the same finite dimension is an isomorphism (Corollary 2.3.2
(e)).
(c) Write
functionals on as . consists of those
with , so
.
consists of
those with , so . Restricting to : and both take the
value at , so both equal . The elements and are different, so
the subspaces of are two different
copies of ,
one for each complement.