Linear Algebra

Hoffman & Kunze

2nd edition

Answers and Solutions to Problems and Exercises

Typos, comments and etc...

Gregory R. Grant
University of Pennsylvania
email: [email protected]

Julyl 2016
2

Note

This is one of the ultimate classic textbooks in mathematics. It will probably be read for generations to come. Yet I
cannot find a comprehensive set of solutions online. Nor can I find lists of typos. Since Im going through this book in some
detail I figured Id commit some of my thoughts and solutions to the public domain so others may have an easier time than I
have finding supporting matericals for this book. Any book this classic should have such supporting materials readily avaiable.

If you find any mistakes in these notes, please do let me know at one of these email addresses:

[email protected] or [email protected] or [email protected]

Chapter 1: Linear Equations

Section 1.1: Fields

Page 3. Hoffman and Kunze comment that the term characteristic zero is strange. But the characteristic is the smallest n
such that n 1 = 0. In a characteristic zero field the smallest such n is 0. This must be why they use the term characteristic
zero and it doesnt seem that strange.

Section 1.2: Systems of Linear Equations

Exercise 1: Verify that the set of complex numbers described in Example 4 is a subfield of C.

Solution: Let F = {x + y 2 | x, y Q}. Then we must show six things:

1. 0 is in F

2. 1 is in F

3. If x and y are in F then so is x + y

4. If x is in F then so is x

5. If x and y are in F then so is xy

6. If x , 0 is in F then so is x1

For 1, take x = y = 0. For 2,take x = 1, y = 0. For 3, suppose
x = a+b 2 and y = c+d 2. Thenx+y = (a+c)+(b+d) 2 F.
x = a+ b 2. Then x = (a) +
For 4, suppose (b) 2 F. For 5, suppose x = a + b 2 and y = c + d 2. Then
xy = (a + b 2)(c + d 2) = (ac + 2bd) + (ad+ bc) 2 F. For 6, suppose x = a + b 2 where at least one of a or b is not
zero. Let n = a2 + 2b2 . Let y = a/n + (b/n) 2 F. Then xy = n1 (a + b 2)(a b 2) = 1n (a2 + 2b2 ) = 1. Thus y = x1 and
y F.

Exercise 2: Let F be the field of complex numbers. Are the following two systems of linear equations equivalent? If so,
express each equation in each system as a linear combination of the equations in the other system.

x1 x2 = 0 3x1 + x2 = 0
2x1 + x2 = 0 x1 + x2 = 0

1
2

Solution: Yes the two systems are equivalent:

1 4
3x1 + x2 = (x1 x2 ) + (2x1 + x2 )
3 3
1 2
x1 + x2 = (x1 x2 ) + (2x1 + x2 )
3 3
x1 x2 = (3x1 + x2 ) 2(x1 + x2 )
1 1
2x1 + x2 = (3x1 + x2 ) + (x1 + x2 )
2 2
Exercise 3: Test the following systems of equations as in Exercise 2.

x1 + x2 +4x3 = 0 x1 x3 = 0
x1 + 3x2 +8x3 = 0 x2 + x3 = 0
1
2 x1 + x2 + x3 = 0
5
2

Solution: Yes the two systems are equivalent:

x1 x3 = 3
4 (x1 + x2 + 4x3 ) + 14 (x1 + 3x3 + 8x3 )
x2 + 3x3 = 14 (x1 + x2 + 4x3 ) + 14 (x1 + 3x3 + 8x3 )

and

x1 + x2 + 4x3 = (x1 x3 ) + (x2 + 3x3 )

x1 + 3x2 + 8x3 = (x1 x3 ) + 3(x2 + 3x3 )
1
2 x1 + x2 + 52 x3 = 12 (x1 x3 ) + (x2 + 3x3 )

Exercise 4: Test the following systems as in Exercie 2.

2x1 + (1 + i)x2 + x4 = 0 (1 + 2i )x1 +8x2 ix3 x4 = 0

3x2 2ix3 + 5x4 = 0 2
3 x1 12 x2 + x3 +7x4 = 0

Solution: These systems are not equivalent. Call the two equations in the first system E1 and E2 and the equations in the
second system E10 and E20 . Then if E20 = aE1 + bE2 since E2 does not have x1 we must have a = 1/3. But then to get the
coefficient of x4 wed need 7x4 = 31 x4 + 5bx4 . That forces b = 43 . But if a = 13 and b = 43 then the coefficient of x3 would have
to be 2i 43 which does not equal 1. Therefore the systems cannot be equivalent.

Exercise 5: Let F be a set which contains exactly two elements, 0 and 1. Define an addition and multiplication by the tables:

+ 0 1 0 1
0 0 1 0 0 0
1 1 0 0 0 1

Solution: We must check the nine conditions on pages 1-2:

1. An operation is commutative if the table is symmetric across the diagonal that goes from the top left to the bottom right.
This is true for the addition table so addition is commutative.
2. There are eight cases. But if x = y = z = 0 or x = y = z = 1 then it is obvious. So there are six non-trivial cases. If theres
exactly one 1 and two 0s then both sides equal 1. If there are exactly two 1s and one 0 then both sides equal 0. So addition
is associative.
3. By inspection of the addition table, the element called 0 indeed acts like a zero, it has no effect when added to another
element.
4. 1 + 1 = 0 so the additive inverse of 1 is 1. And 0 + 0 = 0 so the additive inverse of 0 is 0. In other words 1 = 1 and
 3

0 = 0. So every element has an additive inverse.

5. As stated in 1, an operation is commutative if the table is symmetric across the diagonal that goes from the top left to the
bottom right. This is true for the multiplication table so multiplication is commutative.
6. As with addition, there are eight cases. If x = y = z = 1 then it is obvious. Otherwise at least one of x, y or z must equal 0.
In this case both x(yz) and (xy)z equal zero. Thus multiplication is associative.
7. By inspection of the multiplication table, the element called 1 indeed acts like a one, it has no effect when multiplied to
another element.
8. There is only one non-zero element, 1. And 1 1 = 1. So 1 has a multiplicative inverse. In other words 11 = 1.
9. There are eight cases. If x = 0 then clearly both sides equal zero. That takes care of four cases. If all three x = y = z = 1
then it is obvious. So we are down to three cases. If x = 1 and y = z = 0 then both sides are zero. So were down to the two
cases where x = 1 and one of y or z equals 1 and the other equals 0. In this case both sides equal 1. So x(y + z) = (x + y)z in
all eight cases.

Exercise 6: Prove that if two homogeneous systems of linear equations in two unknowns have the same solutions, then they
are equivalent.

Solution: Write the two systems as follows:

a11 x + a12 y = 0 b11 x + b12 y = 0

a21 x + a22 y = 0 b21 x + b22 y = 0
.. ..
. .
am1 x + am2 y = 0 bm1 x + bm2 y = 0

Each system consists of a set of lines through the origin (0, 0) in the x-y plane. Thus the two systems have the same solutions
if and only if they either both have (0, 0) as their only solution or if both have a single line ux + vy 0 as their common
solution. In the latter case all equations are simply multiples of the same line, so clearly the two systems are equivalent. So
assume that both systems have (0, 0) as their only solution. Assume without loss of generality that the first two equations in
the first system give different lines. Then
a11 a21
, (1)
a12 a22
We need to show that theres a (u, v) which solves the following system:

a11 u + a12 v = bi1

a21 u + a22 v = bi2

Solving for u and v we get

a22 bi1 a12 bi2
u=
a11 a22 a12 a21
a11 bi2 a21 bi1
v=
a11 a22 a12 a12
By (1) a11 a22 a12 a21 , 0. Thus both u and v are well defined. So we can write any equation in the second system as a
combination of equations in the first. Analogously we can write any equation in the first system in terms of the second.

Exercise 7: Prove that each subfield of the field of complex numbers contains every rational number.

Solution: Every subfield of C has characterisitc zero since if F is a subfield then 1 F and n 1 = 0 in F implies n 1 = 0 in
C. But we know n 1 = 0 in C implies n = 0. So 1, 2, 3, . . . are all distinct elements of F. And since F has additive inverses
1, 2, 3, . . . are also in F. And since F is a field also 0 F. Thus Z F. Now F has multiplicative inverses so n1 F for
all natural numbers n. Now let mn be any element of Q. Then we have shown that m and 1n are in F. Thus their product m 1n
is in F. Thus mn F. Thus we have shown all elements of Q are in F.
4

Exercise 8: Prove that each field of characteristic zero contains a copy of the rational number field.

Solution: Call the additive and multiplicative identities of F 0F and 1F respectively. Define nF to be the sum of n 1F s. So
nF = 1F + 1F + + 1F (n copies of 1F ). Define nF to be the additive inverse of nF . Since F has characteristic zero, if
m0 m0
n , m then nF , mF . For m, n Z, n , 0, let mn F = mF n1 m m
F . Since F has characteristic zero, if n , n0 then n F , n0 F .
Therefore the map n 7 n F gives a one-to-one map from Q to F. Call this map h. Then h(0) = 0F , h(1) = 1F and in general
m m

h(x + y) = h(x) + h(y) and h(xy) = h(x)h(y). Thus we have found a subset of F that is in one-to-one correspondence to Q and
which has the same field structure as Q.

Section 1.3: Matrices and Elementary Row Operations

Exercise 1: Find all solutions to the systems of equations

(1 i)x1 ix2 = 0
2x1 + (1 i)x2 = 0.

Solution: The matrix of coefficients is " #

1 i i
.
2 1i
Row reducing " # " #
2 1i 2 1i

1 i i 0 0
Thus 2x1 + (1 i)x2 = 0. Thus for any x2 C, ( 21 (i 1)x2 , x2 ) is a solution and these are all solutions.

Exercise 2: If
3 1 2
A = 2 1 1

1 3 0

find all solutions of AX = 0 by row-reducing A.

Solution:
1 3 0 1 3 0 1 3 0
2 1 1 0 7 1 0 1 1/7

3 1 2 0 8 2 0 8 2


1 0 3/7 1 0 3/7 1 0 0
0 1 1/7 0 1 1/7 0 1 10 .

0 0 6/7 0 0 1 0 0 1

Thus A is row-equivalent to the identity matrix. It follows that the only solution to the system is (0, 0, 0).

Exercise 3: If
6 4 0
A = 4 2 0

1 0 3

find all solutions of AX = 2X and all solutions of AX = 3X. (The symbol cX denotes the matrix each entry of which is c times
the corresponding entry of X.)

Solution: The system AX = 2X is

6 4 0 x x
4

2 0 y = 2 y

1 0 3 z z
 5

which is the same as

6x 4y = 2x
4x 2y = 2y
x + 3z = 2z

which is equivalent to

4x 4y = 0
4x 4y = 0
x + z = 0

The matrix of coefficients is

4 4 0
4 4 0


1 0 1
which row-reduces to
1 0 1
0 1 1


0 0 0

Thus the solutions are all elements of F 3 of the form (x, x, x) where x F.

The system AX = 3X is

6 4 0 x x
4 2 0 y = 3 y


1 0 3 z z
which is the same as

6x 4y = 3x
4x 2y = 3y
x + 3z = 3z

which is equivalent to

3x 4y = 0
x 2y = 0
x = 0

The matrix of coefficients is

3 4 0
1 2 0


1 0 0
which row-reduces to
1 0 0
0 1 0


0 0 0

Thus the solutions are all elements of F 3 of the form (0, 0, z) where z F.
6

Exercise 4: Find a row-reduced matrix which is row-equivalent to

i (1 + i)

0
A = 1 2 1 .

1 2i 1

Solution:
1 2 1 1 2 1 1 2 1
A i (1 + i) 0 0 1 + i i 0 1 1i

2
1 2i 1 0 2 + 2i 2 0 2 + 2i 2


1 2 1 1 0 i
i1 0 1 i1
0 1

2 2
0 0 0 0 0 0

Exercise 5: Prove that the following two matrices are not row-equivalent:

2 0 0 1 1 2
a 1 0 2 0 1 .


b c 3 1 3 5

Solution: Call the first matrix A and the second matrix B. The matrix A is row-equivalent to

1 0 0
A0 = 0 1 0

0 0 1

and the matrix B is row-equivalent to

1 0 1/2
B0 = 0 1 3/2 .

0 0 0

By Theorem 3 page 7 AX = 0 and A0 X = 0 have the same solutions. Similarly BX = 0 and B0 X = 0 have the same solutions.
Now if A and B are row-equivalent then A0 and B0 are row equivalent. Thus if A and B are row equivalent then A0 X = 0 and
B0 X = 0 must have the same solutions. But B0 X = 0 has infinitely many solutions and A0 X = 0 has only the trivial solution
(0, 0, 0). Thus A and B cannot be row-equivalent.

Exercise 6: Let " #

a b
A=
c d
be a 2 2 matrix with complex entries. Suppose that A is row-reduced and also that a + b + c + d = 0. Prove that there are
exactly three such matrices.
" #
1 b
Solution: Case a , 0: Then to be in row-reduced form it must be that a = 1 and A = which implies c = 0, so
c d
" # " #
1 b 1 0
A= . Suppose d , 0. Then to be in row-reduced form it must be that d = 1 and b = 0, so A = which
0 d 0 1
" #
1 1
implies a + b + c + d , 0. So it must be that d = 0, and then it follows that b = 1. So a , 0 A = .
0 0
" # " # " #
0 b 0 1 0 1
Case a = 0: Then A = . If b , 0 then b must equal 1 and A = which forces d = 0. So A =
c d c d c 0
which" implies
# (since a + b + c + d = 0) that c = 1.
" But c cannot
# be 1 in row-reduced form.
" So# it must be that b = 0. So
0 0 0 0 0 0
A= . If c , 0 then c = 1, d = 1 and A = . Otherwise c = 0 and A = .
c d 1 1 0 0
 7

Thus the three possibilities are: " # " # " #

0 0 1 1 0 0
, , .
0 0 0 0 1 1
Exercise 7: Prove that the interchange of two rows of a matrix can be accomplished by a finite sequence of elementary row
operations of the other two types.

Solution: Write the matrix as

R1



R2

R3 .

..

.


Rn
WOLOG well show how to exchange rows R1 and R2 . First add R2 to R1 :

R1 + R2

R2

R3 .
..

.

Rn

Next subtract row one from row two:

R1 + R2


R
1
R 3 .

..

.


Rn
Next add row two to row one again
R2


R
1
R3
.

..

.


Rn
Finally multiply row two by 1:
R2



R1

R3 .

..

.


Rn
Exercise 8: Consider the system of equations AX = 0 where
" #
a b
A=
c d

is a 2 2 matrix over the field F. Prove the following:

(a) If every entry of A is 0, then every pair (x1 , x2 ) is a solution of AX = 0.
(b) If ad bc , 0, the system AX = 0 has only the trivial solution x1 = x2 = 0.
(c) If ad bc = 0 and some entry of A is different from 0, then there is a solution (x10 , x20 ) such that (x1 , x2 ) is a solution if
and only if there is a scalar y such that x1 = yx10 , x2 = yx20 .
8

Solution:

(a) In this case the system of equations is

0 x1 + 0 x2 = 0
0 x1 + 0 x2 = 0

Clearly any (x1 , x2 ) satisfies this system since 0 x = 0 x F.

(b) Let (u, v) F 2 . Consider the system:

a x1 + b x2 = u
c x1 + d x2 = v

If ad bc , 0 then we can solve for x1 and x2 explicitly as

du bv av cu
x1 = x2 = .
ad bc ad bc
Thus theres a unique solution for all (u, v) and in partucular when (u, v) = (0, 0).

(c) Assume WOLOG that a , 0. Then ad bc = 0 d = cb c

a . Thus if we multiply the first equation by a we get the second
equation. Thus the two equations are redundant and we can just consider the first one ax1 + bx2 = 0. Then any solution is of
the form ( ab y, y) for arbitrary y F. Thus letting y = 1 we get the solution (b/a, 1) and the arbitrary solution is of the form
y(b/a, 1) as desired.

Section 1.4: Row-Reduced Echelon Matrices

Exercise 1: Find all solutions to the following system of equations by row-reducing the coefficient matrix:
1
x1 + 2x2 6x3 = 0
3
4x1 + 5x3 = 0
3x1 + 6x2 13x3 = 0
7 8
x1 + 2x2 x3 = 0
3 3
Solution: The coefficient matrix is 1
3 2 6
4 0 5

3 6 13

7 8
3 2 3
This reduces as follows:
1 6 18 1 6 18 1 6 18 1 6 18 1 0 5/4


4 0 5 24 67 24 67 67/24 67/24
0 0
0 1
0 1


3 6 13

0
24 67

0
0 0 0 0 0

0 0
0

7 6 8 0 48 134 0 0 0 0 0 0 0 0 0

Thus
5
x z=0
4
67
y z=0
24
 9

Thus the general solution is ( 45 z, 67

24 z, z) for arbitrary z F.

Exercise 2: Find a row-reduced echelon matrix which is row-equivalent to

1 i
A = 2 2 .

u 1+i

What are the solutions of AX = 0?

Solution: A row-reduces as follows:

1 i 1 i 1 i 1 0
1 1 0 1+i 0 1 0 1


i 1+i 0 i 0 i 0 0

Thus the only solution to AX = 0 is (0, 0).

Exercise 3: Describe explicitly all 2 2 row-reduced echelon matrices.

Solution: " # " # " # " #

1 0 1 x 0 1 0 0
, , ,
0 1 0 0 0 0 0 0
Exercise 4: Consider the system of equations
x1 x2 + 2x3 = 1
2x1 + 2x2 = 1
x1 3x2 + 4x3 = 2
Does this system have a solution? If so, describe explicitly all solutions.

Solution: The augmented coefficient matrix is

1 1 2 1
2 0 2 1


1 3 4 2
We row reduce it as follows:

1 1 2 1 1 1 2 1 1 0 2 1 1 0 0 0
0 2 2 1 0 1 1 1/2 0 1 0 0 0 1 0 0


0 1 0 0 0 1 0 0 0 0 1 1/2 0 0 1 1/2

Thus the only solution is (0, 0, 1/2).

Exercise 5: Give an example of a system of two linear equations in two unkowns which has no solutions.

Solution:
x+y=0
x+y=1
Exercise 6: Show that the system
x1 2x2 + x3 + 2x4 = 1
x1 + x2 x3 + x4 = 2
x1 + 7x2 5x3 x4 = 3
10

has no solution.

Solution: The augmented coefficient matrix is as follows

1 2 1 2 1
1 1 1 1 2


1 7 5 1 3

This row reduces as follows:

1 2 1 2 1 1 2 1 2 1
0 3 2 1 1 0 3 2 1 1


0 9 6 3 2 0 0 0 0 1

At this point theres no need to continue because the last row says 0x1 + 0x2 + 0x3 + 0x4 = 1. But the left hand side of this
equation is zero so this is impossible.

Exercise 7: Find all solutions of

2x1 3x2 7x3 + 5x4 + 2x5 = 2

x1 2x2 4x3 + 3x4 + x5 = 2
2x1 4x3 + 2x4 + x5 = 3
x1 5x2 7x3 + 6x4 + 2x5 = 7

Solution: The augmented coefficient matrix is

2 3 7 5 2 2


1
2 4 3 1 2

2
0 4 2 1 3

1 5 7 6 2 7

We row-reduce it as follows

1 2 4 3 1 2 1 2 4 3 1 2


2 3 7 5 2 2 0 1
1 1 0 2

2 0 4 2 1 3 0 4
4 4 1 7

1 5 7 6 2 7 0 3 3 3 1 5

1 0 2 1 1 2 1 0 2 1 0 1


0 1 1 1 0 2 0
1 1 1 0 2

0 0 0 0 1 1

0
0 0 0 1 1

0 0 0 0 1 1 0 0 0 0 0 0
Thus

x1 2x3 + x4 = 1
x2 + x3 x4 = 2
x5 = 1

Thus the general solution is given by (1 + 2x3 x4 , 2 + x4 x3 , x3 , x4 , 1) for arbitrary x3 , x4 F.

Exercise 8: Let
3 1 2
A = 2 1 1 .

1 3 0

 11

For which (y1 , y2 , y3 ) does the system AX = Y have a solution?

Solution: The matrix A is row-reduced as follows:

1 3 0 1 3 0 1 3 0
0 7 1 0 7 1 0 1 1


0 8 2 0 1 1 0 7 1

1 3 0 1 3 0 1 0 0
0 1 1 0 1 1 0 1 0


0 0 6 0 0 1 0 0 1

Thus for every (y1 , y2 , y3 ) there is a (unique) solution.

Exercise 9: Let
3 6 2 1


2 4 1 3
.
0 0 1 1

1 2 1 0
For which (y1 , y2 , y3 , y4 ) does the system of equations AX = Y have a solution?

Solution: We row reduce as follows

3 6 2 1 y1 1 2 1 0 y4 1 2 1 0 y4


2 4 1 3 6 2 1 1 1 y1 3y4
y2 3 y1 0 0


y2 + 2y4

0 0 1 1 y3 2 4 1 3 y2 0 0 3 3

1 2 1 0 y4 0 0 1 1 y3 0 0 1 1 y3

1 2 1 0 y4 1 2 1 0 y4


0 0 0 0 y1 3y4 + y3 0
0 1 1 y3

y2 + 2y4 + 3y3 y1 3y4 + y3

0 0 0 0 0 0 0 0
y2 + 2y4 + 3y3

0 0 1 1 y3 0 0 0 0
Thus (y1 , y2 , y3 , y4 ) must satisfy

y1 + y3 3y4 = 0
y2 + 3y3 + 2y4 = 0

The matrix for this system is " #

1 0 1 3
0 1 3 2
of which the general solution is (y3 + 3y4 , 3y3 2y4 , y3 , y4 ) for arbitrary y3 , y4 F. These are the only (y1 , y2 , y3 , y4 ) for
which the system AX = Y has a solution.

Exercise 10: Suppose R and R0 are 2 3 row-reduced echelon matrices and that the system RX = 0 and R0 X = 0 have exactly
the same solutions. Prove that R = R0 .

Solution: There are seven possible 2 3 row-reduced echelon matrices:

" #
0 0 0
R1 = (2)
0 0 0
" #
1 0 a
R2 = (3)
0 1 b
12
" #
1 a 0
R3 = (4)
0 0 1
" #
1 a b
R4 = (5)
0 0 0
" #
0 1 a
R5 = (6)
0 0 0
" #
0 1 0
R6 = (7)
0 0 1
" #
0 0 1
R7 = (8)
0 0 0
We must show that no two of these have exactly the same solutions. For the first one R1 , any (x, y, z) is a solution and thats
not the case for any of the other Ri s. Consider next R7 . In this case z = 0 and x and y can be anything. We can have z , 0 for
R2 , R3 and R5 . So the only ones R7 could share solutions with are R3 or R6 . But both of those have restrictions on x and/or y
so the solutions cannot be the same. Also R3 and R6 cannot have the same solutions since R6 forces y = 0 while R3 does not.

