04.8 Homomorphisms and Isomorphisms
04.8 Homomorphisms and Isomorphisms
to be a function which respects the group structure on G and H in the following sense:
f (x ∗ y) = f (x)△f (y).
We usually just say homomorphism and isomorphism instead of group homomorphism and
group isomorphism.
Example 4.10
f (eG ) = eH , and
for any g ∈ G we have f (g
−1
) = f (g)
−1
.
Proof.
We have
f (eG ) = f (eG ∗ eG ) as eG ∗ eG = eG
Now multiply both sides on the left by the inverse of f (eG ) , to get
eH = f (eG ).
−1 −1
f (g) = f (g )
The latter isn’t a new definition — it’s just the image of the function f as we already defined it.
−1 −1
f (g ) = f (g) by the lemma
−1
= e as g ∈ ker f
H
= eH
so g
−1
∈ ker f which is therefore closed under inverses, and if g, h ∈ ker f then
= eH △eH as g, h ∈ ker f
= eH
Now the image. The previous lemma shows eh ∈ im f , and that im f is closed under
inverses. If f (g), f (h) ∈ im f then f (g)△f (h) = f (gh) ∈ im f as f is a homomorphism, so
im f is a subgroup. ▢