Homework 11
Linear Algebra (I), Fall 2024
Deadline: 11/27 (Wed.) 12:10
Remark. In this homework, the characteristic polynomial of an n × n matrix A is defined by
chA (x) := det(xIn − A)
as in the lecture.
Exercise 1 (Section 5.1, 2(d)(f)). For each of the following linear operators T on a vector space V and
ordered bases B, compute [T ]B , and determine whether B is a basis consisting of eigenvectors of T .
(d) V = R[x]≤2 ,
T (a + bx + cx2 ) = (−4a + 2b − 2c) − (7a + 3b + 7c)x + (7a + b + 5c)x2 ,
and B = {x − x2 , −1 + x2 , −1 − x + x2 }.
(f) V = M2×2 (R), Å ã Å ã
a b −7a − 4b + 4c − 4d b
T = ,
c d −8a − 4b + 5c − 4d d
and ßÅ ã Å ã Å ã Å ã™
1 0 −1 2 1 0 −1 0
B= , , , .
1 0 0 0 2 0 0 2
Exercise 2 (Section 5.1, 3(d)). For the matrix
Ñ é
2 0 −1
A = 4 1 −4 ∈ M3×3 (R),
2 0 −1
(i) Determine all the eigenvalues of A.
(ii) For each eigenvalue λ of A, find the set of eigenvectors corresponding to λ.
(iii) If possible, find a basis for R3 consisting of eigenvectors of A.
(iv) If successful in finding such a basis, determine an invertible matrix Q and a diagonal matrix D such
that Q−1 AQ = D.
Exercise 3 (Section 5.1, 8).
(a) Prove that a linear operator T on a finite-dimensional vector space is invertible if and only if zero
is not an eigenvalue of T .
(b) Let T be an invertible linear operator. Prove that a scalar λ is an eigenvalue of T if and only if λ−1
is an eigenvalue of T −1 .
(c) State and prove results analogous to (a) and (b) for matrices.
Exercise 4 (Section 5.1, 12).
(a) Prove that similar matrices have the same characteristic polynomial.
(b) Show that the definition of the characteristic polynomial of a linear operator on a finite-dimensional
vector space V is independent of the choice of basis for V .
1
Exercise 5 (Section 5.1, 17). Let T be the linear operator on Mn×n (R) defined by T (A) = At .
(a) Show that ±1 are the only eigenvalues of T .
(b) Describe the eigenvectors corresponding to each eigenvalue of T .
(c) Find an ordered basis B for M2×2 (R) such that [T ]B is a diagonal matrix.
(d) Find an ordered basis B for Mn×n (R) such that [T ]B is a diagonal matrix for n > 2.
Exercise 6 (Section 5.1, 20). Let A be an n × n matrix with characteristic polynomial
chA (x) = xn + an−1 xn−1 + · · · + a1 x + a0 .
Prove that chA (0) = a0 = (−1)n det A. Deduce that A is invertible if and only if a0 6= 0.
Exercise 7 (Section 5.1, 21). Let A and chA (x) be as in the previous exercise.
(a) Prove that chA (x) = (x − A11 )(x − A22 ) · · · (x − Ann ) + q(x), where q(x) is a polynomial of degree
at most n − 2.
Hint: Apply mathematical induction to n.
(b) Show that an−1 = − tr(A).
Exercise 8 (Section 5.1, 24). Use Section 5.1, 21(a) to prove Theorem 5.3:
Let A ∈ Mn×n (F ).
(a) The characteristic polynomial of A is a polynomial of degree n with leading coefficient 1.
(That is, a monic polynomial of degree n.)
(b) A has at most n distinct eigenvalues.
(There are extra exercises in the next page.)
2
Extra Exercises
You don’t have to hand in extra exercises, and solving them will NOT affect your grade.
Exercise 9. Let A ∈ Mn×n (F ).
(a) Show that A is nilpotent if and only if all the eigenvalues of A are 0. (An n × n matrix A is called
nilpotent if Ak = O for some positive integer k.)
(b) What if A is idempotent? (An n × n matrix A is called idempotent if A2 = A.)
Exercise 10. Let A ∈ Mn×n (C) and let
chA (x) = xn + c1 xn−1 + c2 xn−2 · · · + cn−1 x + cn = (x − λ1 )(x − λ2 ) · · · (x − λn )
be the characteristic polynomial of A. Note that λk may not be distinct.
(a) Show that
−kck = ck−1 tr(A) + ck−2 tr(A2 ) + · · · + c1 tr(Ak−1 ) + tr(Ak )
for every 1 ≤ k ≤ n. (Here, we define c0 = 1 and ck = 0 for k < 0.)
Hint: Consider the classical adjoint of xIn − A.
(b) Deduce that if tr(A) = tr(A2 ) = · · · = tr(An ) = 0, then An = O.
(c) Show that
n
X
tr(Ak ) = λkj ,
j=1
for every 1 ≤ k ≤ n.
Remark. In fact, these statements also hold for general A ∈ Mn×n (F ). As a result, the coefficients of
characteristic polynomial are determined by tr(Ak ).
