The Isomorphism Theorems for Rings
How many essentially different quotients can a ring have? Can we list them without doing any computation? This is the concrete question the isomorphism theorems answer completely. Given a ring , its ideals correspond exactly to its quotient rings. Every homomorphic image of is, up to relabeling, one of these quotients. The isomorphism theorems make this correspondence precise. They turn a vague feeling that "quotienting and mapping are the same operation" into four sharp, provable statements. These theorems matter because they are the load-bearing structure of ring theory. Nearly every later classification result depends on them. This includes the structure of finite fields, the Chinese Remainder Theorem, and the identification of maximal ideals with fields. It also includes localization, and much of algebraic geometry's dictionary between rings and spaces. All of this rests on being able to freely translate between homomorphisms and quotients. Without this dictionary, one would have to re-derive basic facts about images and kernels from scratch every time a new ring appears. The big picture is this. A ring homomorphism carries exactly the same information as a surjection of onto a copy of its image, followed by an inclusion. The First Isomorphism Theorem says the image is a quotient of by the kernel. The Second and Third refine this. They describe what happens when you build quotients out of sub-objects of sub-objects, or quotients of quotients. The Correspondence Theorem then gives the master picture. The entire ideal lattice of is a faithful, order-preserving snapshot of the ideal lattice of lying above . This article states and proves all four theorems in full, with explicit hypotheses. It includes worked examples with genuinely asymmetric rings, not just toy cases. This ensures that every step of the machinery is exercised. It closes by previewing how these results feed directly into the Chinese Remainder Theorem and the classification of Prime Ideals and Maximal Ideals and Fields.
- The First Isomorphism Theorem says for any ring homomorphism .
- The Second Isomorphism Theorem relates a subring plus an ideal to a quotient built from their sum and intersection.
- The Third Isomorphism Theorem simplifies "a quotient of a quotient" back to a single quotient: .
- The Correspondence Theorem shows ideals of biject, order-preservingly, with ideals of containing .
- All four theorems are proved from the universal property of quotient rings, with no circularity.
- Together they justify treating "ring homomorphism" and "quotient ring" as two views of one phenomenon.
- Key idea: every ring homomorphism factors as a quotient map followed by an injection, and this factorization controls all substructure.
Where this lives today
The isomorphism theorems are the machinery behind the Chinese Remainder Theorem, which describes in terms of and for comaximal ideals — a direct application of the First Isomorphism Theorem to the product map . They are also the tool used to show that a maximal ideal of a commutative ring is equivalent to being a field, linking Prime Ideals and Maximal Ideals and Fields to the Correspondence Theorem's picture of the ideal lattice. In algebraic geometry, the Correspondence Theorem underlies the dictionary between subvarieties of an affine variety and ideals of its coordinate ring containing a fixed ideal. In cryptography and coding theory, quotients like (finite fields and their extensions) are analyzed via exactly this factorization of evaluation homomorphisms. In computer algebra systems, Gröbner basis algorithms implicitly use the correspondence between ideals and their quotient rings to compute with polynomial quotient structures efficiently.
:::quiz[In Example 2, why is for and in ?]
- Because and are comaximal
- Because any nonzero multiple of has degree at least 2, so cannot equal a nonzero constant ✓
- Because has integer roots
- Because is not actually a subring of
Ask the tutor: How do the isomorphism theorems specialize to prove the Chinese Remainder Theorem for when ?
Let and be rings (not necessarily commutative, not assumed to have identity unless stated; we use "ring" to mean a set with satisfying the usual axioms). A ring homomorphism is a map satisfying
for all (and if both rings have identity and the homomorphism is required to be unital). The kernel is
which is always a (two-sided) ideal of : an additive subgroup satisfying and for all . Given an ideal , the quotient ring is the set of cosets with operations
which are well-defined precisely because is an ideal. The canonical projection , , is a surjective ring homomorphism with .
Intuition
Think of a ring homomorphism as a lossy compression of . Elements that get sent to the same value in are, from the point of view of , indistinguishable. The kernel collects exactly the elements that get squashed to , and it turns out that two elements map to the same place in if and only if . So the partition of into "fibers of " is exactly the partition of into cosets of . The First Isomorphism Theorem is the statement that this coset partition, equipped with its natural ring structure, is not just in bijection with the image but is a ring isomorphic copy of it. The Second and Third theorems are bookkeeping devices for combining and simplifying quotients. If you have already quotiented by , and you want to quotient further by an ideal that lives "above" , the Third Isomorphism Theorem tells you this two-step quotient collapses to a single quotient by a bigger ideal — nothing is lost or gained by doing it in stages. The Correspondence Theorem is the payoff: it says the entire "ideal skeleton" of is just a relabeled copy of the part of the ideal skeleton of sitting above , with nothing added or removed.
Let and be rings and let be a ring homomorphism. Then: 1. is an ideal of . 2. is a subring of . 3. The map
is a well-defined ring isomorphism. Consequently,
Write .
(1) is an ideal. Since , subtracting from both sides in the abelian group gives , so . If then (using that is additive, hence a group homomorphism on , so ); thus , so is an additive subgroup. For and , , so ; similarly , so . Hence absorbs multiplication by on both sides, so is a two-sided ideal.
(2) is a subring. It is nonempty (). If then and . So is closed under subtraction and multiplication, hence a subring of .
(3) Well-definedness of . Suppose in , i.e. . Then , so . Hence does not depend on the choice of coset representative, and is a well-defined function .
is a ring homomorphism. For :
These use exactly the definitions of addition and multiplication in from Quotient Rings, which are well-defined because is an ideal by part (1).
is surjective. Any element of has the form for some , and , so hits every element of .
is injective. Suppose , i.e. . Then , so , which means . So is injective. Since is a bijective ring homomorphism, it is a ring isomorphism, and .
∎Let be a ring, let be a subring, and let be an ideal. Then: 1. is a subring of . 2. is an ideal of . 3. is an ideal of .
(1) contains . If (with ), then
since is closed under subtraction and is closed under subtraction. For products,
Here since is a subring; and since is an ideal (absorbing multiplication by any element of , in particular by elements of ), and is closed under addition. So the whole sum lies in (write it as the sum plus the ideal element ). Hence is closed under subtraction and multiplication, so it is a subring of .
(2) and is an additive subgroup, hence an additive subgroup of . Since and , for any we have and . So is an ideal of .
(3) is an intersection of two additive subgroups of , hence an additive subgroup of (it is a subset of closed under the group operations). For and : (since is a subring and ) and (since and absorbs multiplication by ); so . Similarly . Hence is an ideal of .
∎Let be a ring, let be a subring, and let be an ideal. Then is a subring of , is an ideal of , is an ideal of , and there is a ring isomorphism
The subring/ideal claims are exactly the preceding Sum and intersection of a subring and an ideal lemma, so it remains to construct the isomorphism. Define by
This makes sense because , so is a genuine coset in .
is a ring homomorphism. For ,
using the definitions of addition and multiplication on (valid since by the lemma).
is surjective. An arbitrary element of has the form for some . Since , , so . Hence every coset in is hit.
Computing the kernel. We claim . If and (the zero coset), then by definition of the coset equivalence (); combined with this gives . Conversely if then , so , i.e. in . So .
Conclusion. By the First Isomorphism Theorem applied to , which is surjective with kernel ,
This is the desired isomorphism (stated in the other order by convention).
∎Let be a ring and let be ideals of with . Then is an ideal of , and there is a ring isomorphism
Step 1: makes sense and is an ideal of . Since , every coset with is a well-defined element of ; set . This is an additive subgroup of (image of the additive subgroup under the additive group homomorphism , , restricted to ). For and : , and because ; so . Similarly . Hence , and the quotient ring is defined.
Step 2: Construct a surjective homomorphism with kernel . Let be the canonical projection , and let be the canonical projection . Both are surjective ring homomorphisms (canonical projections onto quotient rings are always surjective ring homomorphisms, as recalled in the definition block). Let
As a composite of ring homomorphisms, is a ring homomorphism. As a composite of surjections, is surjective.
Step 3: Compute . We have (the zero coset of , i.e. the coset itself) if and only if , i.e. if and only if for some , i.e. if and only if for some . Since and (as ), adding gives . Conversely if then trivially (take ), so . Hence
Step 4: Apply the First Isomorphism Theorem. Since is a surjective ring homomorphism with , the First Isomorphism Theorem gives
∎
Let be a ring and let be an ideal. Let be the canonical projection. Then induces an inclusion-preserving bijection
given by , with inverse given by . Moreover this bijection preserves inclusions in both directions (), and for such ,
The same statement holds with "ideal" replaced by "subring."
Let denote the set of ideals of containing , and let denote the set of ideals of . Define
is well-defined, i.e. is an ideal of for . Since , this was verified in Step 1 of the Third Isomorphism Theorem proof.
is well-defined, i.e. is an ideal of containing , for any ideal . Preimages of ideals under ring homomorphisms are always ideals: if then (as is an additive subgroup), so ; and for , (as absorbs multiplication by the arbitrary element ), so , and similarly . Also because . So .
. Let . We must show . The inclusion is immediate (if then , so ). For the reverse inclusion, suppose , i.e. for some . Then (using the hypothesis ). Since and , we get . Hence , giving equality. This step crucially uses ; without it, the argument fails (see the counterexample below).
. Let . We must show . The inclusion holds for any function's preimage. For the reverse inclusion, since is surjective, every element of has the form for some ; then by definition, so . This uses surjectivity of , which holds since is a canonical projection. Thus and are mutually inverse bijections between and .
Order preservation. If in , then clearly , i.e. , since is a function. Conversely, if , apply (order-preserving by the same reasoning, since preimages of nested sets are nested) to get , using the bijectivity just proved. So .
The quotient formula. For , i.e. , the isomorphism is exactly the Third Isomorphism Theorem, already proved above, and by definition.
The subring version. The identical argument works verbatim replacing "ideal" by "subring" throughout: preimages and images of subrings under a ring homomorphism are subrings (the same closure-under-subtraction-and-multiplication computations apply, using only that and , without ever using the ideal-absorption property), and the same two inclusion arguments ( using , and using surjectivity) go through unchanged.
∎Worked examples
Example 1: First and Third Isomorphism Theorems in . Let and let be evaluation at followed by reduction mod , i.e.
This is a ring homomorphism because evaluation at a fixed element followed by a ring homomorphism () is a composite of ring homomorphisms. Kernel. We claim , the ideal generated by and . Indeed, means . Writing (polynomial division by the monic linear polynomial ), we see if and only if , i.e. iff . So indeed . Image. is surjective onto : for any , the constant polynomial maps to . By the First Isomorphism Theorem,
Now use the Third Isomorphism Theorem to see this as a two-step quotient. Let . There is an isomorphism (evaluation at , an entirely analogous First Isomorphism Theorem argument with kernel exactly since in , valid because is monic). Under this isomorphism, the ideal of corresponds to the ideal of (both generated by the image of ). Taking in the Third Isomorphism Theorem:
and translating the left side via gives — matching the direct First Isomorphism Theorem computation above, exactly as the theorem predicts.
Example 2: Second Isomorphism Theorem with genuinely asymmetric and . Let . Let (constant polynomials), a subring but not an ideal of (e.g. ). Let , the principal ideal generated by . Computing . An element of is an integer that is also a multiple of in , say . If then (for ), a contradiction unless , forcing . So
Computing . By definition , the set of all integer translates of multiples of . By the Second Isomorphism Theorem,
This says: inside , the image of the constant subring (namely ) is isomorphic to itself — the map sending is injective. This is a nontrivial and useful fact: it confirms that no nonzero integer becomes "identified with " after quotienting by , something not obvious without the theorem, since a priori a large enough combination might have collapsed. We can double check directly: if for an integer , then , forcing by the degree argument above — confirming injectivity and matching the isomorphism theorem's conclusion.
The Correspondence Theorem crucially requires before matching ideals of containing with ideals of . Drop this and the map can fail to be injective, wrecking the bijection. Take , , and let be the canonical projection. Consider two ideals of that do not contain : actually does contain (since ), so instead pick ideals not containing , e.g. and ; neither contains (e.g. and ). Now compute images under . We have , and reducing mod :
since cycling through . Similarly reduces mod 6: , so is generated by in , giving the same set . So even though as ideals of . The map is not injective once we allow ideals not containing , so the bijective correspondence fails without the hypothesis . The proof breaks exactly at the step showing : for , in fact , so , precisely because .
Scope, edge cases & common traps
| Situation | What holds | What can fail |
|---|---|---|
| not surjective | First Isom. Thm. still gives (image is a proper subring of codomain) | fails if isn't onto |
| Rings without unity, or non-unital homomorphisms | All four theorems hold verbatim (only additive-subgroup and ideal-absorption properties are used) | Confusing "subring" with "ideal" — a subring need not be an ideal |
| in Third Isom. / Correspondence Thm. | Nothing guaranteed | Bijection/injectivity can fail, as shown in the counterexample |
| Non-commutative | All theorems hold with two-sided ideals throughout | One-sided ideals do not generally support quotient ring structure |
| a subring but not an ideal, in Second Isom. Thm. | Theorem still applies as stated (, computed correctly) | Assuming is not needed — only needs to be an ideal |
The mathematician behind it
Origins · 1 minEmmy Noether and how this was discovered
Emmy Noether transformed algebra from a subject about specific equations and formulas into the study of abstract structures — rings, ideals, modules — defined by their properties. The isomorphism theorems, though often first encountered for groups, were developed by Noether and her school in exactly the generality needed to unify ring theory, and her 1927 paper on the structure of ideal theory made the ideal-quotient correspondence a central organizing tool of the subject.
Do the isomorphism theorems require rings to be commutative?
No. All four theorems hold for arbitrary rings, commutative or not, as long as "ideal" means two-sided ideal. The proofs use only the additive group structure, the absorption property and , and the universal property of quotients — none of these require commutativity. In fact these are the same theorems (suitably specialized) that hold for groups, replacing "normal subgroup" with "ideal." The only place commutativity becomes essential in ring theory is later, when discussing prime and maximal ideals via being an integral domain or field, since those notions depend on commutative cancellation properties.
Does the ring need to have a multiplicative identity for these theorems to hold?
No. The theorems as proved here use only additive-group reasoning plus the ideal absorption property and homomorphism properties , . None of the proofs invoke . If your convention requires ring homomorphisms to send , then extra care is needed only in checking that induced maps between quotients respect identities, which they automatically do since .
How does the First Isomorphism Theorem for rings relate to the one for groups?
A ring homomorphism is in particular a homomorphism of the underlying additive groups, so the group-theoretic First Isomorphism Theorem already gives an additive group isomorphism . The ring-theoretic content is the extra verification that this same bijection also respects multiplication, and that is not just a normal (here, every) additive subgroup but an ideal, so that carries a ring structure at all. The proof given above rebuilds this from scratch rather than quoting the group version, to keep ring-multiplicativity checks explicit.
Can the Second Isomorphism Theorem fail if is only a subring, not an ideal?
Yes, dramatically. The proof needs (or at least an ideal of ) so that is a well-defined quotient ring and so that the kernel computation goes through with actually being a ring homomorphism. If is merely a subring, need not even be closed under multiplication, so may not make sense as a quotient ring, and the entire construction collapses before it starts.
Is the bijection in the Correspondence Theorem also a ring isomorphism of some kind?
The Correspondence Theorem gives a bijection between two sets of ideals (a poset isomorphism, since it also preserves inclusions both ways), not directly a ring isomorphism. However, for each ideal in the correspondence, the theorem additionally supplies a genuine ring isomorphism , which is the Third Isomorphism Theorem attached to each matched pair. So the "lattice" correspondence is set/order-theoretic, while the quotient formula attached to it is ring-theoretic.
Why is it called the "Diamond" Isomorphism Theorem sometimes?
The name comes from the shape of the associated Hasse diagram: draw at top, and as two incomparable middle nodes, and at the bottom, with sitting above both and . Extending upward to include above and , and below both, produces a diamond-shaped lattice of four (or five, including ) nodes, which is the visual mnemonic for the Second Isomorphism Theorem.
What goes wrong if I try to apply the Third Isomorphism Theorem with instead of ?
The statement doesn't parse: is only defined when , since otherwise the cosets for need not partition consistently into a subset of in the intended sense (some "coset representatives" from would not even be well-defined relative to if , since might not contain at all, meaning as a quotient makes no sense). You would instead want paired with the different quotient , which is the same theorem with the roles of and swapped.