Jason Terry Linear Algebra

Exercises in
Applied Linear Algebra

Summer 2014 Edition
by
Jason Terry
19 May 2014
Table of Contents
Preface
1 Preliminaries
1.1
Logic . . . . . . . .
1.1.1 Exercises .
1.1.2 Answers for
1.2
Set Theory . . . .
1.2.1 Exercises .
1.2.2 Answers for
1.3
Functions . . . . .
1.3.1 Exercises .
1.3.2 Answers for
vii
. . . . . .
. . . . . .
Exercises
. . . . . .
. . . . . .
Exercises
. . . . . .
. . . . . .
Exercises
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
2 Matrices
2.1
Gaussian Elimination . . . . . . . .
2.1.1 Exercises . . . . . . . . . .
2.1.2 Answers for Exercises . . .
2.2
Matrix Operations . . . . . . . . .
2.2.1 Exercises . . . . . . . . . .
2.3
Matrix Algebra . . . . . . . . . . .
2.3.1 Exercises . . . . . . . . . .
2.4
Inverse Matrices . . . . . . . . . . .
2.4.1 Exercises . . . . . . . . . .
2.5
LU Factorization . . . . . . . . . .
2.5.1 Exercises . . . . . . . . . .
2.6
Determinants and Their Properties
2.6.1 Exercises . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
2
2
4
6
6
7
8
8
9
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
11
12
12
13
14
14
15
16
16
17
18
18
19
20
20
21
22
22
24
iv
Table of Contents
2.7
Adjoint Matrices and Cramers Rule . . . . . . . . . . . . . . . . . . . . . . . . . . 25

2.7.1 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
2.7.2 Answers for Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
3 Vector Spaces
3.1
Vector Spaces and Their Properties . . . . .
3.1.1 Exercises . . . . . . . . . . . . . . .
3.1.2 Answers for Exercises . . . . . . . .
3.2
Subspaces . . . . . . . . . . . . . . . . . . .
3.2.1 Exercises . . . . . . . . . . . . . . .
3.3
Spanning Sets and Linear Independence . .
3.3.1 Exercises . . . . . . . . . . . . . . .
3.4
Basis and Dimension . . . . . . . . . . . . .
3.4.1 Exercises . . . . . . . . . . . . . . .
3.5
Row Space, Column Space, and Null Space
3.5.1 Exercises . . . . . . . . . . . . . . .
3.6
Change of Bases . . . . . . . . . . . . . . .
3.6.1 Exercises . . . . . . . . . . . . . . .
4 Inner Product Spaces
4.1
Inner Product Spaces and Their
4.1.1 Exercises . . . . . . . .
4.1.2 Answers for Exercises .
4.2
Orthogonality . . . . . . . . . .
4.2.1 Exercises . . . . . . . .
4.3
The Gram-Schmidt Process . .
4.3.1 Exercises . . . . . . . .
4.4
Least-Squares . . . . . . . . . .
4.4.1 Exercises . . . . . . . .
5 Eigenvalues and Eigenvectors
5.1
Eigenvalues and Eigenvectors
5.1.1 Exercises . . . . . . .
5.1.2 Answers for Exercises
5.2
Diagonalization . . . . . . . .
.
.
.
.
Properties
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
27
28
28
29
30
30
31
32
32
33
34
34
35
36
36
38
39
39
40
.
.
.
.
.
.
.
.
.
.
.
.
41
42
42
43
44
44
45
46
46
47
48
48
49
.
.
.
.
51
52
52
53
54
Table of Contents
5.2.1
5.2.2
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
Answers for Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
6 Linear Transformations
6.1
Linear Transformations and Their Properties . . .
6.1.1 Exercises . . . . . . . . . . . . . . . . . . .
6.1.2 Answers for Exercises . . . . . . . . . . . .
6.2
Kernel and Range . . . . . . . . . . . . . . . . . . .
6.2.1 Exercises . . . . . . . . . . . . . . . . . . .
6.3
Matrix Representations of Linear Transformations
6.3.1 Exercises . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
57
58
58
59
60
60
61
62
62
63
vi
Table of Contents
Preface
Math textbooks are commonly expensive and difficult to read. Many of my students have told me
that the homework exercises were the only usable part of a textbook for which they paid upwards
of 200- 300. This is a disappointing situation that I have been wanting to solve for a long time.
So I came up with a solution that can help lower the financial burden on students. The goal of
this booklet is to provide a comprehensive set of homework exercises for an entire semester of an
applied linear algebra class. This booklet is freely available to download and I am releasing it under
a Creative Commons License. So anyone is allowed to download and use this booklet for free as
long as it is not used for commercial purposes.
The greatest advantage for using this booklet is that now students are empowered to choose whatever resource is best for them while they take a linear algebra class. One can still buy a standard
textbook if he or she believes it is in their best interest. But now one can also seek out less expensive/free alternatives, such as purchasing a Dover book, searching online for free material, or
just simply using the notes I provide during class. In any case, at the very least, this booklet gives
students the choice to pick the resources that work best for them as opposed to forcing everyone
to buy an expensive, one-size-fits-all textbook.
I believe this booklet will provide all the linear algebra exercises needed with the required breadth
and depth to run my class this semester. I hope anyone who uses it will find it useful. If you have
any questions, comments, or concerns about this booklet, feel free to conact me at jterry7@cnm.edu.
Take THAT you expensive textbooks!
Jason Terry, Ph.D.

19 May 2014
viii
Preface
Chapter 1
Preliminaries
Preliminaries
1.1
Logic
1.1.1
Exercises
In Exercises 1 - 9, determine the truth value of the given statements

1. 3 = 7 _ 4! = 24
4. 5 < 2 )
1
2
= 0.5
7. (1 > 0 ^ 6 6= 3) ) 4
2. 3 = 7 ^ 4! = 24
5. 5 < 2 )
1
2
6= 0.5
8. (0 > 0 _ 4 = 82 ) ) 0! = 1
3.
1
2
= 0.5 ) 5 < 2
6. (( = 3.14))
9. 3 = 7 , 5 < 2
In Exercises 10 - 15, let P , Q, and R be statements. Prove the given statements are equivalent.
10. (P ^ Q) (P ) _ (Q)
13. P ) Q (Q) ) (P )
11. (P _ Q) (P ) ^ (Q)
14. P , Q (P ) Q) ^ (Q ) P )
12. P ) Q (P ) _ Q
15. (P ) R) ^ (Q ) R) (P _ Q) ) R
In Exercises 16 - 18, state the converse and contrapositive of the given statement.
16. If you are human, then you are a mammal.
17. If you pass linear algebra, then your instructor doesnt kill you.
18. I come to class whenever there is going to be a quiz.
In Exercises 19 - 21, use DeMorgans laws to negate the given statement.
19. I am God and I am not crazy.
20. Dont pass GO and dont collect 200.
21. If I hit my hand with a hammer, then my hand hurts.
In Exercises 22 - 25, determine the truth value of the statements if the domain is all integers.
22. 9n
n2 = 3
23. 9n
n=n
24. 8n
3n 4n
25. 8n
n2
0)n
In Exercises 26 - 31, determine the truth value of the statements if the domain is all real numbers.
26. 9x
x2 = 3
29. 9x8y
27. 8x
x2 > 0
30. 8x8y9z
28. 8x9y
x+y =0
31. 8x8y
x+y =0
(x
x
y
=z
0^y
0) ) xy
1.1 Logic
In Exercises 32 - 34, negate the given statement so that negations appear after all quantifiers.
32. There is somebody in this class who is from California.
33. For every triangle, there exists a side that is longer than the others.
34. 9x8y
x>y
In Exercises 35 - 38, determine whether or not the following proofs are valid and explain.
35. The fundamental theorem of calculus gives that:
Z 1
1
1 1
dx = [
] 1=
2
x
x
1
36. Given the series
P1
1
n=1 n2 ,
we know limn!1
1
n2
1=
= 0. Therefore, the series converges.
37. All dogs have four legs. My pet has four legs. Therefore, my pet is a dog.
38. 1 + 2 + 3 = 6, 1 + 2 + 3 + 4 = 10 and 1 + 2 + 3 + 4 + 5 = 15. Therefore, 1 + 2 + + n =
n(n+1)
.
2
Preliminaries
1.1.2
Answers for Exercises
1. T
4. T
7. F
2. F
5. T
8. T
3. F
6. F
9. T
10.
11.
14.
15.
(P ^ Q)
T
T
F
F
T
F
T
F
T
T
F
F
T
F
T
F
T
T
F
F
T
F
T
F
T
T
T
T
F
F
F
F
T
T
F
F
T
T
F
F
T
F
T
F
T
F
T
F
(P ) _ (Q)
F
T
T
T
F
T
T
T
(P _ Q)
(P ) ^ (Q)
F
F
F
T
P ,Q
T
F
F
T
F
F
F
T
P )Q
P )R
T
F
T
F
T
T
T
T
12.
T
F
T
T
13.
Q)P
Q)R
T
F
T
T
T
F
T
T
T
T
F
T
T
T
F
F
T
F
T
F
T
T
F
F
T
F
T
F
P )Q
(P ) _ Q
P )Q
(Q) ) (P )
T
F
T
T
T
F
T
T
T
F
T
T
T
F
T
T
(P ) Q) ^ (Q ) P )
T
F
F
T
(P ) R) ^ (Q ) R)
T
F
T
F
T
F
T
T
P _Q
T
T
T
T
T
T
F
F
(P _ Q) ) R
T
F
T
F
T
F
T
T
1.1 Logic
16. Converse: If you are a mammal, then you are human. Contrapositive: If you are not a
mammal, then you are not human.
17. Converse: If your instructor doesnt kill you, then you pass linear algebra. Contrapositive: If
your instructor does kill you, then you dont pass linear algebra.
18. Converse: If I come to class, there is going to be a quiz. Contrapositive: If I do not come to
class, then there is not going to be a quiz.
19. I am not God or I am crazy.
20. Pass go or collect 200.
21. I hit my hand with a hammer and my hand will not hurt.
22. F
24. F
23. T
25. F
26. T
29. F
27. F
30. F
28. T
31. T
32. Everyone in this class is not from California.

