In mathematics, a polynomial is said to be irreducible if it cannot be factored into the product of two or more non-trivial polynomials whose coefficients are of a specified type. Thus in the common context of polynomials with rational coefficients, a polynomial is irreducible if it cannot be expressed as the product of two or more such polynomials, each of them having a lower degree than the original one. For example, while is reducible over the rationals, is not.
For any field F, a polynomial with coefficients in F is said to be irreducible over F if it is non-constant and cannot be factored into the product of two or more non-constant polynomials with coefficients in F. The property of irreducibility depends on the field F; a polynomial may be irreducible over some fields but reducible over others. Some simple examples are discussed below.
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:
Every polynomial with coefficients in a field F can be factorized into polynomials that are irreducible over F. This factorization is unique up to permutation of the factors and the multiplication of the factors by nonzero constants from F. This property of unique factorization is commonly expressed by saying that the polynomial rings over a field are unique factorization domains. However the existence of such a factorization does not mean that, given a polynomial, the factorization may always be computed: there are fields such that it can not exist any algorithm to factorize polynomials over these fields. There exist factorization algorithms for the polynomials with coefficients in the rational numbers, in a finite field or a finitely generated field extension of these fields. They are described in the article Polynomial factorization.
If an univariate polynomial p has a root (in some field extension) which is also a root of an irreducible polynomial q, then p is a multiple of q, and thus all roots of q are roots of p; this is Abel's irreducibility theorem. This implies that the roots of an irreducible polynomial may not be distinguished through algebraic relations. This result is one of the starting points of Galois theory, which has been introduced by Évariste Galois to study the relationship between the roots of a polynomial.
Simple examples 
The following five polynomials demonstrate some elementary properties of reducible and irreducible polynomials:
Over the ring of integers, the first two polynomials are reducible, the last two are irreducible. (The third, of course, is not a polynomial over the integers.)
Over the field of rational numbers, the first three polynomials are reducible, but the other two polynomials are irreducible.
Over the field of real numbers, the first four polynomials are reducible, but is still irreducible.
Over the field of complex numbers, all five polynomials are reducible. In fact, every nonzero polynomial over can be factored as
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 the real subset of the algebraic numbers ( ), and finally to the algebraic subset of the complex numbers ( ). After the invention of calculus those latter two subsets were later extended to all real numbers ( ) and all complex numbers ( ).
For algebraic purposes, the extension from rational numbers to real numbers is too "radical": it introduces transcendental numbers, which 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). The set of algebraic numbers ( ) is the algebraic closure of the rationals, and contains the roots of all polynomials (including i for instance). This is a countable field and is strictly contained in the complex numbers – the difference being that this field ( ) is "algebraically complete" (as are the complex numbers, ) but not analytically complete since it lacks the aforementioned transcendentals.
The above paragraph generalizes in that there is a purely algebraic process to extend a given field F with a given polynomial to a larger field where this polynomial can be reduced into linear factors. The study of such extensions is the starting point of Galois theory.
Real and complex numbers 
As shown in the examples above, only linear polynomials are irreducible over the field of complex numbers (this is a consequence of the fundamental theorem of algebra). Since the complex roots of a real polynomial are in conjugate pairs, the irreducible polynomials over the field of real numbers are the linear polynomials and the quadratic polynomials with no real roots. For example, factors over the real numbers as
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 non-units 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 (or any unique-factorization domain) is again a unique factorization domain. Inductively, this means that the polynomial ring in n indeterminants (over a ring R) is a unique factorization domain if the same is true for R.
Finite fields 
Factorization over a finite field behaves similarly to factorization over the rational or the complex field. However, polynomials with integer coefficients that are irreducible over the field can be reducible over a finite field. For example, the polynomial is irreducible over but reducible over the field of two elements. Indeed, over , we have
The irreducibility of a polynomial over the integers is related to that over the field of elements (for a prime ). Namely, if a polynomial over with leading coefficient is reducible over then it is reducible over for any prime . The converse, however, is not true, there are polynomials of arbitrary large degree that are irreducible over the integers and reducible over every finite field. A simple example of such a polynomial is which is irreducible over the integers and reducible over every finite field.
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 criterion
- Hilbert's irreducibility theorem
- Cohn's irreducibility criterion
- Irreducible component of a topological space
- Factorization of polynomials over finite fields
- Quartic function#Factorization into quadratics
- Cubic function#Factorization
- Casus irreducibilis, the irreducible cubic with three real roots
- Quadratic equation#Quadratic factorization
- Menezes, Alfred J.; Van Oorschot, Paul C.; Vanstone, Scott A. (1997), Handbook of applied cryptography, CRC Press, ISBN 978-0-8493-8523-0, pp. 154.
- Lidl, Rudolf; Niederreiter, Harald (1997), Finite fields (2nd ed.), Cambridge University Press, ISBN 978-0-521-39231-0, pp. 91.
- Weisstein, Eric W., "Irreducible Polynomial", MathWorld.
- Irreducible Polynomial at PlanetMath
- Information on Primitive and Irreducible Polynomials, The (Combinatorial) Object Server.
- Fröhlich, A.; Shepherson, J. C. (1955), "On the factorisation of polynomials in a finite number of steps", Mathematische Zeitschrift 62 (1), ISSN 0025-5874
- 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
- David Dummit; Richard Foote (2004). "chapter 9, Proposition 12". Abtract Algebra. John Wiley & Sons, Inc. p. 309. ISBN 0-471-43334-9.