The First Isomorphism Theorem for Groups

The quotient of a group by the kernel of a homomorphism is isomorphic to the image, proved in full, with the counting rule |G| = |kernel| x |image| and a recipe for recognizing quotient groups. Worked cases: Z_36 modulo the multiples of 9 as Z_9, S_n/A_n, cyclic groups as quotients of Z, the reals modulo the integers as the circle group, and Cayley's theorem in one line. The Rubik's cube group mapped to the positions of its cubies, with its order as kernel times image. The ring theorem as a consequence.

Reducing modulo 9 sends each element of $\mathbb{Z}_{36}$ to an element of $\mathbb{Z}_9$, and it is a homomorphism of additive groups. Each of the nine values is taken exactly four times: 0 by 0, 9, 18 and 27, the kernel $K = \langle 9 \rangle$; 1 by 1, 10, 19 and 28; and so on. The four elements with a given value form a coset $a + K$, because two elements have the same image exactly when their difference lies in the kernel. So the cosets of $K$ correspond one to one with the values. Adding cosets matches adding values: $(5 + K) + (7 + K) = 12 + K = \{3, 12, 21, 30\}$, the coset sent to $3 = 5 + 7$ in $\mathbb{Z}_9$. The quotient group $\mathbb{Z}_{36}/\langle 9 \rangle$ is $\mathbb{Z}_9$ with its elements renamed. Is that a special feature of reduction modulo 9, or does every homomorphism do the same?

Reduction modulo 9 from Z36 onto Z9, with Z36 laid out in nine columns. Each column, such as 4, 13, 22, 31, is a coset a + K of the kernel K = {0, 9, 18, 27} (orange), and the whole column is sent to one element of Z9. Notice that different columns go to different elements, so the cosets of the kernel match the values of the map one to one: that matching is the isomorphism of the first isomorphism theorem.
Reduction modulo 9 from Z_36 onto Z_9, with Z_36 laid out in nine columns. Each column, such as 4, 13, 22, 31, is a coset a + K of the kernel K = {0, 9, 18, 27} (orange), and the whole column is sent to one element of Z_9. Notice that different columns go to different elements, so the cosets of the kernel match the values of the map one to one: that matching is the isomorphism of the first isomorphism theorem.

Every homomorphism does. Nothing above used more than the fact that reduction is a homomorphism, and for every homomorphism the quotient by the kernel is isomorphic to the image. That is the first isomorphism theorem, already proved for rings, here with one operation. It is the standard way to recognize a quotient group: find a homomorphism with the right kernel and identify its image.

First we prove the theorem and its counting rule, $\lvert G \rvert = \lvert \ker f \rvert \cdot \lvert f(G) \rvert$ for finite $G$. Then we recognize quotients met earlier: parity, cyclic groups and angles. Next the counting rule splits the order of the Rubik's cube group into the arrangements of the cubies and the twists and flips that leave them in place. Finally we derive the ring theorem from the group theorem and look back over the course.

This is the third and last article of Cosets, Normal Subgroups and Quotient Groups, and the last article of the course. It covers §8.4 of the course text (Hungerford, 2014), with Judson (2026, §11.2) as a free companion. It uses homomorphisms and kernels, quotient groups and Lagrange's theorem.

The theorem

Recall two facts. The kernel $K$ of a homomorphism $f: G \to H$ is a normal subgroup (Normal Subgroups and Quotient Groups), so $G/K$ is a group. And by the kernel theorem of Group Homomorphisms and Isomorphisms, $f(a) = f(b)$ exactly when $a^{-1}b \in K$. By the coset test, that says $aK = bK$:

$$f(a) = f(b) \iff aK = bK.$$

The elements with a given image form one coset of the kernel, and each coset has a single image.

Theorem (first isomorphism theorem). Let $f: G \to H$ be a homomorphism of groups with kernel $K$. Then the rule

$$\bar f(aK) = f(a)$$

defines an isomorphism $\bar f$ from $G/K$ onto the image $f(G)$, and $f = \bar f \circ \pi$, where $\pi: G \to G/K$ is the natural homomorphism. In particular, if $f$ is onto, then $G/K \cong H$.

Here is the idea in one sentence: because equal values and equal cosets are the same condition, the rule $aK \mapsto f(a)$ is at once a function and one-to-one, and the homomorphism property of $f$ passes to it.