33. There exists a triangle such that no side is longer than the others.
34. 8x9y
xy
35. Not valid. The fundamental theorem of calculus states the function must be continuous. x12
is discontinuous at x = 0.
P
36. Not valid. If limn!1 an 6= 0, then the series 1
n=1 an diverges. P ) Q is not equivalent to
(P ) ) (Q).
37. Not valid. An animal with four legs is not necessarily a dog. Its possible the pet is a dog,
but you cannot conclude it is a dog.
38. Not valid. A few examples do not constitute a proof for all integers.
Preliminaries
1.2
Set Theory
1.2.1
Exercises
In Exercises 1 - 6, let A = {1, 4, 7, 10, }, B = {x 2 N : x is odd}, C = {x 2 N : x 6=

2 ^ x is prime}, and D = {1, 2, 3, 5, 8, 13, 21, 34, }. Determine the truth value of the following statements.
1. 25 2 A
3. 22 2
/ A[D
5. 57 2 B \ D
2. 33 2 D
4. |B| = 1
6. 53 2 C
In Exercises 7 - 10, let A = {a, b, c} and B = {y, z}. Write the following sets explicitly.
7. A B
9. B 2
8. B A
10. B 3
In Exercises 11 - 22, determine whether the statements are true or false.

11. 0 2 ;
15. {0} {0}
19. {x} 2 {{x}}
12. ; 2 {0}
16. {;} {;}
20. ; ;
13. ; {0}
17. x 2 {x}
21. ; 2 {x}
14. {0} 2 {0}
18. {x} {x, {x}}
22. ; 2 {;, {x}}
In Exercises 23 - 34, determine whether the statements are true or false.

23. x + 1 2 P2
27. R2 R3
31. |P2 | = 2
24.
1
x
2 C[ 1, 1]
28. Z Q
32. Q R R2
25.
1
x
2 C[1, 2]
29. R N
33. Q \ R = Q
30. |{x 2 Z : |x| < 4}| = 7
34. R = Q [ Z
26. cos x 2 C( 1, 1)
In Exercises 35 - 40, let A = (0, 1), B = {2, 4, 8, 16, 32}, C = {2, 4, 6, 8, 10, 12, 14}, D = ( 3, 9),
and E = ( 1, 1]. Write the following sets.
35. B \ C
37. A \ (D [ E)
39. D
36. B
38. B \ E
40. A
1.2 Set Theory
1.2.2
1. T
3. F
5. F
2. F
4. T
6. T
7. {(a, y), (a, z), (b, y), (b, z), (c, y), (c, z)}
8. {(y, a), (y, b), (y, c), (z, a), (z, b), (z, c)}
9. {(y, y), (y, z), (z, y), (z, z)}
10. {(y, y, y), (y, y, z), (y, z, y), (y, z, z), (z, y, y), (z, y, z), (z, z, y), (z, z, z)}
11. F
15. T
19. T
12. F
16. T
20. T
13. T
17. T
21. F
14. F
18. T
22. T
23. T
27. F
31. F
24. F
28. T
32. T
25. T
29. F
33. T
26. T
30. T
34. F
35. {2, 4, 8}
37. (0, 9)
39. (1, 9)
36. {16, 32}
38. ;
40. [9, 1)
Preliminaries
1.3
Functions
1.3.1
Exercises
1. Let f : R ! R be defined by f (x) = sin x.

(a) Compute f ( 6 ).
(b) Determine f (R).
(c) Prove that 9a, b 2 R
a 6= b ^ f (a) = f (b).
2. Let g : (0, 1) ! R be defined by g(x) = ln x.

(a) Compute g(1).
(b) Determine g(0, 1).
(c) Prove that 8a, b 2 (0, 1)
g(a) = g(b) ) a = b.
3. Let h : R3 ! R be defined by h(a, b, c) = ac
b.
(a) Compute h(2, 3, 4).

(b) Prove that b = c ^ b > 0 ^ h(a, b, c) > 0 ) a > 1.
(c) Prove that a = b ^ b 6= 0 ^ h(a, b, c) = 0 ) c = 1.
4. Let ./: N2 ! Z be defined by a ./ b = a + b
ab.
(a) Compute 3 ./ 4.
(b) Prove that 9c 2 N
c 6= 0 ^ c ./ c = 0.
(c) Prove that a ./ a > 0 ) a = 1.
5. Let D : P3 ! P3 be defined by D(p(x)) = p0 (x).

(a) Compute D(x3 ).
(b) Determine D(P3 ).
(c) Prove that 9q 2 P3
q(x) 6= 0 ^ D(q(x)) = 0.
R1
6. Let I : C[ 1, 1] ! R be defined by I(f ) = 1 f (x)dx.
(a) Compute I(x4 ).
(b) Prove that 9g 2 C[ 1, 1]

(c) Prove that 8c 2 R
g 6= 0 ^ I(g) = 0.
9g 2 C[ 1, 1]
I(g) = c.
1.3 Functions
1.3.2
1. (a)
1
2
(b) [ 1, 1]
(c) Pick a = 0 and b = . Then 0 6= and f (0) = f () = 0.
2. (a) 0
(b) R
(c) Let a, b 2 (0, 1). Then g(a) = g(b) ) ln a = ln b ) eln a = eln b ) a = b.
3. (a) 5
(b) h(a, b, c) > 0 ) ac
(c) h(a, b, c) = 0 ) ac
4. (a)
b > 0 ) ab
b = 0 ) bc
b > 0 ) b(a
b = 0 ) b(c
1) > 0 ) a
1) = 0 ) c
1 > 0 ) a > 1.
1 = 0 ) c = 1.
(b) Pick c = 2. Then 2 ./ 2 = 2 + 2

