Irreducible Polynomial

In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the ring to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as $\left(x - \sqrt\right)\left(x + \sqrt\right)$ if it is considered as a polynomial with real coefficients. One says that the polynomial is irreducible over the integers but not over the reals.

Polynomial irreducibility can be considered for polynomials with coefficients in an integral domain, and there are two common definitions. Most often, a polynomial over an integral domain is said to be ''irreducible'' if it is not the product of two polynomials that have their coefficients in , and that are not unit in . Equivalently, for this definition, an irreducible polynomial is an irreducible element in a ring of polynomials over . If is a field, the two definitions of irreducibility are equivalent. For the second definition, a polynomial is irreducible if it cannot be factored into polynomials with coefficients in the same domain that both have a positive degree. Equivalently, a polynomial is irreducible if it is irreducible over the field of fractions of the integral domain. For example, the polynomial 2(x^2-2)\in \Z /math> is irreducible for the second definition, and not for the first one. On the other hand, $x^2-2$ is irreducible in \Z /math> for the two definitions, while it is reducible in \R

A polynomial that is irreducible over any field containing the coefficients is absolutely irreducible. By the fundamental theorem of algebra, a univariate polynomial is absolutely irreducible if and only if its degree is one. On the other hand, with several indeterminates, there are absolutely irreducible polynomials of any degree, such as $x^2 + y^n - 1,$ for any positive integer .

A polynomial that is not irreducible is sometimes said to be a reducible polynomial.

Irreducible polynomials appear naturally in the study of polynomial factorization and algebraic field extensions.

It is helpful to compare irreducible polynomials to prime numbers: prime numbers (together with the corresponding negative numbers of equal magnitude) are the irreducible integers. They exhibit many of the general properties of the concept of "irreducibility" that equally apply to irreducible polynomials, such as the essentially unique factorization into prime or irreducible factors. When the coefficient ring is a field or other unique factorization domain, an irreducible polynomial is also called a prime polynomial, because it generates a prime ideal.

Definition

If ''F'' is a field, a non-constant polynomial is irreducible over ''F'' if its coefficients belong to ''F'' and it cannot be factored into the product of two non-constant polynomials with coefficients in ''F''.

A polynomial with integer coefficients, or, more generally, with coefficients in a unique factorization domain ''R'', is sometimes said to be ''irreducible'' (or ''irreducible over R'') if it is an irreducible element of the polynomial ring, that is, it is not invertible, not zero, and cannot be factored into the product of two non-invertible polynomials with coefficients in ''R''. This definition generalizes the definition given for the case of coefficients in a field, because, over a field, the non-constant polynomials are exactly the polynomials that are non-invertible and non-zero.

Another definition is frequently used, saying that a polynomial is ''irreducible over R'' if it is irreducible over the field of fractions of ''R'' (the field of rational numbers, if ''R'' is the integers). This second definition is not used in this article. The equivalence of the two definitions depends on ''R''.

Simple examples

The following six polynomials demonstrate some elementary properties of reducible and irreducible polynomials:

:$\begin p_1(x) &= x^2 + 4x + 4\, = \\ p_2(x) &= x^2 - 4\, = \\ p_3(x) &= 9x^2 - 3\, = 3\left(3x^2 - 1\right)\, = 3\left(x\sqrt - 1\right)\left(x\sqrt + 1\right)\\ p_4(x) &= x^2 - \frac\, = \left(x - \frac\right)\left(x + \frac\right)\\ p_5(x) &= x^2 - 2\, = \left(x - \sqrt\right)\left(x + \sqrt\right)\\ p_6(x) &= x^2 + 1\, = \end$

Over the integers, the first three polynomials are reducible (the third one is reducible because the factor 3 is not invertible in the integers); the last two are irreducible. (The fourth, of course, is not a polynomial over the integers.)

Over the rational numbers, the first two and the fourth polynomials are reducible, but the other three polynomials are irreducible (as a polynomial over the rationals, 3 is a unit, and, therefore, does not count as a factor).

