Irreducible polynomial

In mathematics, the adjective irreducible means that an object cannot be expressed as a product of at least two nontrivial factors in a given ring. See also factorization.
For any field F, the ring of polynomials with coefficients in F is denoted by <math>F[x]<math>. A polynomial <math>p(x)<math> in <math>F[x]<math> is called irreducible over <math>F<math>, if it is nonconstant and cannot be represented as the product of two or more nonconstant polynomials from <math>F[x]<math>.
This definition depends on the field F. Some simple examples will be discussed below.
Galois theory studies the relationship between a field, its Galois group, and its irreducible polynomials in depth. Interesting and nontrivial applications can be found in the study of finite fields.
It is helpful to compare irreducible polynomials to prime numbers: prime numbers (together with the corresponding negative numbers of equal modulus) are the irreducible integers. They exhibit many of the general properties of the concept 'irreducibility' that equally apply to irreducible polynomials, such as the essentially unique factorization into prime or irreducible factors:
Every polynomial <math>p(x)<math> in <math>F[x]<math> can be factorized into polynomials that are irreducible over F. This factorization is unique up to permutation of the factors and the multiplication of constants from F to the factors.
Simple examples
The following three polynomials demonstrate some elementary properties of reducible and irreducible polynomials:
 <math>p_1(x)=x^24\,=(x2)(x+2)<math>,
 <math>p_2(x)=x^22\,=(x\sqrt{2})(x+\sqrt{2})<math>,
 <math>p_3(x)=x^2+1\,=(xi)(x+i)<math>.
Over the field Q of rational numbers, the first polynomial <math>p_1(x)<math> is reducible, but the other two polynomials are irreducible.
Over the field R of real numbers, the two polynomials <math>p_1(x)<math> and <math>p_2(x)<math> are reducible, but <math>p_3(x)<math> is still irreducible.
Over the field C of complex numbers, all three polynomials are reducible.
In fact over C, every nonconstant polynomial can be factored into linear factors
 <math>p(z)=a_n (zz_1)(zz_2)\cdots(zz_n)<math>
where <math>a_n<math> is the leading coefficient of the polynomial and <math>z_1,\ldots,z_n<math> are the zeros of <math>p(z)<math>. Hence, all irreducible polynomials are of degree 1. This is the Fundamental theorem of algebra.
Note: The existence of an essentially unique factorization <math>p_3(x)=x^2+1=(xi)(x+i)<math> of <math>p_3(x)<math> into factors that do not belong to <math>Q[x]<math> implies that this polynomial is irreducible over Q: there cannot be another factorization.
These examples demonstrate the relationship between the zeros of a polynomial (solutions of an algebraic equation) and the factorization of the polynomial into linear factors.
The existence of irreducible polynomials of degree greater than one (without zeros in the original field) historically motivated the extension of that original number field so that even these polynomials can be reduced into linear factors: from rational numbers to real numbers and further to complex numbers.
For algebraic purposes, the extension from rational numbers to real numbers is often too 'radical': It introduces transcendental numbers (that are not the solutions of algebraic equations with rational coefficients). These numbers are not needed for the algebraic purpose of factorizing polynomials (but they are necessary for the use of real numbers in analysis). Thus, there is a purely algebraic process to extend a given field F with a given polynomial <math>p(x)<math> to a larger field where this polynomial <math>p(x)<math> can be reduced into linear factors. The study of such extensions is the starting point of Galois theory.
Generalization
If R is an integral domain, an element f of R which is neither zero nor a unit is called irreducible if there are no nonunits g and h with f = gh. One can show that every prime element is irreducible; the converse is not true in general but holds in unique factorization domains. The polynomial ring F[x] over a field F is a unique factorization domain.
See also: Hilbert's irreducibility theoremde:irreduzibles Polynom fr:Factorisation des polynômes