Engineering / Mathematics — Rings and Polynomial Rings
Zero Divisors and Integral Domains
Zero divisors, integral domains, and why the absence of zero divisors is what makes cancellation and root counting work.
Executive summary
A zero divisor is a non-zero element whose product with some other non-zero element is zero. Rings without them are integral domains, and they support cancellation.
The absence of zero divisors is exactly what makes a polynomial of degree k have at most k roots, which underpins several algorithms.
Learning objectives
- Define zero divisors and integral domains.
- Prove the cancellation law in an integral domain.
- Explain the consequence for polynomial root counting.
01Zero divisors
Zero divisor and integral domain
a ≠ 0 is a zero divisor if ab = 0 for some b ≠ 0.
An integral domain is a commutative ring with unity, with 1 ≠ 0, containing no zero divisors.
Cancellation
In an integral domain, ab = ac and a ≠ 0 imply b = c.
Reason. a(b − c) = 0 with a ≠ 0 forces b − c = 0.
This is the same cancellation issue met in modular arithmetic. Cancelling modulo n fails exactly when the cancelled element is a zero divisor, which happens exactly when it shares a factor with n.
02Which rings are domains
| Ring | Integral domain? | Reason |
|---|---|---|
| Z | Yes | A product of non-zero integers is non-zero |
| Z_p, p prime | Yes | A field; fields have no zero divisors |
| Z_n, n composite | No | n = ab gives ab ≡ 0 with both factors non-zero |
| F[X] over a field | Yes | Degrees add, so leading terms cannot cancel |
| Z_n[X], n composite | No | Inherits zero divisors from the coefficients |
Every field is an integral domain, since a unit cannot be a zero divisor. The converse fails — Z is a domain but not a field — though every finite integral domain is a field, by the pigeonhole argument that multiplication by a non-zero element is injective hence surjective.
03Root counting
Root bound
Over an integral domain, a non-zero polynomial of degree k has at most k roots.
The proof factors out each root: if f(r) = 0 then f(X) = (X − r)g(X) with deg g = k − 1, and any further root must be a root of g because the domain has no zero divisors. Induction completes the argument.
This failure is not merely an inconvenience. It is exploited constructively: the Miller–Rabin test detects compositeness precisely by finding a non-trivial square root of 1, which can exist only when the modulus is composite.
04Frequently asked questions
Can a unit be a zero divisor?
No. If a is a unit and ab = 0, multiplying by the inverse gives b = 0. This is why fields, where every non-zero element is a unit, are automatically integral domains.
Is every finite integral domain a field?
Yes. Multiplication by a fixed non-zero element is injective by cancellation, hence surjective on a finite set, so 1 is in its image and the element has an inverse.
Why does Z_n[X] inherit zero divisors?
Because constant polynomials copy the coefficient ring. If ab = 0 in Z_n with both non-zero, the same holds for the corresponding constant polynomials, so the polynomial ring is not a domain either.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 215-217.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.