Minimal polynomial: Difference between revisions
imported>Richard Pinch (New entry, just a stub) |
imported>Richard Pinch (section on Minimal polynomial of an algebraic number) |
||
| Line 1: | Line 1: | ||
In [[linear algebra]] the '''minimal polynomial''' of a [[square matrix]] is the monic polynomial of least degree which the matrix satisfies. | In [[linear algebra]] the '''minimal polynomial''' of a [[square matrix]] is the [[monic polynomial]] of least [[degree of a polynomial|degree]] which the matrix satisfies. | ||
Let ''A'' be an ''n''×''n'' matrix. The powers ''I''=''A''<sup>0</sup>,''A''<sup>1</sup>,...,''A''<sup''n''²</sup> must be [[linear dependence|linearly dependent]] since the matrix ring has dimension ''n''<sup>2</sup>, and so ''A'' satisfies some polynomial. Hence it makes sense to define the minimal polynomial as the [[monic polynomial]] of least degree which ''A'' satisfies, or which annihilates ''A''. | Let ''A'' be an ''n''×''n'' matrix. The powers ''I''=''A''<sup>0</sup>,''A''<sup>1</sup>,...,''A''<sup>''n''²</sup> must be [[linear dependence|linearly dependent]] since the matrix ring has dimension ''n''<sup>2</sup>, and so ''A'' satisfies some polynomial. Hence it makes sense to define the minimal polynomial as the [[monic polynomial]] of least degree which ''A'' satisfies, or which annihilates ''A''. | ||
A similar definition applies to the minimal polynomial of an [[endomorphism]] of a finite-dimensional [[vector space]]. | A similar definition applies to the minimal polynomial of an [[endomorphism]] of a finite-dimensional [[vector space]]. | ||
| Line 8: | Line 8: | ||
Since ''A'' satisfies its own [[characteristic polynomial]] by the [[Cayley-Hamilton theorem]], we deduce that ''the minimal polynomial divides the characteristic polynomial''. However, the two polynomials have the same set of roots, namely the set of [[eigenvalue]]s of ''A''. | Since ''A'' satisfies its own [[characteristic polynomial]] by the [[Cayley-Hamilton theorem]], we deduce that ''the minimal polynomial divides the characteristic polynomial''. However, the two polynomials have the same set of roots, namely the set of [[eigenvalue]]s of ''A''. | ||
==Minimal polynomial of an algebraic number== | |||
The minimal poynomial of an [[algebraic number]] α is the rational [[polynomial]] of least [[degree of a polynomial|degree]] which has α as a root. | |||
Revision as of 02:33, 22 December 2008
In linear algebra the minimal polynomial of a square matrix is the monic polynomial of least degree which the matrix satisfies.
Let A be an n×n matrix. The powers I=A0,A1,...,An² must be linearly dependent since the matrix ring has dimension n2, and so A satisfies some polynomial. Hence it makes sense to define the minimal polynomial as the monic polynomial of least degree which A satisfies, or which annihilates A.
A similar definition applies to the minimal polynomial of an endomorphism of a finite-dimensional vector space.
The polynomials which annihilate A form an ideal in the ring of polynomials, and this is a principal ideal domain: we deduce that the minimal polynomial actually divides all other polynomials which A satisfies.
Since A satisfies its own characteristic polynomial by the Cayley-Hamilton theorem, we deduce that the minimal polynomial divides the characteristic polynomial. However, the two polynomials have the same set of roots, namely the set of eigenvalues of A.
Minimal polynomial of an algebraic number
The minimal poynomial of an algebraic number α is the rational polynomial of least degree which has α as a root.