ConceptComplete

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

Definition7.4Minimal polynomial

The minimal polynomial mA(λ)m_A(\lambda) of a matrix AMn×n(F)A \in M_{n \times n}(F) is the unique monic polynomial of smallest degree such that mA(A)=0m_A(A) = 0.

Equivalently, mAm_A is the monic generator of the ideal {pF[λ]:p(A)=0}\{p \in F[\lambda] : p(A) = 0\}.

Theorem7.2Properties of the minimal polynomial
  1. mAm_A divides pAp_A (the characteristic polynomial), by Cayley--Hamilton.
  2. mAm_A and pAp_A have the same roots: every eigenvalue of AA is a root of mAm_A, and vice versa.
  3. AA is diagonalizable iff mAm_A splits into distinct linear factors (no repeated roots).
  4. The degree of mAm_A equals the dimension of F[A]=span{I,A,A2,}F[A] = \operatorname{span}\{I, A, A^2, \ldots\}.

Computing minimal polynomials

ExampleMinimal polynomial of a diagonal matrix

A=diag(2,3,2,5)A = \operatorname{diag}(2, 3, 2, 5). Eigenvalues: 2,3,52, 3, 5.

pA(λ)=(λ2)2(λ3)(λ5)p_A(\lambda) = (\lambda - 2)^2(\lambda - 3)(\lambda - 5).

mA(λ)=(λ2)(λ3)(λ5)m_A(\lambda) = (\lambda - 2)(\lambda - 3)(\lambda - 5) (each eigenvalue appears once, since diagonal matrices are diagonalizable).

Verify: (A2I)(A3I)(A5I)(A - 2I)(A - 3I)(A - 5I). The (1,1)(1,1) entry: (22)(23)(25)=0(2-2)(2-3)(2-5) = 0. The (2,2)(2,2) entry: (32)(33)(35)=0(3-2)(3-3)(3-5) = 0. All diagonal entries are 00 ✓.

ExampleMinimal polynomial of a scalar matrix

A=cIA = cI: mA(λ)=λcm_A(\lambda) = \lambda - c.

pA(λ)=(λc)np_A(\lambda) = (\lambda - c)^n, but mAm_A has degree just 11.

This is the extreme case where mAm_A is much smaller than pAp_A.

ExampleMinimal polynomial from Jordan form

The minimal polynomial of a Jordan form J=diag(Jk1(λ1),,Jkr(λr))J = \operatorname{diag}(J_{k_1}(\lambda_1), \ldots, J_{k_r}(\lambda_r)) is:

mJ(λ)=i(λλi)sim_J(\lambda) = \prod_i (\lambda - \lambda_i)^{s_i}

where sis_i is the size of the largest Jordan block for eigenvalue λi\lambda_i.

For J=diag(J3(2),J1(2),J2(5))J = \operatorname{diag}(J_3(2), J_1(2), J_2(5)): mJ(λ)=(λ2)3(λ5)2m_J(\lambda) = (\lambda - 2)^3(\lambda - 5)^2. For J=diag(J2(2),J2(2),J1(5))J = \operatorname{diag}(J_2(2), J_2(2), J_1(5)): mJ(λ)=(λ2)2(λ5)m_J(\lambda) = (\lambda - 2)^2(\lambda - 5).

ExampleMinimal polynomial of a companion matrix

The companion matrix of p(λ)=λn+cn1λn1++c0p(\lambda) = \lambda^n + c_{n-1}\lambda^{n-1} + \cdots + c_0 has mA=pA=pm_A = p_A = p. For companion matrices, the minimal and characteristic polynomials coincide.


Relationship to diagonalizability

Theorem7.3Diagonalizability criterion via minimal polynomial

AA is diagonalizable over FF if and only if mA(λ)m_A(\lambda) splits into distinct linear factors over FF:

mA(λ)=(λλ1)(λλ2)(λλk)m_A(\lambda) = (\lambda - \lambda_1)(\lambda - \lambda_2) \cdots (\lambda - \lambda_k)

with λi\lambda_i pairwise distinct.

