Department of Mathematics, University of Toronto

MAT223H1F - Linear Algebra I

Fall 2014

Solved Problems on Eigenvalues, Eigenvectors, and Diagonalization

1. For each 3 3 matrix A and vector v R3 , determine whether v is an eigenvector of A.

5 2 2
1
(a) A = 8 3 4 and v = 2
5 2 2
1

1 2 2
1
(b) A = 8 2 2 and v = 0
5 3 4
0

1 0 2
2
(c) A = 2 3 7 and v = 1
4 5 3
1
Solution: Remember that if A an n n matrix, then v Rn is defined to be an eigenvector of A if
v 6= 0 and Av is a scalar multiple of v. So, in each case, we will determine whether the conditions in this
definition are satisfied

1
1
5 2 2
(a) Note that Av = 8 3 4 2 = 2 = v. So, v 6= 0 and Av is a scalar multiple of v.
1
5 2 2 1
Therefore, v is an eigenvector of A.

1
1 2 2 1
(b) Note that Av = 8 2 2 0 = 8, which is not a scalar multiple of v. Therefore, v is not an
5
5 3 4 0
eigenvector of A.

2
0
1 0 2
(c) Note that Av = 2 3 7 1 = 0 = 0v. So, v 6= 0 and Av is a scalar multiple of v.
1
0
4 5 3
Therefore, v is an eigenvector of A.

5 4
2. Is the matrix A = 11 10
4 4
diagonal 3 3 matrix D such

3
9 diagonalizable? If yes, then find an invertible 3 3 matrix P and a
4
that A = P DP 1 .

Solution: We begin by finding the characteristic polynomial pA () of A. We have



5
4
3 

10
9 
pA () = det(A I3 ) =  11
 4
4
4 
= 3 2 + 2
= ( 1)( + 2).
The eigenvalues of A are precisely the real roots of pA (), so the eigenvalues are = 0, = 1, and = 2.
We now find bases of the eigenspaces E0 , E1 , and E2 .
1 of 3

5 4 3
We have E0 = null(A 0I3 ) = null(A) = null 11 10 9. To find a basis, we find the
4 4 4

5 4 3 0
reduced echelon form of 11 10 9 0 . Using row operations, we get a reduced echelon form of
4 4
4 0

1 0 1 0
1
0 1 2 0 . We then find that 2 is a basis of null(A) = E0 .

0 0
0 0
1

4 4 3
We have E1 = null(A I3 ) = null 11 11 9. To find a basis, we find the reduced echelon
4 4 3

1 1 0 0
4 4 3 0
0 1 0 .
form of 11 11 9 0 . Using row operations, we get a reduced echelon form of 0
4 4 3 0
0
0 0 0
1
We then find that 1 is a basis of null(A I3 ) = E1 .

7 4 3
We have E2 = null(A + 2I3 ) = null 11 8 9. To find a basis, we find the reduced echelon
4 4 6

1 0 1 0
4
4 3 0
form of 11 11 9 0 . Using row operations, we get a reduced echelon form of 0 1 52 0 .
4
4 3 0
0 0
0 0

1
We then find that 52 is a basis of null(A + 2I3 ) = E2 .

1

1
1
1
Putting these bases together, we get 2 , 1 , 52 , which is a set of 3 vectors in R3 . Therefore, A

1
0
1
is diagonalizable.



1
1
1
Now, lets find P and D. Set u1 = 2, u2 = 1, and u3 = 25 . Note that u1 comes from a basis of
1
0
1
E0 (so 1 = 0), u2 comes from a basis of E1 (so 2 = 1), and u3 comes from a basis of E2 (so 3 = 2).
We therefore have

1 1 1


P = u1 u2 u3 = 2 1 25
1 0 1
and

1
D=0
0

0
2
0

0
0
0 = 0
3
0

0
1
0

0
0 .
2

3. Let A be an n n matrix, let pA () be the characteristic polynomial of A, and let pAT () be the
characteristic polynomial of AT . Show that pA () = pAT ().

2 of 3

Solution: We have
pAT () = det(AT In )
= det(AT (In )T ) (since In = (In )T )
= det((A In )T ) (since AT (In )T = (A In )T )
= det(A In )
= pA ().
NOTE: To get from line 3 to line 4, we used the fact that the determinant of an n n matrix equals the
determinant of its transpose.

3 of 3