Over the real numbers, the first five polynomials are reducible, but $p_6(x)$ is irreducible.

Over the complex numbers, all six polynomials are reducible.

Over the complex numbers

Over the complex field, and, more generally, over an algebraically closed field, a univariate polynomial is irreducible if and only if its degree is one. This fact is known as the fundamental theorem of algebra in the case of the complex numbers and, in general, as the condition of being algebraically closed.

It follows that every nonconstant univariate polynomial can be factored as

:$a\left(x - z_1\right) \cdots \left(x - z_n\right)$

where $n$ is the degree, $a$ is the leading coefficient and $z_1, \dots, z_n$ are the zeros of the polynomial (not necessarily distinct, and not necessarily having explicit algebraic expressions).

There are irreducible multivariate polynomials of every degree over the complex numbers. For example, the polynomial
:$x^n + y^n - 1,$

which defines a Fermat curve, is irreducible for every positive ''n''.

Over the reals

Over the field of reals, the degree of an irreducible univariate polynomial is either one or two. More precisely, the irreducible polynomials are the polynomials of degree one and the quadratic polynomials $ax^2 + bx + c$ that have a negative discriminant $b^2 - 4ac.$ It follows that every non-constant univariate polynomial can be factored as a product of polynomials of degree at most two. For example, $x^4 + 1$ factors over the real numbers as $\left(x^2 + \sqrtx + 1\right)\left(x^2 - \sqrtx + 1\right),$ and it cannot be factored further, as both factors have a negative discriminant: $\left(\pm\sqrt\right)^2 - 4 = -2 < 0.$

Unique factorization property

Every polynomial over a field may be factored into a product of a non-zero constant and a finite number of irreducible (over ) polynomials. This decomposition is unique up to the order of the factors and the multiplication of the factors by non-zero constants whose product is 1.

Over a unique factorization domain the same theorem is true, but is more accurately formulated by using the notion of primitive polynomial. A primitive polynomial is a polynomial over a unique factorization domain, such that 1 is a greatest common divisor of its coefficients.

Let be a unique factorization domain. A non-constant irreducible polynomial over is primitive. A primitive polynomial over is irreducible over if and only if it is irreducible over the field of fractions of . Every polynomial over may be decomposed into the product of a non-zero constant and a finite number of non-constant irreducible primitive polynomials. The non-zero constant may itself be decomposed into the product of a unit of and a finite number of irreducible elements of . Both factorizations are unique up to the order of the factors and the multiplication of the factors by a unit of .

This is this theorem which motivates that the definition of ''irreducible polynomial over a unique factorization domain'' often supposes that the polynomial is non-constant.

All algorithms which are presently implemented for factoring polynomials over the integers and over the rational numbers use this result (see Factorization of polynomials).

Over the integers and finite fields

The irreducibility of a polynomial over the integers $\mathbb$ is related to that over the field $\mathbb_p$ of $p$ elements (for a prime $p$). In particular, if a univariate polynomial over $\mathbb Z$ is irreducible over $\mathbb_p$ for some prime $p$ that does not divide the leading coefficient of (the coefficient of the highest power of the variable), then is irreducible over $\mathbb$ (that is, it is not the product of two non-constant polynomials with integer coefficients). Eisenstein's criterion is a variant of this property where irreducibility over $p^2$ is also involved.

The converse, however, is not true: there are polynomials of arbitrarily large degree that are irreducible over the integers and reducible over every finite field. A simple example of such a polynomial is $x^4 + 1.$

The relationship between irreducibility over the integers and irreducibility modulo ''p'' is deeper than the previous result: to date, all implemented algorithms for factorization and irreducibility over the integers and over the rational numbers use the factorization over finite fields as a subroutine.

The number of degree irreducible monic polynomials over a field $\mathbb_q$ for a prime power is given by Moreau's necklace-counting function:
:$M(q, n) = \frac\sum_ \mu(d)q^\frac,$