(c) a ./ a > 0 ) 2a
a2 = 0 ) a(2
2(2) = 4
4 = 0.
a) > 0 ) a > 0 ^ a < 2 ) a = 1.
5. (a) 3x2
(b) P2
(c) Pick q(x) = 1. Then D(1) = 0.
6. (a)
2
5
R1
= [ 12 x2 ]1 1 = 12 12 = 0.
R1
(c) Let c 2 R. Pick g(x) = 12 c. Then I( 12 c) = 1 12 cdx = [ 12 cx]1 1 = c.
(b) Pick g(x) = x. Then I(x) =
1 xdx
10
Preliminaries
Chapter 2
Matrices
12
2.1
2.1.1
Matrices
Gaussian Elimination
Exercises
In Exercises 1 - 10, solve the linear system using Gaussian or Gauss-Jordan elimination.
8
(
>
3x3 =
2
x + 2y = 7
< x1
1.
6.
3x
+
x
2x
=
5
2x + y = 8
1
2
3
>
:
2x1 + 2x2 + x3 =
4
(
8
2x + 6y =
16
2.
>
+ 3x3 = 3
< 2x1
2x
6y =
16
7.
4x1
3x2 + 7x3 = 5
>
(
:
8x1
9x2 + 15x3 = 10
x + 2y = 1.5
3.
8
2x
4y =
3
>
5x3 = 3
< x1 + x2
8
8.
x1
2x3 = 1
>
>
:
22
< 3x + 5y =
2x1
x2
x3 = 0
4.
3x + 4y =
4
(
>
:
4x
8y =
32
3x
3y
z
2w = 1
9.
2x
2y + 2z
4w = 4
8
>
x
+
2y
=
0
<
(
5.
x + 2y + z =
8
x + y = 6
10.
>
:
3x
6y
3z =
21
3x
2y = 8
In Exercises
2
1 0
6
11. 40 1
0 0
11 - 14, solve the homogeneous systems represented by the given coefficient matrices.
3
2
3
1 0 0 1
0
7
6
7
13. 40 0 1 05
15
0
0 0 0 0
2
3
0 0 0
"
#
6
7
14. 40 0 05
1 0 0 0
12.
0 1 1 0
0 0 0
15. Determine whether the following statements are true or false. If true, explain why. If false,
provide a counterexample.
(a) A linear system with more equations than variables is always inconsistent.
(b) A linear system with more variables than equations is always consistent.
(c) If the last row in the RREF of an augmented matrix of a system of linear equations is
all zeros, then the original system has infinite solutions.
2.1 Gaussian Elimination
2.1.2
13
1. (3, 2)
2. {(8
6. (4, 3, 2)
3t, t) : t 2 R}
7. ;
3. ;
8. {(1 + 2t, 2 + 3t, t) : t 2 R}
4. (4, 2)
9. {(s + t + 34 , s, t + 54 , t) : s, t 2 R}
5. ;
10. ;
11. {(0, t, t) : t 2 R}
13. {( t, s, 0, t) : s, t 2 R}
12. {(0, s, s, t) : s, t 2 R}
14. R3
15. All the statements are false.

8
>
< x + y
(a) The system
2x + 2y
>
:
3x + 3y
(
x + y +
(b) The system
x + y +
= 1
= 2 has infinite solutions.
= 3
z = 1
has
z = 2
2
1
6
(c) The system with the augmented matrix 40
0
no solution.
3
0 0
7
1 05 has one solution: (0, 0).
0 0
14
Matrices
2.2
Matrix Operations
2.2.1
Exercises
In Exercises 1 - 6, let
"
1
A=
3
1
0
3
2
6 7
B = 4 6 5,
4
2
,
2
C=
"
1 2
,
2 4
3
0
6 7
D = 4 25 ,
3
E=
"
#
3 0
.
1 1
Perform the indicated operations or explain why it is undefined.

1. A + 2C
3. AB
1
2B
4. BA
#
2.
3D
In Exercises 7 - 12, let A =
7. AI
8. A(I + A)
"
1
0
5. (C
E)T
6. (C + E)2
2
. Compute the following.
1
9. A + IA
10. A0
11. A2
12. A3
In Exercises 13 - 16, solve the system A~x = ~b and write ~b as a linear

of A.
"
#
" #
2
1 1
2
1 ~
5
13. A =
,b=
6
15.
A
=
41 0
1 1
1
2
1
"
#
" #
"
1
2 ~
4
1
1
14. A =
,b=
16. A =
3
6
12
3
3
combination of the columns

3
2 3
5
3
7 ~ 6 7
,
b
=
15
4 15
1
0
#
" #
2 ~
1
,b=
1
7
In Exercises 17 - 20, prove or disprove the statements.

17. If the product AB is a square matrix, then the product BA is defined.
18. If A and B are matrices of the same size, then AB is a square matrix.
19. If the products AB and BA are defined, then AB and BA are square matrices.
20. The linear system A~x = ~b is consistent if and only if ~b can be written as a linear combination
of the columns of A.
2.2 Matrix Operations
2.2.2
1. Undefined since the matrix sizes are dierent.

2
3
1
6
7
2. 4 9 5
11
"
15
1
0
2
7.
1
"
#
2 2
8.
0 0
3.
"
#
12
14
4. Undefined since the inner

dimensions are dierent.
9.
"
2
0
4
2
5.
"
2 1
2 3
6.
"
22 2
3 31
11. I
12.
10. I
"
1
0
2
1
"
#
2
13. ~x =
; 2~a1 + ~a2 = ~b
1
" # " #
2
4
14. ~x = t
+
, t 2 R; 4~a1 + 0~a2 = ~b
1
0
2 3
1
6 7
15. ~x = 425; 1~a1 + 2~a2 + 0~a3 = ~b
0
2 3 2 3
1
3
6 7 6 7
16. ~x = t 415 + 4 0 5, t 2 R; 3~a1 + 0~a2
0
2
2~a3 = ~b
17. True. Let A be an m n matrix. If AB is square, then B is n m. Thus, the columns of B

match the rows of A.
18. False. Pick A and B to both be 2 3 matrices. Then their product is undefined.
19. True. Let A be an m n matrix. If AB is defined, then B is an n p matrix for some p 2 N.
If BA is defined, then p = m. Thus, B is n m and so AB is m m and BA is n n.
Therefore, AB and BA are square matrices.
20. True. The system A~x = ~b is equivalent to x1~a1 + xn~an = ~b.
16
Matrices
2.3
2.3.1
Matrix Algebra
Exercises
3
2
2
1
0
6
7
6
1. Let A = 4 1
and
B
=
05
42
3
4
4
the unknown matrix X.
2. Let
3. Let
4. Let
5. Let
3
3
7
0 5. Solve the matrix equation 6X
1
4A
3B = O for
3
3 4
4 2
1
5 0
6
7
A=
,B=
, and C = 4 0 15. Show that (AB)C = A(BC).
1
3
2 3 3
1 1
"
#
"
#
"
#
0 1
1 0
2 3
A=
,B=
, and C =
. Show that AC = BC, even though A 6= B.
0 1
1 0
2 3
"
#
"
#
2 4
1
2
A=
and B =
. Show that AB = O, even though A 6= O and B 6= O.
1
2 4
1
2
2
3
"
#
3 0
1 1
2
6
7
A=
and B = 4 1
2 5. Show that (AB)T = B T AT .
2 0 1
1
1
"
"
In Exercises 6 - 9, prove or disprove the statements.

6. Matrix multiplication is commutative.
7. The transpose of the sum of two matrices is the sum of their transposes.
8. If A and B are square matrices of the same size, then (A + B)(A
B) = A2
B2.
9. If A and B are square matrices of the same size, then (A + B)2 = A2 + 2AB + B 2 .
In Exercises 10 - 14, prove the statements.
10. If A is any matrix, then both AAT and AT A are symmetric.
11. Let A and B be symmetric matrices. Prove AB is symmetric if and only if AB = BA.
12. The main diagonal of a skew-symmetric matrix consists entirely of zeros.
13. If A and B are square skew-symmetric matrices, then A + B is skew-symmetric.
14. If A is any square matrix, then A
AT is skew-symmetric.
2.3 Matrix Algebra
2.3.2
17

2
6
1. X = 4
5
3
4
3
2. Good luck.
5
6
7
0 5
19
6
3. Good luck.
4. Good luck.
5. Good luck.
"
#
"
#
1 1
1 0
6. False. Pick A =
and B =
. Then AB = B and BA = A.
0 0
0 0
7. True. (A + B)T = [aij + bij ]T = [aji + bji ] = [aji ] + [bji ] = AT + B T .
"
#
"
#
"
#
1 1
0 0
1
1
8. False. Pick A =
and B =
. Then (A+B)(A B) = O and A2 B 2 =
0 0
1 1
1
1
"
#
2 2
2
9. False. Pick A and B as in the previous problem. Then (A+B) =
and A2 +2AB+B 2 =
2 2
"
#
3 3
.
1 1
10. (AAT )T = (AT )T AT = AAT and (AT A)T = AT (AT )T = AT A.
11. Let A and B be symmetric matrices. We must prove that AB is symmetric ) AB = BA
and that AB = BA ) AB is symmetric.
(a) Assume AB is symmetric, i.e., (AB)T = AB. Also, (AB)T = B T AT = BA. So
AB = BA.
(b) Assume AB = BA. Now consider (AB)T = (BA)T = AT B T = AB. So AB is symmetric.
Therefore, AB is symmetric , AB = BA.
12. Let A be skew-symmetric. Then AT =
aii = 0.
13. (A + B)T = AT + B T =
14. (A
AT ) T = AT
B=
(AT )T = AT
A ) [aii ]T = [ aii ] ) aii =
(A + B).
A=
(A
AT ).
aii ) 2aii = 0 )
18
Matrices
2.4
Inverse Matrices
2.4.1
Exercises
In Exercises 1 - 6, find the inverse of the given matrix, if it exists.

"
#
"
#
1 2
1 1
1.
3.
3
3
3 7
2.
"
2 3
1 5
3
1 1 1
6
7
4. 43 5 45
3 6 5
3
1 1 2
6
7
5. 4 3 1 05
2 0 3
2
3
1 0 0
6
7
6. 43 0 05
2 5 5
In Exercises 7 - 10, use an inverse matrix to solve the linear system.

8
(
>
2
x + 2y =
1
< x1 + 2x2 + x3 =
7.
9.
x
+
2x
x
=
4
x
2y =
3
1
2
3
>
:
x1
2x2 + x3 =
2
8
>
1
< x1 + 2x2 + x3 =
(
10.
x + 2y = 10
x1 + 2x2
x3 =
3
8.
>
:
x
2y =
6
x1
2x2 + x3 =
3
2
3
2
3
1
4 2
6 5
3
6
7
6
7
1
1
11. Let A = 40 1 35 and B = 4 2 4
15. Use the properties of inverses to compute
(AB)
1,
4
(AT )
2 1
and (2A)
1,
1.
12. What condition must a diagonal matrix satisfy for it to be invertible?

13. If C is invertible and CA = CB, then A = B.
14. If A is invertible, then the inverse of A is unique (i.e., if both B and C are inverse of A, then
B = C).
15. If A is idempotent, then (I
2A)
=I
2A.
16. If A is idempotent, then A = I or A is singular.

17. If A is idempotent and invertible, then A = I.
18. If A and B are idempotent and AB = BA, then AB is idempotent.
2.4 Inverse Matrices
2.4.2
19
1.
"
2.
"
7
3
5
13
1
13
2
1
3
13
2
13
1
6
4. 4 3
3
1
2
3
6
5. 4
1
7
15
2
7. (1, 1)
3
2
3
2
9
2
7
2
3
1
7
35
1
6. Singular matrix.
9. (1, 1, 1)
8. (2, 4)
11. (AB)
3. Singular matrix.
10. (0, 1, 1)
6
6
=4 6
17
3
25 24
7
10
7 5, (AT )
7
15
3
1 0 4
6
7
= 4 4 1 25, (2A)
2 3 1
12. Each diagonal entry must be nonzero.
13. CA = CB ) C
1 CA
=C
1 CB
1
2
6
= 40
2
2 1
1
2
3 7.
25
1
2
) IA = IB ) A = B.
14. Let B and C be inverses of A. Then AB = I ) CAB = CI ) (CA)B = C ) IB = C )

B = C. Therefore, inverses are unique.
15. Let A2 = A. Consider (I 2A)(I 2A) = I 2 2A 2A+(2A)2 = I 4A+4A2 = I 4A+4A = I.
Therefore, (I 2A) 1 = (I 2A).
16. Let A2 = A. We need only consider two cases.
(a) Case 1: A is singular. Then we are done.
(b) Case 2: A is nonsingular. Then A2 = A ) A
1 A2
=A
1A
) A = I.
Therefore, A2 = A ) A = I or A is singular.
17. Since A is idempotent, the previous problem gives us that A = I or A is singular. But its
given that A is nonsingular. So A = I.
18. Let A2 = A, B 2 = B, and AB = BA. Consider (AB)2 = A(BA)B = AABB = A2 B 2 = AB.
Therefore, AB is idempotent.
20
Matrices
2.5
LU Factorization
2.5.1
Exercises
In Exercises 1 - 6, determine the inverse of the given elementary matrix.

"
#
2
3
2
3
0 0 1
k 0 0
0 1
1.
6
7
6
7
3. 40 1 05
5. 40 1 05
1 0
1 0 0
0 0 1
2.
"
5 0
0 1
1
6
4. 40
0
1
6
60
6. 6
40
0
3
0 0
7
1 05
3 1
0
1
0
0
In Exercises 7 - 10, compute an LU-factorization of the given matrix.

"
#
2
3
3 0 1
1 0
7.
6
7
9. 4 6 1 15
2 1
3 1 0
2
3
2
0
0
"
#
6
7
10. 4 0
2 1
3 15
8.
6 4
10 12 3
8
>
=
1
< 2x1 + x2
11. Consider the linear system
x2
x3 =
2 .
>
:
2x1 + x2 + x3 =
2
(a) Compute an LU-factorization of the coefficient matrix of the system.

(b) Solve the lower triangular system L~y = ~b.
(c) Solve the upper triangular

8
>
>
>
<
12. Consider the linear system
>
>
>
:
system U~x = ~y .
2x1
2x1 + x2
x3
6x1 + 2x2 + x3
x4
=
=
=
=
4
4
.
2
1
(a) Compute an LU-factorization of the coefficient matrix of the system.

(b) Solve the lower triangular system L~y = ~b.
(c) Solve the upper triangular system U~x = ~y .
0
k
1
0
3
0
7
07
7
05
1
2.5 LU Factorization
2.5.2
1.
21
"
0 1
1 0
2.
"
#
0
0 1
7.
"
1 0
2 1
8.
"
3
0 0 1
6
7
3. 40 1 05
1 0 0
3
0 0
6
7
5. 4 0 1 05
0 0 1
2
3
1 0 0
6
7
4. 40 1 05
0 3 1
#"
#"
1 0
0 1
2 1
0 1
32
1 0 0 2 1
6
76
11. (a) 4 0 1 0540 1
1 2 1 0 0
(b) ~y = (1, 2, 5)
3
0
7
15
3
5
3)
32
0 2
76
0760
76
0540
1 0
(b) ~y = (4, 0, 14, 1)

