Chapter 7 — Rings
Arithmetic with two operations: rings, ideals and quotient rings, ring homomorphisms, prime and maximal ideals, the hierarchy Euclidean ⇒ principal ideal ⇒ unique factorisation domain, and the polynomial rings in which fields are built.
In March 1847 Gabriel Lamé told the Paris Academy that he had proved Fermat's Last Theorem. His idea was to factor $x^p+y^p$ over the complex numbers as $(x+y)(x+\zeta y)\cdots(x+\zeta^{p-1}y)$, with $\zeta$ a primitive $p$-th root of unity, and then to argue as one does with ordinary integers. Joseph Liouville immediately asked the decisive question: is factorisation into primes unique in the ring $\mathbb{Z}[\zeta]$? Within weeks a letter arrived from Ernst Kummer in Breslau: it is not, in general, and he had known this for three years. Kummer rescued as much of the argument as he could by inventing "ideal numbers", which restore unique factorisation at the level of something more abstract than numbers. In 1871 Richard Dedekind replaced ideal numbers by ideals — subsets of a ring closed under addition and under multiplication by every ring element — and proved that in the rings of algebraic integers every ideal factors uniquely into prime ideals even when elements do not. David Hilbert gave the word "ring" (Zahlring) in 1897, and in the 1920s Emmy Noether in Göttingen turned these special theories into the abstract algebra of rings and ideals that every mathematician now learns.
Rings are where most practical algebra happens. Every digital transmission is protected by arithmetic in polynomial rings: the CRC checks on network packets divide by a fixed polynomial over $\mathbb{Z}_2$, and the Reed–Solomon codes used on CDs, QR codes and the Voyager probes compute in the field $\mathbb{Z}_2[x]/\langle f\rangle$ with $256$ elements. RSA encryption is arithmetic in $\mathbb{Z}_n$, sped up by the ring isomorphism $\mathbb{Z}_{pq}\cong\mathbb{Z}_p\times\mathbb{Z}_q$; and the post-quantum key-exchange standard ML-KEM, published by the US standards institute NIST in 2024, computes in the quotient ring $\mathbb{Z}_{3329}[x]/\langle x^{256}+1\rangle$. In this chapter Section 7.1 develops rings, units and zero divisors, ideals, quotient rings and homomorphisms; Section 7.2 prime and maximal ideals and the classes of domains in which arithmetic works like that of $\mathbb{Z}$; and Section 7.3 polynomial rings and the tests for irreducibility that Chapter 8 needs to build fields.
- verify the ring axioms, test subrings and ideals, and work fluently in $\mathbb{Z}_n$, $\mathbb{Z}[i]$, $\mathbb{Z}[\sqrt d]$, $M_n(R)$, $R\times S$ and function rings;
- find and count the units, zero divisors, nilpotent and idempotent elements of $\mathbb{Z}_n$ and of other small rings, and compute characteristics;
- form quotient rings and identify them with the first isomorphism theorem — e.g. $\mathbb{Z}[x]/\langle x^2+1\rangle\cong\mathbb{Z}[i]$ and $\mathbb{Z}[i]/\langle\alpha\rangle$;
- use the Chinese remainder theorem for rings and count ring homomorphisms $\mathbb{Z}_m\to\mathbb{Z}_n$;
- decide whether an ideal is prime or maximal by recognising the quotient as a domain or a field;
- distinguish irreducible from prime elements with norms, and factor Gaussian integers;
- place a ring in the hierarchy field ⊂ ED ⊂ PID ⊂ UFD ⊂ integral domain, with the standard counterexamples for each strict inclusion;
- divide polynomials, use Gauss's lemma, the rational root test, Eisenstein's criterion and reduction mod $p$ to prove irreducibility, and count irreducible polynomials over $\mathbb{F}_p$.
How this is examined
Ring theory supplies a steady share of the algebra questions in CSIR NET. Part B favours quick computations with a single answer: the number of units, zero divisors, nilpotent or idempotent elements of $\mathbb{Z}_n$ or of a product $\mathbb{Z}_m\times\mathbb{Z}_n$; the characteristic of a ring; the number of ideals, prime ideals or maximal ideals of $\mathbb{Z}_n$; the number of ring homomorphisms between two cyclic rings; the size or structure of a quotient such as $\mathbb{Z}[i]/\langle\alpha\rangle$ or $\mathbb{Z}_p[x]/\langle f\rangle$; the number of irreducible polynomials of small degree over $\mathbb{Z}_p$. Part C, where more than one option may be correct, presents statements to be judged: "this ideal is prime / maximal", "this ring is an integral domain / a field / a PID / a UFD", "this element is irreducible / prime", "this polynomial is irreducible over $\mathbb{Q}$ / $\mathbb{Z}_p$", "every subring (quotient) of a UFD is a UFD". The false options come from a short list of standard examples — $\langle x\rangle\subset\mathbb{Z}[x]$ prime but not maximal, $\langle2,x\rangle$ not principal, $\mathbb{Z}[x]$ a UFD but not a PID, $6=2\cdot3=(1+\sqrt{-5})(1-\sqrt{-5})$, $\mathbb{Z}\times\mathbb{Z}$ with zero divisors, $M_2(\mathbb{R})$ simple but not a division ring — and each section's ⚠️ box collects them. GATE MA asks very similar questions, frequently as numerical-answer items.
Sections in this chapter
Rings, Ideals and Quotient Rings
Rings and subrings; units, zero divisors, nilpotents and idempotents; integral domains, fields and the characteristic; $\mathbb{Z}_n$, matrix rings and the Gaussian integers; ideals and quotient rings; ring homomorphisms, the isomorphism theorems and the Chinese remainder theorem.
Prime and Maximal Ideals; ED, PID and UFD
Prime and maximal ideals through their quotients; ideals of $\mathbb{Z}$, $\mathbb{Z}_n$, $F[x]$, $\mathbb{Z}[x]$ and $C[0,1]$; irreducible versus prime elements and norms; Euclidean domains, PIDs and UFDs, with the Gaussian primes and the standard counterexamples.
Polynomial Rings and Irreducibility
The division algorithm in $F[x]$, roots and factors, Gauss's lemma, the rational root test, Eisenstein's criterion with shifts, reduction modulo $p$, irreducible polynomials over $\mathbb{R}$, $\mathbb{C}$, $\mathbb{Q}$ and $\mathbb{F}_p$, and cyclotomic polynomials.
A ring is an abelian group with a multiplication, so Chapter 6 is the main prerequisite: subgroups and cosets (§6.1), normal subgroups, quotient groups, homomorphisms and the isomorphism theorems (§6.2) — each has a ring version here, and the ring proofs reuse the group proofs. From number theory you need divisibility, gcd, Bézout's identity, Euclid's lemma and the Chinese remainder theorem (§5.2), and Euler's function and quadratic residues (§5.3). Complex numbers (§1.1) give the Gaussian integers. Matrices and determinants come from the linear algebra chapters of the sister course CSIR NET Unit 1 — Analysis and Linear Algebra, and the compactness of $[0,1]$ (used once, in §7.2) from its analysis chapters. Read the sections in order: §7.2 uses quotient rings and the isomorphism theorems of §7.1, and §7.3 builds on the Euclidean and unique factorisation domains of §7.2.