Proof. Well defined and one-to-one. By the displayed equivalence, read from right to left, the value $f(a)$ depends only on the coset $aK$, not on the representative $a$; so $\bar f$ is a function. Read from left to right, it says that cosets with the same value are equal; so $\bar f$ is one-to-one.

A homomorphism. For cosets $aK$ and $bK$,

$$\bar f\big((aK)(bK)\big) = \bar f(abK) = f(ab) = f(a)\,f(b) = \bar f(aK)\,\bar f(bK).$$

Onto $f(G)$. Every element of the image is $f(a) = \bar f(aK)$ for some $a$.

So $\bar f$ is a bijective homomorphism from $G/K$ to $f(G)$, an isomorphism. Finally $\bar f(\pi(a)) = \bar f(aK) = f(a)$ for every $a$. $\blacksquare$

The course text states the theorem for homomorphisms onto $H$ (Theorem 8.20). That loses nothing, since every homomorphism is onto its image. Judson (2026, Theorem 11.2.1) states it with the image, as here. He adds that $\bar f$ is the only map with $f = \bar f \circ \pi$, which holds because $\pi$ is onto. The proof is the ring proof with the products of cosets in place of sums and without the second operation.

The factorization $f = \bar f \circ \pi$ describes every homomorphism in two steps. First $\pi$ collapses each coset of the kernel to a single element, which is all the information $f$ discards. Then $\bar f$ renames the result without losing anything more. In the opening, $\pi$ collapsed each column of the figure to a point, and $\bar f$ labeled the nine points $0, \ldots, 8$.

Corollary. If $G$ is finite and $f: G \to H$ is a homomorphism, then

$$\lvert G \rvert = \lvert \ker f \rvert \cdot \lvert f(G) \rvert,$$

and every element of the image is the image of exactly $\lvert \ker f \rvert$ elements of $G$.

The idea: each value is taken by one whole coset of the kernel, and Lagrange's theorem counts the cosets.

Proof. $\lvert G/\ker f \rvert = \lvert G \rvert / \lvert \ker f \rvert$ by Lagrange's theorem, and $G/\ker f$ has as many elements as $f(G)$ by the theorem. The elements sent to a given value form one coset of the kernel, which has $\lvert \ker f \rvert$ elements. $\blacksquare$

How to use it

To show that $G/N \cong T$ for a normal subgroup $N$ and a known group $T$:

  1. write down a homomorphism $f: G \to T$;
  2. show that $f$ is onto;
  3. show that $\ker f = N$.

The theorem then provides the isomorphism $aN \mapsto f(a)$, with nothing more to check. Step 3 also proves, as a by-product, that $N$ is normal. When the groups are finite, steps 2 and 3 can trade work through the corollary: if $\ker f = N$ and $\lvert G \rvert / \lvert N \rvert = \lvert T \rvert$, then $f$ is onto.

Quotients recognized

The recipe now identifies, in a line or two each, quotients that earlier articles met one at a time.

Reduction modulo 9. The map $\mathbb{Z}_{36} \to \mathbb{Z}_9$, $[a]_{36} \mapsto [a]_9$, is a well-defined homomorphism onto $\mathbb{Z}_9$ with kernel $\langle 9 \rangle = \{0, 9, 18, 27\}$ (Group Homomorphisms and Isomorphisms). So $\mathbb{Z}_{36}/\langle 9 \rangle \cong \mathbb{Z}_9$, as in the opening and the figure, and the counting rule reads $36 = 4 \cdot 9$. The same change of modulus, read as a map of rings, recognized the quotient rings of $\mathbb{Z}_n$ in Kernels and the First Isomorphism Theorem for Rings; here only its addition is used.

Parity. For $n \ge 2$ the sign $\operatorname{sgn}: S_n \to \{1, -1\}$ is a homomorphism onto $\{1, -1\}$, since a transposition has sign $-1$, and its kernel is $A_n$. So $S_n/A_n \cong \{1, -1\}$. The counting rule gives $n! = \lvert A_n \rvert \cdot 2$, a second proof that $\lvert A_n \rvert = n!/2$ (Symmetric Groups and Permutations). The script checks the theorem's maps for $S_4$ and $S_5$, where the kernels have 12 and 60 elements.

Rotations and reflections. The map $D_8 \to \{1, -1\}$ sending rotations to 1 and reflections to $-1$ is a homomorphism onto $\{1, -1\}$ with kernel $\langle r \rangle$, so $D_8/\langle r \rangle \cong \{1, -1\}$. Writing each symmetry as a $2 \times 2$ matrix (Dihedral Groups), this map is the determinant: rotations have determinant 1 and reflections $-1$.

