MTH3003 Lecture 11
Last time we built up the machinery of quotients and saw how kernels of homomorphisms naturally give rise to factor groups. In this lecture we make that story precise via the First isomorphism theorem, then add two further structural results (the Second isomorphism theorem and Third isomorphism theorem) that let us shuffle subgroups and quotients around safely. We finish by introducing cycle shape in , setting up the signature map and the alternating group for the next lecture.
The First Isomorphism Theorem
We start with the fundamental relationship between a homomorphism, its kernel, and its image.
First isomorphism theorem
Let group homomorphism have kernel and image . If then the quotient group is a group and there is an isomorphism given by . In particular, we obtain a canonical group isomorphism
We already know that if then , so exists as a group of cosets. The real work is to show that the formula does not depend on the choice of representative and that is an isomorphism onto the image.
Proof Structure and “well-defined”
-
Well-definedness. Suppose . Then , so . By the homomorphism property,
\varphi(g_{1}^{-1}g_{2}) = \varphi(g_{1})^{-1}\varphi(g_{2}) = e_{H} \implies \varphi(g_{1}) = \varphi(g_{2}).
Hence $\theta(g_{1}K) = \theta(g_{2}K)$, so $\theta$ is a genuine function on cosets. 2. **Homomorphism property.** For $g_{1}, g_{2} \in G$ we have\theta\bigl((g_{1}K)(g_{2}K)\bigr) = \theta((g_{1}g_{2})K) = \varphi(g_{1}g_{2}) = \varphi(g_{1})\varphi(g_{2}) = \theta(g_{1}K),\theta(g_{2}K).
3. **Surjectivity onto $I$.** Every element of $I$ has the form $\varphi(g)$ for some $g \in G$, and $\varphi(g) = \theta(gK)$, so $\theta$ is onto $I$. 4. **Injectivity.** If $\theta(g_{1}K) = \theta(g_{2}K)$ then $\varphi(g_{1}) = \varphi(g_{2})$, so $\varphi(g_{1}^{-1}g_{2}) = e_{H}$ and hence $g_{1}^{-1}g_{2} \in K$. This is equivalent to $g_{1}K = g_{2}K$. Putting this together, $\theta$ is a bijective homomorphism $G/K \to I$, hence an isomorphism. > [!note] Canonical homomorphism > > Given $N \trianglelefteq G$, the map $\pi \colon G \to G/N$ defined by $\pi(g) = gN$ is a surjective homomorphism with $\ker \pi = N$. > It is often called the **canonical projection or canonical homomorphism**. From the first isomorphism theorem, any homomorphism $\varphi \colon G \to H$ with kernel $K$ factors through the quotient $G/K$ asG \xrightarrow{\pi} G/K \xrightarrow[\cong]{\theta} \operatorname{Im}\varphi \leq H,
where $\pi$ is the canonical projection and $\theta$ is an isomorphism. ### Example: $\mathbb{Z}/n\mathbb{Z} \cong \mathbb{Z}_{n}$ Consider the homomorphism $\varphi \colon \mathbb{Z} \to \mathbb{Z}_{n}$ defined by\varphi(m) = [m]*{n}.
We know: - $\ker \varphi = n\mathbb{Z}$, the set of all multiples of $n$. - $\operatorname{Im}\varphi = \mathbb{Z}_{n}$ (the map is surjective). By the first isomorphism theorem we obtain\boxed{,\mathbb{Z}/n\mathbb{Z} ;\cong; \mathbb{Z}*{n},}.
This recovers our earlier explicit isomorphism (for example when $n = 3$) in a single conceptual statement valid for all $n \in \mathbb{N}$. --- ## The Second Isomorphism Theorem The second isomorphism theorem shows how a subgroup $H$ and a normal subgroup $N$ combine inside $G$. > [!important] Second isomorphism theorem > > Let $G$ be a group with $H \leq G$ and $N \trianglelefteq G$. Then: > - The product $HN = \{hn \colon h \in H, n \in N\}$ is a subgroup of $G$. > - The intersection $H \cap N$ is a normal subgroup of $H$. > - There is an isomorphism >\boxed{,H/(H \cap N) ;\cong; (HN)/N,}.
Proof via the First Isomorphism Theorem
Define by
- Homomorphism. For we have
because multiplication of cosets in is inherited from and .
- Kernel. The kernel is
- Image. Any element of has the form with and , so
By the first isomorphism theorem,
This is extremely useful when you want to compare the “copy of modulo its intersection with ” with the “chunk of generated by and , modulo “.
The Third Isomorphism Theorem (“Fool’s Cancellation”)
The third isomorphism theorem formalises what looks like cancellation in a tower of quotients. The warning is that you can only “cancel” when the relevant subgroups are normal in the right groups.
Third isomorphism theorem
Let be a group and let . Suppose is another normal subgroup with
Then:
- The subgroup is normal in .
- There is an isomorphism
People sometimes write this heuristically as
The whole point of the theorem is that this is not true in general unless the normality conditions are satisfied.
Why "Fool's Cancellation"?
You cannot cancel arbitrary subgroups the way you cancel numbers. The theorem only works when and with . If you try to imitate this when normality fails, the quotient groups may not even make sense.
Proof via the First Isomorphism Theorem
Define by
We must check that this is well-defined and a homomorphism, then identify its kernel and image.
- Well-defined homomorphism. If then , so and hence is well-defined. For we have
so is a homomorphism.
- Kernel. The kernel is
This shows is normal in .
- Image. For any , lies in , and every coset of arises like this. Hence
By the first isomorphism theorem,
Cycle Shape in
We now move to a new topic: the cycle shape of permutations in the symmetric group . This is a way to record how long the disjoint cycles of a permutation are, ignoring which actual points are moved.
Definition: cycle shape
Let be a permutation, . Write as a product of disjoint cycles
where each cycle has length and . The cycle shape of is the tuple
The cycle shape of the identity permutation is usually taken to be .
This is an invariant of a permutation up to relabelling of the underlying set and reordering of disjoint cycles.
Examples of cycle shape
- In , consider
The cycles have lengths , , and , so the cycle shape is after reordering. 2. In , let
Here is a product of four disjoint transpositions, so the cycle shape is .
The key point is that cycle shape forgets the actual labels and remembers only the multiset of cycle lengths.
All Cycle Shapes in
In , every permutation is a product of disjoint cycles acting on , and each element lies in exactly one cycle (possibly a -cycle). The possible cycle shapes and associated permutations can be listed exhaustively.
We have:
| Cycle shape | Elements with this shape in | Number of elements |
|---|---|---|
| , , , , , | ||
| , , | ||
| , , , , , , , | ||
| , , , , , |
We have definitely listed all elements, because
The table illustrates how cycle shape organises permutations by their underlying cycle structure; this will be essential when we define the signature homomorphism and study the alternating group .
Pre-Lecture Notes from University Notes
- Recall: for a homomorphism with kernel , so the quotient is a well-defined group of cosets and the canonical projection is a homomorphism.
- First isomorphism theorem: if has kernel and image , then via ; proof checks that is well-defined, is a homomorphism, and is bijective.
- Example: the homomorphism given by has kernel and image , so for all .
- Second isomorphism theorem: for and the map , , is a homomorphism with kernel and image , giving .
- Third isomorphism theorem (“Fool’s Cancellation”): for and , the map , , has kernel and image , yielding and showing .
- Definition: the cycle shape of is the ordered tuple of cycle lengths when is written as a product of disjoint cycles with lengths , and the identity has cycle shape .
- Worked examples: has cycle shape ; has cycle shape ; in the possible cycle shapes are , , , , and account for all permutations.
- Next time: define the signature homomorphism , use cycle shape to compute efficiently, and study the alternating group .