Engineering / Mathematics — Rings and Polynomial Rings
Ring Homomorphisms and Isomorphisms
Ring homomorphisms, kernels as ideals, and the first isomorphism theorem for rings.
Executive summary
A ring homomorphism preserves both operations and the identity. Its kernel is an ideal, and the first isomorphism theorem identifies the image with a quotient.
Reduction modulo n and evaluation at a point are the two homomorphisms that drive most of the algorithmic content of this subject.
Learning objectives
- Define ring homomorphisms and identify their kernels.
- State the first isomorphism theorem for rings.
- Recognise the two homomorphisms used algorithmically.
01Definition
Ring homomorphism
A map f : R → S with f(a+b) = f(a)+f(b), f(ab) = f(a)f(b) and f(1) = 1.
The condition f(1) = 1 is not automatic and must be imposed. Without it the zero map would qualify as a homomorphism, which is unhelpful.
Kernel is an ideal
ker f = {a : f(a) = 0} is an ideal of R, and im f is a subring of S.
Reason for absorption. If f(a) = 0 then f(ra) = f(r)f(a) = 0.
02The first isomorphism theorem
First isomorphism theorem for rings
For a ring homomorphism f : R → S, R / ker f ≅ im f.
This is the standard tool for identifying an abstractly defined quotient with something concrete. The evaluation map from F[X] to F sending X to a has kernel (X − a) and is surjective, so F[X]/(X−a) ≅ F.
| Homomorphism | Kernel | Theorem gives |
|---|---|---|
| Z → Z_n | nZ | Z/nZ ≅ Z_n |
| F[X] → F, X ↦ a | (X − a) | F[X]/(X−a) ≅ F |
| F[X] → F[X]/(f) | (f) | Defines the quotient algebra |
| Z_{mn} → Z_m × Z_n | Trivial for coprime m,n | Chinese remainder theorem |
03The two algorithmic homomorphisms
Reduction modulo n
Maps Z to Z_n, or Z[X] to Z_n[X]. Bounds coefficient growth by moving the computation into a finite ring. The basis of every modular algorithm.
Evaluation at a point
Maps R[X] to R by substituting a value. Reduces a polynomial problem to a coefficient problem, with interpolation as the inverse.
Both share a structure worth naming: apply the homomorphism, compute in the simpler image, then reconstruct. Chinese remaindering reconstructs from several reductions; interpolation reconstructs from several evaluations. They are the same technique in different rings.
04Frequently asked questions
Why is the image only a subring rather than an ideal?
Because the image need not absorb multiplication by all of S. The inclusion of Z into Q has image Z, which is a subring of Q but certainly not an ideal.
Is a bijective ring homomorphism an isomorphism?
Yes, and the inverse map is automatically a homomorphism, exactly as in the group case.
How does the theorem help computationally?
It licenses the identification of quotient rings with concrete objects. Knowing F_p[X]/(f) is a field with p^k elements, rather than merely a quotient, is what makes finite field arithmetic implementable.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 236-243.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.