(c) ~x = (2,
0
1
0
0
32
3
1 0 0 3 0 1
6
76
7
9. 4 2 1 0540 1
15
1 1 1 0 0 2
2
32
3
1 0 0 2 0 0
6
76
7
10. 40 1 0540
3 15
5
4 1 0 0 7
(c) ~x = ( 13 , 13 ,
2
1 0 0
6
6 1 1 0
12. (a) 6
43 2 1
0 0 0
1
k
1
6
60
6. 6
40
0
1
5
1 0
3 1
14
3 ,
14
3 , 1)
0
1
0
0
0
1
3
0
3
0
7
07
7
05
1
0
k
1
0
3
0
7
07
7
05
1
22
Matrices
2.6
Determinants and Their Properties
2.6.1
Exercises
In Exercises 1 - 12, compute the determinant of the given matrix.

h i
"
#
3
2
1.
3
6.
4
1
"
#
2
3
2 1
2.
1 4
2
3 4
6
7
7. 4 3 2 0 5
"
#
1 4 3
5 2
3.
2
3
6 3
2 4 6
6
7
"
#
8. 40 3 1 5
7 6
0 0
5
4.
1
3
2
2
3
0.4
0.4
0.3
"
#
6
7
9. 4 0.2 0.2 0.25
0 6
5.
0 3
0.3 0.2 0.2
x
6
10. 4 2
0
2
5
6
64
11. 6
40
0
2
5
6
60
6
12. 6
60
6
40
0
3
y 1
7
3 15
1 1
3
6
2
1
2
1
0
0
0
3
0
6
7
4 127
7
3 45
2 2
0
4
2
3
0
0
3
6
4
0
3
2
7
27
7
37
7
7
15
2
In Exercises 13 - 18, use row or column operations to compute the determinant of the given matrix.
2
3
2
3
1 7
3
4
7 9
1
6
7
6
7
13. 41 3 1 5
7
07
66 2
16. 6
7
43 6
3 35
4 8 1
0
2
6
14. 4 1
6
1
3
3
4 3
6
15. 4 5 4
2 3
3
1
7
25
3
3
2
7
15
4
1
6
63
17. 6
43
4
2
1
6
62
6
18. 6
62
6
40
0
2
4
6
5
7
5
1
3
3
9
7
57
7
15
2
1
6
0
2
1
8
0
2
8
1
4
4
6
0
2
3
2
7
37
7
27
7
7
05
2
3
2
3
1 2 1
1 0 0
6
7
6
7
19. Let A = 4 1 0 15 and B = 4 0 2 05. Show that |AB| = |A||B|.
0 1 0
0 0 3
2.6 Determinants and Their Properties

2
3 6
6
20. Let A = 4 6
9
9 12
2
1 0
6
61 0
21. Let A = 6
42 0
1
3
22. Let A 2 R44
2
1
6
23. Let A = 42
4
23
3
9
7
125. Compute |A| by factoring constants out of the determinant.
15
3
1 3
7
3
27
7. Compute |A 1 | without computing A 1 .
2
15
1
2
such that |A| = 24. Compute |AT |, |A2 |, |AAT |, |2A|, and |A
3
0 3
7
1 05. Find the values of k so that A is singular.
2

1|
24. If A is invertible, then |A
1
|A| .
25. If A, P 2 Rnn and P is invertible, then |P
1 AP |
26. If A is an orthogonal matrix, then |A| = 1.

27. |A| = 0 if and only if A is singular.
"
28. A 2 R22 ^ |A| =
6 0)A
1
|A|
a22
a21
a12
a11
= |A|.
1 |.
24
Matrices
2.6.2
1.
5. 0
9. 0.002
2. 5
6.
3. 27
7.
58
11. 0
4.
8.
30
12.
24
10. 4x
13. 28
16.
14. 0
17. 136
15.
60
2y
100
1344
18.
1100
19. Good luck.

20. 54
21.
1
24
22. |AT | =
24, |A2 | = 576, |AAT | = 576, |2A| =
1|
1
|A| .
384, |A
1
24
23. k = 24
24. A
25. |P
26. A
1A
= I ) |A
1 AP |
1
= |P
1 A|
= |I| ) |A
1 ||A||P |
= AT ) |A
1|
1 ||A|
1
|P | |A||P |
= |AT | )
1
|A|
= 1 ) |A
1|
= |A|.
= |A| ) |A|2 = 1 ) |A| = 1.
27. Hint: Consider the role of elementary matrices in computing an inverse matrix.
28. Hint: Multiply A by A
and watch what happens.
2.7 Adjoint Matrices and Cramers Rule
2.7
2.7.1
25
Adjoint Matrices and Cramers Rule

Exercises
In Exercises 1 - 4, compute the adjoint of the given matrix. If the matrix is invertible, use the
adjoint to compute the inverse.
"
#
2
3
3
5
7
1 2
1. A =
6
7
3. A = 4 2
4
35
3 4
0
1
1
2
1
6
2. A = 40
0
0
2
4
0
7
6 5
12
6
6
4. A = 6
4
1
3
0
1
2
1
0
1
0
4
1
1
In Exercises 5 - 8, use Cramers rule to solve the linear system.

