In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomial p(x) over F of least degree such that p(A)=0. Any other polynomial q with q(A) = 0 is a (polynomial) multiple of p.
The following three statements are equivalent:
The multiplicity of a root λ of p(x) is the size of the largest Jordan block corresponding to λ.
The minimal polynomial is not always the same as the characteristic polynomial. Consider the matrix 4In, which has characteristic polynomial (x − 4)n. However, the minimal polynomial is x − 4, since 4I − 4I = 0 as desired, so they are different for
. That the minimal polynomial always divides the characteristic polynomial is a consequence of the Cayley–Hamilton theorem.
Given an endomorphism T on a vector space V over a field
, let IT be the set defined as
where
is the space of all polynomials over the field
. It is easy to show that IT is a proper ideal of
.
Thus it must be the monic polynomial of least degree in IT.
An endomorphism is diagonalizable if and only if every Jordan block has size 1, which is equivalent to each root of the minimal polynomial having multiplicity 1 (and the minimal polynomial factors completely). Thus an endomorphism is diagonalizable over a field K if and only if its minimal polynomial factors completely over K into distinct linear factors.
The above can also be worked out by hand, but the minimal polynomial gives a unified perspective and proof.
Let I T, v be defined as
This definition satisfies the properties of a proper ideal. Let μT,v be the monic polynomial which generates it.
Properties
Define T on R3 with the matrix
Take
We see that e1, T(e1), T2(e1) are linearly independent while by adding T3(e1) to this list they are no more. Thus it's easy to find
, repeat it with e2 and e3 and calculate the least common multiple of them.
Wikipedia,
the free encyclopedia © 2001-2006 Wikipedia
contributors (Disclaimer)
This article is licensed under the GNU
Free Documentation License.
Last updated on Monday September 24, 2007 at 05:23:47 PDT (GMT -0700)
View
this article at Wikipedia.org - Edit
this article at Wikipedia.org - Donate
to the Wikimedia Foundation