Minimal polynomial of a normal operator 2026-10-25
On a real or complex inner product space of finite dimension, a normal operator has a square-free polynomial as its minimal polynomial. To prove this without the spectral theorem, suppose an irreducible polynomial occurs at least twice in . Put and . Since polynomials of a normal operator are normal, is a normal operator. For every ,By kernel stabilization for a normal operator, . Hence the smaller-degree monic polynomial annihilates , contradicting minimality.
Over the complex numbers, all irreducible polynomials are linear, so the primary decomposition theorem for linear maps now gives a basis of eigenvectors. Over the real numbers, irreducible quadratics can remain: a nontrivial planar rotation need not have any real eigenvectors, although its minimal polynomial is square-free.
Let . If , then , and part (i) gives . Thus andThe positive definiteness of the inner product gives . Since the reverse kernel inclusion always holds, we obtainThis is kernel stabilization for a normal operator.