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 , the polynomials with coefficients in form the ring . It behaves much like the integers:
- Division algorithm. For , there are unique and with and .
- Factor theorem. exactly when divides .
- Irreducibles play the role of primes. A polynomial of degree at least is irreducible if it is not a product of two polynomials of lower degree in .
Irreducibility depends on :
| Polynomial | Over | Over | Over |
|---|---|---|---|
| irreducible | factors | ||
| irreducible | irreducible |
Why roots decide degree 2 and 3
If a quadratic or cubic factors, the degrees of the factors add to or , so one factor must have degree . A degree-1 factor means a root in . So a quadratic or cubic is irreducible exactly when it has no root in the field. This test fails from degree on: has no real roots but still factors over . Over a finite field , checking for roots takes only substitutions.
Worked examples
Common mistakes
Practice problems
-
Is irreducible over ?
Answer
Yes
Full solution
and : no roots in a quadratic.
-
Factor over .
Answer
, that is
Full solution
The roots are and , since and are mod .
-
Is irreducible over ?
Answer
Yes
Full solution
The squares mod are ; none equals , so there are no roots.
-
Find a root of in .
Answer
Full solution
.
-
Use Eisenstein’s criterion to show is irreducible over .
Answer
Use .
Full solution
divides and , not the leading , and does not divide the constant .
-
Factor over , over and over .
Answer
; ;
Full solution
Each larger field supplies roots the smaller one lacks.
-
Divide by over . What is the remainder?
Answer
Full solution
By the remainder theorem it is .
-
A student says is irreducible over because it has no real roots. Correct it.
Answer
It equals .
Full solution
The root test only works for degree and . 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 ℚ.