Thus we have shown that if two Ri s share the same solutions then they must be among R2 , R4 , and R5 .

The solutions for R2 are (az, bz, z), for z arbitrary. The solutions for R4 are (a0 yb0 z, y, z) for y, z arbitrary. Thus (b0 , 0, 1)
is a solution for R4 . Suppose this is also a solution for R2 . Then z = 1 so it is of the form (a, b, 1) and it must be that
(b0 , 0, 1) = (a, b, 1). Comparing the second component implies b = 0. But if b = 0 then R2 implies y = 0. But R4 allows
for arbitrary y. Thus R2 and R4 cannot share the same solutions.

The solutions for R2 are (az, bz, z), for z arbitrary. The solutions for R5 are (x, a0 z, z) for x, z arbitrary. Thus (0, a0 , 1) is
a solution for R5 . As before if this is a solution of R2 then a = 0. But if a = 0 then R2 forces x = 0 while in R5 x can be
arbitrary. Thus R2 and R5 cannot share the same solutions.

The solutions for R4 are (ay bz, y, z) for y, z arbitrary. The solutions for R5 are (x, a0 z, z) for x, z arbitrary. Thus setting
x = 1, z = 0 gives (1, 0, 0) is a solution for R5 . But this cannot be a solution for R4 since if y = z = 0 then first component
must also be zero.

Thus we have shown that no two Ri and R j have the same solutions unless i = j.

NOTE: This fact is actually true in genera not just for 2 3l (search for 1832109 on math.stackexchange).

Section 1.5: Matrix Multiplication

Page 18: Typo in the last paragraph where it says the columns of B are the 1 n matrices . . . it should be n 1 not 1 n.

Exercise 1: Let
" # 3
2 1 1
A= , B = 1 , C = [1 1].

1 2 1
1

Compute ABC and CAB.

Solution: " #
4
AB = ,
4
 13

so " # " #
4 4 4
ABC = [1 1] = .
4 4 4
and " #
4
CBA = [1 1] = [0].
4
Exercise 2: Let
1 1 1 2 2
A = 2 0 1 , B = 1 3 .

3 0 1 4 4

Verify directly that A(AB) = A2 B.

Solution:
1 1 1 1 1 1
A = 2
2
0 1 2 0 1


3 0 1 3 0 1


2 1 1
= 5 2 3 .

6 3 4

And
1 1 1 2 2
AB = 2 0 1 1 3


3 0 1 4 4


5 1
= 8 0 .

10 2

Thus
2 1 1 2 2
A2 B = 5 2 3 1 3


6 3 4 4 4


7 3
= 20 4 . (9)

25 5

And
1 1 1 5 1
A(AB) = 2 0 1 8 0


3 0 1 10 2


7 3
20 4 . (10)

25 5
Comparing (9) and (10) we see both calculations result in the same matrix.

Exercise 3: Find two different 2 2 matrices A such that A2 = 0 but A , 0.

Solution: " # " #

0 1 0 0
,
0 0 1 0
14

are two such matrices.

Exercise 4: For the matrix A of Exercise 2, find elementary matrices E1 , E2 , . . . , Ek such that

Ek E2 E1 A = I.

Solution:
1 1 1
A = 2 0 1

3 0 1


1 0 0 1 1 1 1 1 1
E1 A = 2 1 0 2 0 1 = 0 2 1

0 0 1 3 0 1 3 0 1


1 0 0 1 1 1 1 1 1
E2 (E1 A) = 0 1 0 0 2 1 = 0 2 1

3 0 1 3 0 1 0 3 0


1 0 0 1 1 1 1 1 1
E3 (E2 E1 A) = 0 1/2 0 0 2 1 = 0 1 1/2

0 0 1 0 3 0 0 3 0


1 1 0 1 1 1 1 0 1/2
E4 (E3 E2 E1 A) = 0 1 0 0 1 1/2 = 0 1 1/2

0 0 1 0 3 0 0 3 0


1 0 0 1 0 1/2 1 0 1/2
E5 (E4 E3 E2 E1 A) = 0 1 0 0 1 1/2 = 0 1 1/2

0 3 1 0 3 0 0 0 3/2


1 0 0 1 0 1/2 1 0 1/2
E6 (E5 E4 E3 E2 E1 A) = 0 1 0 0 1 1/2 = 0 1 1/2

0 0 2/3 0 0 3/2 0 0 1


1 0 1/2 1 0 1/2 1 0 0
E7 (E6 E5 E4 E3 E2 E1 A) = 0 1 0 0 1 1/2 = 0 1 1/2

0 0 1 0 0 1 0 0 1


1 0 0 1 0 0 1 0 0
E8 (E7 E6 E5 E4 E3 E2 E1 A) = 0 1 1/2 0 1 1/2 = 0 1 0

0 0 1 0 0 1 0 0 1

Exercise 5: Let
1 1 " #
3 1

A = 2 2 , B= .

4 4
1 0

Is there a matrix C such that CA = B?

" #
a b c
Solution: To find such a C = we must solve the equation
d e f

" # 1 1 " #
a b c 3 1
2 2 = 4 .

d e f 4
1 0
 15

This gives a system of equations

a + 2b + c = 3
a + 2b = 1
d + 2e + f = 4
d + 2e = 4

We row-reduce the augmented coefficient matrix

1 2 1 0 0 0 3


1 2 0 0 0 0 1

0
0 0 1 2 1 4

0 0 0 1 2 0 4

1 0 1/2 0 0 0 1


0 1 1/4 0 0 0 1
.
0 0 0 1 0 1/2 4

0 0 0 0 1 1/4 0
Setting c = f = 4 gives the solution " #
1 0 4
C= .
6 1 4
Checking:
" # 1 1 " #
1 0 4 3 1
2 2 = .

6 1 4 4 4
1 0

Exercise 6: Let A be an m n matrix and B an n k matrix. Show that the columns of C = AB are linear combinations of the
columns of A. If 1 , . . . , n are the columns of A and 1 , . . . , k are the columns of C then
n
X
j = Br j r .
r=1

Solution: The i j-th entry of AB is kr=1 Air Br j . Since the term Br j is independent of i, we can view the sum independent of
P
i as r=1 Br j r where r is the r-th column of A. Im not sure what more to say, this is pretty immediately obvious from the
Pn
definition of matrix multiplication.

Exercise 7: Let A and B be 2 2 matrices such that AB = I. Prove that BA = I.

Solution: Suppose " # " #

a b yx
A= , B= .
c d wz
ax + bz ay + bw
" #
AB = .
cx + dz cy + dw
Then AB = I implies the following system in u, r, s, t has a solution

au + bs = 1
cu + ds = 0
ar + bt = 0
cr + dt = 1
16

because (x, y, z, w) is one such solution. The augmented coefficient matrix of this system is

a 0 b 0 1

c 0 d 0 0
. (11)
0 a 0 b 0
0 c 0 d 1
As long as ad bc , 0 this system row-reduces to the following row-reduced echelon form

1 0 0 0 d/(ad bc)

0 1 0 0 b/(ad bc)

0 0 1 0 c/(ad bc)

0 0 0 1 a/(ad bc)
Thus we see that necessarily x = d/(ad bc), y = b/(ad bc), z = c/(ad bc), w = a/(ad bc). Thus
" #
d/(ad bc) b/(ad bc)
B= .
c/(ad bc) a/(ad bc)
Now its a simple matter to check that
" # " # " #
d/(ad bc) b/(ad bc) a b 1 0
= .
c/(ad bc) a/(ad bc) c d 0 1
The loose end is that we assumed ad bc , 0. To tie up this loose end we must show that if A is invertible then necessarily
ad bc , 0. Suppose that ad bc = 0. We will show there is no solution to (11). If a = b = c = d = 0 then obviously A has
no inverse. So suppose WOLOG that a , 0 (because by elementary row operations we can move any of the four elements to
be the top left entry). Subtracting ac times the 3rd row from the 4th row of (11) gives

a 0 b 0 1


c
0 d 0 0
.
0 a 0 b 0
c ac a d ac b

0 0 1
Now c ac a = 0 and since ad bc = 0 also d ac b = 0. Thus we get

a 0 b 0 1


c
0 d 0 0
.
0 a 0 b 0

0 0 0 0 1
and it follows that A is not invertiblle.

Exercise 8: Let " #

C11 C12
C=
C21 C22
be a 2 2 matrix. We inquire when it is possible to find 2 2 matrices A and B such that C = AB BA. Prove that such
matrices can be found if and only fi C11 + C22 = 0.

Solution: We want to know when we can solve for a, b, c, d, x, y, z, w such that

" # " #" # " #" #
c11 c12 a b x y a b x y
=
c21 c22 c d z w c d z w
The right hand side is equal to
ay + bw bx dy
" #
bz cy
cx + dz az cw cy bz
 17

Thus the question is when can we choose a, b, c, d so that the following system has a solution for x, y, z, w

bz cy = c11
ay + bw bx dy = c12
(12)
cx + dz az cw = c21
cy bz = c22
The augmented coefficient matrix for this system is

0 c b 0 c11


b a d 0 b c12

c
0 d a c c21

0 c b 0 c22
This matrix is row-equivalent to
0 c b 0 c11


b ad 0 b c12

c 0 da c c21
c11 + c22

0 0 0 0
from which we see that necessarily c11 + c22 = 0.

Suppose conversely that c11 + c22 = 0. We want to show A, B such that C = AB BA.

We first handle the case when c11 = 0. We know c11 + c22 = 0 so also c22 = 0. So C is in the form
" #
0 c12
.
c21 0
In this case let " # " #
0 c12 1 0
A= , B= .
c21 0 0 0
Then
AB BA
" #" # " #" #
0 c12 1 0 1 0 0 c12
=
c21 0 0 0 0 0 c21 0
" # " #
0 0 0 c12
=
c21 0 0 0
" #
0 c12
=
c21 0
= C.
So we can assume going forward that c11 , 0. We want to show the system (12) can be solved. In other words we have to
find a, b, c, d such that the system has a solution in x, y, z, w. If we assume b , 0 and c , 0 then this matrix row-reduces to the
following row-reduced echelon form
da c12
1 0 (d a)/c 1 bc c11 b


0 1 d/c 0 c11 /c
0 b (d a) + c21 + b
c11 c12 c

0 0 0
0 0 0 0 c11 + c22
We see that necessarily
c11 c12 c
(d a) + c21 + = 0.
b b
18

Since c11 , 0, we can set a = 0, b = c = 1 and d = c12c+c11

21
. Then the system can be solved and we get a solution for any
choice of z and w. Setting z = w = 0 we get x = c21 and y = c11 .

Summarizing, if c11 , 0 then:

a=0
b=1
c=1
d = (c12 + c21 )/c11
x = c21
y = c11
z=0
w=0
" # " #" #
2 1 0 1 3 2
For example if C = then A = and B = . Checking:
3 2 1 2 0 0
" #" # " #" # " #
0 1 3 2 3 2 0 1 2 1
= .
1 2 0 0 0 0 1 2 3 2

Section 1.6: Invertible Matrices

Exercise 1: Let
1 2 1 0
A = 1 0 3 5 .

1 2 1 1

Find a row-reduced echelon matrix R which is row-equivalent to A and an invertible 3 3 matrix P such that R = PA.

Solution: As in Exercise 4, Section 1.5, we row reduce and keep track of the elementary matrices involved. It takes nine
steps to put A in row-reduced form resulting in the matrix

3/8 1/4 3/8
P = 1/4 0 1/4 .

1/8 1/4 1/8

Exercise 2: Do Exercise 1, but with

2 0 i
A = 1 3 i .

i 1 1

Solution: Same story as Exercise 1, we get to the identity matrix in nine elementary steps. Multiplying those nine elementary
matrices together gives
1/3 29+3i 13i

30 10

P = 0 3+i 13i .


10 10

3+i 3+i
i/3 15 5
Exercise 3: For each of the two matrices

2 5 1 1 1 2
4 1 2 , 3 2 4


6 4 1 0 1 2
 19

use elementary row operations to discover whether it is invertible, and to find the inverse in case it is.

Solution: For the first matrix we row-reduce the augmented matrix as follows:

2 5 1 1 0 0
4 1 2 0 1 0

6 4 1 0 0 1

2 5 1 1 0 0
0 11 4 2 1 0

0 11 4 3 0 1


2 5 1 1 0 0
0 11 4 2 1 0

0 0 0 1 1 1

At this point we see that the matrix is not invertible since we have obtained an entire row of zeros.

For the second matrix we row-reduce the augmented matrix as follows:

1 1 2 1 0 0
3 2 4 0 1 0

0 1 2 0 0 1

1 1 2 0 0 1
0 5 2 3
1 0

0 1 2 0 1 0


1 1 2 1 0 0
0 1 2 0 0 1

0 5 2 3 1 0


1 0 0 1 0 1
0 1 2 0 0 1

0 0 8 3 1 5


1 0 0 1 0 1
0 1 2 0 0 1


0 0 1 3/8 1/8 5/8


1 0 0 1 0 1
0 1 0 3/4 1/4 1/4


0 0 1 3/8 1/8 5/8

Thus the inverse matrix is

1 0 1
3/4 1/4 1/4


3/8 1/8 5/8
Exercise 4: Let
5 0 0
A = 1 5 0 .

0 1 5

For which X does there exist a scalar c such that AX = cX?

20

Solution:
5 0 0 x x
1

5 0 y = c y

0 1 5 z z
implies
5x = cx (13)
x + 5y = cy (14)
y + 5z = cz (15)

0
Now if c , 5 then (13) implies x = 0, and then (14) implies y = 0, and then (15) implies z = 0. So it is true for 0 with c = 0.

0


0
If c = 5 then (14) implies x = 0 and (15) implies y = 0. So if c = 5 any such vector must be of the form 0 and indeed any

z

such vector works with c = 5.

0
So the final answer is any vector of the form 0 .

z

Exercise 5: Discover whether

1 2 3 4


0 2 3 4

0 0 3 4

0 0 0 4
is invertible, and find A1 if it exists.

Solution: We row-reduce the augmented matrix as follows:

1 2 3 4 1 0 0 0


0 2 3 4 0 1 0 0

0 0 3 4 0 0 1 0

0 0 0 4 0 0 0 1

1 0 0 0 1 1
0 0

0 2 3 4 0 1
0 0


0 0 3 4 0 0
1 0
0 0 0 4 0 0
0 1
1 0 0 0 1 1 0 0

0 2 0 0 0 1 1 0


0 0 3 4 0 0 1 0
0 0 0 4 0 0 0 1
1 0 0 0 1 1 0 0

0 2 0 0 0 1 1 0


0 0 3 0 0 0 1 1
0 0 0 4 0 0 0 1
1 0 0 0 1 1 0 0


0 1 0 0 0 1/2 1/2 0

0 0 1 0 0 0 1/3 1/3

0 0 0 1 0 0 0 1/4
 21

Thus the A does have an inverse and

1 1 0 0


0 1/2 1/2 0
A1 = .
0 0 1/3 1/3
0 0 0 1/4
Exercise 6: Suppose A is a 2 1 matrix and that B is a 1 2 matrix. Prove that C = AB is not invertible.
" #
a1
Solution: Write A = and B = [b1 b2 ]. Then
a2
" #
a1 b1 a1 b2
AB = .
a2 b1 a2 b2

If any of a1 , a2 , b1 or b2 equals zero then AB has an entire row or an entire column of zeros. A matrix with an entire row or
column of zeros is not invertible. Thus assume a1 , a2 , b1 and b2 are non-zero. Now if we add a2 /a1 of the first row to the
second row we get
" #
a1 b1 a1 b2
.
0 0
Thus AB is not row-equivalent to the identity. Thus by Theorem 12 page 23, AB is not invertible.

Exercise 7: Let A be an n n (square) matrix. Prove the following two statements:

(a) If A is invertible and AB = 0 for some n n matrix B then B = 0.
(b) If A is not invertible, then there exists an n n matrix B such that AB = 0 but B , 0.

Solution:

(a) 0 = A1 0 = A1 (AB) = (A1 A)B = IB = B. Thus B = 0.

(b) By Theorem 13 (ii) since A is not invertible AX = 0 must have a non-trivial solution v. Let B be the matrix all of whose
columns are equal to v. Then B , 0 but AB = 0.

Exercise 8: Let " #

a b
A= .
c d
Prove, using elementary row operations, that A is invertible if and only if (ad bc) , 0.

Solution: Suppose
" # " #
a b x y
A= , B= .
c d z w
Then
ax + bz ay + bw
" #
AB = .
cx + dz cy + dw
Then AB = I implies the following system in u, r, s, t has a solution

au + bs = 1
cu + ds = 0
ar + bt = 0
cr + dt = 1
22

because (x, y, z, w) is one such solution. The augmented coefficient matrix of this system is

a 0 b 0 1


c 0 d 0 0
.

0 (16)
a 0 b 0

0 c 0 d 1

As long as ad bc , 0 this system row-reduces to the following row-reduced echelon form

1 0 0 0 d/(ad bc)


0 1 0 0
b/(ad bc)

0 0 1 0
c/(ad bc)

0 0 0 1 a/(ad bc)

Thus we see that x = d/(ad bc), y = b/(ad bc), z = c/(ad bc), w = a/(ad bc) and
" #
d/(ad bc) b/(ad bc)
A =
1
.
c/(ad bc) a/(ad bc)

Now its a simple matter to check that

" # " # " #
d/(ad bc) b/(ad bc) a b 1 0
= .
c/(ad bc) a/(ad bc) c d 0 1

Now suppose that ad bc = 0. We will show there is no solution. If a = b = c = d = 0 then obviously A has no inverse. So
suppose WOLOG that a , 0 (because by elementary row operations we can move any of the four elements to be the top left
entry). Subtracting ac times the 3rd row from the 4th row of (16) gives

a 0 b 0 1


c
0 d 0 0
.
0 a 0 b 0
c ac a d ac b

0 0 1

Now c ac a = 0 and since ad bc = 0 also d ac b = 0. Thus we get

a 0 b 0 1


c
0 d 0 0
.
0 a 0 b 0

0 0 0 0 1

and it follows that A is not invertible.

Exercise 9: An n n matrix A is called upper-triangular if ai j = 0 for i > j, that is, if every entry below the main diagonal is
0. Prove that an upper-triangular (square) matrix is invertible if and only if every entry on its main diagonal is different from
zero.

Solution: Suppose that aii , 0 for all i. Then we can divide row i by aii to give a row-equivalent matrix which has all ones
on the diagonal. Then by a sequence of elementary row operations we can turn all off diagonal elements into zeros. We can
therefore row-reduce the matrix to be equivalent to the identity matrix. By Theorem 12 page 23, A is invertible.

Now suppose that some aii = 0. If all aii s are zero then the last row of the matrix is all zeros. A matrix with a row of zeros
cannot be row-equivalent to the identity so cannot be invertible. Thus we can assume theres at least one i such that aii , 0.
Let i0 be the largest such index, so that ai0 i0 = 0 and aii , 0 for all i > i0 . We can divide all rows with i > i0 by aii to give ones
on the diagonal for those rows. We can then add multiples of those rows to row i0 to turn row i0 into an entire row of zeros.
 23

Since again A is row-equivalent to a matrix with an entire row of zeros, it cannot be invertible.

Exercise 10: Prove the following generalization of Exercise 6. If A is an m n matrix and B is an n m matrix and n < m,
then AB is not invertible.

Solution: There are n colunms in A so the vector space generated by those columns has dimension no greater than n. All
columns of AB are linear combinations of the columns of A. Thus the vector space generated by the columns of AB is con-
tained in the vector space generated by the columns of A. Thus the column space of AB has dimension no greater than n.
Thus the column space of the m m matrix AB has dimension less or equal to n and n < m. Thus the columns of AB generate
a space of dimension strictly less than m. Thus AB is not invertible.

Exercise 11: Let A be an n m matrix. Show that by means of a finite number of elementary row and/or column operations
one can pass from A to a matrix R which is both row-reduced echelon and column-reduced echelon, i.e., Ri j = 0 if i , j,
Rii = 1, 1 i r, Rii = 0 if i > r. Show that R = PAQ, where P is an invertible mm matrix and Q is an invertible nn matrix.

Solution: First put A in row-reduced echelon form, R0 . So an invertible m m matrix P such that R0 = PA. Each row of R0
is either all zeros or starts (on the left) with zeros, then has a one, then may have non-zero entries after the one. Suppose row
i has a leading one in the j-th column. The j-th column has zeros in all other places except the i-th, so if we add a multiple
of this column to another column then it only affects entries in the i-th row. Therefore a sequence of such operations can turn
this row into a row of all zeros and a single one.

Let B be the n n matrix such that Brr = 1 and Brs = 0 r , s except B jk , 0. Then AB equals A with B jk times column
j added to column k. B is invertible since any such operation can be undone by another such operation. By a sequence of
such operations we can turn all values after the leading one into zeros. Let Q be a product of all of the elementary matrices B
involved in this transformation. Then PAQ is in row-reduced and column-reduced form.

Exercise 12: The result of Example 16 suggests that perhaps the matrix
1 1
1 2 n
1 1 1

2 3 n+1

.. .. ..
. . .


1 1 1
n n+1 2n1

is invertible and A1 has integer entries. Can you prove that?

Solution: This problem seems a bit hard for this book. There are a class of theorems like this, in particular these are called
Hilbert Matrices and a proof is given in this article on arxiv by Christian Berg called Fibonacci numbers and orthogonal
polynomials (http://arxiv.org/pdf/math/0609283v2.pdf). See Theorem 4.1. Also there might be a more elementary
proof in this discussion on mathoverflow.net where two proofs are given:
http://mathoverflow.net/questions/47561/deriving-inverse-of-hilbert-matrix.
Also see http://vigo.ime.unicamp.br/HilbertMatrix.pdf where a general formula for the i, j entry of the inverse is
given explicitly as
!2
n+i1 n+ j1 i+ j1
! !
(1) (i + j 1)
i+ j
n j ni i1
24
Chapter 2: Vector Spaces

Section 2.1: Vector Spaces

Exercise 1: If F is a field, verify that F n (as defined in Example 1) is a vector space over the field F.

Solution: Example 1 starts with any field and defines the objects, the addition rule and the scalar multiplication rule. We
must show the set of n-tuples satisfies the eight properties required in the definition.

1) Addition is commutative. Let = (x1 , . . . , xn ) and = (y1 , . . . , yn ) be two n-tuples. Then + = (x1 + y1 , . . . , xn + yn ).
And since F is commutative this equals (y1 + x1 , . . . , yn + xn ), which equals + . Thus + = + .

