The minimal polynomial is the monic polynomial of least polynomial degree such that . Here a polynomial is evaluated at the linear operator by , with the constant term acting as .
An annihilating polynomial exists because lie in the finite-dimensional vector space and are therefore eventually linearly dependent. Uniqueness follows by subtracting two monic annihilators of the same least degree: their difference has smaller degree and still annihilates .
Equivalently,For the forward implication evaluate the factorization at . For the reverse implication divide by using polynomial division; the remainder annihilates , so minimality makes it zero. This also identifies the annihilating polynomials as the principal ideal generated by .
Suppose . Every vector has the decompositionIf also belongs to , then . HenceOn its image of a linear map, acts as the identity; on its kernel of a linear map, it acts as zero. Concatenate a basis of the image with a basis of the kernel. The resulting matrix is , where .
Conversely, this block matrix squares to itself, so any linear map having that matrix in a basis satisfies . Thus projection operators are precisely the linear maps with this block form. This is an algebraic projection; no inner product or orthogonality is required.
Articles by others on the same topic
There are currently no matching articles.