Each root of the minimal polynomial of a matrix M is an eigenvalue of M and a root of its characteristic polynomial. (A root of the minimal polynomial has a multiplicity that is less than or equal to the multiplicity of the same root in the characteristic polynomial. Thus the minimal polynomial divides the characteristic polynomial. Also, any root of the characteristic polynomial is also a root of the minimal polynomial, so the two kinds of polynomial have the same roots, only (possibly) differing in their multiplicities.)

1965 [John Wiley], Robert B. Ash, Information Theory, 1990, Dover, page 161,
A procedure for obtaining the minimal polynomial of the matrix Tⁱ, without actually computing the powers of T is indicated in the solution to Problem 5.9.

In this section we will show that if A,B,C,D is a controllable and observable realization of mathbf G, then λ is a pole of mathbf G if and only if λ is an eigenvalue of A. Moreover, the roots (multiplicities included) of the minimal polynomial of A are the poles of mathbf G.

2007, A. R. Vasishta, Vipin Vasishta, A.K. Vasishta, Abstract and Linear Algebra, Krishna Prakashan Media, 3rd Edition, page CA-439,
Theorem 1. The minimal polynomial of a matrix or of a linear operator is unique.

[…]we are given an element α∈E, and want to compute the minimal polynomial ϕ∈F[X] of α over F.

The minimal polynomials of the images of unipotent elements in irreducible rational representations of the classical algebraic groups over fields of odd characteristic are found.[…]It occurs that for each unipotent element the degree of its minimal polynomial in an irreducible representation is equal to the order of this element provided the highest weight of this element is large enough with respect to the ground field characteristic.

Let α be an algebraic number with degree n and let P be the minimal polynomial for α (see Section 6.5).

Minimal polynomial

Meaning

Noun