Problem 1. [8 points.

]
Discuss the deniteness of the following quadratic forms:
(i) [3] Q(x, y) = 2x
2
+ 3y
2
4xy;
The corresponding symmetric matrix is
A =
_
2 2
2 3
_
which has
Trace(A) = 5 > 0, det A = 2 > 0
Therefore Q is positive denite.
(ii) [5] Q(x, y, z) = x
2
+y
2
+z
2
+ 6xy + 6xz + 6yz.
The corresponding matrix is
A =
_
_
1 3 3
3 1 3
1 3 3
_
_
.
The characteristic polynomial of A equals
det(I A) = det
_
_
1 3 3
3 1 3
3 3 1
_
_
= ( 7)( + 2)
2
.
The eigenvalues 7 and 2 have opposite sign, so Q is indenite.
1
Problem 2. [15 points.]
Consider the subspace V R
4
spanned by the vectors V = span
_

_
_

_
0
1
0
1
_

_
,
_

_
3
1
4
1
_

_
_

_
.
(i) [4] Find the orthogonal complement V

.
We have V = C(A) for the matrix A =
_

_
0 3
1 1
0 4
1 1
_

_
. Therefore V

= N(A
T
). Row-reducing A
T
we
nd the matrix
rref A
T
=
_
1 0 4/3 0
0 1 0 1
_
which gives the null space spanned by the vectors
V

= span
_

_
_

_
4
0
3
0
_

_
,
_

_
0
1
0
1
_

_
_

_
.
(ii) [4] Find an orthonormal basis for V.
Let v
1
=
_

_
0
1
0
1
_

_
, v
2
=
_

_
3
1
4
1
_

_
be the basis of V . We normalize v
1
: y
1
=
v1
||v1||
=
1

2
_

_
0
1
0
1
_

_
and let
w
2
= v
2
(v
2
y
1
)y
1
= v
2

2y
1
=
_

_
3
0
4
0
_

_
.
Normalizing w
2
we nd the vector y
2
=
1
5
_

_
3
0
4
0
_

_
. The basis is
_

_
1

2
_

_
0
1
0
1
_

_
,
1
5
_

_
3
0
4
0
_

_
_

_
.
(iii) [4] Calculate the projection of the vector u =
_

_
1
2
7
0
_

_
onto V .
We have
u y
1
=

2, u y
2
= 5
which shows
Proj
V
(u) = (u y
1
)y
1
+ (u y
2
)y
2
=
_

_
3
1
4
1
_

_
.
(iv) [3] Find the orthogonal projection of the vector u onto V

.
We have
Proj
V
(u) = u Proj
V
(u) =
_

_
4
1
3
1
_

_
.
Problem 3. [10 points]
Which of the matrices below are diagonalizable?
(i) [4] A =
_
_
2 0 0
0 1 1
0 0 1
_
_
The characteristic polynomial of A is (2)(1)
2
. The eigenvalue = 1 has multiplicity 2 but
the eigenspace
E
1
= N(I A) = N
_
_
_
_
1 0 0
0 0 1
0 0 0
_
_
_
_
is one dimensional, spanned by the vector
_
_
0
1
0
_
_
. The matrix is not diagonalizable.
(ii) [3] A =
_
_
1 1 2
1 3 1
2 1 5
_
_
The matrix is symmetric hence diagonalizable.
(iii) [4] A =
_

_
1 1 2 8 19 1 1
0 1 3 2 11 3 0
0 0 0 2 4 8 1
0 0 0 2 2 2 6
0 0 0 0 3 9 4
0 0 0 0 0 4 17
0 0 0 0 0 0 10
_

_
.
The characteristic polynomial of this triangular matrix is
( + 1)( 1)( 2)( 3)( 4)( 10)
which has 7 distinct roots/eiegnvalues. Since the eigenvalues are distinct, the matrix is diagonaliz-
able.
Problem 4. [7 points.]
Consider the system of equations
x z + 4w = b
1
2x +y + 9w = b
2
x + 2y + 5z 2w = b
3
(i) [4] What conditions must b
1
, b
2
, b
3
satisfy for the system to have solutions?
We row reduce the augumented matrix
_
_
1 0 1 4 b
1
2 1 0 9 b
2
1 2 5 2 b
3
_
_
to the matrix
_
_
1 0 1 4 b
1
0 1 2 1 b
2
2b
1
0 0 0 0 b
3
2b
2
+ 5b
1
.
_
_
.
Therefore,
b
3
2b
2
+ 5b
1
= 0.
(ii) [3] Find a basis for the column space of the matrix
A =
_
_
1 0 1 4
2 1 0 9
1 2 5 2
_
_
.
The rst two variables are pivots. The pivot columns span C(A) i.e. the basis is
_
_
_
_
_
1
2
1
_
_
,
_
_
0
1
2
_
_
_
_
_
.
Problem 5. [10 points.]
Consider a matrix A such that rref A =
_
_
1 2 0 1 2
0 0 1 1 2
0 0 0 0 0
_
_
and A
_