Cyclic groups. For an element $a$ of any group, $\exp_a: \mathbb{Z} \to G$, $k \mapsto a^k$, is a homomorphism onto $\langle a \rangle$. Its kernel is $n\mathbb{Z}$ if $a$ has order $n$ and $\{0\}$ if $a$ has infinite order (Group Homomorphisms and Isomorphisms). The theorem gives at once

$$\langle a \rangle \cong \mathbb{Z}/n\mathbb{Z} = \mathbb{Z}_n \qquad \text{or} \qquad \langle a \rangle \cong \mathbb{Z}/\{0\} \cong \mathbb{Z},$$

which is the classification of cyclic groups proved by hand in Group Homomorphisms and Isomorphisms. For $\sigma = (1\;5\;2\;8)(3\;6\;7)$ in $S_8$, of order 12, the isomorphism $\mathbb{Z}/12\mathbb{Z} \to \langle \sigma \rangle$ sends $k + 12\mathbb{Z}$ to $\sigma^k$, so exponents of $\sigma$ can be reduced modulo 12; the script confirms, for example, that $\sigma^{30} = \sigma^6$.

Angles. The circle group $\mathbb{T} = \{ z \in \mathbb{C} : \lvert z \rvert = 1 \}$ is a group under multiplication of complex numbers, and it contains the roots of unity of Groups: Definition and First Examples. Define

$$w: \mathbb{R} \to \mathbb{T}, \qquad w(t) = \cos 2\pi t + i \sin 2\pi t,$$

which wraps the real line around the unit circle, one full turn per unit. It is a homomorphism from the additive group $\mathbb{R}$: by the addition formulas for sine and cosine,

$$w(s)\,w(t) = \big(\cos 2\pi s \cos 2\pi t - \sin 2\pi s \sin 2\pi t\big) + i\big(\sin 2\pi s \cos 2\pi t + \cos 2\pi s \sin 2\pi t\big) = w(s + t).$$

It is onto, since every point of the unit circle has the form $\cos\theta + i\sin\theta$, and $\theta = 2\pi t$ for $t = \theta/2\pi$. Its kernel is the set of $t$ with $\cos 2\pi t = 1$ and $\sin 2\pi t = 0$, which is $\mathbb{Z}$. So

$$\mathbb{R}/\mathbb{Z} \cong \mathbb{T}.$$

An element of $\mathbb{R}/\mathbb{Z}$ is a real number up to whole turns, that is, an angle measured in turns. The numbers $0.25$, $1.25$ and $-0.75$ lie in one coset, and the script confirms that $w$ sends all three to $i$, a quarter turn. Adding cosets adds angles and discards whole turns: $(0.3 + \mathbb{Z}) + (0.85 + \mathbb{Z}) = 0.15 + \mathbb{Z}$. Judson (2026, Examples 11.1.3 and 11.1.7) uses the same map with angles in radians, where the kernel is $2\pi\mathbb{Z}$.

Check your understanding. The script computes $w(0.6) \approx -0.8090 - 0.5878\,i$. Without any trigonometry, what are $w(-0.4)$ and $w(2.6)$?

Both are the same point. The numbers $-0.4$ and $2.6$ differ from $0.6$ by integers, so all three lie in the coset $0.6 + \mathbb{Z}$, and $w$ is constant on each coset of its kernel. The script returns $-0.8090 - 0.5878\,i$ for all three.

Cayley's theorem. The left regular representation $g \mapsto \lambda_g$ of Cayley's Theorem has trivial kernel, so the theorem identifies $G \cong G/\{e\}$ with its image, a group of permutations. The proof given there is this argument written out.

The Rubik's cube: kernels and images

The counting rule is most striking on a group too large to list. Each move of the cube permutes the eight corner positions and the twelve edge positions, and following a move by another composes the permutations. So there are homomorphisms

$$p_c: G \to S_8, \qquad p_e: G \to S_{12}, \qquad p = (p_c, p_e): G \to S_8 \times S_{12}$$

