Ring homomorphisms and isomorphisms
Use kernels and images to turn a structure-preserving map into an exact description of a quotient ring.
On this page
The question for today
What you’ll understand
- Check addition, multiplication, and identity preservation for a ring map.
- Identify the kernel and image of evaluation and reduction maps.
- Build the first isomorphism theorem from a well-defined bijection.
Substituting a value into a polynomial respects addition and multiplication. Reducing an integer modulo five does too. These maps can simplify a calculation while preserving its algebraic meaning, but they can also forget information. Kernels describe exactly what disappears, and images describe exactly what remains reachable. The first isomorphism theorem joins those two descriptions: after identifying the information a map cannot distinguish, the resulting quotient is the same ring structure as its image.
Preserve the operations, not merely the elements
A ring homomorphism from R to S preserves sums, products, and the multiplicative identity under our convention. These conditions force it to preserve zero and additive negatives as well. Checking only addition is insufficient: a map can preserve sums while changing products. Evaluation at a fixed field element is a ring homomorphism from the polynomial ring to that field because expanding a sum or product and then substituting gives the same answer as substituting first.
An isomorphism is a bijective ring homomorphism. Its inverse also preserves the operations, so it provides two names for the same algebraic structure. A bijection of underlying sets is not enough; the operation tables must correspond. Likewise, a map into a large ring need not cover that ring. Always distinguish a map's specified codomain from its image, which is the actual subset reached by its values.
The kernel records every collision
The kernel consists of elements sent to zero. It is an ideal because differences of zero-valued inputs remain zero-valued, and multiplying such an input by any ring element still maps to zero. More generally, two inputs have the same output precisely when their difference lies in the kernel. This gives a practical injectivity test: the map is injective exactly when its kernel contains only zero.
For evaluation of real polynomials at two, the kernel is the ideal generated by x minus two. Polynomial division writes every polynomial as a multiple of x minus two plus a constant remainder; evaluating at two identifies that remainder. The image is all real numbers because constant polynomials already produce every real output. Thus infinitely many different input polynomials can produce a given output, but their differences are controlled by one simple ideal.
Factor through the information you kept
Send the class of a modulo the kernel to the value of the original map at a. The collision criterion makes this induced map well-defined and injective. It is surjective onto the image by the definition of image, and it preserves the operations because the original map does. This constructs the first isomorphism theorem rather than treating its notation as a cancellation of symbols.
The theorem does not identify the quotient with the entire codomain unless the original map is surjective. The inclusion from integers into rational numbers has zero kernel but reaches only the integers. Its induced isomorphism therefore identifies the integer quotient by zero with that integer image, not with all rationals. When applying the theorem, name the actual map, verify its kernel, and justify its image before writing an isomorphism.
Work it through
Describe a polynomial quotient by evaluation
Consider given by . Identify the kernel and the quotient it determines.
Substitution at three preserves sums, products, and the constant one, so this is an identity-preserving ring homomorphism. Every rational number is attained by the corresponding constant polynomial, which proves surjectivity.
Divide f by to write with rational constant r. Evaluating gives , so f is in the kernel exactly when its remainder is zero, equivalently when f is a multiple of .
Apply the first isomorphism theorem to obtain . The class of corresponds to ten, since evaluating its representative at three gives ten.
The kernel is , the image is , and the induced isomorphism evaluates each class at three.
The living notebook
Explore the model
Interactive lab · function
Inspect evaluation as a homomorphism
The lab displays . Fix position x at two and predict how changing coefficient a changes the evaluation output: a becomes four times a. Then set x to zero and observe that this entire restricted family maps to zero. The lab shows evaluation of one polynomial family, not a complete kernel calculator.
- y at chosen x
- 0.608
- Tangent slope · 2ax
- 1.35
- Signed area · ax³/3
- 0.182
This lab uses only y = ax². Playback traces the curve within the fixed integration interval from 0 to x; it does not estimate numerical error or change the chosen point. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forEvaluation preserves arithmetic while often collapsing different polynomials to the same output.
Pause & reason
Check your understanding
Your turn
Try it yourself
For the reduction map , find the kernel and explain why the map is surjective.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Ask which integers represent the zero class, and where an arbitrary residue class comes from.
Compare with the solution
The kernel is the set of integers divisible by seven, the ideal (7). Every class is represented by an integer, so every codomain element has a preimage. Consequently the quotient of the integers by (7) is isomorphic to the entire codomain in this example. Two integers map to the same class precisely when their difference is divisible by seven.
Keep the idea
Take it with you
- A ring homomorphism preserves both operations and the identity under our convention.
- The kernel is an ideal and describes every pair of inputs with the same output.
- The quotient by the kernel is isomorphic to the image; the codomain may be larger.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.