Coset construction, polynomial quotients, and the CRT
Treat two elements as equal whenever they differ by a member of an ideal, and you get a new ring. This one move builds clock arithmetic and finite fields.
Slide n and press Collapse to fold the colored number line into a circle of n residue classes.
Integers are colored by residue class mod 4. Click Collapse to fold the number line into a circle of 4 elements.
Given a ring R and an ideal I, the quotient ring R/I collects elements into cosets: a + I = {a + i : i ∈ I}. Two elements are "the same" in R/I if their difference belongs to I. This is the ring-theoretic analogue of modular arithmetic, and it is the fundamental construction for building new rings from old ones.
The most familiar quotient ring: Z/(n) = Z/nZ. The integers collapse into n residue classes, each a coset of the ideal (n). The arithmetic of Z/nZ is just ordinary arithmetic with results reduced modulo n. Watch the number line fold into a circle.
Key insight: The quotient Z/(n) identifies all integers that differ by a multiple of n. The resulting ring has exactly n elements, and its structure depends entirely on the prime factorization of n.
Pick an irreducible polynomial over F₂ to build a field from it. Scan the multiplication table: every nonzero element has an inverse.
Quotient ring F₂[x] / (x²+x+1) builds GF(4). The colored grid shows the multiplication table.
The same construction works for polynomial rings. Take F₂[x] and quotient by an irreducible polynomial p(x). The resulting ring F₂[x]/(p(x)) is a finite field! Its elements are polynomials of degree less than deg(p), with arithmetic performed modulo p(x). This is how finite fields GF(2ⁿ) are constructed in practice.
Key insight: Quotienting by an irreducible polynomial is exactly analogous to quotienting Z by a prime: both produce fields. The irreducible polynomial plays the role of a prime number.
Choose a pair of moduli and hover over an element of Z/nZ to highlight its pair of remainders. No two elements share a pair.
Since gcd(3, 5) = 1, CRT gives an isomorphism Z/15Z ≅ Z/3Z × Z/5Z. Hover over elements to highlight the bijection.
When n = pq with gcd(p, q) = 1, the Chinese Remainder Theoremgives a ring isomorphism Z/nZ ≅ Z/pZ × Z/qZ. Every element of Z/nZ is uniquely determined by its remainders modulo p and q. This decomposition reveals the internal structure of composite moduli.
Key insight: The CRT is a ring isomorphism, preserving both addition and multiplication. It decomposes a complicated ring into simpler factors, much like prime factorization decomposes integers.
Spot a mistake or have an idea?