We have previously seen that .
Denoting the left-hand side by , we have
.
We want to generalise this observation into a unified criterion that determines groups that are isomorphic to each other. In what follows, let be a group.
Definition 1. Given , define
and . Clearly,
. Define
.
Lemma 1. Suppose that . We have
Furthermore,
if and only if
In this case, we say that is normal, and denote
.
Proof. The first claim holds since for any ,
implies that
For the biconditional, we prove in both directions.
Fix
and
. Since
,
. Therefore,
Fix
. It suffices to prove
Indeed, inclusion holds since for any ,
Lemma 1 implies that we can define a group structure on if and only if
is a normal subgroup of
. The next lemma tells us that the only real subgroups that are normal are kernels of homomorphisms.
Lemma 2. if and only if there exists a group
and a surjective homomorphism
such that
.
Proof. It suffices to check that
, which holds since for any
and
,
Hence, , so that
, as required.
Recall the equivalence relation
on
defined by
Using discrete mathematics, the projection map defined by
is a well-defined surjection. It is also clear that the computation
implies that . By Lemma 1,
has a well-defined binary operation given by
and it is straightforward to verify that forms a group with identity
under this operation.
Now, define and
be defined as above. It remains to check that
:
as required.
It is the normal subgroup property of the kernel that underscores its ubiquity in abstract algebra. In particular, it plays a crucial role in determining when two groups are isomorphic to each other.
Theorem 1. For any group homomorphism ,
. This result is known as the first isomorphism theorem.
Proof. For simplicity, first suppose is surjective so that
. By Lemma 2,
. Using discrete mathematics, the projection map
induces a bijection
such that
.
It remains to check that is a group homomorphism. Indeed, since
is surjective, for any
,
Since is a group homomorphism, for any
,
so that is a group homomorphism, as required. For the general case, it is clear that
is surjective, so we recover the full result, as required.
In particular, if and only if
, which holds if and only if
is injective.
Corollary 1. Given and a group
, if
, then there exists a surjective homomorphism
.
Proof. Let be a group isomorphism. Since
is surjective, simply define
.
Example 1. .
Proof. Define the surjective homomorphism by
. Then
, so the first isomorphism theorem yields
Example 2. For any ,
.
Proof. Define the surjective homomorphism by
. Then
, so the first isomorphism theorem yields
Example 3. .
Proof. Define the surjective homomorphism by
. Then
, so the first isomorphism theorem yields
Example 4. .
Proof. Define the surjective homomorphism by
. Then
, so the first isomorphism theorem yields
Lemma 3. Suppose and
. Then
. In particular,
Furthermore, if , then
Proof. Exercise in book-keeping.
Theorem 2. Under the hypotheses of Lemma 3,
This result is known as the second isomorphism theorem, and can be heuristically thought of as “cancelling the terms”.
Proof. Define the map by
.
We claim that is a surjective homomorphism with kernel
.
For the surjection claim, fix . Since
, there exist
and
such that
. Then
implies that
as required.
For the homomorphism claim, by Lemma 1, the group structure on implies that
Finally, for the kernel claim, since ,
Hence, . By the first isomorphism theorem,
Theorem 3. If , then
and
This result is known as the third isomorphism theorem, and can be heuristically thought of as “cancelling the terms”.
Proof Sketch. Check that the map defined by
is a well-defined surjective homomorphism with kernel
, then conclude using the first isomorphism theorem.
Example 5. .
Definition 2. For , define
and .
Theorem 4. If , then the map
defined by
is a well-defined bijection. This result is known as the correspondence theorem.
Proof. We just need to check that is injective and surjective.
For injectivity, suppose so that
. To prove that
, fix
. By definition,
. Hence,
. The argument works symmetrically.
For surjectivity, fix . Then there exists
such that
It suffices to check that . Since
, it contains the identity element
. In particular,
, so that
, yielding
. For the subgroup property, fix
. Since
and
,
Therefore, . Hence,
, as required. Finally, by construction,
as required.
These ideas in group isomorphisms are general, but become even more powerful when used in tandem with the more finite aspects of group theory. We will need to explore these ideas next time, starting with the symmetric groups—the set of bijections on a set.
Eventually, we will discuss modulo arithmetic using this group-theoretic lens, yielding natural theorems that would otherwise be nontrivial without group-theoretic language. In fact, we have encountered the desired set(s); it is simply , but together with an associated multiplication operation.
—Joel Kindiak, 29 Dec 25, 1416H
Leave a comment