The squares in $\mathbb{Z}_3$ are 0, 1 and 1, so 2 has no square root there. The reals had the same problem with $-1$, and the complex numbers solved it. Can $\mathbb{Z}_3$ be enlarged in the same way? This unit answers yes, by a method that works for every field and every polynomial.
The method is an old one moved to polynomials. The second unit built $\mathbb{Z}_n$ by ignoring multiples of a fixed integer $n$. Congruence modulo $n$ sorted the integers into classes, the classes could be added and multiplied, and $\mathbb{Z}_n$ was a field exactly when $n$ was prime. The previous unit gave polynomials over a field the divisibility theory of the integers: a division algorithm, greatest common divisors with Bezout's identity, and unique factorization. This unit puts the two together. Ignoring multiples of a fixed polynomial $p(x)$ gives congruence modulo $p(x)$. Its classes form a ring $F[x]/(p(x))$, and that ring is a field exactly when $p(x)$ is irreducible.
The proofs are the integer proofs with polynomials in every place. The articles set them out in the same order, so the parallel can be read line by line. The unit takes three steps:
- first the relation itself: congruence modulo $p(x)$, its classes, and the rules for computing with it;
- then the classes as a ring, with $\mathbb{C}$ and $\mathbb{Q}(\sqrt 2)$ as first examples, and units decided by greatest common divisors;
- finally the irreducible modulus, which gives a field with a new root, and finite fields.
What is new is the payoff. The class of $x$ in $F[x]/(p(x))$ is a root of $p(x)$. So an irreducible polynomial with no root in $F$ acquires one in a larger field, built from nothing but $F[x]$ and congruence. The complex numbers arise this way, as $\mathbb{R}[x]/(x^2 + 1)$, and so does a nine-element field that contains $\mathbb{Z}_3$ and a square root of 2. This is Kronecker's theorem: every polynomial over a field has a root somewhere. Over $\mathbb{Z}_p$ the construction gives finite fields of $p^n$ elements. They have no counterpart among the integers modulo $n$, and they are used in coding and cryptography.
The quartic $f(x) = (x^2 - 2)(x^2 + x + 1)$ of the previous unit runs through all three articles, as a modulus and as a polynomial that gains roots.
The unit covers Chapter 5 of the course text (Hungerford, 2014), §§5.1 to 5.3. Judson (2026, Chapters 21 and 22) is a free companion for extension fields and finite fields. The class sessions covered congruence modulo a polynomial and counted the classes over finite fields. They computed in rings such as $\mathbb{Z}_3[t]/(t^2 + 2t + 2)$, built fields with four and nine elements, and introduced subrings, subfields and extension fields along the way.
Articles
- Congruence Modulo a Polynomial: when do two polynomials count as the same, and which rules of arithmetic survive? The definition in three equivalent forms, and congruence as an equivalence relation. The classes and their unique remainders of degree less than $\deg p$, with the count $q^d$ over a field with $q$ elements. Sums, products and substitution, and the reduction of $x^{100}$ modulo $x^3 + x^2 + 1$ over $\mathbb{Z}_2$. Cancellation down to the modulus $p/\gcd(k, p)$.
- Congruence-Class Arithmetic in Polynomial Rings: can the classes be added and multiplied like numbers, and what number systems result? The ring $F[x]/(p(x))$, the proof that its operations are well defined, and rules that are not. The ring laws, the copy of $F$ inside, and the class $\alpha = [x]$ with $p(\alpha) = 0$. $\mathbb{R}[x]/(x^2 + 1)$ as $\mathbb{C}$ and $\mathbb{Q}[x]/(x^2 - 2)$ as $\mathbb{Q}(\sqrt 2)$, through evaluation at a root. Units by Bezout's identity, zero divisors from a reducible modulus with the running quartic $f(x)$, and two rings with sixteen elements side by side.
- Building Fields from Irreducible Polynomials: when is the ring a field, and what does it contain that $F$ did not? The theorem that $F[x]/(p(x))$ is a field if and only if $p(x)$ is irreducible. Extension fields, Kronecker's theorem, and the roots of $f(x)$ in extensions of $\mathbb{Q}$ and of $\mathbb{Z}_{11}$. Two fields with nine elements, an isomorphism between them, and a generator of the nonzero elements. Then $a^q = a$, and $x^9 - x$ as a product of all irreducibles of degree 1 and 2 over $\mathbb{Z}_3$. It ends with the prime-power sizes of finite fields and $\mathbb{F}_{256}$ in AES.
Parallels with the integers
| Modulo $n$ in $\mathbb{Z}$ | Modulo $p(x)$ in $F[x]$ |
|---|---|
| $a \equiv b$ when $n \mid a - b$ | $f \equiv g$ when $p(x) \mid f - g$ |
| classes $[0], \ldots, [n - 1]$, one per remainder | one class per remainder of degree less than $\deg p$; $q^{\deg p}$ classes over a field with $q$ elements |
| $\mathbb{Z}_n$, a commutative ring with identity | $F[x]/(p(x))$, a commutative ring with identity containing $F$ |
| $[a]$ a unit if and only if $\gcd(a, n) = 1$ | $[h]$ a unit if and only if $\gcd(h, p) = 1$ |
| $\mathbb{Z}_n$ a field if and only if $n$ is prime | $F[x]/(p(x))$ a field if and only if $p(x)$ is irreducible |
| $a^p = a$ in $\mathbb{Z}_p$ | $a^q = a$ in a field with $q$ elements |
The integer results are in congruence modulo $n$, the integers modulo $n$ and units and zero divisors in $\mathbb{Z}_n$, with Fermat's theorem in Fermat's Little Theorem.
Related topics
The unit applies Polynomial Arithmetic. The division algorithm supplies the remainders that represent the classes, Bezout's identity supplies inverses, and irreducible polynomials play the part of primes. It uses the vocabulary of Rings, in particular integral domains and fields and subrings and subfields.
The next units generalize the construction. Homomorphisms make "the same ring under different names" precise, starting with Ring Homomorphisms and Isomorphisms. Ideals and Quotient Rings replaces the multiples of $n$ or of $p(x)$ by any ideal of any ring.
References
- Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 5. Brooks/Cole, Cengage Learning. The course text. record · 44 pages
- Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026), Chapters 21 and 22. Free online at judsonbooks.org. record · 44 pages