The unique monic polynomial of least degree over the base field that annihilates a given algebraic element or linear operator; equivalently the generator of the principal ideal of annihilating polynomials.

Principle

Among all polynomials p(x) with p(T)=0 (or p(α)=0 for an algebraic element α), the minimal polynomial is the monic one with smallest degree and therefore divides every other annihilating polynomial; it encodes algebraic dependencies and block sizes in the operator's primary decomposition.

Demonstration

For the 2×2 Jordan block J = [[2,1],[0,2]] viewed as a linear operator over C, the minimal polynomial is (x−2)^2 because (J−2I)^2=0 but (J−2I)≠0. For an algebraic number α that is a root of an irreducible polynomial f over Q, the minimal polynomial of α over Q is that irreducible f.

Misapplication

Treating the characteristic polynomial as the minimal polynomial in all cases leads to error; for example a diagonalizable matrix has a characteristic polynomial of higher degree with repeated factors but its minimal polynomial has only simple factors corresponding to distinct eigenvalues.

Consequence

Correct identification of the minimal polynomial yields the sizes of Jordan blocks for each eigenvalue, determines whether the operator is diagonalizable, and provides the simplest polynomial relations usable in functional calculus and reduction algorithms.

Reversal

The converse notion (taking a maximal annihilating polynomial) is not useful: the characteristic polynomial is a higher-degree invariant that may not be minimal; reversing minimality produces non-unique or non-canonical choices and loses the tight algebraic constraint.

Boundary

Defined for algebraic elements over a field and for linear operators on finite-dimensional vector spaces (or operators known to be algebraic). It is not defined for transcendental elements or for arbitrary operators on infinite-dimensional spaces unless an annihilating polynomial exists.

Semantic Tension

Tension arises with the characteristic polynomial: both are annihilating polynomials but the characteristic polynomial has fixed degree equal to dimension while the minimal polynomial is minimal and reflects the true algebraic relations; conflating them obscures multiplicity and block structure.

Synthesis

The minimal polynomial is the canonical, monic, least-degree polynomial relation satisfied by an algebraic element or operator; it minimally encodes the operator's algebraic constraints and determines central structural invariants such as diagonalizability and Jordan block sizes.