Jump to content

Endomorphism/Minimal polynomial/Introduction/Section

From Wikiversity


Let be a finite-dimensional -vector space and

a linear mapping. Then the uniquely determined normed polynomial of minimal degree fulfilling

is called the minimal polynom

of .


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

denote a linear mapping. Then the set

is a principal ideal in the polynomial ring , which is generated by the minimal polynomial

.

Proof



For the identity on a -vector space , the minimal polynomial is just . This polynomial is sent under the evaluation homomorphism to

A constant polynomial is sent to , which is not, with the exception of or , the zero mapping.

For a homothety, that is, a mapping of the form , the minimal polynomial is , under the condition and . For the zero mapping on , the minimal polynomial is , in case , it is the constant polynomial .


For a diagonal matrix

with different entries , the minimal polynomial is

This polynomial is sent under the substitution to

We apply this to a standard vector . Then factor sends to . Therefore, the -th factor ensures that is annihilated. Since a basis is mapped under to , it must be the zero mapping.

Assume now that is not the minimal polynomial . Then there exists, due to fact, a polynomial with

and, because of fact, is a partial product of the linear factors of . But as soon as one factor of is removed, say we remove , then is not annihilated by the corresponding mapping.


For the matrix

is the minimal polynomial. This polynomial becomes, after the substitution, the zero mapping, because of

The factors of of smaller degree are the constant polynomials and with , but these polynomials do not annihilate .