_
1
0
0
1
1
_

_
=
_
_
3
4
4
_
_
.
(i) [5] Find the set of solutions to the system Ax =
_
_
3
4
4
_
_
. Is this set of solutions a subspace?
Solutions are of the form
x = x
p
+x
h
, where x
p
=
_

_
1
0
0
1
1
_

_
, x
h
N(A).
From the row-reduced form we nd the null space of A:
x
h
= y
_

_
2
1
0
0
0
_

_
+w
_

_
1
0
1
1
0
_

_
+t
_

_
2
0
2
0
1
_

_
= x =
_

_
1
0
0
1
1
_

_
+.y
_

_
2
1
0
0
0
_

_
+w
_

_
1
0
1
1
0
_

_
+t
_

_
2
0
2
0
1
_

_
This is not a subspace since it does not contain the vector 0. Indeed, 0 is not a solution to the system
since A 0 =
_
_
3
4
4
_
_
.
(ii) [5] It is known that the second column of A is
_
_
2
2
2
_
_
and the fourth column of A is
_
_
1
1
1
_
_
. Find
the matrix A.
Let v
1
, v
2
, v
3
, v
4
, v
5
be the columns of A. Vectors in the nullspace of A give relations between the
columns.
The rst vector
_

_
2
1
0
0
0
_

_
N(A) gives 2v
1
+v
2
= 0 = v
1
=
_
_
1
1
1
_
_
.
The second vector
_

_
1
0
1
1
0
_

_
N(A) gives v
1
v
3
+v
4
= 0 = v
3
=
_
_
0
2
2
_
_
.
Finally, the last vector
_

_
2
0
2
0
1
_

_
N(A) gives 2v
1
2v
3
+v
5
= 0 = v
5
=
_
_
2
2
2
_
_
.
Therefore
A =
_
_
1 2 0 1 2
1 2 2 1 2
1 2 2 1 2
_
_
.
Problem 6. [15 points.]
Company XY Z monitors the dollars spent each year by its customers on apples and oranges. With a(k)
representing the number of dollars spent (in millions) on apples in year k, and o(k) the number of dollars
(in millions) on oranges in year k, they determine that
a(k + 1) =
2
5
a(k) +
1
5
o(k)
o(k + 1) =
3
5
a(k) +
4
5
o(k).
Let v
k
=
_
a(k)
o(k)
_
.
(i) [3] Find a matrix A such that Av
k
= v
k+1
. Show that
v
k
= A
k
v
0
.
We have
A =
_
2
5
1
5
3
5
4
5
_
.
Note that
v
k
= Av
k1
= AAv
k2
= . . . = A. . . Av
0
= A
k
v
0
.
You could prove this statement by induction on k.
(ii) [4] Find the eigenvalues and eigenvectors of A.
We have TrA =
6
5
, det A =
1
5
. The characteristic polynomial is

6
5
+
1
5
= 0.
The eigenvalues are

1
= 1, and
2
=
1
5
.
The eigenvalue
1
= 1 has eigenspace
E
1
= N(I A) = N
__
3
5

1
5

3
5
1
5
__
= span
__
1
3
__
.
The eigenspace of
2
=
1
5
is
E1
5
= N(
1
5
I A) = N
__

1
5

1
5

3
5

