Folioby Interconnected
Log InSign Up

The isomorphism theorems: three theorems, one idea

The isomorphism theorems form the structural backbone of group theory. Through concrete examples -- the determinant, the sign map, the exponential function -- we see that all three rest on a single principle: collapse the kernel and you get the image.

FO
Folio Official
March 1, 2026

In the previous article we introduced the kernel and image of a homomorphism φ:G→H and proved that the kernel is always a normal subgroup. A question was left open: what, concretely, is the quotient group G/kerφ?

The answer is startlingly simple: G/kerφ≅Imφ. Collapse the kernel and what remains is the image. This is the First Isomorphism Theorem, and it is the single most important structural result in group theory. The Second and Third Isomorphism Theorems, despite their billing as independent results in many textbooks, are both applications of the First.

1 The First Isomorphism Theorem

Theorem 1 (First Isomorphism Theorem).
Let φ:G→H be a group homomorphism. Then
G/kerφ≅Imφ.

To see why this is almost forced, consider the following diagram. Write K=kerφ, let π:G↠G/K denote the natural projection g↦gK, and let φˉ​:G/K→Imφ be the map induced by φ, namely φˉ​(gK)=φ(g):

φ
π
φˉ​
G
H
G/kerφ

Commutativity of the diagram means φ=φˉ​∘π: whether you go across the top or down-and-diagonal, you arrive at the same element of H.

Proof.
We verify four properties of φˉ​:G/K→Imφ.

Well-defined. If gK=g′K, then g−1g′∈K, so φ(g−1g′)=eH​, and hence φ(g)=φ(g′).

Homomorphism.
φˉ​(gK⋅g′K)​=φˉ​(gg′K)=φ(gg′)=φ(g)φ(g′)=φˉ​(gK) φˉ​(g′K).​

Injective. If φˉ​(gK)=eH​, then φ(g)=eH​, so g∈K, and gK=K is the identity in G/K.

Surjective. Every element of Imφ has the form φ(g)=φˉ​(gK). □

2 Putting the theorem to work

The real power of the First Isomorphism Theorem lies in its ability to identify unknown quotient groups. A quotient G/N is, by definition, a set of cosets equipped with a multiplication. But as an abstract object, it can be hard to visualize. The strategy is this:

  1. Find a homomorphism φ:G→H whose kernel is N.

  2. Then G/N=G/kerφ≅Imφ, and the quotient is identified.

Let us see this strategy in action.

Example 1: The determinant. The homomorphism det:GLn​(R)→R∗ has kernel SLn​(R) and is surjective. The theorem gives

GLn​(R)/SLn​(R)≅R∗.
The left side is, by definition, the collection of equivalence classes of invertible matrices grouped by determinant. The right side tells us that this abstract object is nothing more than the multiplicative group of nonzero reals. The determinant strips away everything about a matrix except the single number that measures how it scales volume.

Example 2: The sign map. The surjective homomorphism sgn:Sn​→{+1,−1} has kernel An​. The theorem gives

Sn​/An​≅{+1,−1}≅Z/2Z.
The full complexity of Sn​, with its n! elements, collapses to a single binary distinction: even or odd.

Example 3: The exponential. The map exp:(R,+)→(R>0​,×) has trivial kernel and is surjective, so

(R,+)≅(R>0​,×).
Additive reals and positive multiplicative reals are isomorphic as groups. The exponential function and the logarithm are the bridge between two arithmetic worlds, and this isomorphism is the group-theoretic distillation of that relationship.

Example 4: Reduction modn. The natural projection π:Z→Z/nZ has kernel nZ and is surjective. The theorem gives Z/nZ≅Z/nZ– a tautology, but an instructive one. The left side is a quotient of the abstract group Z by its subgroup nZ; the right side is the concrete set {0,1,…,n−1} with modular arithmetic. The theorem confirms that these two descriptions agree.

Here is a less obvious application. Define φ:Z×Z→Z by φ(a,b)=a−b.

  • kerφ={(a,a)∣a∈Z} (the diagonal subgroup).

  • Imφ=Z (surjective).

The First Isomorphism Theorem yields (Z×Z)/{(a,a)}≅Z. Without the theorem, identifying this quotient would require considerably more work.

3 The Second Isomorphism Theorem

Theorem 2 (Second Isomorphism Theorem).
Let H≤G be a subgroup and N⊴G a normal subgroup. Then
HN/N≅H/(H∩N).

Here HN={hn∣h∈H,n∈N}. The left side forms HN (which is a subgroup because N is normal) and quotients out N. The right side takes H and quotients out the part of H that overlaps with N. The theorem asserts these produce the same group.

The intuition is this: viewing elements of H through a lens that blurs everything in N is the same as blurring only the part of N that H actually intersects.

Proof.
Define φ:H→HN/N by φ(h)=hN.

Homomorphism.φ(hh′)=hh′N=(hN)(h′N)=φ(h)φ(h′).

Surjective. A typical element of HN/N has the form (hn)N=hN (since nN=N), which is φ(h).

