Minimal polynomial

from Wikipedia, the free encyclopedia

A minimal polynomial is generally understood to be a polynomial of minimal degree that just fulfills a property that is no longer fulfilled by factors of smaller degree. In particular, in various sub-areas of mathematics, the minimal polynomial indicates the minimal linear dependency between the powers of a matrix or a linear mapping or, more generally, an element of an algebra .

definition

Let a body and a unitary - algebra . Then the minimal polynomial of an element is the normalized polynomial of the lowest degree, which has as a zero.

The minimal polynomial can also be used as a normalized generator of the kernel of the homomorphism

,

of the insertion homomorphism of , where the ring of polynomials with coefficients is off.

In a finite-dimensional algebra, each element has a unique minimal polynomial, in an infinite- dimensional algebra this does not have to be the case. There the elements that have a minimal polynomial are called algebraic elements over the basic field; Elements to which this does not apply are called transcendent elements.

Linear Algebra

The minimal a square - matrix on a body is the normalized polynomial of smallest degree with coefficients in so that (the zero matrix is).

The following statements for out are equivalent :

  • is zero of , d. H. ,
  • is the root of the characteristic polynomial of ,
  • is an eigenvalue of .

The multiplicity of a zero of determines the length of the longest principal vector chain to the eigenvalue , i.e. i.e., the multiplicity is e.g. B. 4, then there is a chain of four linearly independent main vectors (of levels 1 to 4) to the eigenvalue . If there are further main vector chains for the eigenvalue , which are linearly independent of this chain of length 4, then they are by no means longer. Thus the size of the largest Jordan block belonging to the Jordan normal form of is identical to the multiplicity of in the minimal polynomial .

The geometric multiplicity of the eigenvalue of , on the other hand, means the number of linearly independent eigenvectors for this eigenvalue. In other words: the geometric multiplicity of an eigenvalue of the square matrix is the dimension of the solution space of .

Somewhat more generally, one can examine the core of the insertion homomorphism of from the definition for an endomorphism of a vector space (even without fixing it on a certain basis ) ; this then leads to a minimal polynomial even with infinite-dimensional vector spaces if this core is not the zero vector space . A simple example are the projection mappings , which are idempotent by definition, i.e. they fulfill the relation . So every projection has one of the polynomials , or as a minimal polynomial.

Body theory

In body theory , the minimal polynomial is a term that occurs when the body is expanded.

Be a field extension, the polynomial ring to with the indeterminate and be algebraic, that is, it exists with . Then there exists a polynomial (called the minimal polynomial) with the properties

  1. is standardized
  2. has minimal degree, i.e. H. applies
  3. is unambiguous ( determined by), d. H. for every further one that fulfills properties 1–3 already applies

If one considers the extension field as a vector space over and a certain element as endomorphism (through the illustration ), one arrives at the same minimal polynomial (in the sense of linear algebra) as in the field theory for an algebraic element .

properties

  • Minimal polynomials are irreducible over the basic field.
  • Every polynomial with coefficients in the base field that has an algebraic element as a zero is a (polynomial) multiple of the minimal polynomial of .
  • The degree of the minimal polynomial of is equal to the degree of the simple expansion .

See also: Disintegration bodies , Cayley-Hamilton theorem

Examples

  • Consider the body extension with the imaginary unit : The minimal polynomial of is , because it has as a zero, is normalized, and every polynomial of smaller degree would be linear and only have one zero in .
  • The polynomial is not a minimal polynomial of any element of any extension, since it can be represented as and for none of its roots is a polynomial of the lowest degree .

Examples of minimal polynomials of an algebraic element

  • Minimal polynomials over from , where is some complex square root: is already a zero of . But this polynomial is irreducible over if . If so , then this is the minimum polynomial

  • Minimal polynomials over from : It holds . So is zero of . However, this polynomial is not irreducible because it has the factorization . Obviously there is no zero of . So must be the zero of . And this polynomial is irreducible (e.g. by reduction modulo 2)
  • Minimal polynomial over von : Here it is helpful to consider a normal body extension , with . This is e.g. B. for given, the decay field of the polynomial . In , the minimal polynomial breaks down into linear factors. The zeros are conjugates of , i.e. of the form for a from the Galois group of .
It is sufficient to determine the possible values (i.e. the conjugates of ). The minimal polynomial over of is what can be factored over . Thus the conjugates of exact
,
,
and
.
The minimal polynomial of is thus

literature

  • Uwe Storch , Hartmut Wiebe: Textbook of Mathematics. For mathematicians, computer scientists and physicists. Volume 2: Linear Algebra. BI-Wissenschafts-Verlag, Mannheim et al. 1990, ISBN 3-411-14101-8 .
  • Thomas W. Hungerford: Algebra (= Graduate Texts in Mathematics. Vol. 73). 5th printing. Springer, New York NY et al. 1989, ISBN 0-387-90518-9 .