Abstract Algebra · Undergraduate

Polynomial Rings and Irreducible Polynomials

Quick answer

Polynomials with coefficients in a field F form a ring F[x], with long division like the integers: f = qg + r with deg r < deg g. A root a of f gives a factor x − a. A polynomial that cannot be factored into smaller degrees is irreducible, and the answer depends on the field: x² + 1 is irreducible over ℝ but factors over ℂ, and over ℤ₅ it is (x − 2)(x − 3). For degree 2 or 3, irreducible means no roots in the field, and Eisenstein's criterion settles many higher degrees over ℚ.

What you'll learn

  • Divide polynomials over a field with remainder
  • Use the factor theorem in F[x], including over ℤₚ
  • Decide irreducibility of degree 2 and 3 polynomials by checking roots
  • Apply Eisenstein's criterion over ℚ

Polynomials as a ring

For a field FF, the polynomials with coefficients in FF form the ring F[x]F[x]. It behaves much like the integers:

  • Division algorithm. For g≠0g \ne 0, there are unique qq and rr with f=qg+rf = qg + r and deg⁡r<deg⁡g\deg r < \deg g.
  • Factor theorem. f(a)=0f(a) = 0 exactly when x−ax - a divides ff.
  • Irreducibles play the role of primes. A polynomial of degree at least 11 is irreducible if it is not a product of two polynomials of lower degree in F[x]F[x].

Irreducibility depends on FF:

PolynomialOver Q\mathbb{Q}Over R\mathbb{R}Over C\mathbb{C}
x2−2x^2 - 2irreducible(x−2)(x+2)(x - \sqrt{2})(x + \sqrt{2})factors
x2+1x^2 + 1irreducibleirreducible(x−i)(x+i)(x - i)(x + i)

Why roots decide degree 2 and 3

If a quadratic or cubic factors, the degrees of the factors add to 22 or 33, so one factor must have degree 11. A degree-1 factor ax+bax + b means a root −ba-\tfrac{b}{a} in FF. So a quadratic or cubic is irreducible exactly when it has no root in the field. This test fails from degree 44 on: x4+2x2+1=(x2+1)2x^4 + 2x^2 + 1 = (x^2 + 1)^2 has no real roots but still factors over R\mathbb{R}. Over a finite field Zp\mathbb{Z}_p, checking for roots takes only pp substitutions.

Worked examples

Common mistakes

Practice problems

  1. Is x2+x+1x^2 + x + 1 irreducible over Z2\mathbb{Z}_2?

    Answer

    Yes

    Full solution

    f(0)=1f(0) = 1 and f(1)=3≡1f(1) = 3 \equiv 1: no roots in a quadratic.

  2. Factor x2+2x^2 + 2 over Z3\mathbb{Z}_3.

    Answer

    (x−1)(x−2)(x - 1)(x - 2), that is (x+2)(x+1)(x + 2)(x + 1)

    Full solution

    The roots are 11 and 22, since 1+2=31 + 2 = 3 and 4+2=64 + 2 = 6 are 00 mod 33.

  3. Is x2+1x^2 + 1 irreducible over Z7\mathbb{Z}_7?

    Answer

    Yes

    Full solution

    The squares mod 77 are 0,1,2,40, 1, 2, 4; none equals −1≡6-1 \equiv 6, so there are no roots.

  4. Find a root of x3+2x^3 + 2 in Z5\mathbb{Z}_5.

    Answer

    22

    Full solution

    8+2=10≡08 + 2 = 10 \equiv 0.

  5. Use Eisenstein’s criterion to show x3+2x+2x^3 + 2x + 2 is irreducible over Q\mathbb{Q}.

    Answer

    Use p=2p = 2.

    Full solution

    22 divides 22 and 22, not the leading 11, and 44 does not divide the constant 22.

  6. Factor x4−4x^4 - 4 over Q\mathbb{Q}, over R\mathbb{R} and over C\mathbb{C}.

    Answer

    (x2−2)(x2+2)(x^2 - 2)(x^2 + 2); (x−2)(x+2)(x2+2)(x - \sqrt{2})(x + \sqrt{2})(x^2 + 2); (x−2)(x+2)(x−i2)(x+i2)(x - \sqrt{2})(x + \sqrt{2})(x - i\sqrt{2})(x + i\sqrt{2})

    Full solution

    Each larger field supplies roots the smaller one lacks.

  7. Divide x3+2x+1x^3 + 2x + 1 by x+1x + 1 over Z3\mathbb{Z}_3. What is the remainder?

    Answer

    11

    Full solution

    By the remainder theorem it is f(−1)=−1−2+1=−2≡1(mod3)f(-1) = -1 - 2 + 1 = -2 \equiv 1 \pmod 3.

  8. A student says x4+2x2+1x^4 + 2x^2 + 1 is irreducible over R\mathbb{R} because it has no real roots. Correct it.

    Answer

    It equals (x2+1)2(x^2 + 1)^2.

    Full solution

    The root test only works for degree 22 and 33. Quartics can factor into quadratics without roots.

Frequently asked questions

What is F[x]?

The ring of polynomials with coefficients in the field F, with the usual addition and multiplication of polynomials.

What is an irreducible polynomial?

A polynomial of degree at least 1 that cannot be written as a product of two polynomials of lower degree over the same field.

How do you test a quadratic or cubic for irreducibility?

Check for roots in the field. A degree 2 or 3 polynomial factors exactly when it has a linear factor, that is, a root.

Why does the field matter?

Factors must have coefficients in the field. x² − 2 is irreducible over ℚ but equals (x − √2)(x + √2) over ℝ.

What is Eisenstein's criterion?

If a prime p divides every coefficient of an integer polynomial except the leading one, and p² does not divide the constant term, the polynomial is irreducible over ℚ.

What to learn next