After choosing a basis of , a linear endomorphism is specified by an by matrix, with freely chosen coefficients. ThereforeThe 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.
Articles by others on the same topic
There are currently no matching articles.