Let be the monic minimal polynomial. The Cayley-Hamilton theorem says . Divide by ; its remainder also annihilates , and a nonzero remainder of smaller degree would contradict minimality. Thus divides .
Every characteristic root is an eigenvalue, with a nonzero eigenvector . Since , it must be a root of the minimal polynomial as well. This proves there are no possibilities beyondEvery such choice really occurs. For each , take one Jordan block of size at , together with scalar blocks at that eigenvalue, and form their direct sum. The characteristic polynomial has the prescribed multiplicities. The nilpotent part of a block of size has its th power zero and its st power nonzero, so this component's minimal exponent is exactly . A polynomial annihilates the direct sum precisely when it annihilates every component, establishing the displayed minimal polynomial without any extra restrictions.
Articles by others on the same topic
There are currently no matching articles.