from the cube group $G$ (The Rubik's Cube Group), recording where each cubie goes and ignoring how it is turned. Their images are subgroups generated by the images of the six quarter turns. The script computes their orders with the Schreier-Sims algorithm of the cube article:

Homomorphism Order of the image Order of the kernel, $\lvert G \rvert$ divided by it
$p_c$, corner positions $8! = 40{,}320$ 1,072,718,335,180,800
$p_e$, edge positions $12! = 479{,}001{,}600$ 90,296,156,160
$p$, all cubie positions $8! \cdot 12!/2 = 9{,}656{,}672{,}256{,}000$ $3^7 \cdot 2^{11} = 4{,}478{,}976$

So $p_c$ and $p_e$ are onto: every arrangement of the corners can be made, and every arrangement of the edges. By the corollary, each arrangement of the corners is made by exactly 1,072,718,335,180,800 moves, a coset of the kernel of $p_c$.

Check your understanding. The commutator $R\,U\,R'\,U'$ has order 6. The script finds that its cube $(R\,U\,R'\,U')^3$ moves four corner cubies but returns every edge cubie to its own position, unflipped. Which of the three kernels in the table contain it?

Only the kernel of $p_e$. It moves corners, so it is not in the kernel of $p_c$, and not in the kernel of $p$ either. The square $(R\,U\,R'\,U')^2$, met in Group Homomorphisms and Isomorphisms, does the opposite: it leaves the corners in place and moves edges, so it lies in the kernel of $p_c$ only.

The image of $p$. Not every pair of arrangements can be made at once. Each quarter turn permutes the corners by one 4-cycle and the edges by one 4-cycle, both odd, so for every move the two permutations have the same sign: this is the first of the three invariants of the cube article. The pairs $(\alpha, \beta)$ in $S_8 \times S_{12}$ with $\operatorname{sgn}\alpha = \operatorname{sgn}\beta$ form the kernel of the homomorphism $(\alpha, \beta) \mapsto \operatorname{sgn}\alpha \cdot \operatorname{sgn}\beta$, which is onto $\{1, -1\}$. By the counting rule there are $8! \cdot 12!/2$ of them. The image of $p$ lies among these pairs and, by the computation, has exactly that many elements. So the image of $p$ is the set of all pairs of arrangements with equal parities, and by the theorem

$$G/\ker p \;\cong\; \{ (\alpha, \beta) \in S_8 \times S_{12} : \operatorname{sgn}\alpha = \operatorname{sgn}\beta \}.$$

The kernel of $p$. The kernel consists of the moves that return every cubie to its own position, possibly turned: they only twist corners and flip edges. Its order is $\lvert G \rvert$ divided by the order of the image,

$$\frac{43{,}252{,}003{,}274{,}489{,}856{,}000}{9{,}656{,}672{,}256{,}000} = 4{,}478{,}976 = 3^7 \cdot 2^{11},$$

and the division is exact, as the corollary requires. This number has a meaning. A move in the kernel is determined by how it turns each cubie in place: a twist of 0, 1 or 2 thirds for each corner and a flip of 0 or 1 for each edge. By the second and third invariants of the cube article, the twists add up to 0 modulo 3 and the flips to 0 modulo 2, so once seven twists and eleven flips are chosen, the last of each is forced, and at most $3^7 \cdot 2^{11}$ patterns are possible. The kernel has exactly that many elements. So every pattern of twists and flips allowed by the invariants is produced by some move that leaves all cubies in place. The superflip, which flips all twelve edges and moves nothing, is one of them; the script confirms that it lies in the kernel.

So the corollary splits the order of the cube group into what the moves do to positions and what they do to orientations:

$$\lvert G \rvert = \lvert \ker p \rvert \cdot \lvert p(G) \rvert = \big(3^7 \cdot 2^{11}\big) \cdot \frac{8! \cdot 12!}{2}.$$

This is the factorization found by counting in The Rubik's Cube Group, now read as kernel times image. The argument does not replace the computer calculation of $\lvert G \rvert$ on which that article's count rests. It uses that number, with two smaller Schreier-Sims computations, to explain where its factors come from. The kernel is also normal, which a solver uses constantly: if a move $M$ only reorients cubies in place, so does every conjugate $X M X^{-1}$, which reorients the cubies that the setup move $X$ brought into $M$'s positions.

Every image is a quotient

Which groups can $G$ be mapped onto? Up to isomorphism, exactly its quotients $G/N$ by normal subgroups. Every image $f(G)$ is isomorphic to $G/\ker f$, and every quotient $G/N$ is the image of the natural homomorphism. Finding the normal subgroups of a group therefore means finding all the ways of mapping it onto another group.

Check your understanding. In $D_8$ the rotations $\langle r \rangle$ form a normal subgroup, cyclic of order 8, with a quotient of order 2. In $\mathbb{Z}_{16}$ the even classes $\langle 2 \rangle$ do the same. Does it follow that $D_8 \cong \mathbb{Z}_{16}$?

No. $\mathbb{Z}_{16}$ is abelian, while $D_8$ is not, since $sr = r^7 s \neq rs$; the script also finds that the largest order of an element is 16 in $\mathbb{Z}_{16}$ and 8 in $D_8$. A normal subgroup and its quotient do not determine the group. The theorem identifies the quotient, and says nothing about how the kernel and the quotient fit together.

The first isomorphism theorem has companions:

  • the second describes $HN/N$ for a subgroup $H$ and a normal subgroup $N$;
  • the third describes the quotient of a quotient, $(G/N)/(M/N) \cong G/M$;
  • the correspondence theorem matches the subgroups of $G/N$ with the subgroups of $G$ that contain $N$.

Judson (2026, Theorems 11.2.3 to 11.2.5) proves all three. Each follows from the first, applied to a suitable homomorphism. The course text includes the third isomorphism theorem as an optional result (Theorem 8.22) and describes the subgroups of a quotient (Theorems 8.21 and 8.24); the course did not use them.

The ring theorem from the group theorem

The course proved the ring theorem first. Could it have been derived from the group theorem instead? A ring $R$ is an abelian group under addition, and an ideal $I$ is a subgroup of it, normal because the group is abelian. A ring homomorphism $f: R \to S$ is in particular a homomorphism of additive groups, with the same kernel. The group theorem therefore already gives an isomorphism of additive groups $R/\ker f \to f(R)$, $a + \ker f \mapsto f(a)$. To obtain the ring theorem it remains only to check that this map also respects products, which is the one line $f(ab) = f(a)f(b)$. Judson (2026, Theorem 16.3.12) proves the ring version in this way. The ring article gave a self-contained proof. Read side by side, the two proofs differ only in the number of operations checked.

Where it leads

  • The unit's topic page compares the two quotient constructions, rings by ideals and groups by normal subgroups, in one table.
  • The Schreier-Sims computations behind the cube table are themselves built from cosets: each step counts the cosets of a stabilizer, by the orbit-stabilizer relation of Cosets and Lagrange's Theorem.

What we have learned

Every homomorphism $f$ is the natural map onto $G/\ker f$ followed by an isomorphism onto the image. So the quotients of a group by its normal subgroups are, up to isomorphism, its images, and for finite groups $\lvert G \rvert = \lvert \ker f \rvert \cdot \lvert f(G) \rvert$. On the cube that rule split $\lvert G \rvert$ into $3^7 \cdot 2^{11}$ patterns of twists and flips times $8! \cdot 12!/2$ arrangements of the cubies.

That brings the course back to where it began. Arithmetic in the Integers opened with the division algorithm, and congruence modulo $n$ sorted the integers by remainder into classes that could be added and multiplied, $\mathbb{Z}_n$. The rings half of the course repeated that step with polynomials, $F[x]/(p(x))$, and with any ideal, $R/I$. This unit repeated it once more for groups, $G/N$, with conjugation in the role of absorption. Each time the work was the same three steps: an equivalence relation, its classes, and an operation on the classes that does not depend on the representatives. The first isomorphism theorem, for rings and now for groups, adds that these quotients are exactly the images of homomorphisms. Reduction modulo $n$, which sends each integer to its remainder, was the first of them.

References

  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §8.4. Brooks/Cole, Cengage Learning. The course text: kernels are normal subgroups (Theorem 8.16); a homomorphism is one-to-one exactly when its kernel is trivial (Theorem 8.17); the natural homomorphism onto $G/N$ has kernel $N$ (Theorem 8.18); equal images and equal cosets of the kernel (Lemma 8.19); the first isomorphism theorem for surjective homomorphisms (Theorem 8.20); subgroups of quotient groups (Theorems 8.21 and 8.24, Corollary 8.23); the third isomorphism theorem (Theorem 8.22, optional). record · 44 pages
  • Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026). Free online at judsonbooks.org. §11.1 (Examples 11.1.3 and 11.1.7, the homomorphism from $\mathbb{R}$ onto the circle group and its kernel; Theorem 11.1.5, kernels are normal); §11.2 (the canonical homomorphism; Theorem 11.2.1, the first isomorphism theorem with the uniqueness of the induced map; Theorems 11.2.3, 11.2.4 and 11.2.5, the second isomorphism, correspondence and third isomorphism theorems); §16.3 (Theorem 16.3.12, the first isomorphism theorem for rings). record · 44 pages