Introduction
Upon having gotten to know groups a little better, it seems only natural to ask how we can know whether two groups are fundamentally different. In what contexts do two groups have completely distinctive structures and in what contexts do two groups in fact have identical structures? A step in the right direction in order to answer these questions is to explore what are known as homomorphisms.
Let
and
be groups. A group homomorphism from
to
is a function
such that
. Notice that on the left hand side, the operation acting on the two elements is the operation from
while on the right hand side the operation acting on the two elements is the operation from
. Hence, if there exists a homomorphism between two groups
and
and the group operations are
and
respectively, it essentially means that whether we apply
on two elements in
or move the elements to
and then apply
on them, the result will be the same.
We define the kernel of
as the set
.
Examples
In order to establish a homomorphism from the positive real numbers under multiplication to the real numbers under addition, we define
and notice that the function
satisfies the equation
. It is quite clear that
as ![]()
In order to establish a homomorphism between
) and the set
under multiplication, we define
and notice that the function
satisfies the equation
since the determinant is multiplicative. Note that
) denotes the group of invertible two by two matrices with rational entries under matrix multiplication. For this homomorphism, the kernel is the set of all matrices in
with determinant 1.
Standard Results
Having hopefully now gotten a bit of a feel for how homomorphisms work, I’ll elucidate some simple results about homomorphisms and kernels.
Proposition: Let
be a homomorphism, and
. Then:
(1) ![]()
(2) ![]()
(3)
divides
, assuming ![]()
Proof: (1) We know that
. After cancelling, the result follows.
(2) For
, note that
. In the case
, we simply use the first thing we showed:
. In the case
, we notice that
and similarly,
. It follows that
. Using what we have shown thus far, the case where
follows immediately.
(3) This follows from the second result.Letting
, we have that
and hence
divides
.
![]()
Now for some standard results about kernels.
Proposition: Let
be a homomorphism. Then:
1. ![]()
2.
is injective if and only if ![]()
Proof: (1) Let
. We’ll begin by showing that
is a subgroup of
. As shown earlier,
and so
. Suppose
.
and hence
Also,
thus
. Hence
is a subgroup. Now we just have to show that it’s normal. If
and
then
. Thus
and hence
is normal.
(2) If
is injective then
can only be mapped to one element and given that
, it must be that
. Conversely, suppose that
. If
then
. But this means that
. Thus
and so
is injective.
![]()
Now for some more definitions. Let
be a homomorphism. If
then the image of
is
. If
then the preimage (or inverse image) of
is
. Although we use the notation
, bear in mind that this doesn’t imply that the function
is necessarily invertible.
Proposition: Let
be a homomorphism.
1. ![]()
2. ![]()
3.
is cyclic
is cyclic
4.
is abelian
is abelian
5. ![]()
6. ![]()
Proof: (1) We know that
so
. If
, then
since
. Lastly,
since
.
(2) If
, then
as ![]()
(3) If
then
for some
. Then ![]()
(4) If
then ![]()
(5) We know that
, and thus
. If
, then
since
. Hence
. Also,
since
. Hence ![]()
(6) If
, then
since
) and
is normal. Hence ![]()
What’s next?
While homomorphisms are useful in elucidating whether two groups have similar structure or not, the existence of a homomorphism between two groups can’t alone quite tell us whether two groups have truly identical structure. For that, we require the notion of an isomorphism, which is a bijective homomorphism. There is a lot about isomorphisms to explore, and so they will be covered across other posts.




