Skip to main content
Logo image

Section 11.1 Group Homomorphisms

A homomorphism between groups (G,) and (H,) is a map ϕ:GH such that
ϕ(g1g2)=ϕ(g1)ϕ(g2)
for g1,g2G. The range of ϕ in H is called the homomorphic image of ϕ.
Two groups are related in the strongest possible way if they are isomorphic; however, a weaker relationship may exist between two groups. For example, the symmetric group Sn and the group Z2 are related by the fact that Sn can be divided into even and odd permutations that exhibit a group structure like that Z2, as shown in the following multiplication table.
evenoddevenevenoddoddoddeven
We use homomorphisms to study relationships such as the one we have just described.

Example 11.1.

Let G be a group and gG. Define a map ϕ:ZG by ϕ(n)=gn. Then ϕ is a group homomorphism, since
ϕ(m+n)=gm+n=gmgn=ϕ(m)ϕ(n).
This homomorphism maps Z onto the cyclic subgroup of G generated by g.

Example 11.2.

Let G=GL2(R). If
A=(abcd)
is in G, then the determinant is nonzero; that is, det(A)=adbc0. Also, for any two elements A and B in G, det(AB)=det(A)det(B). Using the determinant, we can define a homomorphism ϕ:GL2(R)R by Adet(A).

Example 11.3.

Recall that the circle group T consists of all complex numbers z such that |z|=1. We can define a homomorphism ϕ from the additive group of real numbers R to T by ϕ:θcosθ+isinθ. Indeed,
ϕ(α+β)=cos(α+β)+isin(α+β)=(cosαcosβsinαsinβ)+i(sinαcosβ+cosαsinβ)=(cosα+isinα)(cosβ+isinβ)=ϕ(α)ϕ(β).
Geometrically, we are simply wrapping the real line around the circle in a group-theoretic fashion.
The following proposition lists some basic properties of group homomorphisms.

Proof.

(1) Suppose that e and e are the identities of G1 and G2, respectively; then
eϕ(e)=ϕ(e)=ϕ(ee)=ϕ(e)ϕ(e).
By cancellation, ϕ(e)=e.
(2) This statement follows from the fact that
ϕ(g1)ϕ(g)=ϕ(g1g)=ϕ(e)=e.
(3) The set ϕ(H1) is nonempty since the identity of G2 is in ϕ(H1). Suppose that H1 is a subgroup of G1 and let x and y be in ϕ(H1). There exist elements a,bH1 such that ϕ(a)=x and ϕ(b)=y. Since
xy1=ϕ(a)[ϕ(b)]1=ϕ(ab1)ϕ(H1),
ϕ(H1) is a subgroup of G2 by Proposition 3.31.
(4) Let H2 be a subgroup of G2 and define H1 to be ϕ1(H2); that is, H1 is the set of all gG1 such that ϕ(g)H2. The identity is in H1 since ϕ(e)=e. If a and b are in H1, then ϕ(ab1)=ϕ(a)[ϕ(b)]1 is in H2 since H2 is a subgroup of G2. Therefore, ab1H1 and H1 is a subgroup of G1. If H2 is normal in G2, we must show that g1hgH1 for hH1 and gG1. But
ϕ(g1hg)=[ϕ(g)]1ϕ(h)ϕ(g)H2,
since H2 is a normal subgroup of G2. Therefore, g1hgH1.
Let ϕ:GH be a group homomorphism and suppose that e is the identity of H. By Proposition 11.4, ϕ1({e}) is a subgroup of G. This subgroup is called the kernel of ϕ and will be denoted by kerϕ. In fact, this subgroup is a normal subgroup of G since the trivial subgroup is normal in H. We state this result in the following theorem, which says that with every homomorphism of groups we can naturally associate a normal subgroup.

Example 11.6.

Let us examine the homomorphism ϕ:GL2(R)R defined by Adet(A). Since 1 is the identity of R, the kernel of this homomorphism is all 2×2 matrices having determinant one. That is, kerϕ=SL2(R).

Example 11.7.

The kernel of the group homomorphism ϕ:RC defined by ϕ(θ)=cosθ+isinθ is {2πn:nZ}. Notice that kerϕZ.

Example 11.8.

Suppose that we wish to determine all possible homomorphisms ϕ from Z7 to Z12. Since the kernel of ϕ must be a subgroup of Z7, there are only two possible kernels, {0} and all of Z7. The image of a subgroup of Z7 must be a subgroup of Z12. Hence, there is no injective homomorphism; otherwise, Z12 would have a subgroup of order 7, which is impossible. Consequently, the only possible homomorphism from Z7 to Z12 is the one mapping all elements to zero.

Example 11.9.

Let G be a group. Suppose that gG and ϕ is the homomorphism from Z to G given by ϕ(n)=gn. If the order of g is infinite, then the kernel of this homomorphism is {0} since ϕ maps Z onto the cyclic subgroup of G generated by g. However, if the order of g is finite, say n, then the kernel of ϕ is nZ.