Mathematics.

field theory

Irreducible Polynomials

Abstract Algebra II30 minDifficulty6 out of 10

You should know: polynomial rings

Overview

A polynomial f(x) over a field F is irreducible if it cannot be factored into two polynomials of lower positive degree with coefficients in F — the polynomial analogue of a prime number. Irreducibility depends heavily on the base field: x²+1 is irreducible over ℝ but factors as (x−i)(x+i) over ℂ. Irreducible polynomials are exactly the ones for which F[x]/(f(x)) is a field, making them the essential ingredient for constructing field extensions, finite fields, and (via Eisenstein's criterion and reduction mod p) for proving polynomials cannot be factored over ℚ.

Intuition

Irreducibility is entirely relative to which field you're working over — the same polynomial can be 'prime' (irreducible) in one field and split apart in a bigger one, exactly the way 5 is prime among integers but factors as (2+i)(2-i) among the Gaussian integers. The degree-2/3 root test works because any nontrivial factorization of a cubic or quadratic must include a linear factor, which is the same as having a root in the field; for degree 4 or higher this shortcut fails (a quartic can factor into two irreducible quadratics with no roots at all, like x⁴+1 over ℚ). Eisenstein's criterion is a quick sufficient (not necessary) test: if a prime divides every coefficient except the leading one, and its square doesn't divide the constant term, factoring is impossible.

Formal Definition

Definition

A nonconstant polynomial f(x) ∈ F[x] is irreducible over F if it cannot be written as a product of two nonconstant polynomials in F[x]:

f(x)=g(x)h(x)  ⟹  deg⁡(g)=0 or deg⁡(h)=0f(x) = g(x)h(x) \implies \deg(g)=0 \text{ or } \deg(h)=0
Definition of irreducibility
deg⁡(f)∈{2,3}  ⟹  f irreducible over F  ⟺  f has no root in F\deg(f) \in \{2,3\} \implies f \text{ irreducible over } F \iff f \text{ has no root in } F
Root test (only valid for degree 2 or 3)
f(x)=anxn+⋯+a0, p∤an, p∣ai(i<n), p2∤a0  ⟹  f irreducible over Qf(x) = a_nx^n+\cdots+a_0,\ p \nmid a_n,\ p \mid a_i (i<n),\ p^2 \nmid a_0 \implies f \text{ irreducible over } \mathbb{Q}
Eisenstein's Criterion (sufficient, at a prime p)
F[x]/(f(x)) is a field  ⟺  f(x) is irreducible over FF[x]/(f(x)) \text{ is a field} \iff f(x) \text{ is irreducible over } F
Irreducibility ⟺ quotient is a field

Worked Examples

  1. Over ℝ: a nontrivial factorization would need a real root, but x²+1=0 gives x²=−1, which has no real solution.

    x2=−1 has no solution in Rx^2 = -1 \text{ has no solution in } \mathbb{R}

  2. So x²+1 is irreducible over ℝ (degree-2 root test applies).

    x2+1 irreducible over Rx^2+1 \text{ irreducible over } \mathbb{R}

  3. Over ℂ, i and −i are roots, giving the factorization x²+1=(x−i)(x+i).

    x2+1=(x−i)(x+i) in C[x]x^2+1 = (x-i)(x+i) \text{ in } \mathbb{C}[x]

Answer: x²+1 is irreducible over ℝ (no real roots) but factors as (x−i)(x+i) over ℂ — irreducibility depends on the field.

Practice Problems

Difficulty 4/10

Is x² − 2 irreducible over ℚ? Over ℝ?

Difficulty 5/10

Show x³ − 2 is irreducible over ℚ using Eisenstein's criterion with p = 2.

Difficulty 6/10

Explain why x⁴+1 has no rational or real roots, yet is reducible over ℝ (though not over ℚ). Give its real factorization.

Quiz

Whether a polynomial is irreducible depends on:
The 'has no root implies irreducible' shortcut is valid only for polynomials of degree:
Eisenstein's criterion, when it applies at a prime p, guarantees:

Summary

  • f(x) is irreducible over F if it cannot be factored into two lower-degree polynomials over F; irreducibility depends on the field.
  • The root test (no root ⟹ irreducible) only works for degree 2 or 3; degree ≥4 polynomials can factor with no roots at all.
  • Eisenstein's criterion (a prime p dividing all but the leading coefficient, with p² not dividing the constant term) gives a quick sufficient test for irreducibility over ℚ.

References

  1. WebsiteWikipedia — Irreducible polynomial