A minimal polynomial is a polynomial that expresses the lowest-degree polynomial relation satisfied by a given mathematical object over a specified field. For an algebraic element , it is the monic polynomial of least positive degree with as a root. For a square matrix or a linear operator on a nonzero finite-dimensional space, it is the monic polynomial of least degree that becomes zero when evaluated at . These definitions share a common algebraic foundation, but an important distinction separates them: the minimal polynomial of an algebraic element over a field is always irreducible, whereas the minimal polynomial of a matrix need not be.
General definition
Let be a field and an element of a nonzero unital associative -algebra, with scalars acting centrally. For
evaluation at means
If some nonzero polynomial satisfies , then is called algebraic over . Its minimal polynomial is the monic polynomial of smallest degree satisfying
Here monic means that the leading coefficient is .
The defining property implies the stronger divisibility statement
Indeed, polynomial division gives , where . If , then ; minimality forces . This also proves uniqueness.
Equivalently, the evaluation map
is a ring homomorphism whose kernel is the ideal
Thus the minimal polynomial encodes every polynomial relation satisfied by , not merely one relation of smallest degree.
Algebraic elements and field extensions
Suppose is a field extension and is algebraic over . Its minimal polynomial is often denoted
Irreducibility
The polynomial is an irreducible polynomial over . If it factored as
with both factors of positive degree, then
Because is a field, one factor would vanish at , contradicting minimality.
Conversely, any monic irreducible polynomial over having as a root is its minimal polynomial.
Degree and a basis for the generated field
The evaluation map gives an isomorphism
Irreducibility makes this quotient a field, so , the smallest subfield of containing and .
If , then
and
form a basis over . Every element of therefore has a unique expression as a polynomial in of degree less than .
Examples and dependence on the base field
Over the rational numbers,
This polynomial vanishes at and is irreducible over .
The base field is essential. Since ,
Likewise, the imaginary unit has minimal polynomial over , but over .
A transcendental number over satisfies no nonzero polynomial over , so it has no minimal polynomial over that field.
Conjugate roots and separability
The roots of in a field where it splits are the algebraic conjugates of over . They are central to Galois theory.
In characteristic zero, an irreducible polynomial has no repeated roots. In positive characteristic, an irreducible polynomial may have repeated roots in a splitting field. Thus irreducibility does not by itself imply separability over every field.
Matrices and linear operators
Let be a nonzero finite-dimensional vector space over , and let be a linear operator. For
define
where is the identity operator.
The minimal polynomial is the unique monic polynomial of least degree satisfying . It exists because sufficiently many powers of are linearly dependent in the finite-dimensional space of operators on .
Choosing a basis gives a matrix representing , and . In particular, the minimal polynomial is invariant under matrix similarity:
Unlike the field-element case, an operator acts in an algebra that may have zero divisors. Its minimal polynomial can therefore factor into several nonconstant polynomials.
Relation to the characteristic polynomial
For an matrix , the characteristic polynomial is
The Cayley–Hamilton theorem states that
Consequently,
The two polynomials contain different information. The characteristic polynomial records eigenvalues with their algebraic multiplicities. The minimal polynomial records the polynomial relations needed to annihilate the operator and, over a splitting field, the largest Jordan block associated with each eigenvalue.
They have the same distinct roots in a splitting field, but root multiplicities can differ. For example,
has
Eigenvalues and Jordan blocks
An element in a splitting field is an eigenvalue of exactly when
If
then is the size of the largest block for in the Jordan normal form of .
For example,
satisfies
so
Although and above have the same characteristic polynomial, their minimal polynomials distinguish their different operator structures.
More generally, if but , then is nilpotent of index , and
Diagonalizability
A matrix is diagonalizable over if and only if its minimal polynomial is a product of distinct linear factors in .
Both requirements matter:
- Repeated factors indicate nontrivial Jordan blocks.
- Factors that do not split over prevent diagonalization over , even if no irreducible factor is repeated.
For example, the real matrix
has minimal polynomial . It is diagonalizable over , but not over .
For a matrix whose entries lie in , extending scalars to a larger field does not change its minimal polynomial as a polynomial; only its factorization may change. This differs from fixing an element of an extension field and enlarging the base field over which that element’s minimal polynomial is taken.
Invariant subspaces and canonical forms
If is invariant under , then
If
is a decomposition into invariant subspaces, then
A useful interpretation makes an -module by defining . In rational canonical form, the operator has monic nonconstant invariant factors
They satisfy
Thus the minimal polynomial is the largest invariant factor. It need not determine the complete similarity class: different operators can have the same minimal polynomial but different remaining invariant factors.
An operator is cyclic if some vector has
as a basis. This happens exactly when
The two principal meanings of minimal polynomial meet naturally here. If is algebraic over , multiplication by defines an operator on :
Its minimal polynomial is . The vector is cyclic, so its characteristic polynomial is also .
Computation and applications
Computing matrix minimal polynomials
A direct method seeks the first linear dependence among
If is the first degree at which a dependence occurs, it can be normalized as
Then
For a vector , the first dependence among gives its vector minimal polynomial . This divides and describes the action on the subspace generated by those vectors. Taking the least common multiple of the vector minimal polynomials for a basis recovers .
Other methods use invariant factors or factorization of the characteristic polynomial. Exact minimal-polynomial computation is fundamentally algebraic: small perturbations of a matrix can change its minimal polynomial, so exact structure should not be inferred uncritically from floating-point calculations.
Reducing powers and computing inverses
If , polynomial division shows that every polynomial in can be written uniquely as a linear combination of
This reduces high powers to lower ones and yields recurrence relations for sequences generated by matrix powers.
The matrix is invertible exactly when . If
with , then
Matrix functions and field arithmetic
Over , an analytic function of a matrix, such as the matrix exponential, can be represented by a polynomial in of degree less than . The representing polynomial matches the function’s values at eigenvalues and the required derivatives determined by the multiplicities in .
For algebraic field elements, minimal polynomials support exact arithmetic by reducing expressions modulo the defining polynomial. Over a finite field with elements, a monic irreducible polynomial of degree gives the field
which has elements. The residue class of has minimal polynomial over .