The minimal polynomial is the unique monic polynomial of least positive polynomial degree satisfying . Such an annihilating polynomial exists without using the Cayley-Hamilton theorem: the vector space has dimension of a vector space equal to , so are linearly dependent. Normalize a nonzero annihilating polynomial to be monic and choose one of least degree. Two distinct monic choices of that degree would have an annihilating difference of lower degree, contradicting minimality. A nonzero constant cannot annihilate because .
Choose a basis and let . The characteristic polynomial isIt is independent of the chosen basis. Indeed a change of basis replaces by a similar matrix , andby multiplicativity of the determinant. Thus this monic degree- polynomial is an invariant of the linear transformation itself.
Since is a cyclic vector and , . Finite dimension of a vector space forces a first dependence in the sequence . Let be the smallest index with in the linear span of its predecessors. Thenis linearly independent. Its linear span is invariant under : all but the last basis candidate map to the next, and the last maps to . Induction therefore puts every in . Cyclicity gives , so is a basis and .
WriteThe matrix of in this basis is the companion matrixFor , the defining relation says . Since commutes with , it also annihilates every in , hence . No nonzero polynomial of degree less than can annihilate , because that would contradict linear independence of . Thus .
Finally the characteristic polynomial of a companion matrix is , by direct determinant expansion. Explicitly, expansion along the first row of gives the recurrencestarting from . It yields . ConsequentlyThis proves that a cyclic operator has equal minimal and characteristic polynomials by the cyclic basis and a direct determinant calculation, with no appeal to the Cayley-Hamilton theorem.
For , choose the third standard basis vector . Its first three orbit vectors areThey are linearly independent: their matrix of columns has determinant . They therefore span , proving has a cyclic vector, namely .
For , write where . The binomial theorem gives for every integer . The entire orbit of any lies in , which has dimension of a vector space at most two. Therefore has no cyclic vector in the three-dimensional space. Equivalently, its minimal polynomial is , while its characteristic polynomial is .
Articles by others on the same topic
There are currently no matching articles.