Every vector space comes with its field, and we have
already seen that the field matters: but
(Example (Dimensions of the Running Examples)).
This section explains the pattern behind that example.
Shrinking the field multiplies the dimension by a fixed
factor, the tower law. Going the other
way, every real vector space can be enlarged to a
complex one, its complexification,
without changing the dimension. Both moves are used
later, most of all when real matrices need complex
eigenvalues.
Restricting
the scalars
Start with the standard example. The space over has the basis , so its
dimension is . But
nothing stops us from multiplying vectors of only by
real numbers. The addition is the same,
and the axioms still hold, because they hold for all
complex scalars. So is also a vector
space over .
What is its dimension now?
Example
( as a Real
Vector Space)
Show that is a basis of over , and write in
it.
Solution. Spanning. Let
and write with . Then
a combination with real
coefficients. For example, .
Independence. Let with . The
left side is . Each entry is , and comparing real and
imaginary parts (Definition 0.6.1)
gives .
Hence .
The general setting has a big field , a smaller field inside it, and a vector
space over .
Definition
1.9.1 (Subfield, Restriction of Scalars,
Degree)
Let be a
field. A subfield of is a subset that
contains and
and is closed
under addition, multiplication, negatives, and inverses
of non-zero elements.
Let be a
subfield of , and
let be a vector
space over .
Keeping the addition of and using scalar
multiplication only for scalars in makes a vector space
over . We say is obtained by
restriction of scalars.
In particular
itself, a vector space over , is a vector space over
. If it is
finite-dimensional, its dimension is the
degree .
In words: a subfield is a field sitting inside with the same
operations. Restriction of scalars forgets how to
multiply by elements of outside .
There are two things to check. First, with the operations of
is a field.
Closure makes the operations land in , the elements , negatives and
inverses are in
by assumption, and the remaining axioms are identities
that hold for all elements of , so in particular for
those of . Second,
over is a vector space.
Scalar multiplication lands in , and each axiom of Definition 1.1.1
holds for all scalars in , so in particular for
all scalars in .
We always write or when both fields are in play.
Example
(Degrees of Some Fields)
Find , and for any field . Is defined?
Solution. .
Every is
with , and forces by Definition 0.6.1. So
is a basis
of over .
. The set is a subfield of by Example ( Is a Field).
The list spans it over by definition. For
independence, let with . If , then , contradicting Theorem 0.2.3. So
, and then
.
. The list is a basis of over : every equals , and forces
. This
degenerate case says that restricting to the same field
changes nothing.
is not defined, because is not
finite-dimensional over (Theorem 1.8.6).
Restriction only goes down. The set
with the
operations of
is not a vector space over : everything about
addition works, but scalar multiplication leaves the
set, since . Enlarging the field needs a
construction, which is the second half of this
section.
The tower
law
In Example ( as a Real Vector Space)
we took a vector, wrote it in coordinates over , and then split each
complex coordinate into real coordinates. The same
two-stage process works for any fields.
Theorem
1.9.1 (Tower Law)
Let be a
subfield of , and
let be a vector
space over .
Suppose is a basis of over and is a
basis of over
. Then the list of
the vectors
is a basis of over . In particular,
Idea. Coordinates in two stages. A
vector is an -combination of the
; each -coefficient is a -combination of the
. Substituting
gives a double sum with . For
independence, run the same two stages backwards: regroup
the double sum by , use independence over
, then
independence over .
Proof. Throughout we use two axioms
of Definition 1.1.1 for
scalars in : and .
Spanning. Let . Since spans over , there are
with . Since spans
over , for each there are with . Therefore where the second equality uses and the third uses . This is a -linear combination of
the vectors .
Independence. Let with . Reading the display above
from right to left, Each coefficient lies in
, and is
independent over .
Hence for every . For each fixed , this is a -combination of equal
to , and that list
is independent over . Hence for all and .
So the
vectors
form a basis of
over , and .
The name comes from the picture of fields stacked in
a tower, , with
on top: dimensions multiply as you go down. The most
important case is .
Theorem
1.9.2 (Complex Spaces as Real Spaces)
Let be a
vector space over with basis . Then
is a basis of over . In particular .
This is the result of Exercise (C2: A complex space viewed over the reals),
now as a case of the tower law. For example, , and
, with basis .
Warning. A subset of can be a subspace
over without
being a subspace over . The real vectors
contain and are closed under
addition and under multiplication by
real scalars, so they form an -subspace of dimension
. But and , so
is
not a -subspace. Always ask:
a subspace over which field?
Quick check. What is ? What is ?
Complexification
Now go up. A real matrix such as the rotation moves every non-zero
vector of off
its own line. In , however, it sends
to . To use
such complex vectors for an arbitrary real space , not just , we need a complex
space that contains the way contains .
The model is itself. Every splits as
with
,
its real and imaginary parts, taken entry by entry.
Multiplying by with gives The right side only uses real scalars acting
on real vectors. So we can copy it for any real space,
exactly as was
built from pairs of real numbers in Definition 0.6.1.
The complexification of is the space of formal
expressions with , multiplied by complex numbers the way the
rules of algebra dictate.
Definition
1.9.2 (Complexification)
Let be a
vector space over . The
complexification of is the set with addition and scalar multiplication by
defined,
for all and , by We write for , and for .
In words: addition is entry by entry. Multiplication
by is the
formula forced by . The notation is honest: , by Theorem 1.1.5 and Theorem 1.1.6, so
. Also a real scalar acts
entrywise: . So , restricted to real
scalars, is just two copies of .
Why is a vector space
over .
The operations land in . Addition is entrywise, so
(commutativity, associativity, zero, negatives) follow
from the same axioms in each entry of , with zero and negative
. We
check the scalar axioms that involve the multiplication
of ; below,
means
, which
is the same by Theorem 1.1.8. Let
and
with
,
and .
- : we
get , since by Theorem 1.1.5.
- : since , the axioms of give Since , this is .
- : with ,
The remaining axiom, , is Exercise (B3: Working in a Complexification).
Here is the payoff: complexifying keeps the
dimension, and even keeps the basis.
Theorem
1.9.3 (A Real Basis Is a Complex Basis of the
Complexification)
Let be a
vector space over with basis . Then
, that is, , is a basis of over . In particular .
Idea. A complex coefficient on puts into the real
part and
into the imaginary part. So one complex combination of
the is the
same as two real combinations, one for each part, and
both questions (spanning, independence) split into two
real questions about .
Proof. For and , Definition 1.9.2 and
Theorem 1.1.6 give
Call this identity (∗).
Spanning. Let . Since
spans , there are
with and . By (∗) and entrywise addition,
Independence. Let with , and write
with . By the same computation, . Since is
independent over , all and all . Hence every
.
Therefore is a basis of , and .
As a consistency check, restricting back to gives by Theorem 1.9.2, which
matches the fact that over is two copies of
. The same proof
works word for word for an infinite basis set, since
every combination involves finitely many vectors.
Example
(The Complexification of Is )
Show that the map , from to , is a bijection
that respects addition and multiplication by complex
scalars.
Solution. Here is computed in
: its -th entry is . Every has unique
real and imaginary parts entry by entry (Definition 0.6.1), so
exactly one pair of real vectors maps to . Hence the map is a
bijection.
Addition is entrywise on both sides, so it is
respected. For scaling, let . In , , which maps to the vector with
entries . In , the -th entry of is
The two agree, so the map respects scalar
multiplication. It sends the basis of
from Theorem 1.9.3 to the
standard basis of .
So
is in
disguise; in Chapter 2 such a bijection will be called
an isomorphism. In the same way is , and is
. The
construction earns its keep in Chapter 9, where real
matrices without real eigenvalues, like the rotation
above, get complex ones, and in Chapter 12, in the
spectral theory of real operators.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define the
degree of a
subfield .
- (b) State the Tower
Law.
- (c) What is ? Give a
basis.
- (d) True or false:
every -subspace
of is an
-subspace.
Justify your answer.
- (e) What is ?
Solution.
(a) , where
is regarded as a
vector space over
by restriction of scalars (Definition 1.9.1),
when this dimension is finite.
(b) See Theorem 1.9.1: if
is a basis of
over and is a basis of
over , then is a basis of
over , so .
(c) , with basis , by Theorem 1.9.2.
(d) True. A -subspace contains
, is closed under
addition, and is closed under multiplication by every
complex number, in particular by every real
number.
(e) : (Example (Dimensions of the Running Examples)),
and Theorem 1.9.3 keeps
the dimension.
B. Practice
Exercise
(B1: A Tower over )
Find and a basis of over .
Solution. By Example ( Is a Field),
is a
field, so is a vector
space over it with basis and
dimension (Example (Dimensions of the Running Examples)).
By Example (Degrees of Some Fields),
is a
basis of over the
subfield . By Theorem 1.9.1, is a basis of over . Hence .
Exercise
(B2: Complex Matrices over )
Let be the matrix units of . Find a basis of
over , and write in it.
Solution. The matrix units form a
basis of
over (Example (Standard Bases)).
By Theorem 1.9.2, is a basis of over , so .
Splitting each entry of into real and
imaginary parts,
Exercise
(B3: Working in a Complexification)
Let be a
vector space over .
- (a) Verify that
for all and .
- (b) In ,
compute from Definition 1.9.2,
and compare with the product
computed in .
Solution.
(a) Let with
, and .
Then , and by the distributive
law in and Theorem 1.1.8, where we also rearranged the sums using
commutativity and associativity of addition in . The right side is
.
(b) Here , , and . Then and . So the product is . In
, , the
same answer.
C. Going deeper
Exercise
(C1: When Is a Real Subspace Complex?)
Let be a subspace over .
- (a) Prove that is a subspace over
if and only if
for every
.
- (b) Deduce that if
is a subspace
over , then
is
even.
- (c) Show that is a subspace over of even real
dimension that is not a subspace over
. So the
converse of (b) fails.
Solution.
- (a) If is a -subspace, it is
closed under multiplication by .
Suppose
for every .
We use Theorem 1.2.1 over
. Since is an -subspace, and is closed under
addition. Let and with . Then and , because is closed under real
scalars, and by the axioms of . This lies in by closure under
addition. Hence
is a -subspace.
(b) is a subspace of the
finite-dimensional -space , so by Theorem 1.6.7 it is
finite-dimensional over , and by Corollary 1.5.5 it
has a basis over , of some length . Restricting the
scalars of to
gives the same
real space as before, so by Theorem 1.9.2.
(c) Write with . Then , so is the -span of and is
an -subspace by
Theorem 1.3.1. The
list is independent over :
gives ,
so . Hence
.
But
while , because . By
(a), is not a
-subspace.
Exercise
(C2: A Tower of Degree Four)
Let .
- (a) Prove that .
- (b) Regard as a vector space
over its subfield . Prove that
is a subspace
with basis .
- (c) Deduce that
,
with basis .
Hint for (a): square both sides, and argue with
remainders on division by 3.
Solution.
- (a) First, there are
no integers
with , not
both divisible by , and for . Indeed,
if , then
and
leaves remainder on
division by ,
while leaves
remainder . So
, say . Then , so , and the same
remainder argument (a square not divisible by leaves remainder ) gives , a
contradiction.
Now suppose with . Squaring, . If , then , contradicting
Theorem 0.2.3. If
, then ; writing in lowest terms
gives
with not both
divisible by ,
which is impossible. If , then , and in lowest terms gives , also
impossible. Hence .
- (b) is a subfield
of by Example ( Is a Field),
so is a vector
space over it by restriction of scalars. We use Theorem 1.2.1. (1)
. (2) , since is closed
under addition. (3) For , , since is closed
under multiplication. So is a subspace.
The list spans by the definition of
. For
independence, let with . If , then
and , contradicting (a). So , and then . Hence is a basis
and .
- (c) By Example (Degrees of Some Fields),
is a
basis of over . By Theorem 1.9.1
applied to and the -space , the list is a basis of over . Hence .