Jump to content

Endomorphism/Minimal polynomial/Characteristic polynomial/Section

From Wikiversity


Let be a finite-dimensional vector space over a field , and let

be a linear mapping. Then the characteristic polynomial is a multiple of the minimal polynomial

of .

This follows directly from fact and fact.


In particular, the degree of the minimal polynomial of is bounded by the dimension of the vector space . The minimal polynomial and the characteristic polynomial are related in several respects, for example, they have the same zeroes.


Let be a finite-dimensional vector space over a field , and let

be a linear mapping. Let be an eigenvector of with eigenvalue , and let denote a polynomial. Then

In particular, is an eigenvector of with eigenvalue . The vector

belongs to the kernel of if and only if is a zero of .

We have

This implies the statement, since the assignment is compatible with addition and scalar multiplication.



Let be a finite-dimensional vector space over a field , and let

be a linear mapping. Then the characteristic polynomial and the minimal polynomial

have the same zeroes.

It follows directly from Cayley-Hamilton that the zeroes of the minimal polynomial are also zeroes of the characteristic polynomial.

To prove the other implication, let be a zero of the characteristic polynomial, and let denote an eigenvector of with eigenvalue , its existence is guaranteed by fact. We write the minimal polynomial as

where has no zero. Then

We apply this mapping to . Because of fact, the factors send the vector to or to , respectively. Altogether, is sent to

As the composed mapping is the zero mapping and , we must have for some .