Kernel.φ(h)=N if and only if h∈N, i.e., h∈H∩N. So kerφ=H∩N.

By the First Isomorphism Theorem, H/(H∩N)≅HN/N. □
Example 3.
Take G=Z, H=4Z, N=6Z. Then
  • HN=4Z+6Z=2Z (multiples of gcd(4,6)=2).

  • H∩N=4Z∩6Z=12Z (multiples of lcm(4,6)=12).

The theorem gives 2Z/6Z≅4Z/12Z. The left side has three cosets: {0,6,12,…}, {2,8,14,…}, {4,10,16,…}. The right side also has three cosets: {0,12,24,…}, {4,16,28,…}, {8,20,32,…}. They look different, but both are cyclic of order 3, isomorphic to Z/3Z.

4 The Third Isomorphism Theorem

Theorem 4 (Third Isomorphism Theorem).
Let N⊆H both be normal subgroups of G. Then
(G/N)/(H/N)≅G/H.

In words: dividing in two stages yields the same result as dividing all at once. First quotient by N to get G/N; then quotient the result by the image of H (which is H/N). The outcome is the same as if you had simply formed G/H directly.

Proof.
Define φ:G/N→G/H by φ(gN)=gH.

Well-defined. If gN=g′N, then g−1g′∈N⊆H, so gH=g′H.

Surjective. Every coset gH is the image of gN.

Kernel.φ(gN)=H if and only if g∈H, i.e., gN∈H/N. So kerφ=H/N.

By the First Isomorphism Theorem, (G/N)/(H/N)≅G/H. □
Example 5.
Take G=Z, N=6Z, H=2Z (note 6Z⊆2Z). The left side: Z/6Z={0,1,2,3,4,5} modulo 2Z/6Z={0,2,4} produces two cosets, {0,2,4} and {1,3,5}. The right side: Z/2Z={0,1}. Manifestly isomorphic.
Example 6.
Take G=Z, N=12Z, H=4Z (with 12Z⊆4Z). The left side: Z/12Z={0,1,…,11} modulo 4Z/12Z={0,4,8} gives four cosets: {0,4,8}, {1,5,9}, {2,6,10}, {3,7,11}. The right side: Z/4Z={0,1,2,3}. Once again, they agree.

5 Three theorems, one idea

Step back and compare the three proofs. Every one follows the same template:

  1. Construct a homomorphism φ from the appropriate domain to the desired target.

  2. Verify that φ is surjective.

  3. Identify kerφ.

  4. Apply the First Isomorphism Theorem.

π
φ
First Isom. Thm
G
G/kerφ
Imφ

The First Isomorphism Theorem is the engine; the Second and Third are instances obtained by feeding in cleverly chosen homomorphisms. Textbooks sometimes present the three theorems side by side as though they were results of comparable depth and independence. They are not. The First is the genuine theorem; the Second and Third are its corollaries, distinguished only by the particular homomorphisms used in their proofs. The underlying principle throughout is the same: collapse the kernel, and what remains is the image.

6 Takeaway

The isomorphism theorems are tools for unmasking quotient groups – for determining what a quotient "really is" in concrete terms. The First Isomorphism Theorem provides the fundamental mechanism: G/kerφ≅Imφ. The Second relates HN/N to H/(H∩N) by constructing the right homomorphism and reading off its kernel. The Third tells us that quotienting in two stages is the same as quotienting all at once. Behind all three lies a single refrain: build a homomorphism, identify its kernel, and let the First Isomorphism Theorem do the rest.

Group TheoryAlgebraBetween the Lines
FO
Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 followers·107 articles

Share your expertise with the world

Write articles with LaTeX support, build your audience, and earn from your knowledge.

Start Writing — It's Free

More from Folio Official

Folio Official·March 1, 2026

Cosets and quotient groups: the art of controlled forgetting

The quotient group G/N is the first major conceptual hurdle in group theory. By computing small examples by hand -- from clock arithmetic to D4 modulo its center -- we build the intuition for what "dividing" a group really means, and why normality is indispensable.

Group TheoryAlgebraBetween the Lines
1
Folio Official·February 27, 2026

The group axioms: why these three?

Associativity, identity, inverses -- textbooks present these axioms as if they were carved in stone. But why not two? Why not four? By systematically adding and removing axioms, we discover the engineering brilliance behind the definition of a group.

Group TheoryAlgebraBetween the Lines
Folio Official·March 1, 2026

Cosets and Lagrange's Theorem

Beginning with the definition of cosets of a subgroup, we prove Lagrange's theorem --- the assertion that the order of a subgroup divides the order of the group. As applications, we derive Fermat's little theorem and Euler's theorem, and we exhibit the alternating group A_4 as a counterexample to the converse.

Group TheoryAlgebraTextbook
2
Folio Official·March 1, 2026

Composition Series and the Jordan--Hölder Theorem

We introduce normal series and composition series, establishing the framework for decomposing a group into simple factors. The Jordan--Hölder theorem proves the uniqueness of the composition factors, and we develop the theory of solvable groups with its connections to the derived series.

Group TheoryAlgebraTextbook
1