The course has built new rings twice by the same method. Congruence modulo $n$ sorted the integers into classes that could be added and multiplied, giving $\mathbb{Z}_n$. Congruence modulo a polynomial did the same in $F[x]$, giving the rings $F[x]/(p(x))$ and with them new fields. Can any ring be reduced modulo anything, and what decides whether the result is a field?
In both constructions what mattered about the modulus was the set of its multiples. That set is closed under subtraction, and it absorbs multiplication by anything in the ring. A subset of a ring with those two properties is an ideal. This unit carries the construction to any ideal of any ring. Congruence modulo an ideal $I$ is an equivalence relation that respects both operations. Its classes are the cosets $a + I$, and they form the quotient ring $R/I$.
Two questions organize the unit.
- How do we describe an ideal? In $\mathbb{Z}$ and in $F[x]$ every ideal consists of the multiples of one element, by the division algorithm. Rings with this property are principal ideal domains. In $\mathbb{Z}[x]$ some ideals need two generators. In $\mathbb{Z}[\sqrt{-5}]$ the failure of one generator goes with the failure of unique factorization, which is where ideals came from historically.
- What does $R/I$ look like? It is an integral domain exactly when $I$ is a prime ideal, and a field exactly when $I$ is a maximal ideal. That makes the theorem that $F[x]/(p(x))$ is a field for irreducible $p(x)$ a special case. The first isomorphism theorem identifies the quotient by the kernel of a homomorphism, the set of elements sent to 0, with the image. It is usually the quickest way to recognize a quotient ring.
The unit covers Chapter 6 of the course text (Hungerford, 2014), §§6.1 to 6.3, with Judson (2026, §§16.3 and 16.4, and parts of §§17.3 and 18.2) as a free companion. The class sessions introduced ideals as the sets one can work modulo and tested candidate subsets for absorption. They computed with ideals generated by two integers, proved that $\mathbb{Z}$ is a principal ideal domain and that $\mathbb{Z}[x]$ is not, built quotient rings of $\mathbb{Z}[x]$, and applied the first isomorphism theorem to reduction and evaluation maps. Prime and maximal ideals, from §6.3 of the course text, are covered in the second article, Congruence Modulo an Ideal and Quotient Rings, where they classify quotients. The first isomorphism theorem article then uses them to read off which quotients are fields.
Articles
The articles are in reading order; each ends with a link to the next.
- Ideals and Principal Ideal Domains: which subsets can serve as moduli, and when one generator suffices. Why a subring is not enough (working modulo $\mathbb{Z}$ inside $\mathbb{Q}$), the definition and the ideal test, examples and non-examples, ideals containing a unit and the ideals of a field. Principal and finitely generated ideals, $(a, b) = (\gcd(a, b))$ in $\mathbb{Z}$ and its polynomial twin, and generators that differ by a unit. Every ideal of $\mathbb{Z}$ and of $F[x]$ is principal, and $\mathbb{Z}_{45}$ has six ideals, shown in a figure. The ideal $(2, x^2 + x + 1)$ of $\mathbb{Z}[x]$ needs two generators. Irreducible versus prime elements, with $\mathbb{Z}[\sqrt{-5}]$, where 6 factors in two ways, and a short history of Kummer's and Dedekind's ideals.
- Congruence Modulo an Ideal and Quotient Rings: how to compute modulo an ideal, and when the result is a field. Congruence modulo an ideal and where absorption is needed, cosets, the quotient ring $R/I$ and the natural homomorphism, with $\mathbb{Z}_n$ and $F[x]/(p(x))$ as quotients. A field with 25 elements built as $\mathbb{Z}[x]/(5, x^2 - 3)$, beside the ring $\mathbb{Z}[x]/(5, x^2 - 4)$ with zero divisors. Prime ideals and integral domains, maximal ideals and fields, the maximal ideals of $\mathbb{Z}$ and $F[x]$, nonzero prime ideals in principal ideal domains and prime ideals in finite rings, and the ideals of a quotient.
- Kernels and the First Isomorphism Theorem for Rings: how to recognize a quotient ring. Kernels as ideals and the test for one-to-one maps, homomorphisms out of a field and the Frobenius automorphism of a finite field. The first isomorphism theorem and how to use it: $\mathbb{Z}[x]/(2, x^2 + x + 1)$ as the field with four elements, evaluation at a root and minimal polynomials (with $\mathbb{C}$ and $\mathbb{Q}(\sqrt 2)$ at one stroke), and $\mathbb{Z}_n/(d) \cong \mathbb{Z}_d$. The Gaussian integers modulo $n$ and which primes generate maximal ideals of $\mathbb{Z}[i]$, and $(x^2 + 1)$ as a prime but not maximal ideal of $\mathbb{Z}[x]$. The Chinese remainder theorem for rings, with $\mathbb{Z}[x]$ modulo $(x^2 + 1)(x^2 + x + 1)$ as a product with $\mathbb{Z}[i]$ as a factor, and the images of $\mathbb{Z}$.
Three constructions, one construction
| $\mathbb{Z}$ modulo $n$ | $F[x]$ modulo $p(x)$ | $R$ modulo an ideal $I$ | |
|---|---|---|---|
| modulus | the multiples $(n)$ | the multiples $(p(x))$ | any ideal $I$ |
| $a \equiv b$ when | $n \mid a - b$ | $p(x) \mid a - b$ | $a - b \in I$ |
| classes | $[a] = a + (n)$ | $[f] = f + (p)$ | cosets $a + I$ |
| representatives | remainders $0, \ldots, n - 1$ | remainders of degree $< \deg p$ | no standard choice |
| ring of classes | $\mathbb{Z}_n$ | $F[x]/(p(x))$ | $R/I$ |
| integral domain when | $n$ prime | $p$ irreducible | $I$ prime |
| field when | $n$ prime | $p$ irreducible | $I$ maximal |
Read down the last column for the general construction. In $\mathbb{Z}$ and $F[x]$ the last two rows coincide, because in a principal ideal domain the nonzero prime ideals are maximal.
Related topics
The unit generalizes Congruence and Modular Arithmetic and Congruence in Polynomial Rings and Field Extensions. Its proofs that $\mathbb{Z}$ and $F[x]$ are principal ideal domains reuse the division algorithms of Arithmetic in the Integers and Polynomial Arithmetic. It completes Homomorphisms and the Chinese Remainder Theorem, which previewed the kernel of the map from the Eisenstein integers onto $\mathbb{Z}_7$ and the ring version of the Chinese remainder theorem.
The next units turn to groups, starting with Groups. There the subgroups one can work modulo are the normal subgroups. Cosets, Normal Subgroups and Quotient Groups repeats this unit with one operation, ending with the first isomorphism theorem for groups.
References
- Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 6, with the Chinese remainder theorem for rings in §14.3. Brooks/Cole, Cengage Learning. The course text. record · 44 pages
- Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026), §§16.3 and 16.4, §17.3.1 and §18.2. Free online at judsonbooks.org. record · 44 pages