2) Addition is associative. Let = (x1 , . . . , xn ), = (y1 , . . . , yn ) and = (z1 , . . . , zn ) be three n-tuples. Then ( + ) + =
((x1 +y1 )+z1 , . . . , (xn +yn )+zn ). And since F is associative this equals (x1 +(y1 +z1 ), . . . , xn +(yn +zn )), which equals +(+).

3) We must show there is a unique vector 0 in V such that + 0 = V. Consider (0F , . . . , 0F ) the vector of all
0s of length n, where 0F is the zero element of F. Then this vector satisfies the property that (0F , . . . , 0F ) + (x1 , . . . , xn ) =
(0F + x1 , . . . , 0F + xn ) = (x1 , . . . , xn ) since 0F + x = x x F. Thus (0F , . . . , 0F ) + = V. We must just show this
vector is unique with respect to this property. Suppose = (x1 , . . . , xn ) also satisfies the property that + = for all V.
Let = (0F , . . . , 0F ). Then (x1 , . . . , xn ) = (x1 + 0F , . . . , xn + 0F ) = (x1 , . . . , xn ) + (0F , . . . , 0F ) and by definition of this equals
(0F , . . . , 0F ). Thus (x1 , . . . , xn ) = (0F , . . . , 0F ). Thus = and the zero element is unique.

4) We must show for each vector there is a unique vector such that + = 0. Suppose = (x1 , . . . , xn ). Let =
(x1 , . . . , xn ). Then has the required property + = 0. We must show is unique with respect to this property. Suppose
also 0 = (x10 , . . . , xn0 ) also has this property. Then + = 0 and +0 = 0. So = +0 = +(+0 ) = (+)+0 = 0+0 = 0 .

5) Let 1F be the multiplicative identity in F. Then 1F (x1 , . . . , xn ) = (1 x1 , . . . , 1 xn ) = (x1 , . . . , xn ) since 1F x = x x F.

Thus 1F = V.

6) Let = (x1 , . . . , xn ). Then (c1 c2 ) = ((c1 c2 )x1 , . . . , (c1 c2 )xn ) and since multiplication in F is associative this equals
(c1 (c2 x1 ), . . . , c1 (c2 xn )) = c1 (c2 x1 , . . . c2 xn ) = c1 (c2 ).

7) Let = (x1 , . . . , xn ) and = (y1 , . . . , yn ). Then c(+) = c(x1 +y1 , . . . , xn +yn ) = (c(x1 +y1 ), . . . , c(xn +yn )) and since multi-
plication is distributive over addition in F this equals (cx1 +cy1 , . . . , cxn +xyn ). This then equals (cx1 , . . . , cxn )+(cy1 , . . . , cyn ) =
c(x1 , . . . , xn ) + c(y1 , . . . , yn ) = c + c. Thus c( + ) = c + c.

8) Let = (x1 , . . . , xn ). Then (c1 + c2 ) = ((c1 + c2 )x1 , . . . , (c1 + c2 )xn ) and since multiplication distributes over addition in
F this equals (c1 x1 + c2 x1 , . . . , c1 xn + c2 xn ) = (c1 x1 , . . . , c1 xn ) + (c2 x1 , . . . c2 xn ) = c1 (x1 , . . . , xn ) + c2 (x1 , . . . , xn ) = c1 + c2 .
Thus (c1 + c2 ) = c1 + c2 .

Exercise 2: If V is a vector space over the field F, verify that

(1 + 2 ) + (3 + 4 ) = [2 + (3 + 1 )] + 4

25
26

for all vectors 1 , 2 , 3 and 4 in V.

Solution: This follows associativity and commutativity properties of V:

(1 + 2 ) + (3 + 4 )

= (2 + 1 ) + (3 + 4 )
= 2 + [1 + (3 + 4 )]
= 2 + [(1 + 3 ) + 4 ]
= [2 + (1 + 3 )] + 4
= [2 + (3 + 1 )] + 4 .

Exercise 3: If C is the field of complex numbers, which vectors in C3 are linear combinations of (1, 0, 1), (0, 1, 1), and
(1, 1, 1)?

Solution: If we make a matrix out of these three vectors

1 0 1
A = 0 1 1


1 1 1

then if we row-reduce the augmented matrix

1 0 1 1 0 0
0 1 1 0 1 0


1 1 1 0 0 1
we get
1 0 0 0 1 1
0 1 0 1 2 1 .

0 0 1 1 1 1
Therefore the matrix is invertible and AX = Y has a solution X = A1 Y for any Y. Thus any vector Y C3 can be written as a
linear combination of the three vectors. Not sure what the point of making the base field C.

Exercise 4: Let V be the set of all pairs (x, y) of real numbers, and let F be the field of real numbers. Define

(x, y) + (x1 , y1 ) = (x + x1 , y + y1 )

c(x, y) = (cx, y).

Is V, with these operations, a vector space over the field of real numbers?

Solution: No it is not a vector space because (0, 2) = (0, 1) + (0, 1) = 2(0, 1) = (2 0, 1) = (0, 1). Thus we must have
(0, 2) = (0, 1) which implies 1 = 2 which is a contradiction in the field of real numbers.

Exercise 5: On Rn , define two operations

=
c = c.
The operations on the right are the usual ones. Which of the axioms for a vector space are satisfied by (Rn , , )?
 27

Solution:

1) is not commutative since (0, . . . , 0) (1, . . . , 1) = (1, . . . , 1) while (1, . . . , 1) (0, . . . , 0) = (1, . . . , 1). And (1, . . . , 1) ,
(1, . . . , 1).

2) is not associative since ((1, . . . , 1) (1, . . . , 1)) (2, . . . , 2) = (0, . . . , 0) (2, . . . , 2) = (2, . . . , 2) while (1, . . . , 1)
((1, . . . , 1) (2, . . . , 2)) = (1, . . . , 1) (1, . . . , 1) = (2, . . . , 2).

3) There does exist a right additive identity, i.e. a vector 0 that satisfies + 0 = for all . The vector = (0, . . . , 0) satisfies
+ = for all . And if 0 = (b1 , . . . , bn ) also satisfies (x1 , . . . , xn ) + 0 = (x1 , . . . , xn ) then xi bi = xi for all i and thus
bi = 0 for all i. Thus = (0, . . . , 0) is unique with respect to the property + = for all .

4) There do exist right additive inverses. For the vector = (x1 , . . . , xn ) clearly only itself satisfies = (0, . . . , 0).

5) The element 1 does not satisfy 1 = for any non-zero since otherwise we would have 1(x1 , . . . , xn ) = (x1 , . . . , xn ) =
(x1 , . . . , xn ) only if xi = 0 for all i.

6) The property (c1 c2 ) = c1 (c2 ) does not hold since (c1 c2 ) = (c1 c2 ) while c1 (c2 ) = c1 (c2 ) = (c1 (c2)) =
+c1 c2 . Since c1 c2 , c1 c2 for all c1 , c2 they are not always equal.

7) It does hold that c ( ) = c c . Firstly, c ( ) = c ( ) = c( ) = c + c. And secondly

c c = (c) (c) = c (c) = c + c. Thus they are equal.

8) It does not hold that (c1 + c2 ) = (c1 ) (c2 ). Firstly, (c1 + c2 ) = (c1 + c2 ) = c1 c2 . Secondly,
c1 c2 = (c1 ) (c2 ) = c1 + c2 . Since c1 c2 , c1 c2 for all c1 , c2 they are not equal.

Exercise 6: Let V be the set of all complex-valued functions f on the real line such that (for all t in R)
f (t) = f (t).
The bar denotes complex conjugation. Show that V, with the operations
( f + g)(t) = f (t) + g(t)
(c f )(t) = c f (t)
is a vector space over the field of real numbers. Give an example of a function in V which is not real-valued.

Solution: We will use the basic fact that a + b = a + b and ab = a b.

Before we show V satisfies the eight properties we must first show vector addition and scalar multiplication as defined are ac-
tually well-defined in the sense that they are indeed operations on V. In other words if f and g are two functions in V then we
must show that f + g is in V. In other words if f (t) = f (t) and g(t) = g(t) then we must show that ( f + g)(t) = ( f + g)(t).
This is true because ( f + g)(t) = f (t) + g(t) = f (t) + g(t) = ( f (t) + g(t) = ( f + g)(t).

Similary, if c R, (c f )(t) = c f (t) = c f (t) = c f (t) since c = c when c R.

Thus the operations are well defined. We now show the eight properties hold:

1) Addition on functions in V is defined by adding in C to the values of the functions in C. Thus since C is commutative,
addition in V inherits this commutativity.

2) Similar to 1, since C is associative, addition in V inherits this associativity.

28

3) The zero function g(t) = 0 is in V since 0 = 0. And g satisfies f + g = f for all f V. Thus V has a right additive identity.

4) Let g be the function g(t) = f (t). Then g(t) = f (t) = f (t) = f (t) = g(t). Thus g V. And ( f + g)(t) = f (t) + g(t) =
f (t) f (t) = 0. Thus g is a right additive inverse for f .

5) Clearly 1 f = f since 1 is the multiplicative identity in R.

6) As before, associativity in C implies (c1 c2 ) f = c1 (c2 f ).

7) Similarly, the distributive property in C implies c( f + g) = c f + cg.

8) Similarly, the distributive property in C implies (c1 + c2 ) f = c1 f + c2 f .

An example of a function in V which is not real valued is f (x) = ix. Since f (1) = i f is not real-valued. And f (x) = ix = ix
since x R, so f V.

Exercise 7: Let V be the set of pairs (x, y) of real numbers and let F be the field of real numbers. Define

(x, y) + (x1 , y1 ) = (x + x1 , 0)

c(x, y) = (cx, 0).

Is V, with these operations, a vector space?

Solution: This is not a vector space because there would have to be an additive identity element (a, b) which has the property
that (a, b) + (x, y) = (x, y) for all (x, y) V. But this is impossible, because (a, b) + (0, 1) = (a, 0) , (0, 1) no matter what (a, b)
is. Thus V does not satisfy the third requirement of having an additive identity element.

Section 2.2: Subspaces

Page 39, typo in Exercise 3. It says R5 , should be R4 .

Exercise 1: Which of the following sets of vectors = (a1 , . . . , an ) in Rn are subspaces of Rn (n 3)?

(a) all such that a1 0;

(b) all such that a1 + 3a2 = a3 ;

(c) all such that a2 = a21 ;

(d) all such that a1 a2 = 0;

(e) all such that a2 is rational.

Solution:

(a) This is not a subspace because for (1, . . . , 1) the additive inverse is (1, . . . , 1) which does not satisfy the condition.

(b) Suppose (a1 , a2 , a3 , . . . , an ) and (b1 , b2 , b3 , . . . , bn ) satisfy the condition and let c R. By Theorem 1 (page 35) we must
show that c(a1 , a2 , a3 , . . . , an )+(b1 , b2 , b3 , . . . , bn ) = (ca1 +b1 , . . . , can +bn ) satisfies the condition. Now (ca1 +b1 )+3(ca2 +b2 ) =
c(a1 + 3a2 ) + (b1 + 3b2 ) = c(a3 ) + (b3 ) = ca3 + b3 . Thus it does satisfy the condition so V is a vector space.
 29

(c) This is not a vector space because (1, 1) satisfies the condition since 12 = 1, but (1, 1, . . . ) + (1, 1, . . . ) = (2, 2, . . . ) and
(2, 2, . . . ) does not satisfy the condition because 22 , 2.

(d) This is not a subspace. (1, 0, . . . ) and (0, 1, . . . ) both satisfy the condition, but their sum is (1, 1, . . . ) which does not satisfy
the condition.

(e) This is not a subspace. (1, 1, . . . , 1) satisfies the condition, but (1, 1, . . . , 1) = (, , . . . , ) does not satisfy the condition.

Exercise 2: Let V be the (real) vector space of all functions f from R into R. Which of the following sets of functions are
subspaces of V?
(a) all f such that f (x2 ) = f (x)2 ;
(b) all f such that f (0) = f (1);
(c) all f such that f (3) = 1 + f (5);
(d) all f such that f (1) = 0;
(e) all f which are continuous.
Solution:

(a) Not a subspace. Let f (x) = x and g(x) = x2 . Then both satisfy the condition: f (x2 ) = x2 = ( f (x))2 and g(x2 ) = (x2 )2 =
(g(x))2 . But ( f + g)(x) = x + x2 and ( f + g)(x2 ) = x2 + x4 while [( f + g)(x)]2 = (x + x2 )2 = x4 + 2x3 + x2 . These are not equal
polynomials so the condition does not hold for f + g.

(b) Yes a subspace. Suppose f and g satisfy the property. Let c R. Then (c f +g)(0) = c f (0)+g(0) = c f (1)+g(1) = (c f +g)(1).
Thus (c f + g)(0) = (c f + g)(1). By Theorem 1 (page 35) the set of all such functions constitute a subspace.

(c) Not a subspae. Let f (x) be the function defined by f (3) = 1 and f (x) = 0 for all x , 3. Let g(x) be the function defined
by g(5) = 0 and g(x) = 1 for all x , 5. Then both f and g satisfy the condition. But ( f + g)(3) = f (3) + g(3) = 1 + 1 = 2,
while 1 + ( f + g)(5) = 1 + f (5) + g(5) = 1 + 0 + 0 = 1. Since 1 , 2, f + g does not satisfy the condition.

(d) Yes a subspace. Suppose f and g satisfy the property. Let c R. Then (c f + g)(1) = c f (1) + g(1) = c 0 + 0 = 0.
Thus (c f + g)(1) = 0. By Theorem 1 (page 35) the set of all such functions constitute a subspace.

(e) Yes a subspace. Let f and g be continuous functions from R to R and let c R. Then we know from basic results of real
analysis that the sum and product of continuous functions are continuous. Since the function c 7 c is continuous as well
as f and g, it follows that c f +g is continuous. By Theorem 1 (page 35) the set of all cotinuous functions constitute a subspace.

Exercise 3: Is the vector (3, 1, 0, 1) in the subspace of R5 (sic) spanned by the vectors (2, 1, 3, 2), (1, 1, 1, 3), and
(1, 1, 9, 5)?

Solution: I assume they meant R4 . No, (3, 1, 0, 1) is not in the subspace. If we row reduce the augmented matrix
2 1 1 3

1 1 1 1


3 1 9 0
2 3 5 1
we obtain
1 0 2 2


0 1 3 1
.
0 0 0
7
0 0 0 2
30

The two bottom rows are zero rows to the left of the divider, but the values to the right of the divider in those two rows are
non-zero. Thus the system does not have a solution (see comments bottom of page 24 and top of page 25).

Exercise 4: Let W be the set of all (x1 , x2 , x3 , x4 , x5 ) in R5 which satisfy

4
2x1 x2 + x3 x4 =0
3
2
x1 +
x3 x5 = 0
3
9x1 3x2 + 6x3 3x4 3x5 = 0.
Find a finite set of vectors which spans W.

Solution: The matrix of the system is

2 1 4/3 1 0
1 0 2/3 0 1 .

9 3 6 3 3
Row reducing to reduced echelon form gives

1 0 2/3 0 1
0 1 0 1 2 .

0 0 0 0 0

Thus the system is equivalent to

x1 + 2/3x3 x5 = 0
x2 + x4 2x5 = 0.
Thus the system is parametrized by (x3 , x4 , x5 ). Setting each equal to one and the other two to zero, in turn, gives the three
vectors (2/3, 0, 1, 0, 0), (0, 1, 0, 1, 0) and (1, 2, 0, 0, 1). These three vectors therefore span W.

Exercise 5: Let F be a field and let n be a positive integer (n 2). Let V be the vectors space of all n n matrrices over F.
Which of the following sets of matrices A in V are subspaces of V?
(a) all invertible A;
(b) all non-invertible A;
(c) all A such that AB = BA, where B is some fixed matrix in V;
(d) all A such that A2 = A.
Solution:
" # " # " #
1 0 1 0 0 0
(a) This is not a subspace. Let A = and let B = . Then both A and B are invertible, but A+ B =
0 1 0 1 0 0
which is not invertible. Thus the subset is not closed with respect to matrix addition. Therefore it cannot be a subspace.
" # " # " #
1 0 0 0 1 0
(b) This is not a subspace. Let A = and let B = . Then neither A nor B is invertible, but A + B =
0 0 0 1 0 1
which is invertible. Thus the subset is not closed with respect to matrix addition. Therefore it cannot be a subspace.

(c) This is a subspace. Suppose A1 and A2 satisfy A1 B = BA1 and A2 B = BA2 . Let c F be any constant. Then
(cA1 + A2 )B = cA1 B + A2 B = cBA1 + BA2 = B(cA1 ) + BA2 = B(cA1 + A2 ). Thus cA1 + A2 satisfy the criteria. By
Theorem 1 (page 35) the subset is a subspace.
 31

(d) This is a subspace if F equals Z/2Z, otherwise it is not a subspace.

" # " # " #2 " #
1 0 2 0 2 0 4 0
Suppose first that char(F) , 2. Let A = . Then A2 = A. But A + A = and = ,
0 1 0 2 0 2 0 4
" #
2 0
. Thus A + A does not satisfy the criteria so the subset cannot be a subspace.
0 2
Suppose now that F = Z/2Z. Suppose A and B both satisfy A2 = A and B2 = B. Let c F be any scalar. Then
(cA + B)2 = c2 A2 + 2cAB + B2 . Now 2 = 0 so this reduces to c2 A2 + B2 . If c = 0 then this reduces to B2 which equals
B, if c = 1 then this reduces to A2 + B2 which equals A + B. In both cases (cA + B)2 = cA + B. Thus in this case by Theorem
1 (page 35) the subset is a subspace.

Finally suppose char(F) = 2 but F is not Z/2Z. Then |F| > "2. The polynomial
# x2 x = 0 has at most two solutions in F, so
1 0
c F such that c2 , c. Consider the identity matrix I = . Then I 2 = I. If such matrices form a subspace then it
0 1
must be that cI is also in the subspace. Thus it must be that (cI)2 = cI. Which is equivalent to c2 = c, which contradicts the
way c was chosen.

Exercise 6:
(a) Prove that the only subspaces of R1 are R1 and the zero subspace.
(b) Prove that a subspace of R2 is R2 , or the zero subspace, or consists of all scalar multiples of some fixed vector in R2 .
(The last type of subspace is, intuitively, a straight line through the origin.)
(c) Can you describe the subspaces of R3 ?
Solution:

(a) Let V be a subspace of R1 . Suppose v V with v , 0. Then v is a vector but it is also simply an element of R. Let
R. Then = v v where v is a scalar in the base field R. Since cv V c R, it follows that V. Thus we have
shown that if V , {0} then V = R1 .

(b) We know the subsests {(0, 0)} (example 6a, page 35) and R2 (example 1, page 29) are subspaces of R2 . Also for any vector
v in any vector space over any field F, the set {cv | c F} is a subspace (Theorem 3, page 37). Thus we must show that if V
is a subspace of R2 and there exists v1 , v2 V such that v1 and v2 do not lie on the same line, then V = R2 . Equivalently we
must show that any vector w R2 can be written as a linear combination of v1 and v2 whenever v1 and v2 are not co-linear.
Equivalently, by Theorem 13 (iii) (page 23), it suffices to show that if v1 = (a, b) and v2 = (c, d) are not colinear, then the
matrix A = [vT1 vT2 ] is invertible. Suppose a , 0 and let x = c/a. Then xa = c, and since v1 and v2 are not colinear, it follows
that xb , d. Thus equivalently ad bc , 0. It follows now from Exercise 1.6.8 pae 27 that if v1 and v2 not colinear then the
matrix AT is invertible. Finally AT is invertible implies A is invertible, since clearly (AT )1 = (A1 )T . Similarly if a = 0 then
it must be that b , 0 so we can make the same argument. So in all cases A is invertible.

(c) The subspaces are the zero subspace {0, 0, 0}, lines {cv | c R} for fixed v R3 , planes {c1 v1 + c2 v2 | c1 , c2 R} for
fixed v1 , v2 R3 and the whole space R3 . By Theorem 3 we know these all are subspaces, we just must show they are the
only subspaces. It suffices to show that if v1 , v2 and v3 are not co-planar then the space generated by v1 , v2 , v3 is all of R3 .
Equivalently we must show if v3 is not in the plane generated by v1 , v2 then any vector w R3 can be written as a linear com-
bination of v1 , v2 , v3 . Equivalently, by Theorem 13 (iii) (page 23), it suffices to show the matrix A = [v1 v2 v3 ] is invertible.
A is invertible AT is invertible since clearly (AT )1 = (A1 )T . Now v3 is in the plane generated by v1 , v2 v3 can be
written as a linear combination of v1 and v2 AT is row equivalent to a matrix with a row equal to all zeros (this follows
from Theorem 12, page 23) AT is not invertible. Thus v3 is not in the plane generated by v1 , v2 A is invertible.

Exercise 7: Let W1 and W2 be subspaces of a vector space V such that the set-theoretic union of W1 and W2 is also a subspace.
Prove that one of the spaces Wi is contained in the other.
32

Solution: Assume the space generated by W1 and W2 is equal to their set-theoretic union W1 W2 . Suppose W1 * W2 and
W2 * W1 . We wish to derive a contradiction. So suppose w1 W1 \ W2 and w2 W2 \ W1 . Consider w1 + w2 . By
assumption this is in W1 W2 , so w01 W1 such that w1 + w2 = w01 or w02 W2 such that w1 + w2 = w02 . If the former, then
w2 = w01 w1 W1 which contradicts the assumption that w2 < W1 . Likewise the latter implies the contradiction w1 W2 .
Thus we are done.

Exercise 8: Let V be the vector space of all functions from R into R; let Ve be the susbset of even functions, f (x) = f (x);
let Vo be the subset of odd functions, f (x) = f (x).
(a) Prove that Ve and Vo are subspaces of V.
(b) Prove that Ve + Vo = V.
(c) Prove that Ve Vo = {0}.
Solution:

(a) Let f, g Ve and c R. Let h = c f + g. Then h(x) = c f (x) + g(x) = c f (x) + g(x) = h(x). So h Ve . By Theorem 1
(page 35) Ve is a subspace. Now let f, g Vo and c R. Let h = c f +g. Then h(x) = c f (x)+g(x) = c f (x)g(x) = h(x).
So h Vo . By Theorem 1 (page 35) Vo is a subspace.

