06.09.2021 Views

Linear Algebra, 2020a

Linear Algebra, 2020a

Linear Algebra, 2020a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

448 Chapter Five. Similarity<br />

(c) Verify the statement, excerpted here, that precedes Theorem 1.8.<br />

. . . if a minimal polynomial m(x) for a transformation t factors as<br />

m(x) =(x − λ 1 ) q 1 ···(x − λ z ) q z<br />

then m(t) =(t − λ 1 ) q 1 ◦···◦(t − λ z ) q z<br />

is the zero map. Since m(t) sends every vector to zero, at least one of<br />

the maps t − λ i sends some nonzero vectors to zero. . . . That is, . . .<br />

at least some of the λ i are eigenvalues.<br />

1.30 True or false: for a transformation on an n dimensional space, if the minimal<br />

polynomial has degree n then the map is diagonalizable.<br />

1.31 Let f(x) be a polynomial. Prove that if A and B are similar matrices then f(A)<br />

is similar to f(B).<br />

(a) Now show that similar matrices have the same characteristic polynomial.<br />

(b) Show that similar matrices have the same minimal polynomial.<br />

(c) Decide if these are similar.<br />

(1 ) ( )<br />

3 4 −1<br />

2 3 1 1<br />

1.32 (a) Show that a matrix is invertible if and only if the constant term in its<br />

minimal polynomial is not 0.<br />

(b) Show that if a square matrix T is not invertible then there is a nonzero matrix<br />

S such that ST and TS both equal the zero matrix.<br />

̌ 1.33 (a) Finish the proof of Lemma 1.7.<br />

(b) Give an example to show that the result does not hold if t is not linear.<br />

1.34 Any transformation or square matrix has a minimal polynomial. Does the<br />

converse hold?<br />

IV.2<br />

Jordan Canonical Form<br />

We are looking for a canonical form for matrix similarity. This subsection<br />

completes this program by moving from the canonical form for the classes of<br />

nilpotent matrices to the canonical form for all classes.<br />

2.1 Lemma A linear transformation on a nontrivial vector space is nilpotent if<br />

and only if its only eigenvalue is zero.<br />

Proof If the linear transformation t on a nontrivial vector space is nilpotent<br />

then there is an n such that t n is the zero map, so t satisfies the polynomial<br />

p(x) =x n =(x − 0) n . By Lemma 1.10 the minimal polynomial of t divides p, so<br />

the minimal polynomial’s only root is zero. By Cayley-Hamilton, Theorem 1.8,<br />

the characteristic polynomial’s only root is zero. Thus t’s only eigenvalue is<br />

zero.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!