The minimal polynomial is the unique monic polynomial of least positive degree such that . The Cayley-Hamilton theorem says that satisfies its characteristic polynomial, so such polynomials exist. Dividing any two monic candidates of least degree shows uniqueness.
If , then but . The least for which is the least integer satisfying . Hence
If for nonzero , then
so is an eigenvalue. Let . Since , the three factors of
are pairwise coprime. The kernel decomposition for coprime polynomials therefore gives
where an absent eigenspace is interpreted as zero.
Set
For every ,
Consequently contains as a polynomial factor and is zero. By the divisibility property of the minimal polynomial,
If the nonzero are real and distinct, their cubes are also distinct. Suppose the multiplicity of in were . Since
minimality makes divide . At , the factor has a simple zero because its derivative is . Thus has multiplicity only there, contradicting the multiplicity in . Every exponent is therefore , and

Articles by others on the same topic (0)

There are currently no matching articles.