The minimal polynomial of an n-by-n matrix A over a field F is the monic polynomial p(x) over F of least degree such that p(A)=0.
The following three statements are equivalent:Jordan block corresponding to λ.
This article is a stub. You can help Wikipedia by fixing it.
In field theory, a minimal polynomial is a polynomial m(x) in the field Zp (with p prime), such that, if we have the field F=Zp(α), it is the polynomial of least degree with m(α)=0.
The minimal polynomial is unique, and if we have some irreducible polynomial f(x) with f(α)=0, then f is the minimal polynomial of α.