3
5
__
= span
__
1
1
__
.
(iii) [4] Express the vector
_
3
1
_
as a linear combination of the eigenvectors of A.
We have
_
3
1
_
= w
1
+ 2w
2
,
where w
1
and w
2
are the two eiegnvectors found in (ii) corresponding to
1
= 1 and
2
=
1
5
.
(iv) [4] Assume that the customers of XY Z spend 3 million dollars on apples in year 0, and 1 million
dollars on oranges. What is a good estimate for the sum (in millions) spent on apples in year 2010?
How about dollars spent on oranges in year 2010?
We have
v
2010
= A
2010
_
3
1
_
= A
2010
(w
1
+ 2w
2
) = A
2010
w
1
+ 2A
2010
w
2
= w
1
+ 2
_
1
5
_
2010
w
2
,
where we used that w
1
and w
2
are eigenvectors for A
2010
with eigenvalues 1
2010
and
_
1
5
_
2010
. The
second term clearly is negligible. Thus the dominant term is
v
2010
w
1
=
_
1
3
_
.
Therefore, the customers of XY Z will spend approximately 1 million dollars on apples and 3 million
on oranges.
Problem 7. [10 points.]
Consider the basis B consisting of vectors
v
1
=
_
_
1/3
2/3
2/3
_
_
, v
2
=
_
_
2/3
1/3
2/3
_
_
, v
3
=
_
_
2/3
2/3
1/3
_
_
.
Let T : R
3
R
3
be the linear transformation such that
T(v
1
) = v
1
+v
2
,
T(v
2
) = v
3
,
T(v
3
) = v
2
+v
3
.
Find the matrix of T rst in the basis B and in the standard basis.
In the basis B, the matrix of T equals
B =
_
_
1 0 0
1 0 1
0 1 1
_
_
.
The basis B is orthonormal. The change of basis matrix C is therefore orthonormal, hence
A = C
T
BC =
1
9
_
_
1 2 2
2 1 2
2 2 1
_
_
_
_
1 0 0
1 0 1
0 1 1
_
_
_
_
1 2 2
2 1 2
2 2 1
_
_
=
1
9
_
_
7 8 2
7 10 7
8 5 1
_
_
.
Problem 8. [8 points.]
(i) [4] Let R be the reection in a subspace V R
n
. What are the eigenvalues of R?
For v V , we have R(v) = v so 1 is an eigenvalue. For v V

, we have R(v) = v hence 1 is

an eigenvalue. There are no other eigenvalues since V and V

together span R
n
.
(ii) [4] Assume that T is a linear transformation with T
5
= T. What real numbers can be eigenvalues
for T?
If
Tv = v = T
5
v =
5
v.
Since T
5
= T we have
T
5
v = Tv =
5
v = v =
5
=
which gives {0, 1, 1}.
Problem 9. [10 points.]
Consider Rot

the rotation in R
3
around the y axis by angle in the direction that takes the positive x
axis to the positive z axis.
(i) [5] Find the matrix of the linear transformation Rot

in the standard basis.

Note that
Rot(e
2
) = e
2
Rot(e
1
) = e
1
cos +e
3
sin
Rot(e
3
) = e
1
sin +e
3
cos .
The matrix equals
_
_
cos 0 sin
0 1 0
sin 0 cos
_
_
(ii) [5] Possibly using (i), calculate A
3006
where
A =
_
_

3 0 1
0 2 0
1 0

3
_
_
.
Note that
1
2
A is the matrix of the rotation by =

6
. Thus
_
1
2
A
_
3006
is the matrix of the rotation
by 3006

6
= 501. This is the same as rotating by . Hence
A
3006
= 2
3006
Rot

which has matrix

2
3006
_
_
1 0 0
0 1 0
0 0 1
_
_
.
Problem 10. [10 points.]
Is the matrix
_
_
_
_
_
_
_
_
_
_
1 2 0 0 0 0 0
1 4 1 1 0 0
19
1
23
1 0 0 0 0
0 1 2 2 1 9 1
1 0 0 1 0 0 0
12
1
2

1
3
0 0 1 0
5 0
1
3
0 1 0 3
_
_
_
_
_
_
_
_
_
_
invertible?
The matrix is invertible. We expand the determinant along the rst column. All entries contribute
rational numbers with one exception: the irrational number . To nd the minor of we calculate the
determinant of
_

_
2 0 0 0 0 0
1
23
1 0 0 0 0
1 2 2 1 9 1
0 0 1 0 0 0

1
2

1
3
0 0 1 0
0
1
3
0 1 0 3
_

_
.
We expand along rows and columns. We see that this minor equals 6. Thus
det A = 6 + rational number.
The determinant is thus an irrational number, hence nonzero. Therefore, A is invertible.
Problem 11. [6 points.]
Assume that A, B are invertible square matrices. Show that AB and BA have the same characteristic
polynomial.
The matrices AB and BA are similar. Indeed,
AB = B
1
(BA)B.
Therefore AB and BA have the same characteristic polynomial.
Problem 12. [6 points.]
If A is a symmetric matrix with exp(A) = I then A = 0.
If A is symmetric, then
A = PDP
1
for some diagonal matrix D. Then
exp(A) = P exp(D)P
1
as shown in the homework. But
exp(A) = I = P exp(D)P
1
= I = exp(D) = I,
after multiplying by P
1
and P to the left and right respectively.
Now if D has diagonal entries
1
, . . . ,
n
then exp(D) has diagonal entries e
1
, . . . , e
n
again by the
homework. But the diagonal entries must be 1 hence
e
1
= . . . = e
n
= 1 =
1
= . . . =
n
= 0 = D = 0.
Then
A = PDP
1
= 0.