After choosing a basis of , a linear endomorphism is specified by an by matrix, with freely chosen coefficients. Therefore
The endomorphisms are linearly dependent. Some nonzero coefficient list gives a nonzero polynomial satisfying .
For nonzero , the minimal polynomial is the monic polynomial of least degree annihilating . It is unique: subtracting two monic least-degree choices would give a lower-degree annihilator. More generally division of any annihilator by gives , with , and evaluation implies . Minimality forces , so every annihilator is divisible by . If , the convention handles the degenerate case.
The arguments work over the underlying scalar field. In part (b), roots in that field correspond to eigenvalues there; to discuss other roots one extends scalars, for example by complexifying a real vector space.
If with , then . The left side vanishes, so .
Conversely, if , write . Then . If were invertible, multiplying by its inverse would imply , contradicting the minimal degree. Thus is not invertible. In finite dimension this means it has a nonzero kernel, furnishing an eigenvector with eigenvalue . Hence the eigenvalues are exactly the roots of the minimal polynomial, with the scalar-field convention stated in part (a).
Invariance of means every power of restricts to the corresponding power of . Therefore is the restriction of , and it is zero. Divide with . Evaluation at gives . By minimality of , , proving
The zero-subspace case has and satisfies the same conclusion.
Take , and . Then is a proper invariant subspace, and the restriction has matrix . In each case annihilates the operator, while any annihilator must vanish at both zero and one. Consequently
This same example works over any scalar field.

Articles by others on the same topic (0)

There are currently no matching articles.