(b) Let f V. Let fe (x) = f (x)+2f (x) and fo = f (x) f (x)

2 . Then fe is even and fo is odd and f = fe + fo . Thus we have written
f as g + h where g Ve and h Vo .

(c) Let f Ve Vo . Then f (x) = f (x) and f (x) = f (x). Thus f (x) = f (x) which implies 2 f (x) = 0 which implies f = 0.

Exercise 9: Let W1 and W2 be subspaces of a vector space V such that W1 + W2 = V and W1 W2 = {0}. Prove that for each
vector in V there are unique vectors 1 in W1 and 2 in W2 such that = 1 + 2 .

Solution: Let W. Suppose = 1 + 2 for i Wi and = 1 + 2 for i Wi . Then 1 + 2 = 1 + 2 which implies

1 1 = 2 2 . Thus 1 1 W1 and 1 1 W2 . Since W1 W2 = {0} it follows that 1 1 = 0 and thus 1 = 1 .
Similarly, 2 2 W1 W2 so also 2 = 2 .

Section 2.3: Bases and Dimension

Exercise 1: Prove that if two vectors are linearly dependent, one of them is a scalar multiple of the other.

Solution: Suppose v1 and v2 are linearly dependent. Then c1 , c2 such that c1 v1 + c2 v2 = 0 and at least one of c1 or c2 is
non-zero. Assume WLOG that c1 , 0. Then v1 = cc21 v2 .

Exercise 2: Are the vectors

1 = (1, 1, 2, 4), 2 = (2, 1, 5, 2)
3 = (1, 1, 4, 0), 4 = (2, 1, 1, 6)
4
linearly independent in R ?

Solution: By Corollary 3, page 46, it suffices to determine if the matrix whose rows are the i s is invertible. By Theorem 12
(ii) we can do this by row reducing the matrix
1 1 2 4

2 1 5 2
.
1 1 4 0
2 1 1 6
 33

1 1 2 4 1 1 2 4 1 1 2 4 1 1 2 4 1 1 2 4


2 1 5 2 3 9 6 1 3 2
0 0 0 1 3 2 0 1 3 2


1 1 4 0 0 2 6 4 0 3 9 6 0 3 9 6 0 0 0 0

2 1 1 6 0 1 3 2 0 2 6 4 0 2 6 4 0 0 0 0
Thus the four vectors are not linearly independent.

Exercise 3: Find a basis for the subspace of R4 spanned by the four vectors of Exercise 2.

Solution: In Section 2.5, Theorem 9, page 56, it will be proven that row equivalent matrices have the same row space. The
proof of this is almost immediate so there seems no easier way to prove it than to use that fact. If you multiply a matrix A
on the left by another matrix P, the rows of the new matrix PA are linear combinations of the rows of the original matrix.
Thus the rows of PA generate a subspace of the space generated by the rows of A. If P is invertible, then the two spaces
must be contained in each other since we can go backwards with P1 . Thus the rows of row-equivalent matrices generate the
same space. Thus using the row reduced form of the matrix in Exercise 2, it must be that the space is two dimensoinal and
generated by (1, 1, 2, 4) and (0, 1, 3, 2).

Exercise 4: Show that the vectors

1 = (1, 0, 1), 2 = (1, 2, 1), 3 = (0, 3, 2)

form a basis for R3 . Express each of the standard basis vectors as linear combinations of 1 , 2 , and 3 .

Solution: By Corollary 3, page 46, to show the vectors are linearly independent it suffices to show the matrix whose rows are
the i s is invertible. By Theorem 12 (ii) we can do this by row reducing the matrix

1 0 1
A = 1 2 1 .

0 3 2

1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0
1 2 1 0 2 2 0 1 1 0 1 1 0 1 1 0 1 0 .

0 3 2 0 3 2 0 3 2 0 0 5 0 0 1 0 0 1
Now to write the standard basis vectors in terms of these vectors, by the discussion at the bottom of page 25 through page 26,
we can row-reduce the augmented matrix
1 0 1 1 0 0
1 2 1 0 1 0 .


0 3 2 0 0 1

This gives
1 0 1 1 0 0
1 2 1 0 1 0

0 3 2 0 0 1


1 0 1 1 0 0
0 2 2 1 1 0

0 3 2 0 0 1


1 0 1 1 0 0
0 1 1 1/2 1/2 0

0 3 2 0 0 1


1 0 1 1 0 0
0 1 1 1/2 1/2 0

0 0 5 3/2 3/2 1

34

1 0 1 1 0 0
0 1 1 1/2 1/2 0

0 0 1 3/10 3/10 1/5


1 0 0 7/10 3/10 1/5
0 1 0 1/5 1/5 1/5 .

0 0 1 3/10 3/10 1/5

Thus if
7/10 3/10 1/5
P = 1/5 1/5 1/5


3/10 3/10 1/5

then PA = I, so we have
7 3 1
1 + 2 + 3 = (1, 0, 0)
10 10 5
1 1 1
1 + 2 3 = (0, 1, 0)
5 5 5
3 3 1
1 + 2 + 3 = (0, 0, 1).
10 10 5
Exercise 5: Find three vectors in R3 which are linearly dependent, and are such that any two of them are linearly independent.

Solution: Let v1 = (1, 0, 0), v2 = (0, 1, 0) and v3 = (1, 1, 0). Then v1 + v2 v3 = (0, 0, 0) so they are linearly dependent. We
know v1 and v2 are linearly independent as they are two of the standard basis vectors (see Example 13, page 41). Suppose
av1 + bv3 = 0. Then (a + b, b, 0) = (0, 0, 0). The second coordinate implies b = 0 and then the first coordinate in turn implies
a = 0. Thus v1 and v3 are linearly independent. Analogously v2 and v3 are linearly independent.

Exercise 6: Let V be the vector space of all 2 2 matrices over the field F. Prove that V has dimension 4 by exhibiting a
basis for V which has four elements.

Solution: Let " # " #

1 0 0 1
v11 = , v12 =
0 0 0 0
" # " #
0 0 0 0
v21 = , v22 =
1 0 0 1
" #
0 0
Suppose av11 + bv12 + cv21 + dv22 = . Then
0 0
" # " #
a b 0 0
= ,
c d 0 0
from which it follows immediately that a = b = c = d = 0. Thus v11 , v12 , v21 , v22 are linearly independent.
" # " #
a b a b
Now let be any 2 2 matrix. Then = av11 + bv12 + cv21 + dv22 . Thus v11 , v12 , v21 , v22 span the space of
c d c d
2 2 matrices.

Thus v11 , v12 , v21 , v22 are both linearly independent and they span the space of all 2 2 matrices. Thus v11 , v12 , v21 , v22
constitue a basis for the space of all 2 2 matrices.

Exercise 7: Let V be the vector space of Exercise 6. Let W1 be the set of matrices of the form
" #
x x
y z
 35

and let W2 be the set of matrices of the form " #

a b
.
a c
(a) Prove that W1 and W2 are subspaces of V.

(b) Find the dimension of W1 , W2 , W1 + W2 , and W1 W2 .

Solution:
" # " #
x x x0 x0
(a) Let A = and B = be two elements of W1 and let c F. Then
y z y0 z0

cx + x0
" # " #
cx x0 a a
cA + B = =
cy + y0 cz + z0 u v

where a = cx + x0 , u = cy + y0 and v = cz + z0 . Thus cA + B is in the form of an element of W1 . Thus cA + B W1 . By

Theorem 1 (page 35) W1 is a subspace.
" # " 0 #
a b a b0
Now let A = and B = be two elements of W1 and let c F.Then
a d a0 d0

ca + a0 cb + b0
" # " #
x y
cA + B = =
ca a0 cd + d0 x z

where x = ca + a0 , y = cb + b0 and z = cd + d0 . Thus cA + B is in the form of an element of W2 . Thus cA + B W2 . By

Theorem 1 (page 35) W2 is a subspace.

(b) Let " # " # " #

1 1 0 0 0 0
A1 = , A2 = , A2 = .
0 0 1 0 0 1
Then A1 , A2 , A3 W1 and " # # "
0c1 c1 0
c1 A1 + c2 A2 + c3 A3 = =
0c2 c3 0
" #
x x
implies c1 = c2 = c3 = 0. So A1 , A2 , A3 are linearly independent. Now let A = be any element of W1 . Then
y z
A = xA1 + yA2 + zA3 . Thus A1 , A2 , A3 span W1 . Thus {A1 , A2 , A3 } form a basis for W1 . Thus W1 has dimension three.

Let " # " # " #

1 0 0 1 0 0
A1 = , A2 = , A2 = .
1 0 0 0 0 1
Then A1 , A2 , A3 W2 and " # " #
c1 c2 0 0
c1 A1 + c2 A2 + c3 A3 = =
c1 c3 0 0
# "
x y
implies c1 = c2 = c3 = 0. So A1 , A2 , A3 are linearly independent. Now let A = be any element of W2 . Then
x z
A = xA1 + yA2 + zA3 . Thus A1 , A2 , A3 span W2 . Thus {A1 , A2 , A3 } form a basis for W2 . Thus W2 has dimension three.

Let V be the space of 2 2 matrices. We showed in Exercise

" 6# that the dim(V) = 4. Now W1 W1 + W2 V. Thus by
1 0
Corollary 1, page 46, 3 dim(W1 + W2 ) 4. Let A = . Then A W2 and A < W1 . Thus W1 + W2 is strictly bigger
1 0
36

than W1 . Thus 4 dim(W1 + W2 ) > dim(W1 ) = 3. Thus dim(W1 + W2 ) = 4.

" # " #
a b a a
Suppose A = is in W1 W2 . Then A W1 a = b and A W2 a = c. So A = . Let
c d a b
" # " #
1 1 0 0
A1 = , A2 = . Suppose aA1 + bA2 = 0. Then
1 0 0 1
" # " #
a a 0 0
= ,
a b 0 0
# "
a a
which implies a = b = 0. Thus A1 and A2 are linearly independent. Let A = W1 W2 . Then A = aA1 + bA2 .
a b
So A1 , A2 span W1 W2 . Thus {A1 , A2 } is a basis for W1 W2 . Thus dim(W1 W2 ) = 2.

Exercise 8: Again let V be the space of 2 2 matrices over F. Find a basis {A1 , A2 , A3 , A4 } for V such that A2j = A j for each j.

Solution: Let V be the space of all 2 2 matrices. Let

" # " #
1 0 0 0
A1 = , A2 =
0 1 0 1
" # " #
1 1 0 0
A3 = , A4
0 0 1 1
Then A2i = Ai i. Now
a+c
" # " #
c 0 0
aA1 + bA2 + cA3 + dA4 = =
d b+d 0 0
implies c = d = 0 which in turn implies a = b = 0. Thus A1 , A2 , A3 , A4 are linearly independent. Thus they span a subspace
of A of dimension four. But by Exercise 6, A also has dimension four. Thus by Corollary 1, page 46, the subspace spanned
by A1 , A2 , A3 , A4 is the entire space. Thus {A1 , A2 , A3 , A4 } is a basis.

Exercise 9: Let V be a vector space over a subfield F of the complex numbers. Suppose , , and are linearly independent
vectors in V. Prove that ( + ), ( + ), and ( + ) are linearly independent.

Solution: Suppose a( + ) + b( + ) + c( + ) = 0. Rearranging gives (a + c) + (a + b) + (b + c) = 0. Since , , and

are linearly independent it follows that a + c = a + b = b + c = 0. This gives a system of equations in a, b, c with matrix

1 1 0
1 0 1 .

0 1 1

This row-reduces as follows:

1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1 0 0
1 0 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 .


0 1 1 0 1 1 0 1 1 0 0 2 0 0 1 0 0 1

Since this row-reduces to the identity matrix, by Theorem 7, page 13, the only solution is a = b = c = 0. Thus ( + ), ( + ),
and ( + ) are linearly independent.

Exercise 10: Let V be a vector space over the field F. Suppose there are a finite number of vectors 1 , . . . , r in V which
span V. Prove that V is finite-dimensional.
 37

Solution: If any i s are equal to zero then we can remove them from the set and the remaining i s still span V. Thus we can
assume WLOG that i , 0 i. If 1 , . . . , r are linearly independent, then {1 , . . . , r } is a basis and dim(V) = r < . On the
other hand if 1 , . . . , r are linearly dependent, then c1 , . . . , cr F, not all zero, such that c1 1 + + cr r = 0. Suppose
WLOG that cr , 0. Then r = cc1r 1 ccr1r r1 . Thus r is in the subspace spanned by 1 , . . . , r1 . Thus 1 , . . . , r1
spans V. If 1 , . . . , r1 are linearly independent then {1 , . . . , r1 } is a basis and dim(V) = r 1 < . If 1 , . . . , r1 are
linearly dependent then arguing as before (with possibly re-indexing) we can produce 1 , . . . , r2 which span V. Continuing
in this way we must eventually arrive at a linearly independent set, or arrive at a set that consists of a single element, that still
spans V. If we arrive at a single element v1 then {v1 } is linearly independent since cv1 = 0 c = 0 (see comments after (2-9)
page 31). Thus we must eventually arrive at a finite set that is spans and is linearly independent. Thus we must eventually
arrive at a finite basis, which implies dim(V) < .

Exercise 11: Let V be the set of all 2 2 matrices A with complex entries which satisfy A11 + A22 = 0.

(a) Show that V is a vector space over the field of real numbers, with the usual operations of matrix addition and multipli-
cation of a matrix by a scalar.

(b) Find a basis for this vector space.

(c) Let W be the set of all matrices A in V such that A21 = A12 (the bar denotes complex conjugation). Prove that W is a
subspace of V and find a basis for W.

