Homomorphisms and the Chinese Remainder Theorem

The seventh unit of a rings-first abstract algebra course. Ring homomorphisms, maps that respect addition and multiplication, with reduction modulo n, evaluation, a map from the Eisenstein integers onto Z_7 and the Frobenius map as examples; isomorphisms and the properties they preserve, which tell apart three rings with nine elements; the characteristic of a ring; and the Chinese remainder theorem, that Z_mn is isomorphic to Z_m x Z_n exactly when gcd(m, n) = 1, with simultaneous congruences, idempotents, square roots of 1, RSA decryption, Euler's phi and the version for polynomials.

The earlier units built many rings and kept finding the same ring twice. The complex numbers reappeared as $\mathbb{R}[x]/(x^2 + 1)$. The field with nine elements was built from $\mathbb{Z}_3[i]$ and twice more from polynomials over $\mathbb{Z}_3$. And the direct product $\mathbb{Z}_3 \times \mathbb{Z}_7$ behaved, element for element, like $\mathbb{Z}_{21}$. When are two rings "the same ring under different names", and what does knowing it buy us?

This unit makes the phrase precise. A homomorphism is a function between rings that respects addition and multiplication. An isomorphism is a homomorphism that is also a one-to-one correspondence. Isomorphic rings share every property that can be stated in terms of their operations. So a result proved for one ring holds for the other, and a single differing property, such as the number of units, proves that two rings are not isomorphic.

The unit has two steps.

  1. First, the definitions and the tools. Homomorphisms send 0 to 0 and negatives to negatives, but not always 1 to 1. Isomorphisms preserve units, zero divisors and the characteristic, which is enough to tell apart three rings with nine elements.
  2. Then, the leading example. The Chinese remainder theorem says that when $m$ and $n$ are relatively prime, sending a number modulo $mn$ to its pair of remainders is an isomorphism $\mathbb{Z}_{mn} \cong \mathbb{Z}_m \times \mathbb{Z}_n$. Arithmetic modulo 45 is arithmetic modulo 5 and modulo 9 carried out side by side.

In the older language of congruences, the theorem says that any system of congruences to pairwise relatively prime moduli has a solution, unique modulo their product. Bezout's identity finds it. The theorem accounts for several facts met earlier:

  • why $\varphi(mn) = \varphi(m)\varphi(n)$;
  • why $x^2 = 1$ has eight solutions in $\mathbb{Z}_{24}$;
  • how the holder of an RSA key decrypts one prime at a time.

The running example of the second article is $\mathbb{Z}_{45}$, read as $\mathbb{Z}_5 \times \mathbb{Z}_9$. Its elements 36 and 10, each its own square, explain how the ring splits into two pieces.

The unit covers §3.3 of the course text (Hungerford, 2014), with the Chinese remainder theorem as the class sessions presented it. Judson (2026, §§16.2, 16.3 and 16.5) is a free companion. The class sessions defined homomorphisms and isomorphisms and tested candidate maps. They proved that homomorphisms send 0 to 0 and that an onto homomorphism carries the identity along. They proved the Chinese remainder theorem for two moduli, worked a solution of a pair of congruences, and used the theorem to split large computations.

Articles

  • Ring Homomorphisms and Isomorphisms: what exactly is a map that respects both operations, and what does it preserve? The article opens with two rings of four elements that are one ring. It gives examples (reduction and change of modulus, evaluation, the Eisenstein integers onto $\mathbb{Z}_7$ by $\omega \mapsto 2$, the Frobenius map and conjugation in $\mathbb{Z}_3[i]$) and maps that respect only one operation (determinant, transpose). It proves the first properties of homomorphisms, shows what happens to the identity and to units, and derives the characteristic of a ring from the homomorphisms out of $\mathbb{Z}$. It closes with composites and inverses, the properties isomorphisms preserve, three rings with nine elements that are pairwise not isomorphic, and the dual numbers $\mathbb{R}[x]/(x^2)$ as a ring of matrices.
  • The Chinese Remainder Theorem: why does Sunzi's recipe for remainders always work, and what does it say about rings? The article solves two congruences through Bezout's identity and handles moduli with a common factor. It proves the isomorphism $\mathbb{Z}_{mn} \cong \mathbb{Z}_m \times \mathbb{Z}_n$ and why it fails when $\gcd(m, n) > 1$. It then finds idempotents, computes a power and a product through the isomorphism, counts square roots of 1, and recombines RSA decryption in the form of the PKCS #1 standard. It closes with Euler's $\varphi$ as a product, any number of moduli, and the theorem for polynomials as Lagrange interpolation.

Isomorphisms met so far

Rings Isomorphism Where
$\mathbb{R}[x]/(x^2 + 1)$ and $\mathbb{C}$ $[a + bx] \mapsto a + bi$ Congruence-Class Arithmetic in Polynomial Rings
$\mathbb{Q}[x]/(x^2 - 2)$ and $\mathbb{Q}(\sqrt 2)$ $[a + bx] \mapsto a + b\sqrt 2$ Congruence-Class Arithmetic in Polynomial Rings
$\mathbb{Z}_3[x]/(x^2 - 2)$ and $\mathbb{Z}_3[x]/(x^2 + x + 2)$ a square root of 2 to a square root of 2 Building Fields from Irreducible Polynomials
$\mathbb{Z}_2[x]/(x^2 + x + 1)$ and four matrices over $\mathbb{Z}_2$ $[x] \mapsto A$ with $A^2 = A + I$ Ring Homomorphisms and Isomorphisms
$\mathbb{R}[x]/(x^2)$ and the matrices $\begin{pmatrix} a & b \\ 0 & a \end{pmatrix}$ $[a + bx] \mapsto \begin{pmatrix} a & b \\ 0 & a \end{pmatrix}$ Ring Homomorphisms and Isomorphisms
$\mathbb{Z}_{mn}$ and $\mathbb{Z}_m \times \mathbb{Z}_n$, $\gcd(m, n) = 1$ $[a] \mapsto ([a]_m, [a]_n)$ The Chinese Remainder Theorem

The unit names what the Rings unit and Congruence in Polynomial Rings and Field Extensions were already doing when they compared rings. It rests on Congruence and Modular Arithmetic and on Bezout's identity from Arithmetic in the Integers. The Chinese remainder theorem completes the computations of Public-Key Cryptography, where Fermat's little theorem and the RSA cryptosystem combined results modulo two primes.

The next unit, Ideals and Quotient Rings, studies the elements a homomorphism sends to 0. They form an ideal, the kernel, and the first isomorphism theorem identifies the image of any homomorphism with a quotient ring. Groups have homomorphisms of their own, in Group Homomorphisms and Isomorphisms.

References

  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.3, with the Chinese remainder theorem in Chapter 14. Brooks/Cole, Cengage Learning. The course text. record · 44 pages
  • Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026), §§16.2, 16.3 and 16.5. Free online at judsonbooks.org. record · 44 pages