ExampleUsing minimal polynomial to test diagonalizability

A=(2102)A = \begin{pmatrix} 2 & 1 \\ 0 & 2 \end{pmatrix}: pA(λ)=(λ2)2p_A(\lambda) = (\lambda - 2)^2. Is (A2I)=0(A - 2I) = 0? No: A2I=(0100)0A - 2I = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} \neq 0.

So mA(λ)=(λ2)2m_A(\lambda) = (\lambda - 2)^2 (has a repeated root). Conclusion: AA is not diagonalizable.

B=(2002)=2IB = \begin{pmatrix} 2 & 0 \\ 0 & 2 \end{pmatrix} = 2I: mB(λ)=λ2m_B(\lambda) = \lambda - 2 (no repeated roots). Conclusion: BB is diagonalizable.

Example3x3 examples

A=(300031003)A = \begin{pmatrix} 3 & 0 & 0 \\ 0 & 3 & 1 \\ 0 & 0 & 3 \end{pmatrix}: pA=(λ3)3p_A = (\lambda - 3)^3. Check: (A3I)=(000001000)0(A - 3I) = \begin{pmatrix} 0 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix} \neq 0. (A3I)2=0(A-3I)^2 = 0. So mA=(λ3)2m_A = (\lambda - 3)^2 (repeated root). Not diagonalizable.

B=diag(3,3,3)=3IB = \operatorname{diag}(3, 3, 3) = 3I: mB=λ3m_B = \lambda - 3. Diagonalizable.

C=diag(3,3,5)C = \operatorname{diag}(3, 3, 5): mC=(λ3)(λ5)m_C = (\lambda - 3)(\lambda - 5) (distinct linear factors). Diagonalizable.


Computing the minimal polynomial systematically

ExampleSystematic computation

A=(110010002)A = \begin{pmatrix} 1 & 1 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 2 \end{pmatrix}.

pA(λ)=(λ1)2(λ2)p_A(\lambda) = (\lambda - 1)^2(\lambda - 2).

The candidates for mAm_A (monic divisors of pAp_A sharing the same roots) are:

  • (λ1)(λ2)(\lambda - 1)(\lambda - 2) (degree 22),
  • (λ1)2(λ2)(\lambda - 1)^2(\lambda - 2) (degree 33, same as pAp_A).

Test (λ1)(λ2)(\lambda - 1)(\lambda - 2): (AI)(A2I)=(010000000)(110010000)=(010000000)0(A - I)(A - 2I) = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\begin{pmatrix} -1 & 1 & 0 \\ 0 & -1 & 0 \\ 0 & 0 & 0 \end{pmatrix} = \begin{pmatrix} 0 & -1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix} \neq 0.

So mA(λ1)(λ2)m_A \neq (\lambda - 1)(\lambda - 2), hence mA=(λ1)2(λ2)=pAm_A = (\lambda - 1)^2(\lambda - 2) = p_A.

ExampleWhen m_A is strictly smaller than p_A

A=(100010002)A = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 2 \end{pmatrix}.

pA(λ)=(λ1)2(λ2)p_A(\lambda) = (\lambda - 1)^2(\lambda - 2).

Test (λ1)(λ2)(\lambda - 1)(\lambda - 2): (AI)(A2I)=(000000001)(100010000)=0(A - I)(A - 2I) = \begin{pmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} -1 & 0 & 0 \\ 0 & -1 & 0 \\ 0 & 0 & 0 \end{pmatrix} = 0.

So mA=(λ1)(λ2)m_A = (\lambda - 1)(\lambda - 2), which is strictly smaller than pAp_A. The matrix is diagonalizable (it already is diagonal).


Minimal polynomial and Jordan form relationship

ExampleReading minimal polynomial from Jordan form

Jordan form diag(J2(1),J1(1),J3(2))\operatorname{diag}(J_2(1), J_1(1), J_3(2)):

  • Largest block for λ=1\lambda = 1: size 22.
  • Largest block for λ=2\lambda = 2: size 33.
  • mA=(λ1)2(λ2)3m_A = (\lambda - 1)^2(\lambda - 2)^3.
  • pA=(λ1)3(λ2)3p_A = (\lambda - 1)^3(\lambda - 2)^3 (sum of block sizes for each eigenvalue).