8
(
>
4x
2y = 10
< x1 + 2x2
5.
7.
2x1
3x
5y = 11
>
:
3x1
4x2
8
>
< 3x1 + 4x2
(
8.
x + 2y = 7
4x1
4x2
6.
>
:
2x + y = 8
6x1
6x2
3
1
7
17
7
25
2
3x3 = 1
+ x3 = 0
+ 4x3 = 2
+ 4x3 = 11
+ 6x3 = 11
= 3
26
Matrices
2.7.2
1. adj(A) =
"
4
3
0
6
2. adj(A) = 40
0
2
7
6
3. adj(A) = 4 2
2
2
7
6
67
4. adj(A) = 6
4 4
2
#
2
;A
1
"
2
3
2
1
1
2
3
0
7
65; Inverse does not exist.
2
3
3
2
7
13
12 13
4
3
3
7
6
5 7
1
3
55; A 1 = 4 23
3 5
2
2
3
2
1
3
3
3
2 7
1
1
9
13
1
9
9
7
6 7
1
1
0
47
0
6
9
7; A 1 = 6 9 4
2
4 9
2
9 10 5
1
9
2
1
1 9
5
1
9
9
0
12
4
13
9
4 7
9 7
10 7
5
9
5
9
5. (2, 1)
7. ( 45 ,
3
2,
6. (3, 2)
8. (1, 12 , 32 )
8
5)
Chapter 3
Vector Spaces
28
Vector Spaces
3.1
3.1.1
Vector Spaces and Their Properties

Exercises
In Exercises 1 - 10, determine whether or not the given set and operations are vector spaces. If so,
identify the zero vector. If not, show at least one vector space axiom that fails.
1. R46 with the standard matrix operations.
2. The set of all third-degree polynomials with the standard function operations.
3. The set {(x, y) : x
0 ^ y 2 R} with the standard operations in R2 .
4. The set {(x, x) : x 2 R} with the standard operations in R2 .

5. The set {A 2 R22 : a22 = 1} with the standard matrix operations.
6. The set {A 2 R33 : a11 = a22 = a33 = 0} with the standard matrix operations.
7. The set {A 2 R22 : |A| = 0} with the standard matrix operations.
8. R22 with the operations A
B = AB and the standard scalar multiplication.
9. R with the standard addition operation and c x = bccx.

10. C[a, b] with the operation f (x)
g(x) = f (x)g(x) and the standard scalar multiplication.
In Exercises 11 - 14, determine if the set R2 with the given operations is a vector space. If so,
identify the zero vector. If not, show at least one vector space axiom that fails.
11. (x1 , y1 )
(x2 , y2 ) = (x1 + x2 , y1 + y2 ) and c (x, y) = (cx, y)
12. (x1 , y1 )
(x2 , y2 ) = (x1 , 0) and c (x, y) = (cx, cy)
13. (x1 , y1 )
(x2 , y2 ) = (x1 x2 , y1 y2 ) and c (x, y) = (cx, cy)
14. (x1 , y1 )
(x2 , y2 ) = (x1 + x2 , y1 + y2 ) and c (x, y) = (cx, 0)
In Exercises 15 - 18, prove the given set and operations is a vector space.
15. The set {(x, 2x) : x 2 R} with the standard operations in R2 .
16. The set {p 2 P2 : p(0) = 0} with the standard function operations.
17. The set {A 2 R22 : a12 = a21 = a22 = 0} with the standard matrix operations.
18. The set {x 2 R : x > 0} with the operations x
y = xy and c x = xc .
3.1 Vector Spaces and Their Properties
3.1.2
29
1. Yes. ~0 = O
2. No. ~0 does not exist.
3. No.
1 (1, 0) = ( 1, 0) is not in the set.
4. Yes. ~0 = (0, 0)
5. No. I + I = 2I is not in the set.
6. Yes. ~0 = O
"
# "
#
1 0
0 0
7. No.
+
= I is not in the set.
0 0
0 1
8. No. A
B 6= B
A in general.
9. No. 2 (0.5 x) = 2 0 = 0, but (2 0.5) x = 1 x = x.

10. No. 2 (f
11. No.
12. No.
13. No.
14. No.
15. Good luck.

16. Good luck.
17. Good luck.
18. Good luck.
g) = 2f (x)g(x), but (2 f )
(2 g) = 4f (x)g(x).
30
Vector Spaces
3.2
Subspaces
3.2.1
Exercises
~ V , where V has the standard operations.

In Exercises 1 - 10, prove whether or not W
1. W = {(x, 0) : x 2 R}, V = R2
2. W = {(x, y, 1) : x, y 2 R}, V = R3
3. W = {(a, b) : a
0^b
0}, V = R2
4. W = {(a, b, c) : a2 + b2 = c2 }, V = R3
5. W = {A : a12 = a21 = 0}, V = R22
6. W = {A : A is a diagonal matrix}, V = Rnn
7. W = {A : AT = A}, V = Rnn
8. W = {f (x) : f 2
/ C[a, b]}, V is the set of all functions on [a, b]
Rb
9. W = {f (x) : a f (x)dx = 0}, V = C[a, b]
10. W = {f (x) : f 0 (x) + f (x) = 0}, V = C( 1, 1)
~ V.
~ V and W
~ V , but U [ W *
11. Find an example where U
In Exercises 12 - 14, prove the given statement for any vector space V .
~ V ^W
~ V )U \W
~ V.
12. U
~ V.
13. If ~u, ~v 2 V and W = {a~u + b~v : a, b 2 R}, then W
~ V ^W
~ V )U +W
~ V , where U + W = {~x : 9~u 2 U, 9w
14. U
~ 2W
~x = ~u + w}.
~
3.2 Subspaces
3.2.2
1. Yes.
2. No.
3. No.
4. No.
5. Yes.
6. Yes.
7. Yes.
8. No.
9. Yes.
10. Yes.
11. Good luck.

12. Good luck.
13. Good luck.
14. Good luck.
31
32
Vector Spaces
3.3
3.3.1
Spanning Sets and Linear Independence

Exercises
In Exercises 1 - 4, show whether or not ~u is a linear combination of the vectors in set S.

1. ~u = (1, 1, 1), S = {(2, 1, 3), (5, 0, 4)}
"
#
"
# "
#
2 28
2
3
0 5
2. ~u =
,S={
,
}
1
11
4 1
1
2
3. ~u = x2
2x, S = {x2 , x2
4. ~u = sinh x, S = {ex , e
x, 3x + 1}
x}
In Exercises 5 - 7, show whether or not the set of vectors S spans the vector space V .
5. S = {( 2, 1), ( 1, 2)}, V = R2
6. S = {(1, 2, 0), (0, 0, 1), ( 1, 2, 0)}, V = R3
7. S = {1, x2 , x2 + 2}, V = P2
In Exercises 8 - 10, show whether the set of vectors S is linearly independent or linearly dependent.
8. S = {( 4, 3, 4), (1, 2, 3), (6, 0, 0)}
x, 2x x2 , 6 5x + x2 }
# "
# "
#
1 0
0 1
2 1
10. S = {
,
,
}
0
2
1 0
1 4
9. S = {2
"
11. Show whether or not the sets of vectors S1 = {(1, 2, 1), (0, 1, 1), (2, 5, 1)} and S2 =
{( 2, 6, 0), (1, 1, 2)} span the same subspace of R3 .
12. Let A be a nonsingular 3 3 matrix. Prove that if {~x1 , ~x2 , ~x3 } is a linearly indepdent set of
vectors in R3 , then the set {A~x1 , A~x2 , A~x3 } is also linearly independent.
In Exercises 13 - 18, prove the given statement for any vector space V .
13. Any set of vectors that contains the zero vector is linearly dependent.
14. Two vectors are linearly dependent if and only if one is a scalar multiple of the other.
15. If {~u, ~v } is a linearly indepedent set of vectors, then {~u +~v , ~u ~v } is also linearly independent.
16. If {~u, ~v , w}
~ is any set of vectors, then {~v
~u, w
~
~v , ~u
w}
~ is linearly dependent.
17. If {~v1 , ~v2 , , ~vk 1 , ~vk } is linearly independent and ~vk is removed from the set, then the
remaining set {~v1 , ~v2 , , ~vk 1 } cannot span V .
18. If {~v1 , ~v2 , , ~vk } spans V and any vector ~vk+1 is added to the set, then the resulting set
{~v1 , ~v2 , , ~vk , ~vk+1 } cannot be linearly independent.
3.3 Spanning Sets and Linear Independence
3.3.2
1. No.
2. Yes. ~u =
"
3. Yes. ~u =
(x2 ) + 2(x2
4. Yes. ~u = 12 ex
2
4
#
"
3
0
+5
1
1
1
x
2e
5. Yes.
6. Yes.
7. No.
8. Linearly independent.
9. Linearly dependent.
10. Linearly dependent.
11. Yes.
12. Good luck.
13. Good luck.

14. Good luck.
15. Good luck.
16. Good luck.
17. Good luck.
18. Good luck.
#
5
2
x) + 0(3x + 1)
33
34
Vector Spaces
3.4
Basis and Dimension
3.4.1
Exercises
In Exercises 1 - 4, determine a basis for and the dimension of the given vector space (with the
standard operations).
1. P5
3. {A 2 R33 : AT = A}
2. {A 2 R33 : A is diagonal}
4. {f 2 C( 1, 1) : f 000 (x)
f 0 (x) = 0}
In Exercises 5 - 12, show whether or not the given set S is a basis for the vector space V (with the
standard operations).
5. S = {(1, 2), (1, 0), (0, 1)}, V = R2
6. S = {(3, 2), (4, 5)}, V = R2
7. S = {(1, 5, 3), (0, 1, 2), (0, 0, 6)}, V = R3
8. S = {(7, 0, 3), (8, 4, 1)}, V = R3
9. S = {1
10. S = {x3
"
1
11. S = {
0
"
2
12. S = {
0
x, 1
x2 , 3x2
2x
1}, V = P2
2x2 + 1, x2 4, x3 + 2x + 5x}, V = P3
# "
# "
# "
#
0
0 1
1 0
8
4
,
,
,
}, V = R22
0
1 0
0 1
4 3
# "
# "
# "
#
0
1 4
0 1
0 1
,
,
,
}, V = R22
3
0 1
3 2
2 0
In Exercises 13 - 14, compute a basis for and a geometric description of the following subspaces of
R3 .
13. {(2t, t, t) : t 2 R}
14. {(2s
t, s, t) : s, t 2 R}
In Exercises 15 - 18, determine if the given statement is true or false for any vector space V . If it
is true, explain why. If it is false, provide a counterexample.
15. If dim(V ) = n, then any set of n + 1 vectors cannot be linearly independent.
16. If dim(V ) = n, then any set of n
1 vectors must be linearly independent.
17. If dim(V ) = n, then any set of n + 1 vectors must span V .

18. If dim(V ) = n, then any set of n
1 vectors cannot span V .
3.4 Basis and Dimension
3.4.2
35
1. {1, x, x2 , x3 , x4 , x5 },
2
3 2
1 0 0
0 0
6
7 6
2. {40 0 05 , 40 1
0 0 0
0 0
2
3 2
1 0 0
0 0
6
7 6
3. {40 0 05 , 40 1
0 0 0
0 0
4. {1, ex , e
x },
6
3 2
0
0
7 6
05 , 4 0
0
0
3 2
0
0
7 6
05 , 4 0
0
0
3
0 0
7
0 05}, 3
0 1
3 2
3 2
3 2
3
0 0
0 1 0
0 0 1
0 0 0
7 6
7 6
7 6
7
0 05 , 41 0 05 , 40 0 05 , 40 0 15}, 6
0 1
0 0 0
1 0 0
0 1 0
5. No.
6. Yes.
7. Yes.
8. No.
9. No.
10. No.
11. No.
12. Yes.
13. {(2, 1, 1)}, Line through the origin in the direction of (2, 1, 1).
14. {(2, 1, 0), ( 1, 0, 1)}, Plane through the origin containing (2, 1, 0) and ( 1, 0, 1).
15. T
16. F
17. F
18. T
36
Vector Spaces
3.5
3.5.1
Row Space, Column Space, and Null Space

Exercises
In Exercises 1 - 4, compute a basis for the row space and the rank of the given matrix.
"
#
"
#
1 0
1
3 2
1.
3.
0 2
4 2 1
h
2. 0 1
i
2
2
6
4. 45
8
3
3 1
7
10 65
7 5
In Exercises 5 - 8, compute a basis for the column space and the rank of the given matrix.
"
#
"
#
2 4
1 2 4
5.
7.
1 6
1 2 1
h
i
6. 1 2 3
4
6
8. 46
2
20
5
11
3
31
7
65
16
In Exercises 9 - 12, compute a basis for the nullspace space and the nullity of the given matrix.
"
#
"
#
2
1
1 2 3
9.
11.
6 3
0 1 0
h
i
10. 1 2 3
1
6
12. 42
4
2
1
3
3
3
7
45
2
In Exercises 13 - 16, compute a basis for and the dimension of the solution set for
homogeneous system.
(
(
x1
4x2 = 0
2x1
x2 = 0
13.
15.
3x1
12x2 = 0
x1 + 3x2 = 0
8
>
< x1 + x2 + x3
(
16.
x1
2x2 + 3x3 = 0
3x1
x2
14.
>
:
3x1 + 6x2
9x3 = 0
2x1
4x2
5x3
the given linear
= 0
= 0
= 0
3.5 Row Space, Column Space, and Null Space
37
In Exercises 17 - 18, determine if ~b is in the column space of A. If so, write ~b as a linear combination
of the columns of A.
"
#
" #
2
3
2 3
1 3 2
1
1 2 ~
3
17. A =
,b=
6
7 ~ 6 7
18.
A
=
,
b
=
1
1
2
15
4
5
4
4 0
4
0 1 1
0
19. Compute a basis for
2
1 2 1
6
62 5 1
20. Let A = 6
43 7 2
4 9 3
the subspace of R3 that is spanned by {(4, 4, 8), (1, 1, 2), (1, 1, 1)}.
3
2
3
0
0
1 0 3 0
4
7
6
7
1
07
1 0 27
60 1
7, where RREF(A) = 6
7.
40 0 0 1
2
25
25
1
0 0
(a) Compute the rank and nullity of A.
(b) Compute a basis for the null space of A.

(c) Compute a basis for the row space of A.
(d) Compute a basis for the column space of A.
(e) Determine whether or not the rows of A are linearly independent.
(f) Determine if the first, second, and third columns of A are linearly independent. If not,
write one column as a linear combination of the others.
(g) Determine if the first, second, and fourth columns of A are linearly independent. If not,
write one column as a linear combination of the others.
38
Vector Spaces
3.5.2
1. {(1, 0), (0, 1)}, 2
3. {(1, 0, 12 ), (0, 1,
1
2 )},
2. {(0, 1, 2)}, 1
4. {(1, 0, 45 ), (0, 1, 15 )}, 2
" # " #
1
0
5. {
,
}, 2
0
1
"
# " #
1
2
7. {
,
}, 2
1
2
h i
6. { 1 }, 1
2 3 2
3
4
20
6 7 6
7
8. {465 , 4 5 5}, 2
2
11
" #
1
9. {
}, 1
2
6
11. {4
3 2 3
2
3
6 7 6 7
10. {4 1 5 , 4 0 5}, 2
0
1
6
12. {4
3
3
7
0 5}, 1
1
3
1
7
2 5}, 1
1
13. {(4, 1)}, 1
15. {(0, 0)}, 0
14. {(2, 1, 0), ( 3, 0, 1)}, 2
16. {( 1, 3, 2)}, 1
17. Yes. ~b = ~a1 + 2~a2
18. No.
19. {(1, 1, 0), (0, 0, 1)}

20. (a) Rank is 3. Nullity is 2.
h
iT h
(b) { 3 1 1 0 0 , 4
2 0 2
h
i h
(c) { 1 0 3 0
4 , 0 1
1 0
h
iT h
iT h
(d) { 1 2 3 4 , 2 5 7 9 , 0
(e) No.
(f) No. ~a3 = 3~a1
(g) Yes.
~a2
iT
1 }
i h
2 , 0 0 0 1
iT
1 2
1 }
i
2 }
3.6 Change of Bases
3.6
3.6.1
39
Change of Bases
Exercises
In Exercises 1 - 2, compute [~x]S given [~x]B and B, where S is the standard basis in Rn .
" #
4
1. [~x]B =
, B = {(2, 1), (0, 1)}
1
2 3
2
6 7
2. [~x]B = 435, B = {(1, 0, 1), (1, 1, 0), (0, 1, 1)}
1
In Exercises 3 - 4, compute [~x]B given ~x and B.
3. ~x = (12, 6), B = {(4, 0), (0, 3)}
4. ~x = (3, 19, 2), B = {(8, 11, 0), (7, 0, 10), (1, 4, 6)}
In Exercises 5 - 6, compute the transition matrix from S to B, where S is the standard basis in Rn .
5. B = {(2, 4), (1, 3)}
6. B = {(1, 0, 0), (0, 2, 8), (6, 0, 12)}
In Exercises 7 - 8, compute the transition matrix from C to B. Then compute [~x]B given [~x]C .
" #
1
7. B = {(1, 3), ( 2, 2)}, C = {( 12, 0), ( 4, 4)}, [~x]C =
3
2 3
1
6 7
8. B = {(1, 0, 2), (0, 1, 3), (1, 1, 1)}, C = {(2, 1, 1), (1, 0, 0), (0, 2, 1)}, [~x]C = 4 2 5
1
In Exercises 9 - 10, compute the transition matrix from S = {1, x, x2 } to B. Then compute [p(x)]B
given p(x).
9. B = {1 + x, 2x, x2
10. B = {1
2x + x2 , 3
1}, p(x) = x2
x+2
5x + 4x2 , 2x + 3x2 }, p(x) = 2x
40
Vector Spaces
3.6.2
1.
"
8
3
2 3
5
6 7
2. 445
3
" #
3
3.
2
5.
7.
"
"
3
1
6 7
4. 4 15
2
3
2
1
2
1
6
6. 40
0
# " #
6 4
6
,
9 4
3
6
9. 4
1
1
2
0
1
2
6
8. 4
3
3
7
1 7, 6
2 5 4 25
1
1
1
3 2
1
2
3
2
1
2
2
1
2
1
2
23
6
10. 4 8
3
7
0 5
1
3
1
12
1
2
1
2
1
2
9
3
1
3
4
5
4
5
4
3 2
7 6
5, 4
11
4
97
45
5
4
3 2 3
6
5
7 6 7
,
25 4 25
1
1
Chapter 4
Inner Product Spaces
42
4.1
4.1.1
Inner Product Spaces and Their Properties

Exercises
In Exercises 1 - 5, prove whether or not the given function defines an inner product on V .
1. h~u, ~v i = 3u1 v1 + u2 v2 , V = R2
2. h~u, ~v i = u21 v12
u22 v22 , V = R2
3. h~u, ~v i = u1 v1
u2 v 2
u 3 v 3 , V = R3
4. hA, Bi = a11 b11 + a12 b12 + a21 b21 + a22 b22 , V = R22
Rb
5. hf, gi = a f (x)g(x)dx, V = C[a, b]
In Exercises 6 - 10, compute h~u, ~v i, ||~u||, ||~v ||, and d(~u, ~v ) for the given vectors with respect to the
given inner product on V .
6. ~u = (3, 4), ~v = (5, 12), h~u, ~v i = ~u ~v , V = R2
7. ~u = ( 4, 3), ~v = (0, 5), h~u, ~v i = 3u1 v1 + u2 v2 , V = R2
"
#
"
#
1 3
0
2
8. ~u =
, ~v =
, h~u, ~v i = 2u11 v11 + u12 v12 + u21 v21 + 2u22 v22 , V = R22
4
2
1 1
9. ~u = 1
x + 3x2 , ~v = x
10. ~u = 1, ~v = 3x2
x2 , h~u, ~v i = u0 v0 + u1 v1 + u2 v2 , V = P2
R1
1, h~u, ~v i = 1 u(x)v(x)dx, V = C[ 1, 1]
In Exercises 11 - 14, compute the angle between the given vectors with respect to the given inner
product on V .
11. ~u = (3, 4), ~v = (5, 12), h~u, ~v i = ~u ~v , V = R2
12. ~u = (1, 1, 1), ~v = (2, 2, 2), h~u, ~v i = u1 v1 + 2u2 v2 + u3 v3 , V = R3
x + x2 , q(x) = 1 + x + x2 , hp, qi = a0 b0 + a1 b1 + a2 b2 , V = P2
R1
14. f (x) = x, g(x) = x2 , hf, gi = 1 f (x)g(x)dx, V = C[ 1, 1]
13. p(x) = 1
In Exercises 15 - 18, verify the Cauchy-Schwarz and triangle inequalities for the given vectors with
respect to the given inner product on V .
15. ~u = (1, 0, 4), ~v = ( 5, 4, 1), h~u, ~v i = ~u ~v , V = R3
"
#
"
#
0 3
3 1
16. A =
,B=
, hA, Bi = a11 b11 + a12 b12 + a21 b21 + a22 b22 , V = R22
2 1
4 3
17. p(x) = 2x, q(x) = 3x2 + 1, hp, qi = a0 b0 + a1 b1 + a2 b2 , V = P2
R /4
18. f (x) = sin x, g(x) = cos x, hf, gi = 0 f (x)g(x)dx, V = C[0, /4]
4.1 Inner Product Spaces and Their Properties
4.1.2
1. Yes.
2. No.
3. No.
4. Yes.
5. Yes.
p
33, ||~u|| = 5, ||~v || = 13, d(~u, ~v ) = 2 65
p
p
h~u, ~v i = 15, ||~u|| = 57, ||~v || = 5, d(~u, ~v ) = 2 13
p
p
p
h~u, ~v i = 6, ||~u|| = 35, ||~v || = 7, d(~u, ~v ) = 3 6
p
p
p
h~u, ~v i = 4, ||~u|| = 11, ||~v || = 2, d(~u, ~v ) = 21
p
p
p
h~u, ~v i = 0, ||~u|| = 2, ||~v || = 2p52 , d(~u, ~v ) = 3p52
6. h~u, ~v i =
7.
8.
9.
10.
11. Approximately 120.5 .
13. Approximately 70.5 .
12. /2 rads.
14. /2 rads.
p
p
p
714, 57 17 + 42
p
p
p
p
16. 14 7 10, 77 14 + 35
p
p
p
17. 0 2 10, 14 2 + 10
q
q
q
2
1
18. 12 64 16
, 4 + 12 8
15. 1
1
4
1
4
43
44
4.2
4.2.1
Orthogonality
Exercises
In Exercises 1 - 3, show whether or not the given vectors are orthogonal with repect to the given
inner product on V . If the vectors are orthogonal, verify the Pythagorean Theorem.
1. ~u = (1, 0, 1), ~v = ( 2, 1, 1), h~u, ~v i = ~u ~v , V = R3
R /2
2. f (x) = sin x, g(x) = cos x, hf, gi = /2 f (x)g(x)dx, V = C[ /2, /2]
3. f (x) = x, g(x) = 12 (5x3
3x), hf, gi =
R1
1 f (x)g(x)dx,
V = C[ 1, 1]
In Exercises 4 - 6, compute proj~v ~u with respect to the given inner product on V .

4. ~u = (1, 2), ~v = (2, 1), h~u, ~v i = ~u ~v , V = R2
5. ~u = (1, 3, 2), ~v = (0, 1, 1), h~u, ~v i = ~u ~v , V = R3
R1
6. ~u = x, ~v = ex , h~u, ~v i = 0 u(x)v(x)dx, V = C[0, 1]
In Exercises 7 - 8, show that the given set of vectors is orthogonal in Rn and transform it into an
orthonormal set. Use the inner product h~u, ~v i = ~u ~v .
p p p
p
p
8. {( 3, 3, 3), (
2, 0, 2)}
7. {( 1, 4), (8, 2)}
9. Show that the set {1, cos x, cos (2x), sin x, sin (2x)} is orthogonal
in C[0, 2] and transform it
R 2
into an orthonormal set. Use the inner product hf, gi = 0 f (x)g(x)dx.
In Exercises 10 - 11, compute [~x]B given the vector ~x and the orthonormal basis B in Rn . Use the
inner product h~u, ~v i = ~u ~v .
10. ~x = (1, 2), B = {(
p
p
p
p
2 13 3 13
3 13 2 13
13 , 13 ), ( 13 , 13 )}
11. ~x = (5, 10, 15), B = {( 35 , 45 , 0), (
4 3
5 , 5 , 0), (0, 0, 1)}
3
1 1
1
7
6
12. Let A = 40 2 1 5. Show that N (A) ? R(AT ) and N (AT ) ? R(A) with respect to the
1 3 0
inner product h~u, ~v i = ~u ~v in R3 .
In Exercises 13 - 14, prove the given statement for any inner product space V .
~ V =) W ?
~ V.
13. W
~ V =) W \ W ? = {~0}.
14. W
4.2 Orthogonality
4.2.2
45
1. No.
2. Yes.
3. Yes.
4. proj~v ~u = ( 85 , 45 )
5. proj~v ~u = (0, 52 ,
6. proj~v ~u =
7. {(
5
2)
2ex
e2 1
p1 , p4 ), ( p4 , p1 )}
17
17
17
17
8. {(
p p
3
3
3
,
3
3 , 3 ), (
p
2
2
,
0,
2
2 )}
9. { p12 , p1 cos x, p1 cos (2x), p1 sin x, p1 sin (2x)}
10. [~x]B =
"
p #
4 13
13
p
7 13
13
3
11
6 7
11. [~x]B = 4 2 5
15
12. Hint: You need only consider the vectors in the basis of each subspace.
13. Good luck.

14. Good luck.
46
4.3
4.3.1
The Gram-Schmidt Process

Exercises
In Exercises 1 - 4, use the Gram-Schmidt process to transform the given set of vectors in Rn into
an orthonormal set. Use the inner product h~u, ~v i = ~u ~v .
1. {(3, 4), (1, 0)}
3. {(0, 1, 1), (1, 1, 0), (1, 0, 1)}
2. {(3, 4, 0), (2, 0, 0)}
4. {(1, 2, 1, 0), (2, 2, 0, 1), (1, 1, 1, 0)}
In Exercises 5 - 8, use the Gram-Schmidt process to transform the given basis into an orthonormal
basis with respect to the given inner product on V .
5. {(2, 1), ( 2, 10)}, h~u, ~v i = 2u1 v1 + u2 v2 , V = R2
6. {x2 , x2 + 2x, x2 + 2x + 1}, hp, qi = a0 b0 + a1 b1 + a2 b2 , V = P2
7. {x2
1}, hp, qi = a0 b0 + a1 b1 + a2 b2 , V = P2
R1
8. {1, x, x2 }, hp, qi = 1 p(x)q(x)dx, V = P2
1, x
4.3 The Gram-Schmidt Process
4.3.2
47
1. {( 35 , 45 ), ( 54 ,
3
5 )}
2. {( 35 , 45 , 0), ( 54 ,
3.
4.
3
5 , 0)}
p p
p p
p
p
p p
{(0, 22 , 22 ), ( 36 , 36 , 36 ), ( 33 , 33 , 33 )}
p p
p
p
p p
p
p
{( 66 , 66 , 66 , 0), ( 33 , 0, 33 , 33 ), ( 33 , 33 ,
5. {( 23 ,
p
p
2 2 2
1
),
(
,
3
6
3 )}
6. {x2 , x, 1}
7. { p12 (x2
1),
p1 (x2
6
8. { p12 , p32 x, 2p52 (3x2
2x + 1)}
1)}
3
3 , 0)}
48
4.4
4.4.1
Least-Squares
Exercises
In Exercises 1
2
2
6
1. A = 41
1
- 2, compute the least-squares solution of A~x = ~b

3
2 3
2
1
2
1
7
6 7
6
25, ~b = 4 0 5
61
2. A = 6
40
1
3
for the given matrices A and ~b.
0
1
1
1 1
3
2 3
1
4
7
6 7
1 7 ~ 6 17
7, b = 6 7
405
15
0
1
In Exercises 3 - 6, compute the least-squares regression function indicated for the given set of data
points.
3. {( 1, 1), (1, 0), (3, 3)}, least-squares regression line.
4. {( 2, 1), ( 1, 2), (0, 1), (1, 2), (2, 1)}, least-squares regression line.
5. {(0, 0), (2, 2), (3, 6), (4, 12)}, least-squares regression parabola.
6. {( 2, 0), ( 1, 0), (0, 1), (1, 2), (2, 5)}, least-squares regression parabola.
In Exercises 7 - 10, compute the Fourier approximation of f (x) of the given order on the interval
[0, 2].
7. f (x) =
8. f (x) = (x
x, third order
)2 , third order
9. f (x) = e
x,
first order
10. f (x) = 2 sin x cos x, fourth order
4.4 Least-Squares
4.4.2
1. x
=
"
3. y =
4. y =
#
1
1
x+
3
2
6 7
2. x
= 4 25
1
1
3
7
5
7. 2 sin x + sin (2x) + 23 sin (3x)

8.
49
2
3
+ 4 cos x + cos (2x) + 49 cos (3x)
5. y = x2
6. y = 37 x2 + 65 x +
9.
1
2 (1
10. sin (2x)
2 )(1
26
35
+ cos x + sin x)
50
Chapter 5
52
5.1
5.1.1

Exercises
In Exercises 1 - 10, compute all the eigenvalues and their corresponding eigenvectors of the given
matrix.
"
#
2
3
1 2
2
3
2
1. A =
6
7
6. A = 4 2 5
25
2
2
6 6
3
"
#
6
3
"
#
2. A =
0 1
2 1
7. A =
1 0
2
3
2
2 3
"
#
6
7
3. A = 40 3
3
2
25
8. A =
4
1
0
1 2
"
#
"
#
2 1
2
5
4. A =
9. A =
1
2
1
2
2
3
2
3
1 1 2
1 0 0
6
7
6
7
5. A = 41 2 15
10. A = 42 1
25
2 1 1
3 2 1
11. For each matrix in the previous problem, show that the trace equals the sum of its eigenvalues
and that the determinant equals the product of its eigenvalues.
12. Prove that
= 0 is an eigenvalue of A if and only if A is singular.
13. Prove that if A is invertible with eigenvalue , then A

14. Prove that if A2 = O, then the only eigenvalue of A is
has eigenvalue 1/ .
= 0.
5.1 Eigenvalues and Eigenvectors
5.1.2
1.
2.
3.
53
4.
5.
6.
7.
8.
9.
10.
" #
" #
1
2
= 1, ~v1 =
and 2 = 2, ~v2 =
2
1
" #
" #
1
3
= 0, ~v1 =
and 2 = 7, ~v2 =
2
1
2 3
2 3
1
1
6 7
6 7
= 1, ~v1 = 4 1 5 and 2 = 2, ~v2 = 405 and
1
"
3
7
6 7
= 4, ~v3 = 4 45
2
" #
1
1
= 3, ~v1 =
and 2 = 1, ~v2 =
1
1
2 3
2 3
2 3
1
1
1
6 7
6 7
6 7
= 1, ~v1 = 4 0 5 and 2 = 1, ~v2 = 4 25 and 3 = 4, ~v3 = 415
1
1
1
2 3
2 3
2 3
1
1
1
6 7
6 7
6 7
= 3, ~v1 = 415 and 2 = 3, ~v2 = 415, ~v3 = 4 0 5
3
0
1
" #
" #
1
1
= i, ~v1 =
and 2 = i, ~v2 =
i
i
"
#
"
#
1
1
= 1 + 2i, ~v1 =
and 2 = 1 2i, ~v2 =
1 i
1+i
"
#
"
#
2+i
2 i
= i, ~v1 =
and 2 = i, ~v2 =
1
1
2 3
2 3
2 3
2
0
0
6 7
6 7
6 7
= 1, ~v1 = 4 35 and 2 = 1 + 2i, ~v2 = 4 i 5 and 3 = 1 2i, ~v3 = 4 i5
2
1
1
11. Good luck.

12. Good luck.
13. Good luck.
14. Good luck.
54
5.2
5.2.1
Diagonalization
Exercises
In Exercises 1 - 6, determine if A is diagonalizable. If so, compute an

diagonal matrix D of eigenvalues so that D = V 1 AV .
"
#
2
1 2
6
3
1. A =
6
4. A = 4 2 5
2 1
6 6
"
#
2
3
3
1
0
0
1
2
2. A = 1
6
7
5. A = 41 2 15
1
2
1 0 2
2
3
2
3
2
2 3
4 0 0
6
7
6
7
3. A = 40 3
6. A = 42 2 05
25
0
1 2
0 2 2
invertible matrix V and a

3
2
7
25
3
In Exercises 7 - 10, use a diagonal matrix to perform the given task.

"
#
"
#
10 18
1 0
6
A
7. Compute A if A =
.
9. Compute e if A =
.
6
11
1 0
2
3
3
2
3
"
#
6
7
8. Compute A8 if A = 4 3
.
1
0
4 95
10. Compute eA if A =
.
1 2
1
2 5
11. Prove that if A is diagonalizable with n real eigenvalues, then |A| equals the product of its
eigenvalues.
12. Prove that if every eigenvalue of a diagonalizable matrix A is 1 or
1, then A
= A.
5.2 Diagonalization
5.2.2
55

"
#
"
#
1
3
0 0
1. V =
,D=
2 1
0 7
"
#
"
#
1
3 1
0
2. V =
,D= 2
1
1 1
0
2
2
3
2
1 1 7
1
6
7
6
3. V = 4 1 0
45 , D = 4 0
1 0 2
0
2
3
2
1 1 1
3
6
7
6
4. V = 41 1 0 5, D = 4 0
3 0
1
0
5. Not diagonalizable.
3
0 0
7
2 05
0 4
3
0 0
7
3 05
0 3
6. Not diagonalizable.
"
188
126
378
253
384
6
8
8. A = 4 384
128
256
512
256
7. A6 =
11. Good luck.

12. Good luck.
3
384
7
1152 5
640
9. eA =
"
10. eA =
"
e
e
#
0
1 1
e
e
e2
0
e2
56
Chapter 6
Linear Transformations
58
6.1
6.1.1
Linear Transformations and Their Properties

Exercises
In Exercises 1 - 6, prove whether or not the given function defines a linear transformation.
1. T : R2 ! R2 where T (~v ) = (v1 , 1)
2. T : R3 ! R2 where T (~v ) = (v22 , v1
v3 )
3. T : R2 ! R3 where T (~v ) = (0, v2 , v1 )

Rb
4. T : C[a, b] ! R where T (f ) = a f (x)dx
5. T : R22 ! R where T (A) = |A|
6. T : R22 ! R where T (A) = a11 + a12 + a21 + a22

7. Let T : R3 ! R3 be a linear transformation such that T (1, 0, 0) = (2, 4, 1), T (0, 1, 0) =
(1, 3, 2), and T (0, 0, 1) = (0, 2, 2). Compute T (0, 3, 1) and T (2, 4, 1).
8. Let T : P2 ! P2 be a linear transformation such that T (1) = x, T (x) = 1 + x, and T (x2 ) =
1 + x + x2 . Compute T (2 6x + x2 ).
In Exercises 9 - 12, prove the given statement.
9. If A 2 Rmn , then T : Rn ! Rm where T (~v ) = A~v is a linear transformation.
10. If V is an inner product space and ~x0 2 V , then T : V ! R where T (~v ) = h~v , ~x0 i is a linear
transformation.
~ V.
11. If T : V ! V is a linear transformation and W = {~v 2 V : T (~v ) = ~v }, then W
12. If T : V ! V is a linear transformation and {~v1 , ~v2 , , ~vk } is linearly dependent, then
{T (~v1 ), T (~v2 ), , T (~vk )} is linearly dependent.
6.1 Linear Transformations and Their Properties
6.1.2
1. No.
2. No.
3. Yes.
4. Yes.
5. No.
6. Yes.
7. T (0, 3, 1) = (3, 11, 8) and T (2, 4, 1) = (0, 6, 8)

8. T (2
6x + x2 ) = x2
9. Good luck.
10. Good luck.
11. Good luck.
12. Good luck.
3x
59
60
6.2
6.2.1
Kernel and Range

Exercises
In Exercises 1 - 6, compute ker(T ) nullity(T ), R(T ), and rank(T ) for each given linear transformation.
1. T : R23 ! R32 where T (A) = AT
2. T : R3 ! R3 where T (~v ) = (v1 , 0, v3 )
3. T : R3 ! R3 where T (~v ) = (0, 0, v2 )
"
#
1
1 2
3
2
4. T : R ! R where T (~v ) =
~v
0 1 2
5. T : P4 ! P3 where T (p) = p0 (x)
6. T : C[a, b] ! C[a, b] where T (f ) = f (x)
7. Which linear transformations in Exercises 1 - 6 are one-to-one?
8. Let T : Rnn ! Rnn be the linear transformation where T (A) = A
AT . Compute ker(T ).
In Exercises 9 - 10, prove the statement for any linear transformation T : V ! W .

~ V and R(T )
~ W.
9. ker(T )
10. ker(T ) = {~0} , T is one-to-one.
6.2 Kernel and Range
6.2.2

"
#
0 0 0
1. ker(T ) = {
}, nullity(T ) = 0, R(T ) = R32 , rank(T ) = 6
0 0 0
2. ker(T ) = span{(0, 1, 0)}, nullity(T ) = 1, R(T ) = span{(1, 0, 0), (0, 0, 1)}, rank(T ) = 2
3. ker(T ) = span{(1, 0, 0), (0, 0, 1)}, nullity(T ) = 2, R(T ) = span{(0, 0, 1)}, rank(T ) = 1
4. ker(T ) = span{( 4, 2, 1)}, nullity(T ) = 1, R(T ) = R2 , rank(T ) = 2
5. ker(T ) = span{1}, nullity(T ) = 1, R(T ) = P3 , rank(T ) = 4
6. ker(T ) = {f (x) = 0}, nullity(T ) = 0, R(T ) = C[a, b], rank(T ) = 1
7. Exercises 1 and 6.
8. ker(T ) = {A 2 Rnn : AT = A}
9. Good luck.
10. Good luck.
61
62
6.3
6.3.1
Matrix Representations of Linear Transformations

Exercises
In Exercises 1 - 4, compute the standard matrix representation for the given linear transformation.
1. T : R2 ! R2 where T (~v ) = (v1 + 2v2 , v1
2v2 )
2. T : R3 ! R3 where T (~v ) = (v1 + v2 , v1
v 2 , v3
3. T : R3 ! R2 where T (~v ) = (3v1
2v3 , 2v2
v1 )
v3 )
4. T : R2 ! R2 where T (~v ) will rotate ~v clockwise by 60 .

In Exercises 5 - 6, compute the standard matrix representation of T2 T1 and T1 T2 .
5. T1 : R2 ! R2 where T1 (~v ) = (v1
2v2 , 2v1 + 3v2 ) and T2 : R2 ! R2 where T2 (~v ) = (v2 , 0)
6. T1 : R2 ! R3 where T1 (~v ) = ( v1 + 2v2 , v1 + v2 , v1

(v1 3v2 , 3v1 + v3 )
v2 ) and T2 : R3 ! R2 where T2 (~v ) =
In Exercises 7 - 9, determine whether or not the given linear transformation is invertible. If so,
compute the inverse.
7. T : R2 ! R2 where T (~v ) = ( 2v1 , 2v2 )
8. T : R2 ! R2 where T (~v ) = (v1 + v2 , 3v1 + 3v2 )
9. T : R3 ! R3 where T (~v ) = (v1 , v1 + v2 , v1 + v2 + v3 )
In Exercises 10 - 13, compute the matrix representation of T relative to bases B and B 0 .
10. T : R2 ! R2 where T (~v ) = (2v1
12v2 , v1
11. T : R3 ! R2 where T (~v ) = (v1

{(1, 2), (1, 1)}
5v2 ), B = B 0 = {(4, 1), (3, 1)}
v2 , +v2
v3 ), B = {(1, 1, 1), (1, 1, 0), (0, 1, 1)}, B 0 =
12. T : R3 ! R3 where T (~v ) = (v1 + v2 + v3 , v1 + 2v3 , 2v2

B 0 = {(1, 1, 1), (1, 1, 0), (0, 1, 1)}
v3 ), B = {(2, 0, 1), (0, 2, 1), (1, 2, 1)},
13. T : P2 ! P3 where T (p) = xp(x), B = {1, x, x2 }, B 0 = {1, x, x2 , x3 }

14. Let B = {1, x, ex , xex } be a basis for W . Let T : W ! W be the linear transformation where
T (f ) = f 0 (x).
(a) Compute the matrix representation of T relative to B.
(b) Use the matrix to compute T (3x
2xex ).
6.3 Matrix Representations of Linear Transformations
6.3.2
63
"
#
1 2
1.
1
2
2
3
1
1 0
6
7
2. 4 1
1 05
1 0 1
3.
"
4.
"
3 0
0 2
1
2p
3
2
2
1
p
3
2
1
2
#
#
"
#
"
#
2 3
0 1
5.
for T2 T1 and
for T1 T2
0 0
0 2
2
3
"
#
5
3
2
4
1
6
7
6.
for T2 T1 and 4 4
3 1 5 for T1 T2
2 5
2
3
1
1 (v)
7. T
=(
1
1
2 v1 , 2 v2 )
8. Not invertible.
1 (v)
9. T
10.
11.
"
"
1
0
0
0
= (v1 , v1 + v2 , v2 + v3 )
0
2
1
1
2
0
6
60
14. (a) 6
40
0
(b) 3
2
6
12. 4 1
3
2
0
6
61
13. 6
40
0
#
1
2
1
0
0
0
2ex
0
0
1
0
3
0
7
07
7
15
1
2xex
4
1
1
0
0
1
0
3
0
7
07
7
05
1
3
6
7
25
3

Jason Terry Linear Algebra

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Jason Terry Linear Algebra

Uploaded by

Copyright:

Available Formats

Exercises in

Applied Linear Algebra

Adjoint Matrices and Cramers Rule . . . . . . . . . . . . . . . . . . . . . . . . . . 25

Jason Terry, Ph.D.

In Exercises 1 - 9, determine the truth value of the given statements

= 0. Therefore, the series converges.

Answers for Exercises

32. Everyone in this class is not from California.

In Exercises 1 - 6, let A = {1, 4, 7, 10, }, B = {x 2 N : x is odd}, C = {x 2 N : x 6=

In Exercises 11 - 22, determine whether the statements are true or false.

15. {0} {0}

19. {x} 2 {{x}}

16. {;} {;}

14. {0} 2 {0}

18. {x} {x, {x}}

22. ; 2 {;, {x}}

In Exercises 23 - 34, determine whether the statements are true or false.

30. |{x 2 Z : |x| < 4}| = 7

1.2 Set Theory

Answers for Exercises

36. {16, 32}

1. Let f : R ! R be defined by f (x) = sin x.

2. Let g : (0, 1) ! R be defined by g(x) = ln x.

(c) Prove that 8a, b 2 (0, 1)

3. Let h : R3 ! R be defined by h(a, b, c) = ac

(a) Compute h(2, 3, 4).

(c) Prove that a = b ^ b 6= 0 ^ h(a, b, c) = 0 ) c = 1.

4. Let ./: N2 ! Z be defined by a ./ b = a + b

(c) Prove that a ./ a > 0 ) a = 1.

5. Let D : P3 ! P3 be defined by D(p(x)) = p0 (x).

(b) Prove that 9g 2 C[ 1, 1]

Answers for Exercises

(b) Pick c = 2. Then 2 ./ 2 = 2 + 2

a) > 0 ) a > 0 ^ a < 2 ) a = 1.

