Minimal Polynomial
The minimal polynomial of a matrix is the monic polynomial of smallest degree that annihilates the matrix. While the characteristic polynomial tells us the eigenvalues and their algebraic multiplicities, the minimal polynomial reveals the sizes of the largest Jordan blocks -- it is the finer invariant needed to distinguish similarity classes.
Definition
The minimal polynomial of a matrix is the unique monic polynomial of smallest degree such that .
Equivalently, is the monic generator of the ideal .
- divides (the characteristic polynomial), by Cayley--Hamilton.
- and have the same roots: every eigenvalue of is a root of , and vice versa.
- is diagonalizable iff splits into distinct linear factors (no repeated roots).
- The degree of equals the dimension of .
Computing minimal polynomials
. Eigenvalues: .
.
(each eigenvalue appears once, since diagonal matrices are diagonalizable).
Verify: . The entry: . The entry: . All diagonal entries are ✓.
: .
, but has degree just .
This is the extreme case where is much smaller than .
The minimal polynomial of a Jordan form is:
where is the size of the largest Jordan block for eigenvalue .
For : . For : .
The companion matrix of has . For companion matrices, the minimal and characteristic polynomials coincide.
Relationship to diagonalizability
is diagonalizable over if and only if splits into distinct linear factors over :
with pairwise distinct.
: . Is ? No: .
So (has a repeated root). Conclusion: is not diagonalizable.
: (no repeated roots). Conclusion: is diagonalizable.
: . Check: . . So (repeated root). Not diagonalizable.
: . Diagonalizable.
: (distinct linear factors). Diagonalizable.
Computing the minimal polynomial systematically
.
.
The candidates for (monic divisors of sharing the same roots) are:
- (degree ),
- (degree , same as ).
Test : .
So , hence .
.
.
Test : .
So , which is strictly smaller than . The matrix is diagonalizable (it already is diagonal).
Minimal polynomial and Jordan form relationship
Jordan form :
- Largest block for : size .
- Largest block for : size .
- .
- (sum of block sizes for each eigenvalue).
Jordan form :
- , .
- The matrix is nilpotent with index : but .
Jordan form :
- , .
- Nilpotent index .
and :
Both have . But while .
The minimal polynomial distinguishes the two similarity classes that the characteristic polynomial cannot.
The algebra F[A]
: , so .
.
This is a -dimensional commutative subalgebra of .
: , .
has dimension , spanned by .
(all diagonal matrices), which has dimension .
(): , . , the scalar matrices.
Application: testing nilpotency
If is nilpotent, then where is the smallest positive integer with (the nilpotent index). By Cayley--Hamilton, .
For the shift matrix: (the maximum possible). For : (the minimum for a nilpotent matrix).
The number of Jordan blocks of size equals .
Summary
The minimal polynomial refines the characteristic polynomial:
- Same roots (eigenvalues), but the exponents encode largest Jordan block sizes instead of total algebraic multiplicities.
- is diagonalizable iff has no repeated roots.
- divides , and they agree iff has a cyclic vector (i.e., is similar to a companion matrix).
- The algebra has dimension , measuring the "complexity" of the matrix.
- Together, and determine the Jordan form for matrices up to ; for larger matrices, additional invariants (the full list of elementary divisors) may be needed.