where is the Möbius function. For , such polynomials are commonly used to generate pseudorandom binary sequences.

In some sense, almost all polynomials with coefficients zero or one are irreducible over the integers. More precisely, if a version of the Riemann hypothesis for Dedekind zeta functions is assumed, the probability of being irreducible over the integers for a polynomial with random coefficients in tends to one when the degree increases.

Algorithms

The unique factorization property of polynomials does not mean that the factorization of a given polynomial may always be computed. Even the irreducibility of a polynomial may not always be proved by a computation: there are fields over which no algorithm can exist for deciding the irreducibility of arbitrary polynomials.

Algorithms for factoring polynomials and deciding irreducibility are known and implemented in computer algebra systems for polynomials over the integers, the rational numbers, finite fields and finitely generated field extension of these fields. All these algorithms use the algorithms for factorization of polynomials over finite fields.

Field extension

The notions of irreducible polynomial and of algebraic field extension are strongly related, in the following way.

Let ''x'' be an element of an extension ''L'' of a field ''K''. This element is said to be ''algebraic'' if it is a root of a nonzero polynomial with coefficients in ''K''. Among the polynomials of which ''x'' is a root, there is exactly one which is monic and of minimal degree, called the minimal polynomial of ''x''. The minimal polynomial of an algebraic element ''x'' of ''L'' is irreducible, and is the unique monic irreducible polynomial of which ''x'' is a root. The minimal polynomial of ''x'' divides every polynomial which has ''x'' as a root (this is Abel's irreducibility theorem).

Conversely, if P(X) \in K /math> is a univariate polynomial over a field ''K'', let L = K P(X) be the quotient ring of the polynomial ring K /math> by the ideal generated by . Then is a field if and only if is irreducible over . In this case, if is the image of in , the minimal polynomial of is the quotient of by its leading coefficient.

An example of the above is the standard definition of the complex numbers as \mathbb = \mathbb ;/\left(X^2 + 1\right).

If a polynomial has an irreducible factor over , which has a degree greater than one, one may apply to the preceding construction of an algebraic extension, to get an extension in which has at least one more root than in . Iterating this construction, one gets eventually a field over which factors into linear factors. This field, unique up to a field isomorphism, is called the splitting field of .

Over an integral domain

If ''R'' is an integral domain, an element ''f'' of ''R'' that is neither zero nor a unit is called irreducible if there are no non-units ''g'' and ''h'' with ''f'' = ''gh''. One can show that every prime element is irreducible;Consider ''p'' a prime that is reducible: ''p'' = ''ab''. Then ''p'' , ''ab'' ⇒ ''p'' , ''a'' or ''p'' , ''b''. Say ''p'' , ''a'' ⇒ ''a'' = ''pc'', then we have: ''p'' = ''ab'' = ''pcb'' ⇒ ''p''(1 − ''cb'') = 0. Because ''R'' is a domain, we have ''cb'' = 1. So ''b'' is a unit, and ''p'' is irreducible. the converse is not true in general but holds in unique factorization domains. The polynomial ring ''F'' 'x''over a field ''F'' (or any unique-factorization domain) is again a unique factorization domain. Inductively, this means that the polynomial ring in ''n'' indeterminates (over a ring ''R'') is a unique factorization domain if the same is true for ''R''.

See also

* Gauss's lemma (polynomial)
* Rational root theorem, a method of finding whether a polynomial has a linear factor with rational coefficients
* Eisenstein's criterion
* Perron's irreducibility criterion
* Hilbert's irreducibility theorem
* Cohn's irreducibility criterion
* Irreducible component of a topological space
* Factorization of polynomials over finite fields
*
*
* Casus irreducibilis, the irreducible cubic with three real roots
*

Notes

References

* . This classical book covers most of the content of this article.
*
*
pp. 91

*
*
pp. 154

External links

*
*


The (Combinatorial) Object Server.

{{Polynomials

Polynomials
Abstract algebra
Algebra