Irreducible polynomial information

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (March 2015) (Learn how and when to remove this message)

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 x² − 2 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 ${\displaystyle \left(x-{\sqrt {2}}\right)\left(x+{\sqrt {2}}\right)}$ if it is considered as a polynomial with real coefficients. One says that the polynomial x² − 2 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 R is said to be irreducible if it is not the product of two polynomials that have their coefficients in R, and that are not unit in R. Equivalently, for this definition, an irreducible polynomial is an irreducible element in the rings of polynomials over R. If R 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 ${\displaystyle 2(x^{2}-2)\in \mathbb {Z} [x]}$ is irreducible for the second definition, and not for the first one. On the other hand, ${\displaystyle x^{2}-2}$ is irreducible in ${\displaystyle \mathbb {Z} [x]}$ for the two definitions, while it is reducible in ${\displaystyle \mathbb {R} [x].}$

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 ${\displaystyle x^{2}+y^{n}-1,}$ for any positive integer n.

A polynomial that is not irreducible is sometimes said to be a reducible polynomial.^[1][2]

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.