Solution: (a) It is clear from inspection of the definition of a vector space (pages 28-29) that a vector space over a field F is
a vector space over every subfield of F, because all properties (e.g. commutativity and associativity) are inherited from the
operations in F. Let M be the space of all 2 2 matrices over C. We will show M is a subspace V as a vector space over C. It
will follow from the comment above that M is a vector space over R. Now V is a subset"of M, so# using Theorem " 0 1 0(page
# 35)
x y x y
we must show whenever A, B V and c C then cA + B V. Let A, B V. Write A = and B = . Then
z w z0 w0

x + w = x0 + w0 = 0. (17)

cx + x0 cy + y0
" #
cA + B =
cz + z0 cw + w0
To show cA + B V we must show (cx + x0 ) + (cw + w0 ) = 0. Rearranging the left hand side gives c(x + w) + (x0 + w0 ) which
equals zero by (17).

(b) We can write the general element of V as

a + bi e + f i
" #
A= .
g + hi a bi

Let " # " #

1 0 i0
v1 = , v2 = ,
0 1 i
0
" # " #
0 1 0 i
v3 = , v4 = ,
0 0 0 0
" # " #
0 0 0 0
v5 = , v6 = .
1 0 i 0
Then A = av1 + bv2 + ev3 + f v4 + gv5 + hv6 so v1 , v2 , v3 , v4 , v5 , v6 span V. Suppose av1 + bv2 + ev3 + f v4 + gv5 + hv6 = 0. Then

a + bi e + f i
" # " #
0 0
av1 + bv2 + ev3 + f v4 + gv5 + hv6 = =
g + hi a bi 0 0
38

implies a = b = c = d = e = f = g = h = 0 because a complex number u + vi = 0 u = v = 0. Thus v1 , v2 , v3 , v4 , v5 , v6 are

linearly independent. Thus {v1 , . . . , v6 } is a basis for V as a vector space over R, and dim(V) = 6.
" # " 0 #
x y x y0
(c) Let A, B W and c R. By Theorem 1 (page 35) we must show cA + B W. Write A = and B = ,
z x z0 x0
where x, y, z, x , y , z C. Then
0 0 0

cx + x0 cy + y0
" #
cA + B = .
cz + z0 c x x0

Since c x x0 = (cx + x0 ), it follows that cA + B W.

Exercise 12: Prove that the space of m n matrices over the field F has dimension mn, by exhibiting a basis for this space.

Solution: Let M be the space of all m n matrices. Let Mi j be the matrix of all zeros except for the i, j-th place which is
a one. We claim {Mi j | 1 i m, 1 j n} constitute a basis for M. Let A = (ai j ) be an arbitrary marrix in M. Then
A = i j ai j Mi j . Thus {Mi j } span M. Suppose i j ai j Mi j = 0. The left hand side equals the matrix (ai j ) and this equals the
P P
zero matrix if and only if every ai j = 0. Thus {Mi j } are linearly independent as well. Thus they constitute a basis and M has
dimension mn.

Exercise 13: Discuss Exercise 9, when V is a vector space over the field with two elements described in Exercise 5, Section
1.1.

Solution: If F has characteristic two then ( + ) + ( + ) + ( + ) = 2 + 2 + 2 = 0 + 0 + 0 = 0 since in a field of

characteristic two, 2 = 0. Thus in this case ( + ), ( + ) and ( + ) are linearly dependent.

Exercise 14: Let V be the set of real numbers. Regard V as a vector space over the field of rational numbers, with the usual
operations. Prove that this vector space is not finite-dimensional.

Solution: We know that Q is countable and R is uncountable. Since the set of n-tuples of things from a countable set is
countable, Qn is countable for all n. Now, suppose {r1 , . . . , rn } is a basis for R over Q. Then every element of R can be written
as a1 r1 + + an rn . Thus we can map n-tuples of rational numbers onto R by (a1 , . . . , an ) 7 a1 r1 + + an rn . Thus the
cardinality of R must be less or equal to Qn . But the former is uncountable and the latter is countable, a contradiction. Thus
there can be no such finite basis.

Section 2.4: Coordinates

Exercise 1: Show that the vectors
1 = (1, 1, 0, 0), 2 = (0, 0, 1, 1)

3 = (1, 0, 0, 4), 4 = (0, 0, 0, 2)

form a basis for R4 . Find the coordinates of each of the standard basis vectors in the ordered basis {1 , 2 , 3 , 4 }.

Solution: Using Theorem 7, page 52, if we calculate the inverse of

1 0 1 0


1 0 0 0
P = .
0 1 0 0

0 1 4 2

then the columns of P1 will give the coefficients to write the standard basis vectors in terms of the i s. We do this by
 39

row-reducing the augmented matrix

1 0 1 0 1 0 0 0


1 0 0 0 0 1 0 0
.
0 1 0 0 0 0 1 0

0 1 4 2 0 0 0 1
The left side must reduce to the identity whlie the right side transforms to the inverse of P. Row reduction gives
1 0 1 0 1 0 0 0

1 0 0 0 0 1 0 0
.
0 1 0 0 0 0 1 0
0 1 4 2 0 0 0 1

1 0 1 0 1 0 0 0

0 0 1 0 1 1 0 0
.
0 1 0 0 0 0 1 0
0 1 4 2 0 0 0 1
1 0 1 0 1 0 0 0

0 1 0 0 0 0 1 0
.
0 0 1 0 1 1 0 0
0 1 4 2 0 0 0 1
1 0 1 0 1 0 0 0

0 1 0 0 0 0 1 0
.
0 0 1 0 1 1 0 0
0 0 4 2 0 0 1 1
1 0 1 0 1 0 0 0

0 1 0 0 0 0 1 0

.
0 0 1 0 1 1 0 0
0 0 4 2 0 0 1 1
1 0 0 0 0 1 0 0

0 1 0 0 0 0 1 0

.
0 0 1 0 1 1 0 0
0 0 0 2 4 4 1 1
1 0 0 0 0 1 0 0

0 1 0 0 0 0 1 0

.
0 0 1 0 1 1 0 0
0 0 0 1 2 2 1/2 1/2
Thus {1 , . . . , 4 } is a basis. Call this basis . Thus (1, 0, 0, 0) = 3 24 , (0, 1, 0, 0) = 1 3 + 24 , (0, 0, 1, 0) = 2 21 4
and (0, 0, 0, 1) = 12 4 .

Thus [(1, 0, 0, 0)] = (0, 0, 1, 2), [(0, 1, 0, 0)] = (1, 0, 1, 2), [(0, 0, 1, 0)] = (0, 1, 0, 1/2) and [(0, 0, 0, 1)] = (0, 0, 0, 1/2).

Exercise 2: Find the coordinate matrix of the vector (1, 0, 1) in the basis of C3 consisting of the vectors (2i, 1, 0), (2, 1, 0),
(0, 1 + i, 1 i), in that order.

1
Solution: Using Theorem 7, page 52, the answer is P1 0 where

1


2i 2 0
P = 1 1 1 + i .

0 0 1i

40

We find P1 by row-reducing the augmented matrix

2i 2 0 1 0 0
1 1 1 +i 0 1 0 .


0 0 1i 0 0 1

The right side will transform into the P1 . Row reducing:

2i 2 0 1 0 0
1 1 1 + i 0 1 0

0 0 1i 0 0 1

1 1 1 + i 0 1 0

2i 2 0 1 0 0

0 0 1i 0 0 1

1 + i 0 1 0

1 1
0 2 + 2i 2 2i 1 2i 0

0 0 1i 0 0 1

1 1 1 + i 0

1 0
1i 1i
0 1 i 0

4 2
0 0 1i 0 0 1

1i 1i
1 0 1 4 2 0

1i 1i

0 1 i 4 2 0

0 0 1i 0 0 1
1 0 1 1i 1i

4 2 0

1i
0 1 i 1i

4 2 0
1+i

0 0 1 0 0 2
1i
1 0 0 1i 1i

4 2 2
1i 1+i
0 1 0 1i

4 2 2

1+i

0 0 1 0 0 2
Therefore
1i 1i 1i 13i
1 4 2 2 1 4
P1 0 = 1i 1i 1+i 0 = 1+i


4 2 2 4
1
1+i 1+i

0 0 2
1 2

Thus (1, 0, 1) = 13i

4 (2i, 1, 0) + 1+i
4 (2, 1, 0) + 1+i
2 (0, 1 + i, 1 i).

Exercise 3: Let B = {1 , 2 , 3 } be the ordered basis for R3 consisting of

1 = (1, 0, 1), 2 = (1, 1, 1), 3 = (1, 0, 0).

What are the coordinates of the vector (a, b, c) in the ordered basis B?

a
Solution: Using Theorem 7, page 52, the answer is P1 b where

c

1 1 1
P = 0 1 0 .

1 1 0

 41

We find P1 by row-reducing the augmented matrix

1 1 1 1 0 0
0 1 0 0 1 0 .

1 1 0 0 0 1

The right side will transform into the P1 . Row reducing:

1 1 1 1 0 0
0 1 0 0 1 0 .

1 1 0 0 0 1

1 1 1 1 0 0
0 1 0 0 1 0 .

0 2 1 1 0 1


1 0 1 1 1 0
0 1 0 0 1 0 .

0 0 1 1 2 1


1 0 0 0 1 1
0 1 0 0 1 0 .

0 0 1 1 2 1

Therefore,
a 0 1 1 a bc
P1 b = 0 1 0 b = b


c 1 2 1 c a 2b + c

Thus the answer is

[(a, b, c)]B = (b c, b, a 2b + c).
Exercise 4: Let W be the subspace of C spanned by 1 = (1, 0, i) and 2 = (1 + i, 1, 1).
3

(a) Show that 1 and 2 form a basis for W.

(b) Show that the vectors 1 = (1, 1, 0) and 2 = (1, i, 1 + i) are in W and form another basis for W.
(c) What are the coordinates of 1 and 2 in the ordered basis {1 , 2 } for W?
Solution: (a) To show 1 and 2 form a basis of the space they generate we must show they are linearly independent. In other
words that a1 + b2 = 0 a = b = 0. Equivalently we need to show neither is a multiple of the other. If 2 = c1 then
from the second component it follows that c = 0 which would imply 2 = (0, 0, 0), which it does not. So {1 , 2 } is a basis
for the space they genearate.

(b) Since the first coordinate of both 1 and 2 is one, its clear that neither is a multiple of the other. So they generate a two
dimensional subspace of C3 . If we show 1 and 2 can be written as linear combinations of 1 and 2 then since the spaces
generated by them both have dimension two, by Corollary 1, page 46, they must be equal. To show 1 and 2 can be written
as linear combinations of 1 and 2 we row-reduce the augmented matrix
1 1 + i 1

1
0 1 1 i .

i 1 0 1 + i

Row reduction follows:

1+i 1 1 + i 1 1

1 1 1 1 0 i 2i
0 1 1 i 0 1 1 i 0 1 1 i


i 1 0 1+i 0 i i 1 0 0 0 0

42

Thus 1 = i1 + 2 and 2 = (2 i)1 + i2 .

(c) We have to write the i s in terms of the i s, basically the opposite of what we did in part b. In this case we row-reduce
the augmented matrix

1 1 + i 1 1 + i 1 1 + i

1 1 1 1 1 1
1 i 0 1 0 1 + i 1 i 0 1 + i 1 i

0 1 + i i 1 0 1+i

i 1 0 0 0 0

1i 3+i
1 + i

1 0

1 1 1 2 2
1+i 1+i 1+i 1+i
0 1 0

2 2 1 2 2


0 0 0 0

0 0 0 0
Thus 1 = 2 1
1i
+ 2 2
1+i
and 2 = 2 1
3+i
+ 2 2 .
1+i
So finally, if B is the basis {1 , 2 } then

1i 1+i
!
[1 ]B = ,
2 2

3 + i 1 + i
!
[2 ]B = , .
2 2
Exercise 5: Let = (x1 , x2 ) and = (y1 , y2 ) be vectors in R2 such that

x1 y1 + x2 y2 = 0, x12 + x22 = y21 + y22 = 1.

Prove that B = {, } is a basis for R2 . Find the coordinates of the vector (a, b) in the ordered basis B = {, }. (The conditions
on and say, geometrically, that and are perpendicular and each has length 1.)

Solution: It suffices by Corollary 1, page 46, to show and are linearly indepdenent, because then they generate a subspace
of R2 of dimension two, which therefore must be all of R2 . The second condition on x1 , x2 , y1 , y2 implies that neither nor
are the zero vector. To show two vectors are linearly independent we only need show neither is a non-zero scalar multiple of
the other. Suppose WLOG that = c for some c R, and since nither vector is the zero vector, c , 0. Then y1 = cx1 and
y2 = cx + 2. Thus the conditions on x1 , x2 , y1 , y2 implies

0 = x1 y1 + x2 y2 = cx12 + cx22 = c(x12 + x22 ) = c 1 = c.

Thus c = 0, a contradiction.

It remains to find the coordinates of the arbitrary vector (a, b) in the ordered basis {, }. To find the coordinates of (a, b) we
can row-reduce the augmented matrix " #
x1 y1 a
.
x2 y2 b
It cannot be that both x1 = x2 = 0 so assume WLOG that x1 , 0. Also it cannot be that both y1 = y2 = 0. Assume first that
y1 , 0. Since order matters we cannot assume y1 , 0 WLOG, so we must consider both cases. Then note that x1 y1 + x2 y2 = 0

x2 y2
= 1 (18)
x1 y1
 2
Thus if x1 y2 x2 y1 = 0 then xx21 = yy21 from which (18) implies xx21 = 1, a contradiction. Thus we can conclude that
x1 y2 x2 y1 , 0. We use this in the following row reduction to be sure we are not dividing by zero.

1 y1 /x1 a/x1 y1 /x1 y1 /x1

" # " # " # " #
x1 y1 a 1 a/x1 1 a/x1
=
x2 y2 b x2 y2 b 0 y2 xx2 y1 1 b xx21a 0 x1 y2xx
1
2 y1 bx1 ax2
x1
 43
ay2 by1
y1 /x1 1 0
" #
1 a/x1 x1 y2 x2 y1

bx1 ax2
0 1 x1 y2 x2 y1 0 1 bx1 ax2
x1 y2 x2 y1
ay2 by1
Now if we substitute y1 = x2 y2 /x1 into the numerator and denominator of x1 y2 x2 y1 and use x12 + x22 = 1 it simplifies to
ay2 by1
ax1 + bx2 . Similarly x1 y2 x2 y1 simplifies to ay1 + by2 . So we get

ax1 + bx2
" #
1 0
.
0 1 ay1 + by2

Now assume y2 , 0 (and we continue to assume x1 , 0 since we assumed that WLOG). In this case
y1 x2
= (19)
y2 x1
 2
So if x1 y2 x2 y1 = 0 then xx21 yy12 = 1. But then (19) implies xx12 = 1 a contradition. So also in this case we can assume
x1 y2 x2 y1 , 0 and so we can do the same row-reduction as before. Thus in all cases

(ax1 + bx2 ) + (ay1 + by2 ) = (a, b)

or equivalently
(ax1 + bx2 )(x1 , x2 ) + (ay1 + by2 )(y1 + y2 ) = (a, b).
Exercise 6: Let V be the vector space over the complex numbers of all functions from R into C, i.e., the space of all complex-
valued functions on the real line. Let f1 (x) = 1, f2 (x) = eix , f3 (x) = eix .
(a) Prove that f1 , f2 , and f3 are linearly independent.
(b) Let g1 (x) = 1, g2 (x) = cos x, g3 (x) = sin x. Find an invertible 3 3 matrix P such that
3
X
gj = Pi j fi .
i=1

Solution: Suppose a + beix + ceix = 0. Let y = eix . Then y , 0 and a + by + yc = 0 which implies ay + by2 + c = 0. This is
a quadratic polynomial in y thus can be zero for at most two values of y. But eix is a continuous non-constant function, so it
cannot be zero for all y = eix , so this is a contradiction.

We know that eix = cos(x) + i sin(x). Thus eix = cos(x) i sin(x). Adding these gives 2 cos(x) = eix + eix . Thus
cos(x) = 12 eix + 21 eix . Subtracting instead of adding the equations gives eix eix = 2i sin(x). Thus sin(x) = 2i1 eix + 2i1 eix or
equivalently sin(x) = 2i eix 2i eix . Thus the requested matrix is

1 0 0
P = 0 1/2 i/2 .

0 1/2 i/2

Exercise 7: Let V be the (real) vector space of all polynomial functions from R into R of degree 2 or less, i.e., the space of
all functions f of the form
f (x) = c0 + c1 x + c2 x2 .
Let t be a fixed real number and define

g1 (x) = 1, g2 (x) = x + t, g3 (x) = (x + t)2 .

Prove that B = {g1 , g2 , g3 } is a basis for V. If

f (x) = c0 + c1 x + c2 x2
44

what are the coordinates of f in this ordered basis B?

Solution: We know V has dimension three (it follows from Example 16, page 43, that {1, x, x2 } is a basis). Thus by Corollary
2 (b), page 45, it suffices to show {g1 , g2 , g3 } span V. We need to solve for u, v, w the equation

c2 x2 + c1 x + c0 = u + v(x + t) + w(x + t)2 .

Rearranging
c2 x2 + c1 x + c0 = wx2 + (v + 2wt)x + (u + vt + wt2 ).
It follows that
w = c2

v = c1 2c2 t

u = c0 c1 t + c2 t2 .
Thus {g1 , g2 , g3 } do span V and the coordinates of f (x) = c2 x2 + c1 x + c0 are

(c2 , c1 2c2 t, c0 c1 t + c2 t2 ).

Section 2.6: Computations Concerning Subspaces

Exercise 1: Let s < n and A and s n matrix with entries in the field F. Use Theorem 4 (not its proof) to show that there is a
non-zero X in F n1| such that AX = 0.

Solution: Let 1 , 2 , . . . , n be the colunms of A. Then i F s i. Thus {1 , ,n } are n vectors in F s . But F s has dimension
s < n thus by Theorem 4, page 44, 1 , . . . , n cannot be linearly independent. Thus x1 , . . . , xn such that x1 1 + + xn n = 0.
Thus if
x1

X = ...


xn
then AX = x1 1 + + xn n = 0.

Exercise 2: Let
1 = (1, 1, 2, 1), 2 = (3, 0, 4, 1), 3 = (1, 2, 5, 2).
Let
= (4, 5, 9, 7), = (3, 1, 4, 4), = (1, 1, 0, 1).

(a) Which of the vectors , , are in the subspace of R4 spanned by the i ?

(b) Which of the vectors , , are in the subspace of C4 spanned by the i ?

(c) Does this suggest a theorem?

Solution:

(a) We use the approach of row-reducing the matrix whose rows are given by the i :

1 1 2 1
3 0 4 1


1 2 5 2
 45

1 1 2 1
0 3 10 4

0 3 3 3


1 1 2 1
0 0 13 1

0 1 1 1


1 0 3 0
0 1 1 1

0 0 13 1


1 0 3 0
0 1 1 1


0 0 1 1/13


1 0 0 3/13
0 1 0 14/13

0 0 1 1/13

Let 1 = (1, 0, 0, 3/13), 2 = (0, 1, 0, 14/13) and 3 = (0, 0, 1, 1/13). Thus elements of the subspace spanned by the i are
of the form b1 1 + b2 2 + b3 3
1
= (b1 , b2 , b3 , (14b2 3b1 b3 ).
13
= (4, 5, 9, 7). We have b1 = 4, b2 = 5 and b3 = 9. Thus if is in the subspace it must be that

1 ?
(14(5) 3(4) 9) = b4
13
where b4 = 7. Indeed the left hand side does equal 7, so is in the subspace.

= (3, 1, 4, 4). We have b1 = 3, b2 = 1, b3 = 4. Thus if is in the subspace it must be that

1 ?
(14 3(3) + 4) = b4
13
where b4 = 4. But the left hand side equals 9/13 , 4 so is not in the subspace.

= (1, 1, 0, 1). We have b1 = 1, b2 = 1, b3 = 0. Thus if is in the subspace it must be that

1 ?
(14 3(1) 0) = b4
13
where b4 = 1. But the left hand side equals 17/13 , 1 so is not in the subspace.

(b) Nowhere in the above did we use the fact that the field was R instead of C. The only equations we had to solve are linear
equations with real coefficients, which have solutions in R if and only if they have solutions in C. Thus the same results hold:
is in the subspace while and are not.

(c) This suggests the following theorem: Suppose F is a subfield of the field E and 1 , . . . , n are a basis for a subspace of
F n , and F n . Then is in the subspace of F n generated by 1 , . . . , n if and only if is in the subspace of E n generated
by 1 , . . . , n .

Exercise 3: Consider the vectors in R4 defined by

1 = (1, 0, 1, 2), 2 = (3, 4, 2, 5), 3 = (1, 4, 0, 9).

46

Find a system of homogeneous linear equations for which the space of solutions is exactly the subspace of R4 spanned by the
three given vectors.

Solution: We use the approach of row-reducing the matrix whose rows are given by the i :

1 0 1 2 1 0 1 2 1 0 1 2
3 4 2 5 0 4 1 11 0 1 1/4 11/4 .

1 4 0 9 0 4 1 11 0 0 0 0

Let 1 = (1, 0, 1, 2) and 2 = (0, 1, 1/4, 11/4). Then the arbitrary element of the subspace spanned by 1 and 2 is of the
form b1 1 + b2 2 for arbitrary b1 , b2 R. Expanding we get

1 11
b1 1 + b2 2 = (b1 , b2 , b1 + b2 , 2b2 + b2 ).
4 4
Thus the equations that must be satisfied for (x, y, z, w) to be in the subspace are

z = x + 14 y
(
.
w = 2x + 11 4 y

or equivalently
x + 14 y z = 0
(
.
2x + 114 yw=0

Exercise 4: In C3 let
1 = (1, 0, i), 2 = (1 + i, 1 i, 1), 3 = (i, i, i).
Prove that these vectors form a basis for C3 . What are the coordinates of the vector (a, b, c) in this basis?

Solution: We use the approach of row-reducing the augmented matrix:

1 0 i 1 0 0
1 + i 1 i 1 0 1 0


i i i 0 0 1

1 0 i 1 0 0
0 1 i i 1 i 1 0

0 i i1 i 0 1


1 0 i 1 0 0
0 1 1+i i 1+i 0

2 2
0 i i 1 i 0 1

1 0 i 1 0 0
1+i 1+i
0 1

2 i 2 0

0 0 1+3i 1 i 1i

2 2 1

1 0 i 1 0 0
0 1 1+i i 1+i
0
2 2
2+4i 2i 13i
0 0 1 5 5 5

1 0 0 12i 12i 3i

5 5 5
2i
0 1 0 12i 1+3i


5 5 5
2+4i 2i 13i

0 0 1 5 5 5
 47

Since the left side transformed into the identity matrix we know that {1 , 2 , 3 } form a basis for C3 . The matrix on the right
is P1 from (2-17), so the coordinate matrix of (a, b, c) with respect to the basis B = {1 , 2 , 3 } are given by

a
[(a, b, c)]B = P1 b

c

5 a+ 5 b+ 5 c
12i 12i 3i

= 5 a+ 5 b+ 5 c
12i 1+3i 2i .

5 a+ 5 b+
2+4i 2i 13i

5 c
Exercise 5: Give an explicit description of the type (2-25) for the vectors

= (b1 , b2 , b3 , b4 , b5 )

in R5 which are linear combinations of the vectors

1 = (1, 0, 2, 1, 1), 2 = (1, 2, 4, 2, 0)

3 = (2, 1, 5, 2, 1), 4 = (2, 1, 3, 5, 2).

Solution: We row-reduce the matrix whose rows are given by the i s.

1 0 2 1 1


1 2 4 2 0

2 1 5 2 1

2 1 3 5 2

1 0 2 1 1

0 2 2 3 1


0 1 1 0 3
0 1 1 3 4
1 0 2 1 1

0 1 1 3 4


0 0 0 3 9
0 0 0 3 7
1 0 2 1 1

0 1 1 3 4


0 0 0 1 3
0 0 0 3 7
1 0 2 1 4

0 1 1 0 5


0 0 0 1 3
0 0 0 0 2
1 0 2 0 4

0 1 1 0 5


0 0 0 1 3
0 0 0 0 1
1 0 2 0 0

0 1 1 0 0


0 0 0 1 0
0 0 0 0 1
48

Let 1 = (1, 0, 2, 0, 0), 2 = (0, 1, 1, 0, 0), 3 = (0, 0, 0, 1, 0) and 4 = (0, 0, 0, 0, 1). Then the general element that is a linear
combination of the i s is b1 1 + b2 2 + b3 3 + b4 4 = (b1 , b2 , 2b1 b2 , b3 , b4 ).

Exercise 6: Let V be the real vector space spanned by the rows of the matrix

3 21 0 9 0


1 7 1 2 1
A = .
2 14 0 6 1
6 42 1 13 0

(a) Find a basis for V.

(b) Tell which vectors (x1 , x2 , x3 , x4 , x5 ) are elements of V.

(c) If (x1 , x2 , x3 , x4 , x5 ) is in V what are its coordinates in the basis chosen in part (a)?

Solution: We row-reduce the augmented matrix

3 21 0 9 0


1 7
1 2 1

2 14 0 6 1

6 42 1 13 0

1 7 1 2 1


0 0 3 15 3

0 0 2 10 3

0 0 5 25 6

1 7 1 2 1


0 0 1 5 1

0 0 2 10 3

0 0 5 25 6

1 7 0 3 0


0 0 1 5 1

0 0 0 0 1

0 0 0 0 1

1 7 0 3 0


0 0 1 5 0

0 0 0 0 1

0 0 0 0 0
(a) A basis for V is given by the non-zero rows of the reduced matrix

1 = (1, 7, 0, 3, 0), 2 = (0, 0, 1, 5, 0), 3 = (0, 0, 0, 0, 1).

(b) Vectors of V are any of the form b1 1 + b2 2 + b3 3

= (b1 , 7b1 , b2 , 3b1 + 5b2 , b3 )

for arbitrary b1 , b2 , b3 R.
 49

(c) By the above, the element (x1 , x2 , x3 , x4 , x5 ) in V must be of the form x1 1 , x3 2 , x5 3 ). In other words if B = {1 , 2 , 3 }
is the basis for V given in part (a), then the coordinate matrix of (x1 , x2 , x3 , x4 , x5 ) is

x1
[(x1 , x2 , x3 , x4 , x5 )]B = x3 .

x5

Exercise 7: Let A be an m n matrix over the field F, and consider the system of equations AX = Y. Prove that this system
of equations has a solution if and only if the row rank of A is equal to the row rank of the augmented matrix of the system.

Solution: To solve the system we row-reduce the augmented matrix [A | Y] resulting in an augmented matrix [R | Z] where R
is in reduced echelon form and Z is an m 1 matrix. The system has a solution if and only if whenever the last k rows of R
are zero rows then the last r entries of Z are also zeros. If this were not the case then we would have = 0 for a non-zero .
Thus the only non-zero entries in Z are in subset of the rows for which R is non-zero. In this case the rank of the augmented
matrix is clearly the same as the rank of R. Thus the system has a solution if and only if the rank of R is the same as the rank
of [R|Z] which has the same rank as [A|Y] since they differ by elementary row operations.
50
Chapter 3: Linear Transformations

Section 3.1: Linear Transformations

Exercise 1: Which of the following functions T from R2 into R2 are linear transformations?

(a) T (x1 , x2 ) = (1 + x1 , x2 );

(b) T (x1 , x2 ) = (x2 , x1 );

(c) T (x1 , x2 ) = (x12 , x2 );

(d) T (x1 , x2 ) = (sin x1 , x2 );

(e) T (x1 , x2 ) = (x1 x2 , 0).

Solution:

(a) T is not a linear transformation because T (0, 0) = (1, 0) and according to the comments after Example 5 on page 68 we
know that it must always be that T (0, 0) = (0, 0).

(b) T is a linear transformation. Let = (x1 , x2 ) and = (y1 , y2 ). Then T (c+) = T ((cx1 +y1 , cx2 +y2 )) = (cx2 +y2 , cx1 +y1 ) =
c(x2 , x1 ) + (y2 , y1 ) = cT () + T ().

(c) T is not a linear transformation. If T were a linear transformatoin then wed have (1, 0) = T ((1, 0)) = T (1 (1, 0)) =
1 T (1, 0) = 1 (1, 0) = (1, 0) which is a contradiction, (1, 0) , (1, 0).

(d) T is not a linear transformation. If T were a linear transformation then (0, 0) = T (, 0) = T (2(/2, 0)) = 2T ((/2, 0)) =
2(sin(/2), 0) = 2(1, 0) = (2, 0) which is a contradiction, (0, 0) , (2, 0).
" #
1 0
(e) T is a linear transformation. Let Q = . Then (identifying R2 with R12 ) T (x1 , x2 ) = [x1 x2 ]Q so from Example
1 0
4, page 68, (with P being the identity matrix), it follows that T is a linear transformation.

Exercise 2: Find the range, rank, null space, and nullity for the zero transformation and the identity transformation on a
finite-dimensional vector space V.

Solution: Suppose V has dimension n. The range of the zero transformation is the zero subspace {0}; the range of the identity
transformation is the whole space V. The rank of the zero transformation is the dimension of the range which is zero; the rank
of the identity transformation is the rank of the whole space V which is n. The null space of the zero transformation is the
whole space V; the null space of the identity transformation is the zero subspace {0}. The nullity of the zero transformation is
the dimension of its null space, which is the whole space, so is n; the nullity of the identity transformation is the dimension
of its null space, which is the zero space, so is 0.

51
52

Exercise 3: Describe the range and the null space for the differentiation transformation of Example 2. Do the same for the
integration transformation of Example 5.

Solution: V is the space of polynomals. The range of the differentiiation transformation is all of V since if f (x) =
c0 + c1 x + + cn xn then f (x) = (Dg)(x) where g(x) = c0 x + c21 x2 + c32 x3 + + n+1
cn n+1
x . The null space of the differ-
entiation transformation is the set of constant polynomials since (Dc)(x) = 0 for constants c F.

The range of the integration transformation is all polynomials with constant term equal to zero. Let f (x) = c1 x + c2 x2 + +
xn cn . Then f (x) = (T g)(x) where g(x) = c1 +2c2 x +3c3 x2 + +ncn xn1 . Clearly the integral transoformation of a polynomial
has constant term equal to zero, so this is the entire range of the integration transformation. The null space of the integration
transformation is the zero space {0} since the integral of any other polynomial is non-zero.

Exercise 4: Is there a linear transformation T from R3 into R2 such that T (1, 1, 1) = (1, 0) and T (1, 1, 1) = (0, 1)?

Solution: Yes, there is such a linear transformation. Clearly 1 = (1, 1, 1) and 2 = (1, 1, 1) are linearly independent. By
Corollary 2, page 46, a third vector 3 such that {1 , 2 , 3 ) is a basis for R3 . By Theorem 1, page 69, there is a linear
transformation that takes 1 , 2 , 3 to any three vectors we want. Therefore we can find a linear transformatoin that takes
1 7 (1, 0), 2 7 (0, 1) and 3 7 (0, 0). (We could have used any vector instead of (0, 0).)

Exercise 5: If
1 = (1, 1), 1 = (1, 0)
2 = (2, 1), 2 = (0, 1)
3 = (3, 2), 3 = (1, 1)
is there a linear transformation T from R to R such that T i = i for i = 1, 2 and 3?
2 2

Solution: No there is no such transformation. If there was then since {1 , 2 } is a basis for R2 their images determine T com-
pletely. Now 3 = 1 2 , thus it must be that T (3 ) = T (1 2 ) = T (1 ) T (2 ) = (1, 0) (0, 1) = (1, 1) , (1, 1).
Thus no such T can exist.

Exercise 6: Describe explicitly (as in Exercises 1 and 2) the linear transformation T from F 2 into F 2 such that T 1 = (a, b),
T 2 = (c, d).
" #
a b
Solution: Im not 100% sure I understand what they want here. Let A be the matrix . Then the range of T is
c d
the row-space of A which can have dimension 0, 1, or 2 depending on the row-rank. Explicitly it is all vectors of the form
x(a, b) + y(c, d) = (ax + cy, bx + dy) where x, y are arbitrary elements of F. The rank is the dimension of this row-space, which
is 0 if a = b = c = d = 0 and if not all a, b, c, d are zero then by Exercise 1.6.8, page 27, the rank is 2 if ad bc , 0 and
equals 1 if ad bc = 0.
" #
a c
Now let A be the matrix . Then the null space is the solution space of AX = 0. Thus the nullity is 2 if a = b = c =
b d
d = 0, and if not all a, b, c, d are zero then by Exercise 1.6.8, page 27 and Theorem 13, page 23, is 0 if ad bc , 0 and is 1 if
ad bc = 0.

Exercise 7: Let F be a subfield of the complex numbers and let T be the function from F 3 into F 3 defined by

T (x1 , x2 , x3 ) = (x1 x2 + 2x3 , 2x1 + x2 , x1 2x2 + 2x3 ).

(a) Verify that T is a linear transformation.

(b) If (a, b, c) is a vector in F 3 , what are the conditions on a, b, and c that the vector be in the range of T ? What is the rank
of T ?
 53

(c) What are the conditions on a, b, and c that (a, b, c) be in the null space of T ? What is the nullity of T ?

Solution: (a) Let

1 1 2
P = 2 1 0 .

1 2 2

Then T can be represented by

x1 x1
x 7 P x2 .

2
x2 x2
By Example 4, page 68, this is a linear transformation, where weve identified F 3 with F 31 and taken Q in Example 4 to be
the identity matrix.

(b) The range of T is the row space of the matrix

1 2 1
1 1 2 .

2 0 2

We row reduce the matrix as follows

1 2 1
0 3 3 .

0 4 4


1 2 1
0 1 1 .

0 0 0


1 0 1
0 1 1 .

0 0 0

Let 1 = (1, 0, 1) and 2 = (0, 1, 1). Then elements of the row space are elements of the form b1 1 + b2 2 = (b1 , b2 , b1 b2 ).
Thus the rank of T is two and (a, b, c) is in the range of T as long as c = a b.

Alternatively, we can row reduce the augmented matrix

1 1 2 a
2 1 0 b


1 2 2 c

1 1 2 a
0 3 4 b 2a

0 3 4 a+c


1 1 2 a
0 3 4 b 2a

0 0 0 a + b + c


1 1 2 a
0 1 4/3 (b 2a)/4

0 0 0 a + b + c

54

(b + 2a)/4

1 0 2/3
0 1 4/3 (b 2a)/4


0 0 0 a + b + c

from which we arrive at the condition a + b + c = 0 or equivalently c = a b.

a
(c) We must find all X = b such that PX = 0 where P is the matrix from part (a). We row reduce the matrix

c

1 1 2
2 1 0

1 2 2

1 1 2
0 3 4


0 3 4


1 1 2
0 3 4


0 0 0


1 1 2
0 1 4/3


0 0 0


1 0 2/3
0 1 4/3


0 0 0

Therefore
a + 32 c = 0
(

b 43 c = 0
So elements of the null space of T are of the form ( 23 c, 43 c, c) for arbitrary c F and the dimension of the null space (the
nullity) equals one.

Exercise 8: Describe explicitly a linear transformation from R3 to R3 which has as its range the subspace spanned by (1, 0, 1)
and (1, 2, 2).

Solution: By Theorem 1, page 69, (and its proof) there is a linear transformation T from R3 to R3 such that T (1, 0, 0) =
(1, 0, 1), T (0, 1, 0) = (1, 0, 1) and T (0, 0, 1) = (1, 2, 2) and the range of T is exactly the subspace generated by {T (1, 0, 0), T (0, 1, 0), T (0, 0, 1
{(1, 0, 1), (1, 2, 2)}.

Exercise 9: Let V be the vector space of all n n matrices over the field F, and let B be a fixed n n matrix. If

T (A) = AB BA

verify that T is a linear transformation from V into V.

Solution: T (cA1 + A2 ) = (cA1 + A2 )B B(cA1 + A2 ) = cA1 B + A2 B + cBA1 + BA2

= c(A1 B + BA1 ) + (A2 B + BA2 ) = cT (A1 ) + T (A2 ).

Exercise 10: Let V be the set of all complex numbers regarded as a vector space over the field of real numbers (usual oper-
ations). Find a function from V into V which is a linear transformation on the above vector space, but which is not a linear
 55

transformation on C1 , i.e., which is not complex linear.

Solution: Let T : V V be given by a + bi 7 a. Let z = a + bi and w = a0 + b0 i and c R. Then T (cz + w) =

T ((ca + a0 ) + (cb + b0 )i) = ca + a0 = cT (a + bi) + T (a0 + b0 i) = aT (z) + T (w). Thus T is real linear. However, if T were
complex linear then we must have 0 = T (i) = T (i 1) = i T (1) = i 1 = i. But 0 , i so this is a contradiction. Thus T is not
complex linear.

Exercise 11: Let V be the space of n 1 matrices over F and let W be the space of m 1 matrices over F. Let A be a fixed
m n matrix over F and let T be the linear transformation from V into W defined by T (X) = AX. Prove that T is the zero
transformation if and only if A is the zero matrix.

Solution: If A is the zero matrix then clearly T is the zero transformation. Conversely, suppose A is not the zero matrix,
suppose the k-th column Ak has a non-zero entry. Then T (k ) = Ak , 0.

Exercise 12: Let V be an n-dimensional vector space over the field F and let T be a linear transformation from V into V such
that the range and null space of T are identical. Prove that n is even. (Can you give an example of such a linear transformatoin
T ?)

Solution: From Theorem 2, page 71, we know rank(T ) + nullity(T ) = dim V. In this case we are assuming both terms on the
left hand side are equal, say equal to m. Thus m + m = n or equivalently n = 2m which implies n is even.

The simplest example is V = {0} the zero space. Then trivially the range and null space are equal. To give a less trivial
example assume V = R2 and define T by T (1, 0) = (0, 0) and T (0, 1) = (1, 0). We can do this by Theorem 1, page 69 because
{(1, 0), (0, 1)} is a basis for R2 . Then clearly the range and null space are both equal to the subspace of R2 generated by (1, 0).

Exercise 13: Let V be a vector space and T a linear transformation from V into V. Prove that the following two statements
about T are equivalent.

(a) The intersection of the range of T and the null space of T is the zero subspace of V.

(b) If T (T ) = 0, then T = 0.

Solution: (a) (b): Statement (a) says that nothing in the range gets mapped to zero except for 0. In other words if x is in
the range of T then T x = 0 x = 0. Now T is in the range of T , thus T (T ) = 0 T = 0.

(b) (a): Suppose x is in both the range and null space of T . Since x is in the range, x = T for some . But then x in the
null space of T implies T (x) = 0 which implies T (T ) = 0. Thus statement (b) implies T = 0 or equivalently x = 0. Thus
the only thing in both the range and null space of T is the zero vector 0.

Section 3.2: The Algebra of Linear Transformations

Page 76: Typo in line 1: It says Ai j , . . . , Am j , it should say A1 j , . . . , Am j .

Exercise 1: Let T and U be the linear operators on R2 defined by

T (x1 , x2 ) = (x2 , x1 ) and U(x1 , x2 ) = (x1 , 0).

(a) How would you describe T and U geometrically?

(b) Give rules like the ones defining T and U for each of the transformations (U + T ), UT , T U, T 2 , U 2 .
56

Solution: (a) Geometrically, in the xy plane, T is the reflection about the diagonal x = y and U is a projection onto the x-axis.

(b)
(U + T )(x1 , x2 ) = (x2 , x1 ) + (x1 , 0) = (x1 + x2 , x1 ).
(UT )(x1 , x2 ) = U(x2 , x1 ) = (x2 , 0).
(T U)(x1 , x2 ) = T (x1 , 0) = (0, x1 ).
T 2 (x1 , x2 ) = T (x2 , x1 ) = (x1 , x2 ), the identity function.
U 2 (x1 , x2 ) = U(x1 , 0) = (x1 , 0). So U 2 = U.
Exercise 2: Let T be the (unique) linear operator on C3 for which

T 1 = (1, 0, i), T 2 = (0, 1, 1), T 3 = (i, 1, 0).

Is T invertible?

Solution: By Theorem 9 part (iv), top of page 82, T is invertible if {T 1 , T 2 , T 3 } is a basis of C3 . Since C3 has dimension
three, it suffices (by Corollary 1 page 46) to show T 1 , T 2 , T 3 are linearly independent. To do this we row reduce the matrix

1 0 i
0 1 1

i 1 0

to row-reduced echelon form. If it reduces to the identity then its rows are independent, otherwise they are dependent. Row
reduction follows:
1 0 i 1 0 i 1 0 i
0 1 1 0 1 1 0 1 1

i 1 0 0 1 1 0 0 0
This is in row-reduced echelon form not equal to the identity. Thus T is not invertible.

Exercise 3: Let T be the linear operator on R3 defined by

T (x1 , x2 , x3 ) = (3x1 , x1 x2 , 2x1 + x2 + x3 ).

Is T invertible? If so, find a rule for T 1 like the one which defines T .

Solution: The matrix representation of the transformation is

x1 3 0 0 x1
x2 7 1 1 0 x2

x3 2 1 1 x3

where weve identified R3 with R31 . T is invertible if the matrix of the transformation is invertible. To determine this we
row-reduce the matrix - we row-reduce the augmented matrix to determine the inverse for the second part of the Exercise.

3 0 0 1 0 0
1 1 0 0 1 0

2 1 1 0 0 1

1 1 0 0 1 0
3 0 0 1 0 0


2 1 1 0 0 1

 57

1 1 0 0 1 0
0 3 0 1 3 0


0 3 1 0 2 1


1 1 0 0 1 0
0 1 0 1/3 1 0

0 3 1 0 2 1


1 0 0 1/3 0 0
0 1 0 1/3 1 0

0 0 1 1 1 1

Since the left side transformed into the identity, T is invertible. The inverse transformation is given by

x1 1/3 0 0 x1
x 7 1/3 1 0 x2

2
x3 1 1 1 x3

So
T 1 (x1 , x2 , x3 ) = (x1 /3, x1 /3 x2 , x1 + x2 + x3 ).
Exercise 4: For the linear operator T of Exercise 3, prove that

(T 2 I)(T 3I) = 0.

Solution: Working with the matrix representation of T we must show

(A2 I)(A 3I) = 0

where
3 0 0
A = 1 1 0 .

2 1 1

Calculating:

3 0 0 3 0 0
A2 = 1 1 0 1 1 0


2 1 1 2 1 1


9 0 0
= 2 1 0

9 0 1

Thus
8 0 0
A2 I = 2 0 0 .

9 0 0

Also
0 0 0
A 3I = 1 4 0


2 1 2

Thus
8 0 0 0 0 0
(A2 I)(A 3I) = 2 0 0 1 4 0


9 0 0 2 1 2

58

0 0 0
= 0 0 0 .

0 0 0

Exercise 5: Let C 22 be the complex vector space of 2 2 matrices with complex entries. Let
" #
1 1
B=
4 4

and let T be the linear operator on C22 defined by T (A) = BA. What is the rank of T ? Can you describe T 2 ?

Solution: An (ordered) basis for C22 is given by

" # " #
1 0 0 0
A11 = , A21 =
0 0 1 0
" # " #
0 1 0 0
A12 = , A22 = .
0 0 0 1
If we identify C22 with C4 by " #
a b
7 (a, b, c, d)
c d
then since
A11 7 A11 4A21
A21 7 A11 + 4A21
A12 7 A12 4A22
A22 7 A12 + 4A22
the matrix of the transformation is given by
1 4 0 0


1 4 0 0
.
0
0 1 4

0 0 1 4
To find the rank of T we row-reduce this matrix:

1 4 0 0


0 0 1 4
.

0 0 0 0
0 0 0 0

It has rank two so the rank, so the rank of T is 2.

T 2 (A) = T (T (A)) = T (BA) = B(BA) = B2 A. Thus T 2 is given by multiplication by a matrix just as T is, but multiplication
with B2 instead of B. Explicitly " #" #
1 1 1 1
B =
2
4 4 4 4
" #
5 5
= .
20 20
Exercise 6: Let T be a linear transformation from R3 into R2 , and let U be a linear transformation from R2 into R3 . Prove
that the transformation UT is not invertible. Generalize the theorem.
 59

Solution: Let {1 , 2 , 3 } be a basis for R3 . Then T (1 ), T (2 ), T (3 ) must be linearly dependent in R2 . So suppose b1 T (1 )+

b2 T (2 ) + b3 T (3 ) = 0 and not all b1 , b2 , b3 are zero. Then b1 1 + b2 2 + b3 3 , 0 and

UT (b1 1 + b2 2 + b3 3 )

= U(T (b1 1 + b2 2 + b3 3 ))
= U(b1 T (1 ) + b2 T (2 ) + b3 T (3 )
= U(0) = 0.
Thus (by the definition at the bottom of page 79) UT is not non-singular and thus by Theorem 9, page 81, UT is not invertible.

The obvious generalization is that if n > m and T : Rn Rm and U : Rm Rn are linear transformations, then UT is not
invertible. The proof is an immediate generalization the proof of the special case above, just replace 3 with . . . , n .

Exercise 7: Find two linear operators T and U on R2 such that T U = 0 but UT , 0.

Solution: Identify R2 with R21 and let T and U be given by the matrices
" # " #
1 0 0 1
A= , B= .
0 0 0 0

More precisely, for " #

x
X= .
y
let T be given by X 7 AX and let U be given by X 7 BX. Thus T U is given by X 7 ABX and UT is given by X 7 BAX.
But BA = 0 and AB , 0 so we have the desired example.

Exercise 8: Let V be a vector space over the field F and T a linear operator on V. If T 2 = 0, what can you say about the
relation of the range of T to the null space of T ? Give an example of a linear operator T on R2 such that T 2 = 0 but T , 0.

Solution: If T 2 = 0 then the range of T must be contained in the null space of T since if y is in the range of T then y = T x
for some x so T y = T (T x) = T 2 x = 0. Thus y is in the null space of T .

To give an example of an operator where T 2 = 0 but T , 0, let V = R21 and let T be given by the matrix
" #
0 1
A= .
0 0

Specifically, for " #

x
X= .
y
let T be given by X 7 AX. Since A , 0, T , 0. Now T 2 is given by X 7 A2 X, but A2 = 0. Thus T 2 = 0.

Exercise 9: Let T be a linear operator on the finite-dimensional space V. Suppose ther is a linear operator U on V such
that T U = I. Prove that T is invertible and U = T 1 . Give an example which shows that this is false when V is not finite-
dimensional. (Hint: Let T = D, be the differentiation operator on the space of polynomial functions.)

Solution: By the comments in the Appendix on functions, at the bottom of page 389, we see that simply because T U = I as
functions, then necessarily T is onto and U is one-to-one. It then follows immediately from Theorem 9, page 81, that T is
invertible. Now T T 1 = I = T U and multiplying on the left by T 1 we get T 1 T T 1 = T 1 T U which implies (I)T 1 = (I)U
and thus U = T 1 .
60

Let V be the space of polynomial functions in one variable over R. Let D be the differentiation operator and let T be the
operator multiplication by x (exactly as in Example 11, page 80). As shown in Example 11, UT = I while T U , I. Thus
this example fulfills the requirement.

Exercise 10: Let A be an m n matrix with entries in F and let T be the linear transformation from F n1 into F m1 defined
by T X = AX. Show that if m < n it may happen that T is onto without being non-singular. Similarly, show that if m > n we
may have T non-singular but not onto.

Solution: Let B = {1 , . . . , n } be a basis for F n1 and let B0 = {1 , . . . , m } be a basis for F m1 . We can define a linear
transformatio from F n1 to F m1 uniquely by specifying where each member of B goes in F m1 . If m < n then we can define
a linear transformation that maps at least one member of B to each member of B0 and maps at least two members of B to the
same member of B0 . Any linear transformation so defined must necessarily be onto without being one-to-one. Similarly, if
m > n then we can map each member of B to a unique member of B0 with at least one member of B0 not mapped to by any
member of B. Any such transformation so defined will necessarily be one-to-one but not onto.

Exercise 11: Let V be a finite-dimensional vector space and let T be a linear operator on V. Suppose that rank(T 2 ) = rank(T ).
Prove that the range and null space of T are disjoint, i.e., have only the zero vector in common.

Solution: Let {1 , . . . , n } be a basis for V. Then the rank of T is the number of linearly independent vectors in the set
{T 1 , . . . , T n }. Suppose the rank of T equals k and suppose WLOG that {T 1 , . . . , T k } is a linearly independent set (it might
be that k = 1, pardon the notation). Then {T 1 , . . . , T k } give a basis for the range of T . It follows that {T 2 1 , . . . , T 2 k } span
the range of T 2 and since the dimension of the range of T 2 is also equal to k, {T 2 1 , . . . , T 2 k } must be a basis for the range
of T 2 . Now suppose v is in the range of T . Then v = c1 T 1 + + ck T k . Suppose v is also in the null space of T . Then
0 = T (v) = T (c1 T 1 + + ck T k ) = c1 T 2 1 + + ck T 2 k . But {T 2 1 , . . . , T 2 k } is a basis, so T 2 1 , . . . , T 2 k are linearly
independent, thus it must be that c1 = = ck = 0, which implies v = 0. Thus we have shown that if v is in both the range of
T and the null space of T then v = 0, as required.

Exercise 12: Let p, m, and n be positive integers and F a field. Let V be the space of m n matrices over F and W the space
of p n matrices over F. Let B be a fixed p m matrix and let T be the linear transformation from V into W defined by
T (A) = BA. Prove that T is invertible if and only if p = m and B is an invertible m m matrix.

Solution: We showed in Exercise 2.3.12, page 49, that the dimension of V is mn and the dimension of W is pn. By Theorem
9 page (iv) we know that an invertible linear transformation must take a basis to a basis. Thus if theres an invertible linear
transformation between V and W it must be that both spaces have the same dimension. Thus if T is inverible then pn = mn
which implies p = m. The matrix B is then invertible because the assignment B 7 BX is one-to-one (Theorem 9 (ii), page
81) and non-invertible matrices have non-trivial solutions to BX = 0 (Theorem 13, page 23). Conversely, if p = n and B is
invertible, then we can define the inverse transformation T 1 by T 1 (A) = B1 A and it follows that T is invertible.

Section 3.3: Isomorphism

Exercise 1: Let V be the set of complex numbers and let F be the field of real numbers. With the usual operations, V is a
vector space over F. Describe explicitly an isomorphism of this space onto R2 .

Solution: The natural isomorphism from V to R2 is given by a + bi 7 (a, b). Since i acts like a placeholder for addition in C,
(a + bi) + (c + di) = (a + c) + (b + d)i 7 (a + c, b + d) = (a, b) + (c, d). And c(a + bi) = ca + cbi 7 (ca, cb) = c(a, b). Thus this
is a linear transformation. The inverse is clearly (a, b) 7 a + bi. Thus the two spaces are isomorphic as vector spaces over R.

Exercise 2: Let V be a vector space over the field of complex numbers, and suppose there is an isomorphism T of V into C3 .
Let 1 , 2 , 3 , 4 be vectors in V such that

T 1 = (1, 0, i), T 2 = (2, 1 + i, 0),

 61

T 3 = (1, 1, 1), T 4 = ( 2, i, 3).
(a) Is 1 in the subspace spanned by 2 and 3 ?
(b) Let W1 be the subspace spanned by 1 and 2 , and let W2 be the subspace spanned by 3 and 4 . What is the intersection
of W1 and W2 ?
(c) Find a basis for the subspace of V spanned by the four vectors j .
Solution: (a) Since T is an isomorphism, it suffices to determine whether T 1 is contained in the subspace spanned by T 2
and T 3 . In other words we need to determine if there is a solution to

2 1 " # 1
1 + i 1 x = 0 .
y
0 1 i
To do this we row-reduce the augmented matrix

2 1 1 1 1/2 1/2 1 1/2 1/2
1 + i 1 0 1 + i 1 0



0 1 i


1+i 1

0 1 i 0 1 i 0

1 0 1i

1 1/2 1/2 2

0 1 i 0 1 i

1i 1+i
0 0 0 0

2 2
The zero row on the left of the dividing line has zero also on the right. This means the system has a solution. Therefore we
can conclude that 1 is in the subspace generated by 2 and 3 .

(b) Since T 1 and T 2 are linearly independent, and T 3 and T 4 are linearly independent, dim(W1 ) = dim(W2 ) = 2. We
row-reduce the matrix whose columns are the T i :

1 2 1 2
0 1 + i 1 i



i 0 1 3
which yields
1 0 i 0
,
1i
0 1 0

2
0 0 0 1
from which we deduce that T 1 , T 2 , T 3 , T 4 generate a space of dimension three, thus dim(W1 + W2 ) = 3. It then follows
(since dim(W1 ) = dim(W2 ) = 2) that dim(W1 W2 ) = 1. We also deduce from the row-reduced matrix that

2iT 1 + (i 1)T 2 + 2T 3 = 0

which implies T 3 = iT 1 + 1i
2 T 2 which implies T 3 T W1 . Thus 3 W1 . Thus 3 W1 W2 . Since dim(W1 W2 ) = 1
it follows that W1 W2 = C3 .

(c) We have determined in part (b) that the {1 , 2 , 3 , 4 } span a space of dimension three, and that 3 is in the space gener-
ated by 1 and 2 . Thus {1 , 2 , 4 } give a basis for the subspace spanned by {1 , 2 , 3 , 4 }.

Exercise 3: Let W be the set of all 2 2 complex Hermitian matrices, that is, the set of 2 2 complex matrices A such that
Ai j = A ji (the bar denoting complex conjugation). As we pointed out in Example 6 of Chapter 2, W is a vector space over the
field of real numbers, under the usual operations. Verify that
t + x y + iz
" #
(x, y, z, t)
y iz t x
62

is an isomorphism of R4 onto W.

Solution: The function is linear since the four components are all linear combinations of the components of the domain
(x, y, z, t). Identify C22 with C4 by A 7 (A11 , A12 , A21 , A22 ). Then the matrix of the transformation is given by

1 0 0 1

0 1 i 0

.
0
1 i 0
1 0 0 1

As usual, the transformation is an isomorphism if the matrix is invertible. We row-reduce to veryify the matrix is invertible.
We will row-reduce the augmented matrix in order to find the inverse explicitly:

1 0 0 1 1 0 0 0


0 1 i 0 0 1 0 0
.
0
1 i 0 0 0 1 0

1 0 0 1 0 0 0 1

This reduces to
1 0 0 0 1/2 0 0 1/2


0 1 0 0 0 1/2 1/2 0
.
0 0 1 0 0 i/2 i/2 0
0 0 0 1 1/2 0 0 1/2
Thus the inverse transformation is
x w y + z i(z y) x + w
" # !
x y
7 , , , .
z w 2 2 2 2
Chapter 6: Elementary Canonical Forms

Section 6.2: Characteristic Values

Exercise 1: In each of the following cases, let T be the linear operator on R2 which is represented by the matrix A in
the standard ordered basis for R2 , and let U be the linear operator on C2 represented by A in the standard ordered basis.
Find the characyteristic polynomial for T and that for U, find the characteristic values of each operator, and for each such
charactersistic value c find a basis for the corresponding space of characteristic vectors.
" # " # " #
1 0 2 3 1 1
A= , , .
0 0 1 1 1 1

Solution: " #
1 0
A=
0 0
" #
x1 0
xI A =
0 x
The characteristic polynomial equals |xI A| = x(x 1). So c1 = 0, c1 = 1. A basis for W1 is {(0, 1)}, 1 = (0, 1). A basis
for W2 is {(1, 0)}, 2 = (1, 0). This is the same whether the base field is R or C since the characteristic polynomial factors
completely.

" #
2 3
A=
1 1
 
 x2 3
|xI A| = 

 1 x1 

= (x 2)(x 1) + 3 = x2 3x+ 5. This is a parabola

opening up with vertex (3/2, 11/4). Thus there are no real roots. Using
the quadratic formula c1 = 2 and c2 = 2 . To find the a characteristic vector for c1 we solve
3+ 11i 3 11i

" # " #
1+ 11i
3 x 0
= .

2
1 1+ 11i y 0
2

This gives the characteristic vector 1 = ( 1+ 2 11i , 1). To find the a characteristic vector for c2 we solve
" # " #
1 11i
3 x 0
= .

2
1 1 11i y 0
2

This gives the characteristic vector 2 = ( 1 2 11i , 1).

63
64

" #
1 1
A=
1 1
 
 x 1 1 
|xI A| =  = (x 1)2 1 = x(x 2). So c1 = 0 for which 1 = (1, 1). And c2 = 2 for which 2 = (1, 1).
 1 x 1 
This is the same in both R and C since the characteristic polynomial factors completely.

Exercise 2: Let F be an n-dimensional vector space over F. What is the characteristic polynomial of the identity operator on
V? What is the characteristic polynomial for the zero operator?

Solution: The identity operator can be represented by the n n identity matrix I. The characteristic polynomial of the iden-
tity operator is therefore (x 1)n . The zero operator is represented by the zero matrix in any basis. Thus the characteristic
polynomial of the zero operator is xn .

Exercise 3: Let A be an n n triangular matrix over the field F. Prove that the characteristic values of A are the diagonal
entries of A, i.e., the scalars Aii .

Solution: The determinant of a triangular matrix is the product of the diagonal entries. Thus |xI A| =
Q
(x aii ).

Exercise 4: Let T be the linear operator of R3 which is represented in the standard ordered basis by the matrix

9 4 4
8 3 4 .

16 8 7

Prove that T is diagonalizable by exhibiting a basis for R3 , each vector fo which is a characteristic vector of T .

Solution:
 x + 9 4
 
4 
|xI A| =   8 x 3 4 
8 x7
 
16

 x + 9
 
0 4 
=  8 x+1

4 
x 1 x 7 
 
16

 x + 9 0
 
4 
= (x + 1)  8

1 4 
1 x 7 
 
16

 x + 9 0
 
4 
= (x + 1)  8

1 4 
0 x 11 
 
24
 
 x + 9 4 
= (x + 1) 
 24 x 11 

= (x + 1)[(x + 9)(x 11) + 96] = (x + 1)(x2 2x 3) = (x + 1)(x 3)(x + 1) = (x + 1)2 (x 3). Thus c1 = 1, c2 = 3. For c1 ,
xI A equals

8 4 4
= 8 4 4

16 8 8

 65

This matrix evidently has rank one. Thus the null space has rank two. The two characteristic vectors (1, 2, 0) and (1, 0, 2) are
independent, so they form a basis for W1 . For c2 , xI A equals

12 4 4
= 8 0 4

16 8 4

This is row equivalent to

1 0 1/2
= 0 1 1/2


0 0 0

Thus the null space one dimensional and is given by (z/2, z/2, z). So (1, 1, 2) is a characteristic vector and a basis for W2 . By
Theorem 2 (ii) T is diagonalizable.

Exercise 5: Let
6 3 2
4 1 2 .

10 5 3
Is A similar over the field R to a diagonal matrix? Is A similar over the field C to a diagonal matrix?

Solution:  
 x 6 3 2 
=  4 x+1

2 
10 x+3 
 
5
 
 x 6 3 2 
=  x + 2 x 2

0 
10 x+3 
 
5
 
 x 6 3 2 
= (x 2)  1 1

0 
10 5 x + 3 
 
 
 x 3 3 2 
= (x 2)  0

1 0 
5 5 x + 3 
 

= (x 2)((x 3)(x + 3) + 10) = (x 2)(x2 + 1). Since this is not a product of linear factors over R, by Theorem 2, page 187, A is
not diagonalizable over R. Over C this factors to (x 2)(x i)(x + i). Thus over C the matrix A has three distinct characteristic
values. The space of characteristic vectors for a given characteristic value has dimension at least one. Thus the sum of the
dimensions of the Wi s must be at least n. It cannot be greater than n so it must equal n exactly. Thus A is diagonalizable over C.

Exercise 6: Let T be the linear operator on R4 which is represented in the standard ordered basis by the matrix

0 0 0 0

a 0 0 0
.
0 b 0 0
0 0 c 0
Under what conditions on a, b, and c is T diagonalizable?

Solution:  
 x 0 0 0 
 a x 0 0 
|xI A| =  
 0 b x 0 
 0 0 c x 

66

= x4 . Therefore there is only one characteristic value c1 = 0. Thus c1 I A = A and W1 is the null space of A. So A is
diagonalizable dim(W) = 4 A is the zero matrix a = b = c = 0.

Exercise 7: Let T be the linear operator on the n-dimensional vector space V, and suppose that T has n distinct characteristic
values. Prove that T is diagonalizable.

Solution: The space of characteristic vectors for a given characteristic value has dimension at least one. Thus the sum of the
dimensions of the Wi s must be at least n. It cannot be greater than n so it must equal n exactly. Thus by Theorem 2, T is
diagonalizable.

Exercise 8: Let A and B be n n matrices over the field F. Prove that if (I AB) is invertible, then I BA is invertible and

(I BA)1 = I + B(I AB)1 A.

Solution:
(I BA)(I + B(I AB)1 A)
= I BA + B(I AB)1 A BAB(I AB)1 A
= I B(A (I AB)1 A + AB(I AB)1 A)
= I B(I (I AB)1 + AB(I AB)1 A
= I B(I (I AB)(I AB)1 )A
= I B(I I)A
= I.
Exercise 9: Use the result of Exercise 8 to prove that, if A and B are n n matrices over the field F, then AB and BA have
precisely the same characteristic values in F.

Solution: By Theorem 3, page 154, det(AB) = det(A) det(B). Thus AB is singular BA is singular. Therefore 0 is a charac-
teristic values of AB 0 is a characteristic value of BA. Now suppose the characteristic value c of AB is not equal to zero.
by #8
Then |cI AB| = 0 cn |I 1c AB| = 0 cn |I 1c BA| = 0 |cI BA| = 0.

Exercise 10: Suppose that A is a 2 2 matrix with real entries which is symmetrix (At = A). Prove that A is similar over R to
a diagonal matrix.
" #  
a b  x a b 
Solution: A = . So |xI A| =  = (x a)2 b2 = (x a b)(x a + b). So c1 = a + b, c2 = a = b.
c d  b x a 
If b = 0 then A is already diagonal. If b , 0 then c1 , c2 so by Exercise 7 A is diagonalizable.

Exercise 11: Let N be a 2 2 complex matrix such that N 2 = 0. Prove that either N = 0 or N is similar over C to
" #
0 0
.
1 0
" # " # " #
a b a b
Solution: Suppose N = . Now N = 0
2
, are characteristic vectors for the characteristic value 0.
c d c d
" # " # " #
a b 0 0
If , are linearly independent then W1 has rank two and N is diagonalizable to . If PNP1 = 0 then
c d 0 0
" # " #
a b
N = P1 0P = 0 so in this case N itself is the zero matrix. This contradicts the assumption that , are linearly
c d
independent.
 67
" # " #
a b
So we can assume that , are linearly dependent. If both equal the zero vector then N = 0. So we can assume at least
c d
" # " # " #
b a 0 a 0
one vector is non-zero. If is the zero vector then N = . So N = 0 a = 0 a = 0. Thus N =
2 2
. In
d c 0 c 0
" # " # " #
0 0 c 0 a
this case N is similar to N = via the matrix P = . Similary if is the zero vector, then N 2 = 0 implies
1 0 0 1 c
" # " # " #
0 b 0 0 0 1
d2 = 0 implies d = 0 so N = . In this case N is similar to N = via the matrix P = , which is
0 0 b 0 1 0
" #
0 0
simiilar to as above.
1 0
" # " #
a b
By the above we can assume neither or is the zero vector. Since they are linearly dependent we can assume
c d
" # " # " #
b a a ax
=x so N = . So N 2 = 0 implies
d c c cx

a(a + cx) = 0

c(a + cx) = 0

ax(a + cx) = 0

cx(a + cx) = 0.
" #
0 0
We know that at least one of a or c is not zero. If a = 0 then since c , 0 it must be that x = 0. So in this case N =
c 0
" #
0 0
which is similar to as before. If a , 0 then x , 0 else a(a + cx) = 0 implies a = 0. Thus a + cx = 0 so
1 0
" # " # " # " # " #
a ax a a x 0 a a 0 0
N = . This is similar to via P = . And is similar to via
a/x a a a 0 1/ x a a a 0
" # " #
1 1 0 0
P= . And this finally is similar to as before.
1 0 1 0
Exercise 12: Use the result of Exercise 11 to prove the following: If A is a 2 2 matrix with complex entries, then A is similar
over C to a matrix of one of the two types
" # " #
a 0 a 0
.
0 b 1 a
" #
a b
Solution: Suppose A = . Since the base field is C the characteristic polynomial p(x) = (x c1 )(x c2 ). If c1 , c2
c d
then A is diagonalizable by Exercise 7. If c1 = c2 then p(x) = (x c1 )2 . If W has dimension two then A is "diagonalizable
# by
a 0
Theorem 2. Thus we will be done if we show that if p(x) = (x c1 ) and dim(W1 ) = 1 then A is similar to
2
.
1 a
We will need the following three identities:
" # " # " #
a 0 a 0 c 0
via p = (20)
c d 1 d 0 1
" # " # " #
a b ab cd 1 0
via p = (21)
c d b d 1 1
" # " # " #
a b a xb x 0
via p = for x , 0. (22)
c d c/x d 0 1/ x
68
" # " #
a b a bc/d
Now we know in this case that A is not diagonalizable. If d , 0 then by (22) with x = c/d and this
c d d d
" #
a bc/d 0
in turn is similar to by (21).
a + 2bc/d d
" #
d 0
Now we know the diagonal entries are the characteristic values, which are equal. Thus a = d. So this equals bc
d x d
" #
d 0
where x = a + 2bc
d and we know x , 0 since A is not diagonalizable. Thus A by (20). Now suppose d = 0. Then
1 d
" # " # " # " #
a b 0 c 0 1 a 0
A= via p = . If b = 0 then A = and again since A has equal characteristic values it
c 0 b a 1 0 c 0
" # " # " # " #
0 0 0 0 c 0 0 c
must be that a = 0. So A = which is similar to via P = . So assume b , 0. Then A
c 0 1 0 0 1 b a
and we can argue exact as above were d , 0.

Exercise 13: Let V be the vector space of all functions from R into R which are continuous, i.e., the space of continuous
real-valued functions on the real line. Let T be the linear operator on V defined by
Z x
(T f )(x) = f (t)dt.
0

Prove that T has no characteristic values.

Rx Rx
Solution: Suppose c such that T f = c f f . Then 0 f (t)dt = c f (x). Let f (x) = 1. Then we must have 0 1dt = c 1,
which imples x = c. In other words this implies the functions f (x) = x and g(x) = c are the same, which they are not because
one is constant and the other is not. This therefore is a contradiction. Thus it is impossible that c such that T f = c f f .
Thus T has no characteristic values.

Exercise 14: Let A be an n n diagonal matrix with characteristic polynomial

(x c1 )d1 (x ck )dk ,

where c1 , . . . , ck are distinct. Let V be the space of n n matrices B such that AB = BA. Prove that the dimension of V is
d12 + + dk2 .

Solution: Write
c1 I

c2 I 0
A = .

..
0 .

ck I
Write
B11 B12 B1k


B
21 B22 B2k
B = . .. .. ..

.. . . .



Bk1 Bk2 Bkk
where Bi j has dimenson di d j . Then AB = BA implies

c1 B11 c1 B12 c1 B1k c1 B11 c2 B12 ck B1k

c B
2 21 c2 B22 c2 B2k c B
1 21 c2 B22 ck B2k
.. .. .. .. = .. .. .. ..

. . . . . . . .



ck Bkk ck Bk2 ck Bkk c1 Bk1 c2 Bk2 ck Bkk
 69

Thus ci , c j for i , j implies Bi j = 0 for i , j, while B11 , B22 , . . . , Bkk can be arbitrary. The dimension of Bii is therefore di2
thus the dimension of the space of all such Bii s is d12 + d22 + + dk2 .

Exercise 15: Let V be the space of n n matrices over F. Let A be a fixed n n matrix over F. Let T be the linear operator
left multiplication by A on V. Is it true that A and T have the same characteristic values?

Solution: Yes. Represent an element of V as a column vector by stacking the columns of V on top of each other, with the

A
A 0


first column on top. Then the matrix for T is given by .. . By the argument on page 157 the determinant of

0 .

A
this matrix is det(A)n . Thus if p is the characteristic polynomial of A then pn is the characteristic polynomial of T . Thus they
have exactly the same roots and thus they have exactly the same characteristic values.

Section 6.3: Annihilating Polynomials

Page 198: Typo in Exercise 11, Section 6.1 should be Section 6.2.

Exercise 1: Let V be a finite-dimensional vector space. What is the minimal polynomial for the identity operator on V? What
is the minimal polynomial for the zero operator?

Solution: The minimal polynomial for the identity operator is x 1. It annihilates the identity operator and the monic zero
degree polynomial p(x) = 1 does not, so it must be the minimal polynomial. The minimal polynomial for the zero operator is
x. It is a monic polynomial that annihilates the zero operator and again the monic zero degree polynomial p(x) = 1 does not,
so it must be the minimal polynomial.

Exercise 2: Let a, b and c be tlements of a field F, and let A be the following 3 3 matrix over F:

0 0 c
A = 1 0 b .

0 1 a

Prove that the characteristic polynomial for A is x x ax2 bx c and that this is also the minimal polynomial for A.

Solution: The characteristic polynomial is

   
 x 0 c   x 0 c  
 = 1  x
 c
b  =  1 0 x2 ax b  = x ax bx c.
3 2
 1 x   
 1 x2 ax b
0 1 x a   0 1 xa
   

Now for any r, s F

0 c ac 0 0 rc s 0 0
A + rA + s = 0
2
b c + ba + r 0 rb + 0 s 0


1 a b + a2 0 r ra 0 0 s

ac + rc

s c
= r b+s c + ba + br , 0.

1 a + r b + a2 + ra + s

Thus f (A) , 0 for all f F[x] such that deg(F) = 2. Thus the minimum polynomial cannot have degree two, it must therefore
have degree three. Since it divides x3 ax2 bx c it must equal x3 ax2 bx c.
70

Exercise 3: Let A be the 4 4 real matrix

1 1 0 0


1 1 0 0
.
2 2 2 1

1 1 1 0
Show that the characteristic polynomial for A is x2 (x 1)2 and that it is also the minimal polynomial.

Solution: The characteristic polynomial equals

 
 x 1 1 0 0     
 1 x+1 0 0   x 1 1   x 2 1
=


x 2 1   1 x+1   1 by (5-20) page 158
 2 2 x 
 1 1 1 x 


= x2 (x2 2x + 1) = x2 (x 1)2 .
The minimum polynomial is clearly not linear, thus the minimal polynomial is one of x2 (x1)2 , x2 (x1), x(x1)2 or x(x1).
We will plug A in to the first three and show it is not zero. It will follow that the minimum polynomial must be x2 (x 1)2 .

0 0 0 0


0 0 0 0
A2 =
3 3 3 2

2 2 2 1

0 1 0 0


1 2 0 0
A I =
2 2 1 1

1 1 1 1
and
1 2 0 0

2 3 0 0

(A I)2 =
1 1 0 0
0 0 0 0
Thus
0 0 0 0

0 0 0 0

A (A I) =
2 ,0
1 1 1 1
1 1 1 1

1 1 0 0

1 1 0 0

A(A I) =
2 ,0
0 0 0 0
0 0 0 0
and
1 1 0 0


1 1 0 0
A(A I) = , 0.
1 1 1 1
1 1 2 2
Thus the minimal polynomial must be x2 (x 1)2 .

Exercise 4: Is the matrix A of Exercise 3 similar over the field of complex numbers to a diagonal matrix?
 71

Solution: Not diagonalizable, because for characteristic value c = 0 the matrix A cI = A and A is row equivalent to

1 1 0 0


0 0 1 0

0 0 0 1

0 0 0 0

which has rank three. So the null space has dimension one. So if W is the null space for A cI then W has dimension one,
which is less than the power of x in the characteristic polynomial. So by Theorem 2, page 187, A is not diagonalizable.

Exercise 5: Let V be an n-dimensional vector space and let T be a linear operator on V. Suppose that there exists some
positive integer k so that T k = 0. Prove tht T n = 0.

Solution: T k = 0 the only characteristic value is zero. We know the minimal polynomial divides this so the minimal poly-
nomial is of the form tr for some 1 r n. Thus by Theorem 3, page 193, the characteristic polynomials only root is zero,
and the characteristic polynomial has degree n. So the characteristic polynomial equals tn . By Theorem 4 (Caley-Hamilton)
T n = 0.

Exercise 6: Find a 3 3 matrix for which the minimal polynomial is x2 .

Solution: If A2 = 0 and A , 0 then the minimal polynomial is x or x2 . So any A , 0 such that A2 = 0 has minimal polynomial
x2 . E.g.

0 0 0
A = 1 0 0 .

0 0 0

Exercise 7: Let n be a positive integer, and let V be the space of polynomials over R which have degree at most n (throw in
the 0-polynomial). Let D be the differentiation operator on V. What is the minimal polynomial for D?

Solution: 1, x, x2 , . . . , xn is a basis.
1 7 0
x 7 1
x2 7 2x
..
.
xn 7 nxn1
The matrix for D is therefore
0 1 0 0 0



0 0 2 0 0

0 0 0 3 0
.. .. .. .. .. ..

. . . . . .


0 0 0 0 n
Suppose A is a matrix such that ai j = 0 except when j = i + 1. Then A2 has ai j = 0 except when j = i + 2. A3 has ai j = 0
except when j = i + 3. Etc., where finally An = 0. Thus if ai j , 0 j = i + 1 then Ak , 0 for k < n and An = 0. Thus the
minimum polynomial divides xn and cannot be xk for k < n. Thus the minimum polynomial is xn .

Exercise 8: Let P be the operator on R2 which projects each vector onto the x-axis, parallel to the y-axis: P(x, y) = (x, 0).
Show that P is linear. What is the minimal polynomial for P?
72
# "
1 0
Solution: P can be given in the standard basis by left multiplication by A = . Since P is given by left multiplication
0 0
by a matrix, P is clearly linear. Since A is diagonal, the characteristic values are the diagonal values. Thus the characteristic
values of A are 0 and 1. The characteristic polynomial is a degree two monic polynomial for which both 0 and 1 are roots.
Therefore the characteristic polynomial is x(x 1). If the characteristic polynomial is a product of distinct linear terms then
it must equal the minimal polynomial. Thus the minimal polynomial is also x(x 1).

Exercise 9: Let A be an n n matrix with characteristic polynomial

f = (x c1 )d1 (x ck )dk .

Show that
c1 d1 + + ck dk = trace(A).
# "
a b
Solution: Suppose A is n n. Claim: |xI A| = xn + trace(A)xn1 + . Proof by induction: case n = 2. A = .
c d
|xI A| = x2 + (a + d)x + (ad bc). The trace of A is a + d so we have established the claim for the case n = 2. Suppose true
for up to n 1. Let r = a22 + a33 + + ann . Then
 
 x a11 a12 a1n 
 a21 x a22 a2n 
 . .. ..
..

 . . 
 
an1 an2 x ann

Now expanding by minors using the first column, and using induction, we get that this equals

(x a11 )(xn1 rxn2 + )

a21 (polynomial of degree n 2)

+a31 (polynomial of degree n 2)

= xn + (r + a11 )xn1 + polynomial of degree at most n 2

= xn tr(A)xn1 +
Now if f (x) = (x c1 )d1 (x ck )dk then the coefficient of xn1 is c1 d1 + ck dk so it must be that c1 d1 + ck dk = tr(A).

Exercise 10: Let V be the vector space of n n matrices over the field F. Let A be a fixed n n matrix. Let T be the linear
operator on V defined by
T (B) = AB.
Show that the minimal polynomial for T is the minimal polynnomial for A.

Solution: If we represent a n n matrix as a column vector by stacking the columns of the matrix on top of each other, with
the first column on the top, then the transformation T is represented in the standard basis by the matrix

A

A 0
M = .

..

0 .

A
 73

And since

f (A)

f (A) 0
f (M) =

..
0 .

f (A)

it is evident that f (M) = 0 f (A) = 0.

Exercise 11: Let A and B be n n matrices over the field F. According to Exercise 9 of Section 6.2, the matrices AB and
BA have the same characteristic values. Do they have the same characteristic polynomial? Do they have the same minimal
polynomial?

Solution: In Exercise 9 Section 6.2 we showed |xI = AB| = 0 |xI BA| = 0. Thus we have two monic polynomials of
degree n with exactly the same roots. Thuse they are
" equal.# So the characteristic
" # polynomials
" are equal.
# But the
" minimum
#
0 0 1 0 0 0 0 0
polynomials need not be equal. To see this let A = and B = . Then AB = and BA = so
1 0 0 0 1 0 0 0
the minimal polynomial of BA is x and the minimal polynomial of AB is clearly not x (it is in fact x2 ).

Section 6.4: Invariant Subspaces

Exercise 1: Let T be the linear operator on R2 , the matrix of which in the standard ordered basis is
" #
1 1
A= .
2 2

(a) Prove that the only subspaces of R2 invariant under T are R2 and the zero subspace.
(b) If U is the linear operator on C2 , the matrix of which in the standard ordered basis is A, show that U has 1-dimensional
invariant subspaces.
 
 x1 1 
Solution: (a) The charactersistic polynomial equals  = (x1)(x2)+2 = x2 3x+4. This is a parabola open-
 2 x 2 
ing upwards with vertex (3/2, 7/4), so it has no real roots. If T had an invariant subspace it would have to be 1-dimensional
and T would therefore have a characteristic value.

(b) Over C the characteristic polylnomial factors into two linears. Therefore over C, T has two characteristic values and
therefore has at least one characteristic vector. The subspace generated by a characteristic vector is a 1-dimensional subspace.

Exercise 2: Let W be an invariant subspace for T . Prove that the minimal polynomial for the restriction operator T W divides
the minimal polynomial for T , without referring to matrices.

Solution: The minimum polynomial of T W divides any polynomial f (t) where f (T W ) = 0. If f is the minimum polynomial
for T then F(T )v = 0 v V. Therefore, f (T )w = 0 w W. So f (T W )w = 0 w W since by definition f (T W )w = f (T )w
for w W. Therefore, f (T W ) = 0. Therefore the minimum polynomial for T W divides f .

Exercise 3: Let c be a characteristic value of T and let W be the space of characteristic vectors associated with the character-
istic value c. What is the restriction operator T W ?

Solution: For w W the transformation T (w) = cw. Thus T W is diagonalizable with single characteristic value c. In other
74

words under which it is represented by the matrix

c

c 0

..

0 .

c

where there are dim(W) cs on the diagonal.

Exercise 4: Let
0 1 0
A = 2 2 2 .

2 3 2

Is A similar over the field of real numbers to a triangular matrix? If so, find such a triangular matrix.

Solution:
2 2 2
A2 = 0 0 0 .

2 2 2

And A3 = 0. Thus the minimal polynomial x3 and the only characteristic

value is 0. We now follow the constructive
proof
1 1
of Theorem 5. W = {0}, 1 a characteristic vector of A is 0 . We need 2 such that A2 {1 }. 2 = 1 satisfies

1 2


0
A2 = 1 . Now need 3 such that A3 {1 , 2 }. 3 = 0 satisfies A3 = 21 + 22 . Thus with respect to the basis

1


0 1 2
{1 , 2 , 3 } the transformation corresponding to A is 0 0 2 .

0 0 0

Exercise 5: Every matrix A such that A2 = A is siimilar to a diagonal matrix.

Solution: A2 = A A satisfies the polynomial x2 x = x(x 1). Therefore the minimum polynomial of A is either x, x 1 or
x(x 1). In all three cases the minimum polynomial factors into distinct linears. Therefore, by Theorem 6 A is diagonalizable.

Exercise 6: Let T be a diagonalizable linear opeartor on the n-dimensional vector space V, and let W be a subspace which is
invariant under T . Prove that the restriction operator T W is diagonalizable.

Solution: By the lemma on page 80 the minimum polynomial for T W divides the minimum polynomial for T . Now T di-
agonalizable implies (by Theorem 6) that the minimum polynomial for T factors into distinct linears. Since the minimum
polynomial for T W divides it, it must also factor into distinct linears. Thus by Theorem 6 again T W is diagonalizable.

Exercise 7: Let T be a linear operator on a finite-dimensional vector space over the field of complex numbers. Prove that T
is diagonalizable if and only if T is annihilated by some polynomial over C which has distinct roots.

Solution: If T is diagonalizable then its minimum polynomial is a product of distinct linear factors, and the minimal poly-
nomial annihilates T . This proves . Now suppose T is annihilated by a polynomial over C with distinct roots. Since
the base field is C this polynomial factors completely into distinct linear factors. Since the minimum polynomial divides this
polynomial the minimum polynomial factors completely into distinct linear factors. Thus by Theorem 6, T is diagonalizable.
 75

Exercise 8: Let T be a linear operator on V. If every subspace of V is invariant under T , then T is a scalar multiple of the
identity operator.

Solution: Let {i } be a basis. The subspace generated by i is invariant thus T i is a multiple of i . Thus i is a characteristic
vector since T i = ci i for some ci . Suppose i, j such that ci , c j . Then T (i + j ) = T i + T j = ci i + c j j = c(i + j ).
Since the subspace generated by {i , j } is invariant under T . Thus ci = c and c j = c since coefficients of linear combinations
of basis vectors are unique. Thus T i = ci i. Thus T is c times the identity operator.

Exercise 9: Let T be the indefinite inntegral operator

Z x
(T f )(x) = f (t)dt
0

on the space of continuous functions on the interval [0, 1]. Is the space of polynomial functions invariant under T ? Ths space
of differentiable functions? The space of functions which vanish at x = 1/2?

Solution: The integral from 0 to x of a polynomial is again a polynomial, so the space of polynomial functions is invariant
under T . The integral from 0 to x of a differntiable function is differentiable,
Rx so the space of differentiable functions is invari-
ant under T . Now let f (x) = x 1/2. Then f vanishes at 1/2 but 0 f (t)dt = 12 x2 21 x which does not vanish at x = 1/2. So
the space of functions which vanish at x = 1/2 is not invariant under T .

Exercise 10: Let A be a 3 3 matrix with real entries. Prove that, if A is not similar over R to a triangular matrix, then A is
similar over C to a diagonal matrix.

Solution: If A is not similar to a tirangular matrix then the minimum polynomial of A must be of the form (x c)(x2 + ax + b)
where x2 + ax + b has no real roots. The roots of x2 + ax + b are then two non-real complex conjugates z and z. Thus over C
the minimum polynomial factors as (x c)(x z)(x z). Since c is real, c, z and z constintute three distinct numbers. Thus by
Theorem 6 A is diagonalizable over C.

Exercise 11: True or false? If the triangular matrix A is similar to a diagonal matrix, then A is already diagonal.
" #
1 1
Solution: False. Let A = . Then A is triangular and not diagonal. The characteristic polynomial is x(x 1) which
0 0
has distinct roots, so the minimum polynomial is x(x 1). Thus by Theorem 6, A is diagonalizable.

Exercise 12: Let T be a linear operator on a finite-dimensional vector space over an algebraically closed field F. Let f be a
polynomial over F. Prove that c is a characteristic value of f (T ) if and only if c = f (t), where t is a characteristic value of T .

Solution: Since F is algebraically closed, the corollary at the bottom of page 203 implies theres a basis under which T is
represented by a triangular matrix A. A = [ai j ] where ai j = 0 if i > j and the aii , i = 1, . . . , n are the characteristic values of T .
Now f (A) = [bi j ] where bi j = 0 if i > j and bii = f (aii ) for all i = 1, . . . , n. Thus the characteristic values of f (A) are exactly
the f (c)s where c is a characteristic value of A. Since f (A) is a matrix representative of f (T ) in the same basis, we conclude
the same thing about the tranformation T .

Exercise 13: Let V be the space of n n matrices over F. Let A be a fixed n n matrix over F. Let T and U be the linear
operators on V defined by

T (B) = AB
U(B) = AB BA

(a) True or false? If A is a diagonalizable (over F), then T is diagonalizable.

(b) True or false? If A is diagonalizable, then U is diagonalizable.
76

Solution: (a) True by Exercise 10 Section 6.3 page 198 since by Theorem 6 diagonalizability depends entirely on the mini-
mum polynomial.

(b) True. Find a basis so that A is diagonal

c1

c2 0
A = .

..

0 .

cn
Let B = [bi j ]. Then U(B) = AB BA. The n2 matrices Bi j such that bi j , 0 and all other entries equal zero form a basis for
V. For any Bi j , U(Bi j ) = ABi j Bi j A = [di0 j0 ] where di0 j0 = ci0 bi0 j0 c j0 bi0 j0 = (ci0 c j0 )bi0 j0 . Thus di0 j0 , 0 only when i0 = i
and j0 = j. Thus U(Bi j ) = (ci c j )Bi j . So ci c j is a characteristic value and Bi j is a characteristic vector for all i, j. Thus V
has a basis of characteristic vectors for U. Thus U is diagonalizable.

Section 6.5: Simultaneous Triangulation; Simultaneous Diagonliazation

Exercise 1: Find an invertible real matrix P such that P1 AP and P1 BP are both diagonal, where A and B are the real matrices
" # " #
1 2 3 8
(a) A= , B=
0 2 0 1
" # " #
1 1 1 a
(b) A= , B= .
1 1 a 1
Solution: The proof of Theorem 8 shows that if a 2 2 matrix has two characteristic values then the P that diagonalizes A
will necessarily also diagonalize any B that commutes with A.

(a) Characteristic polynomial equals (x 1)(x 2). So c1 = 1, c2 = 2.

" #" # " #
0 2 1 0
c1 : =
0 2 0 0
" #" # " #
1 2 2 0
c2 : =
0 0 1 0
" # " #
0 2 1 2
So P = and P1 = .
0 1 0 1
" #
1 0
P1 AP =
0 2
" #
3 0
P1 BP =
0 1
(b) Characteristic polynomial equals x(x 2). So c1 = 0, c2 = 2.
" #" # " #
1 1 1 0
c1 : =
1 1 1 0
" #" # " #
1 1 1 0
c2 : =
1 1 1 0
" # " #
1 1 1/2 1/2
So P = and P1 = .
1 1 1/2 1/2
" #
0 0
P AP =
1
0 2
 77
" #
1a 0
P BP =
1
0 1+a
Exercise 2: Let F be a commuting family of 3 3 complex matrices. How many linearly independent matrices can F
contain? What about the n n case?

Solution: This turns out to be quite a hard question, so Im

j 2not
k sure what Hoffman & Kunze had in mind. But theres a general
theorem from 1905 by I. Schur which says the answer is n4 + 1. A simpler proof was published in 1998 by M. Mirzakhani in
the American Mathematical Monthly. I have extracted the proof for the case n = 3 (which required also extracting the proof
for the case n = 2).

First we show:

The maximum size of a set of linearly independent commuting triangulizable 2 2 matrices is two ()

Suppose that {A1 , A2 , A3 } are three linearly independent commuting upper-triangular 2 2 matrices. Let V be the space gen-
erated by {A1 , A2 , A3 }. So dim(V) = 3.
h i
Write Ai = 0 NMi i where Ni is 1 2. Since dim(V) = 3 it cannot be that all three Mi s are zero. Assume WLOG that M1 , 0.
Then M2 = c2 M1 and M3 = c3 M1 for some constants c1 , c2 . Let B2 = A2 c2 A1 and B3 = A3 = c3 A1 . Then {B2 , B3 } are
lineraly independent in V.
h i h i
Write B2 = t2
00 and B3 = t3
00 where {t2 , t3 } are linearly independent 1 2 matrices.
h i h i
Similarly B02 and B03 in V such that B02 = 0
0 t20 , B03 = 00 t30 , where {t20 , t30 } are linearly independent.

Since B2 , B3 , B02 , B03 are all in V, they all commute with each other. Thus ti t0j = 0 i, j.
h i
Let A be the 2 2 matrix tt34 . Then rank(A) = 2 but At20 = 0 and At30 = 0 thus null(A) = 2. Therefore rank(A) + null(A) = 4.
But rank(A) + null(A) cannot be greater than dim(V) = 2. This contradiction imples we cannot have {A1 , A2 , A3 } all three be
" 2 2# matrices.
commuting linearly independent upper-triangular " #But we know we can have two commuting linearly indepen-
1 0 0 0
dent upper-triangular 2 2 matrices because , are such a pair.
0 0 0 1
We now turn to the case n = 3. Suppose F is a commuting family of linearly independent 3 3 matrices with |F | = 4. We
know P such that P1 F P is a family of upper tirangular commuting matrices. Let V be the space generated by F . Then
dim(V) = 4. Let A1 , A2 , A3 , A4 be a linearly independent subset of V. For each i a 2 2 matrix Mi and a 1 3 matrix Ni
such that
Ni
A = 0
0
Mi
0

Since the Ai s commute, for 1 i, j 4 we have Mi M j = M j Mi . Suppose W is the vector space spanned by the set
{M1 , M2 , M3 , M4 } and let k = dim(W). We know by () that k 2. Since {A1 , A2 , A3 , A4 } are independent we also know k 1.

First assume k = 1. Then WLOG assume M1 generates W. Then for i = 2, 3, 4 ni such that Mi = ni M1 . For i =h 2, i 3, 4 define
Bi = Ai ni A1 . Since {A1 , A2 , A3 , A4 } are linearly independent, {B2 , B3 , B4 } are linearly independent and Bi = 0 where ti is
ti

1 3 and {t2 , t3 , t4 } are linearly independent.

Now assume k = 2. Then WLOG assume M1 , M2 generate W. Then for each i = 3, 4 ni1 , ni2 such that Mi = ni1 M1 + ni2 M2 .
For i = 3, 4 define Bi =
h iAi ni1 A1 ni2 A2 . Then {A1 , A2 , A3 , A4 } linearly independent implies {B3 , B4 } are linearly independent
and for i = 3, 4, Bi = t0i where ti is 1 n. Since {B3 , B4 } are linearly independent, {t3 , t4 } are linearly independent.
78
hi
Thus in both cases (k = 1, 2) we have produced a set of 4 k linearly independent 1 n matrices {ti } such that Bi = ti
0 .

By a similar argument we obtian a set of two or three linearly independent n 1 matrices {t30 , t40 } or {t20 , t30 , t40 } such that
B0i = [0 | ti0 ] is a matrix in V.

Now since all Bi s and B0i s all belong to the commuting family V, one sees that ti t0j = 0 i, j.

Let A be the m 4 matrix (m = 2 or 3) such that its ith row is ti Since the ti s are independent we have rank(A) m 2.
On the other hand At0j = 0 for all j and the t0j s are linearly independent. Thus the null space of A has rank greater or equal
to the numnber of t0j s. Thus rank(A) 2 and null(A) 2. But since A is 3 3 we know that rank(A) + null(A) = 3. This
contradiction implies the set {A1 , A2 , A3 , A4 } cannot be linearly independent.

1 0 0 0 0 0 0 0 0
Now we can achieve three independent such matrices because 0 1 0 , 0 1 0 and 0 0 0 are such a triple.

0 0 0 0 0 0 0 0 1

Exercise 3: Let T be a linear operator on an n-dimensional space, and suppose that T has n distinct characteristic values.
Prove that any linear operator which commutes with T is a polynomial in T .

Solution: Since T has n distinct characteristic values, T is diagonalizable (exercise 6.2.7, page 190). Choose a basis B for
which T is represented by a diagonal matrix A. Suppose the linear transformation S commutes with T . Let B be the matrix
of S in the basis B. Then the i j-th entry of AB is aii bi j and the i j-th entry of BA is a j j bi j . Therefore if aii bi j = a j j bi j and
aii , a j j , then it must be that bi j = 0. So we have shown that B must also be diagonal. So we have to show there exists a
polynomial such that f (aii ) = bii for all i = 1, . . . , n. By Section 4.3 there exists a polynomial with this property.

Exercise 4: Let A, B, C, and D be n n complex matrices which commute. Let E be the 2n 2n matrix
" #
A B
E= .
C D

Prove that det E = det(AD BC).

Solution: By the corollary on paeg 203 we know A, B, C, and D are all triangulable. By Theorem 7 page 207 we know they
are simultaneously triangulable. Let P be the matrix that simultaneously triangulates them. Let
" #
P 0
M= .
0 P

Then " #
P1 0
M 1
= .
0 P1
And " #
A0 B0
M 1 EM = ,
C0 D0

where A0 , B0 , C 0 , and D0 are upper triangular. Now det(E) = det(M 1 EM). Suppose the result were true for upper triangular
matrices A, B, C, and D. Then det(E) = det(M 1 EM) = det(P1 AP P1 DP P1 BP P1CP) = det(P1 ADP P1 BCP) =
det(P1 (AD BC)P) = det(AD BC).

Thus it suffices to prove the result for upper triangular matrices. So in what follows we drop the primes and assume A, B, C,
and D are upper triangular. We proceed by induction. Suppose first that n = 1. Then the theorem is clearly true. Suppose it is
true up to n 1.
 79

If A, B, C, and D are upper triangular then it is clear that det(AD BC) = ni=1 (aii dii bii cii ). So by induction we assume
Q
det(E) = i=1 (aii dii bii cii ) whenever E has dimension 2m for m < n (of couse always assuming A, B, C, and D commute).
Qm

Now we can write E in the following form for some A0 , B0 , C 0 and D0 :

a11 A0 b11 B0
.. ..

. .



0 ann 0 bnn

E =


C0 D0

c11 d11
.. ..


. .


0 cnn 0 dnn

Expanding E by cofactors of the 1st column gives

   
a22 A00 0 b22 B00  b11 B0
A0
  

.. ..
  a22 
 . .   .. .. 
   . . 
 0 ann 0 bnn   
   0 ann 0 bnn 
det(E) = a11   + (1) c11 
n 
 d11 D0   
 c22 C0   c22 C 00 0 d22 D00 
.. .. .. ..
   
 . .   . . 
   
 0 cnn 0 dnn   0 cnn 0 dnn 

for some A00 , B00 , C 00 and D00 .

The n + 1 column of each of these matrices has only one non-zero element. So we next expand by cofactors of the n + 1-th
column of each matrix, which gives
   
 a22 A00 b22 B00   a22 A00 b22 B00 
 .. ..   .. .. 
 . .   . . 
   
 0 ann 0 bnn   0 ann 0 bnn 
(1)2n a11 d11   + (1)2n+1 c b  
 11 11  
C 00 D00  C 00 D00 

 c22 d22  c22 d22
.. .. .. ..
  
. . . .
   
   

0 cnn 0 dnn   0 cnn 0 dnn 

 
 a22 A00 b22 B00 
 .. .. 
 . . 
 
 0 ann 0 bnn 
= (a11 d11 c11 b11 )   .

C 00 D00 

 c22 d22
.. ..

. .
 
 

0 cnn 0 dnn 
80

By induction this is equal to

n
Y n
Y
(a11 d11 c11 b11 ) (aii dii bii cii ) = (aii dii bii cii ).
i=2 i=1

QED

Exercise 5: Let F be a field, n a positive integer, and let V be the space of n n matrices over F. If A is a fixed n n
matrix over F, let T A be the linear operator on V defined by T A (B) = AB BA. Consider the family of linear operators T A
obtained by letting A vary over all diagonal matrices. Prove that the operators in that family are simultaneously diagonalizable.

Solution: If we stack the cloumns of an n n matrix on top of each other with column one at the top, the matrix of T A in the
A


A
. Thus if A is diagonal then T is diagonalizable.
standard basis is then given by .. A
.


A
Now T A T B (C) = ABC ACB BCA + CBA and T B T A (C) = BAC BCA ACB + CAB. Therefore we must show that
BAC + CAB = ABC + CBA. The i, j-th entry of BAC + CAB is ci j (aii bii + a j j b j j ). And this is exactly the same as the i, j-th
entry of ABC + CBA. Thus T A and T B commute. Thus by Theorem 8 the family can be simultaneously diagonalized.

Section 6.6: Direct-Sum Decompositions

Exercise 1: Let V be a finite-dimensional vector space and let W1 be any subspace of V. Prove that there is a subspace W2 of
V such that V = W1 W2 .

Solution:

Exercise 2: Let V be a finite-dimensional vector space and let W1 , . . . , Wk be subspaces of V such that

V = W1 + + Wk and dim(V) = dim(W1 ) + + dim(Wk ).

Prove that V = W1 Wk .

Solution:

Exercise 3: Find a projection E which projects R2 onto the subspace spanned by (1, 1) along the subspace spanned by (1, 2).

Solution:

Exercise 4: If E1 and E2 are projections onto independent subspaces, then E1 + E2 is a projection. True or false?

Solution:

Exercise 5: If E is a projection and f is a polynomial, then f (E) = aI + bE. What are a and b in terms of the coefficents of f ?

Solution:

Exercise 6: True or false? If a diagonalizable operator has only the characteristic values 0 and 1, it is a projection.

Solution:
 81

Exercise 7: Prove that if E is the projection on R along N, then (I E) is the projection on N along R.

Solution:

Exercise 8: Let E1 , . . . , Ek be linear operators on the space V such that E1 + + Ek = I.

(a) Prove that if Ei E j = 0 for i , j, then Ei2 = Ei for each i.

(b) In the case k = 2, prove the converse of (a). That is, if E1 + E2 = I and E12 = E1 , E22 = E2 , then E1 E2 = 0.

Solution:

Exercise 9: Let V be a real vector space and E an idempotent linear operator on V, i.e., a projection. Prove that (I + E) is
invertible. Find (I + E)1 .

Solution:

Exercise 10: Let F be a subfield of the complex numbers (or, a field of characteristic zero). Let V be a finite-dimensinal
vector space over F. Suppose that E1 , . . . , Ek are projections of V and that E1 + Ek = I. Prove that Ei E j = 0 for i , j
(Hint: use the trace function and ask yourself what the trace of a porjection is.)

Solution:

Project 11: Let V be a vector space, let W1 , . . . , Wk be subspace of V, and let

V j = W1 + W j1 + W j+1 + + Wk .

Suppose that V = W1 Wk . Prove that the dual space V has the direct-sum decomposition V = V10 Vk0 .

Solution: