# Irreducible polynomial

Irreducible polynomial

In mathematics, the adjective irreducible means that an object cannot be expressed as a product of at least two non-trivial factors in a given set. See also factorization.

For any field "F", the ring of polynomials with coefficients in "F" is denoted by $F \left[x\right]$. A polynomial $p\left(x\right)$ in $F \left[x\right]$ is called irreducible over $F$ if it is non-constant and cannot be represented as the product of two or more non-constant polynomials from $F \left[x\right]$.

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 non-trivial applications can be found in the study of finite fields.

It is helpful to compare irreducible polynomials to
prime numbers: prime numbers (together with thecorresponding 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 $p\left(x\right)$ in $F \left[x\right]$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 constants from "F".

Simple examples

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

:$p_1\left(x\right)=x^2+4x+4,=\left\{\left(x+2\right)\left(x+2\right)\right\}$,:$p_2\left(x\right)=x^2-4,=\left\{\left(x-2\right)\left(x+2\right)\right\}$,:$p_3\left(x\right)=x^2-4/9,=\left(x-2/3\right)\left(x+2/3\right)$,:$p_4\left(x\right)=x^2-2,=\left(x-sqrt\left\{2\right\}\right)\left(x+sqrt\left\{2\right\}\right)$,:$p_5\left(x\right)=x^2+1,=\left\{\left(x-i\right)\left(x+i\right)\right\}$.

Over the ring $mathbb\left\{Z\right\}$ 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 $mathbb\left\{Q\right\}$ of rational numbers, the first three polynomials are reducible, but the other two polynomials are irreducible.

Over the field $mathbb\left\{R\right\}$ of real numbers, the first four polynomials are reducible, but $p_5\left(x\right)$ is still irreducible.

Over the field $mathbb\left\{C\right\}$ of complex numbers, all five polynomials are reducible.

In fact, over $mathbb\left\{C\right\}$ every non-constant polynomial can be factored into linear factors

:$p\left(z\right)=a_n \left(z-z_1\right)\left(z-z_2\right)cdots\left(z-z_n\right)$

where $a_n$ is the leading coefficient of the polynomial and $z_1,ldots,z_n$ are the zeros of $p\left(z\right)$. Hence, all irreducible polynomials are of degree 1. This is the fundamental theorem of algebra.

Note: The existence of an essentially "unique" factorization $p_5\left(x\right)=x^2+1=\left(x-i\right)\left(x+i\right)$of $p_5\left(x\right)$ into factors that do "not" belong to $Q \left[x\right]$ implies that this polynomial is irreducible over $mathbb\left\{Q\right\}$: 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). 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&mdash;the difference being that this field is "algebraically complete" (as are the complexes) 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 $p\left(x\right)$ to a larger field where this polynomial $p\left(x\right)$ 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,$x^4 + 1$ factors over the real numbers as $\left(x^2 + sqrt\left\{2\right\}x + 1\right)\left(x^2 - sqrt\left\{2\right\}x + 1\right).$

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 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" is a unique factorization domain.

Finite fields

Factorization over a finite field can behave very differently from factorization over the rational or complex fields. For instance, over the finite field of two elements, "GF"(2), we have that the polynomial :$p_5\left(x\right)=x^2+1,=\left(x+1\right)^2$is not irreducible as it was over $mathbb\left\{Z\right\}$ or $mathbb\left\{Q\right\}$. This behavior occurs because finite fields have non-zero characteristic.

Generally, if a polynomial factors over $mathbb\left\{Z\right\}$ then the corresponding polynomial with coefficients considered in the finite field "GF"("p") is also reducible, where "p" is a prime (the factors are the factors over $mathbb\left\{Z\right\}$ reduced modulo "p"). The converse of this statement is not true: there are polynomials that factor modulo "p" for all positive primes "p" but that are not reducible when considered as a polynomial with integer coefficients.An example is:$x^4 + 1$,which is irreducible over $mathbb\left\{Z\right\}$ and $mathbb\left\{Q\right\}$ but factors into 4 linear factors or two quadratic factors mod any prime "p".

* Gauss's lemma (polynomial)
* Rational root theorem
* Eisenstein's criterion
* Hilbert's irreducibility theorem
* A. Cohn's irreducibility criterion
* Irreducible component of a topological space

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Polynomial ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the …   Wikipedia

• Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… …   Wikipedia

• Irreducible (mathematics) — In mathematics, the term irreducible is used in several ways. * In abstract algebra, irreducible can be an abbreviation for irreducible element; for example an irreducible polynomial. * In representation theory, an irreducible representation is a …   Wikipedia

• Polynomial basis — In mathematics, the polynomial basis is a basis for finite extensions of finite fields.Let α ∈ GF( p m ) be the root of a primitive polynomial of degree m over GF( p ). The polynomial basis of GF( p m ) is then:{ 0, 1, alpha, ldots, alpha^{m… …   Wikipedia

• Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial   , the word has been introduced, in Latin, by Franciscus Vieta) is an expression of finite length constructed from variables (also known as… …   Wikipedia

• irreducible — irreducibility, irreducibleness, n. irreducibly, adv. /ir i dooh seuh beuhl, dyooh /, adj. 1. not reducible; incapable of being reduced or of being diminished or simplified further: the irreducible minimum. 2. incapable of being brought into a… …   Universalium

• irreducible — 1. adjective /ˌɪrɪˈdjuːsɪbəl/ a) Not able to be reduced or lessened. b) Not able to be brought to a simpler or reduced form. Ant: reducible 2. noun /ˌɪrɪˈdjuːsɪbəl/ …   Wiktionary

• irreducible function — noun : an integral rational function of a polynomial that cannot be resolved into integral rational factors of lower degree with coefficients in the same number field …   Useful english dictionary

• Separable polynomial — In mathematics, two slightly different notions of separable polynomial are used, by different authors. According to the most common one, a polynomial P(X) over a given field K is separable if all its roots are distinct in an algebraic closure of… …   Wikipedia

• Primitive polynomial — In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF( p m ). In other words, a polynomial F(X) with coefficients in GF( p ) = Z/ p Z is a primitive… …   Wikipedia