Back to Polynomials of Maps and Matrices

Exercise 17

Avg difficulty 3.0

The first two items of this question are review.

  • Prove that the composition of one-to-one maps is one-to-one.

  • Prove that if a linear map is not one-to-one then at least one nonzero vector from the domain maps to the zero vector in the codomain.

  • Verify the statement, excerpted here, that precedes Theorem 1.8.

    … if a minimal polynomial m(x)m(x) for a transformation tt factors as m(x)=(x−λ1)q1⋯(x−λz)qzm(x)=(x-\lambda_{1})^{q_{1}}\cdots(x-\lambda_{z})^{q_{z}} then m(t)=(t−λ1)q1∘⋯∘(t−λz)qzm(t)=(t-\lambda_{1})^{q_{1}}\mathbin{\circ}\cdots\mathbin{\circ}(t-\lambda_{z})^{q_{z}} is the zero map. Since m(t)m(t) sends every vector to zero, at least one of the maps t−λit-\lambda_{i} sends some nonzero vectors to zero. … That is, … at least some of the λi\lambda_{i} are eigenvalues.

Hefferon, Linear Algebra, Similarity, Polynomials of Maps and Matrices, Exercise 17

AI Tutor

Adapted from Linear Algebra © 2016 Jim Hefferon. Licensed under CC BY-SA 3.0 US. Source: Linear Algebra. Imported at revision df2262e.