(b) Pick g(x) = x. Then I(x) =

2.1 Gaussian Elimination

Answers for Exercises

8. {(1 + 2t, 2 + 3t, t) : t 2 R}

15. All the statements are false.

Perform the indicated operations or explain why it is undefined.

In Exercises 7 - 12, let A =

In Exercises 13 - 16, solve the system A~x = ~b and write ~b as a linear

combination of the columns

In Exercises 17 - 20, prove or disprove the statements.

2.2 Matrix Operations

Answers for Exercises

1. Undefined since the matrix sizes are dierent.

4. Undefined since the inner

17. True. Let A be an m n matrix. If AB is square, then B is n m. Thus, the columns of B

In Exercises 6 - 9, prove or disprove the statements.

2.3 Matrix Algebra

Answers for Exercises

A ) [aii ]T = [ aii ] ) aii =

In Exercises 1 - 6, find the inverse of the given matrix, if it exists.

In Exercises 7 - 10, use an inverse matrix to solve the linear system.

12. What condition must a diagonal matrix satisfy for it to be invertible?

16. If A is idempotent, then A = I or A is singular.

2.4 Inverse Matrices

Answers for Exercises

12. Each diagonal entry must be nonzero.

14. Let B and C be inverses of A. Then AB = I ) CAB = CI ) (CA)B = C ) IB = C )

In Exercises 1 - 6, determine the inverse of the given elementary matrix.

In Exercises 7 - 10, compute an LU-factorization of the given matrix.

(a) Compute an LU-factorization of the coefficient matrix of the system.