Jordan form diag(J2(0),J2(0))\operatorname{diag}(J_2(0), J_2(0)):

  • pA=λ4p_A = \lambda^4, mA=λ2m_A = \lambda^2.
  • The matrix is nilpotent with index 22: A2=0A^2 = 0 but A0A \neq 0.

Jordan form diag(J3(0),J2(0),J1(0))\operatorname{diag}(J_3(0), J_2(0), J_1(0)):

  • pA=λ6p_A = \lambda^6, mA=λ3m_A = \lambda^3.
  • Nilpotent index 33.
ExampleSame characteristic polynomial, different minimal polynomials

A=diag(J2(0),J1(0))A = \operatorname{diag}(J_2(0), J_1(0)) and B=diag(J1(0),J1(0),J1(0))B = \operatorname{diag}(J_1(0), J_1(0), J_1(0)):

Both have p(λ)=λ3p(\lambda) = \lambda^3. But mA=λ2m_A = \lambda^2 while mB=λm_B = \lambda.

The minimal polynomial distinguishes the two similarity classes that the characteristic polynomial cannot.


The algebra F[A]

ExampleThe algebra generated by a matrix

A=(0100)A = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}: mA=λ2m_A = \lambda^2, so dimF[A]=2\dim F[A] = 2.

F[A]=span{I,A}={(ab0a):a,bF}F[A] = \operatorname{span}\{I, A\} = \left\{\begin{pmatrix} a & b \\ 0 & a \end{pmatrix} : a, b \in F\right\}.

This is a 22-dimensional commutative subalgebra of M2(F)M_2(F).

ExampleAlgebra of a diagonalizable matrix

A=diag(1,2,3)A = \operatorname{diag}(1, 2, 3): mA=(λ1)(λ2)(λ3)m_A = (\lambda - 1)(\lambda - 2)(\lambda - 3), degmA=3\deg m_A = 3.

F[A]={p(A):pF[λ]}F[A] = \{p(A) : p \in F[\lambda]\} has dimension 33, spanned by I,A,A2I, A, A^2.

F[A]={diag(a,b,c):a,b,cF}F[A] = \{\operatorname{diag}(a, b, c) : a, b, c \in F\} (all diagonal matrices), which has dimension 33.

ExampleWhen F[A] is as small as possible

A=5IA = 5I (n×nn \times n): mA=λ5m_A = \lambda - 5, dimF[A]=1\dim F[A] = 1. F[A]={cI:cF}F[A] = \{cI : c \in F\}, the scalar matrices.


Application: testing nilpotency

ExampleMinimal polynomial determines nilpotent index

If AA is nilpotent, then mA=λkm_A = \lambda^k where kk is the smallest positive integer with Ak=0A^k = 0 (the nilpotent index). By Cayley--Hamilton, knk \leq n.

For the n×nn \times n shift matrix: mA=λnm_A = \lambda^n (the maximum possible). For A=0A = 0: mA=λm_A = \lambda (the minimum for a nilpotent matrix).

The number of Jordan blocks of size j\geq j equals rank(Aj1)rank(Aj)\operatorname{rank}(A^{j-1}) - \operatorname{rank}(A^j).


Summary

RemarkThe minimal polynomial as the refined invariant

The minimal polynomial refines the characteristic polynomial:

  • Same roots (eigenvalues), but the exponents encode largest Jordan block sizes instead of total algebraic multiplicities.
  • AA is diagonalizable iff mAm_A has no repeated roots.
  • mAm_A divides pAp_A, and they agree iff AA has a cyclic vector (i.e., AA is similar to a companion matrix).
  • The algebra F[A]F[A] has dimension degmA\deg m_A, measuring the "complexity" of the matrix.
  • Together, pAp_A and mAm_A determine the Jordan form for matrices up to 4×44 \times 4; for larger matrices, additional invariants (the full list of elementary divisors) may be needed.