Irreducible polynomial

A nonconstant polynomial that cannot be factored into lower-degree nonunits.
Irreducible polynomial

Let RR be an . A polynomial fR[x]f\in R[x] is irreducible if ff is nonzero, not a , has positive degree, and whenever f=ghf=gh with g,hR[x]g,h\in R[x], then either gg or hh is a unit.

Over a field, irreducible polynomials generate maximal ideals in R[x]R[x] and define finite field extensions. Practical tests include , and hypotheses are often used to compare factorization in R[x]R[x] and in Frac(R)[x]\mathrm{Frac}(R)[x].

Examples:

  • In R[x]\mathbb{R}[x], the polynomial x2+1x^2+1 is irreducible.
  • In Q[x]\mathbb{Q}[x], x32x^3-2 is irreducible (Eisenstein at 22).
  • In any R[x]R[x], x21=(x1)(x+1)x^2-1=(x-1)(x+1) is reducible.