This sheet introduces homomorphisms—the structure-preserving maps between groups—and isomorphisms, the maps that identify when two groups are structurally identical. Homomorphisms are the foundation for the isomorphism theorems (Sheet 4), Cayley's theorem (Sheet 5), and Galois theory (Sheets 13-15).

Commentary. In mathematics, we study objects and the maps between them that preserve their structure. For groups, these maps are homomorphisms. They allow us to compare groups, relate them to each other, and understand their internal structure through kernels and images. The First Isomorphism Theorem (Sheet 4) is the culmination of this idea: every homomorphic image of a group is a quotient of that group.

Prerequisites. This sheet uses the following results from earlier sheets:

  • Definition of a group, subgroup, normal subgroup (Sheets 1, 2, 3)
  • Cosets and quotient groups (Sheet 3)

Homomorphisms#

Definition 3.5.1. Let (G,⋅)(G, \cdot) and (H,∗)(H, *) be groups. A function φ:G→H\varphi: G \to H is a homomorphism if for all a,b∈Ga, b \in G:φ(a⋅b)=φ(a)∗φ(b).\varphi(a \cdot b) = \varphi(a) * \varphi(b).

Example 3.5.2. The map φ:Z→Zn\varphi: \mathbb{Z} \to \mathbb{Z}_n given by φ(m)=m mod n\varphi(m) = m \bmod n is a homomorphism.

Example 3.5.3. The sign map sgn⁡:Sn→{±1}\operatorname{sgn}: S_n \to \{\pm 1\} defined by sgn⁡(σ)=1\operatorname{sgn}(\sigma) = 1 if σ\sigma is even and −1-1 if σ\sigma is odd is a homomorphism.

Definition 3.5.4. The kernel of a homomorphism φ:G→H\varphi: G \to H is:ker⁡(φ)={g∈G∣φ(g)=eH}.\ker(\varphi) = \{g \in G \mid \varphi(g) = e_H\}.

Definition 3.5.5. The image of a homomorphism φ:G→H\varphi: G \to H is:im⁡(φ)={φ(g)∣g∈G}.\operatorname{im}(\varphi) = \{\varphi(g) \mid g \in G\}.

Theorem 3.5.6. If φ:G→H\varphi: G \to H is a homomorphism, then:

  1. φ(eG)=eH\varphi(e_G) = e_H.
  2. φ(g−1)=φ(g)−1\varphi(g^{-1}) = \varphi(g)^{-1} for all g∈Gg \in G.
  3. φ(gn)=φ(g)n\varphi(g^n) = \varphi(g)^n for all g∈Gg \in G and n∈Zn \in \mathbb{Z}.

Theorem 3.5.7. If φ:G→H\varphi: G \to H is a homomorphism, then:

  1. ker⁡(φ)\ker(\varphi) is a normal subgroup of GG.
  2. im⁡(φ)\operatorname{im}(\varphi) is a subgroup of HH.

Theorem 3.5.8. A homomorphism φ:G→H\varphi: G \to H is injective iff ker⁡(φ)={eG}\ker(\varphi) = \{e_G\}.

Suppose, for contradiction, there exists a≠ba\neq b that φ(a)=φ(b)\varphi(a)=\varphi(b).
φ(a)=φ(a)eH=φ(b)  ⟹  eH=φ−1(a)φ(b)=φ(a−1b)\varphi(a)=\varphi(a)e_{H}=\varphi(b)\implies e_{H}=\varphi^{-1}(a)\varphi(b)=\varphi(a^{-1}b)
By definition of ker(φ)ker(\varphi), a−1b∈ker(φ)a^{-1}b\in ker(\varphi)
However, by a≠b,a−1b≠eGa\neq b, a^{-1}b\neq e_{G}. Contradiction arises.
Therefore, supposition is wrong. φ\varphi is injective.

Corollary 3.5.9. If φ\varphi is injective, then G≅im⁡(φ)G \cong \operatorname{im}(\varphi) (as groups).

Isomorphisms#

Definition 3.5.13. A homomorphism φ:G→H\varphi: G \to H is an isomorphism if it is bijective. If such a map exists, we write G≅HG \cong H and say GG is isomorphic to HH.

Theorem 3.5.14. If φ:G→H\varphi: G \to H is an isomorphism, then φ−1:H→G\varphi^{-1}: H \to G is also an isomorphism.

Theorem 3.5.15. If φ:G→H\varphi: G \to H and ψ:H→K\psi: H \to K are isomorphisms, then ψ∘φ:G→K\psi \circ \varphi: G \to K is an isomorphism.

Theorem 3.5.16. An isomorphism preserves:

  1. The identity element.
  2. Inverses.
  3. The order of every element.
  4. The property of being abelian.
  5. The property of being cyclic.
  6. The property of being generated by a set.

Theorem 3.5.17 (Invariance of Group Properties). If G≅HG \cong H, then GG and HH have the same cardinality, same element orders, same number of subgroups of each order, and the same group-theoretic structure.

Example 3.5.18. Z≅2Z\mathbb{Z} \cong 2\mathbb{Z} via φ(n)=2n\varphi(n) = 2n.

Example 3.5.19. Z4\mathbb{Z}_4 and Z2×Z2\mathbb{Z}_2 \times \mathbb{Z}_2 are not isomorphic: one has an element of order 4, the other does not.

Exercise 3.5.20. Show that Z2×Z3≅Z6\mathbb{Z}_2 \times \mathbb{Z}_3 \cong \mathbb{Z}_6.

Exercise 3.5.21. Show that Q\mathbb{Q} under addition is not isomorphic to Z\mathbb{Z} under addition.

Exercise 3.5.22. Prove Theorem 3.5.14.


Automorphisms#

Definition 3.5.23. An automorphism of a group GG is an isomorphism φ:G→G\varphi: G \to G. The set of all automorphisms of GG is denoted Aut⁡(G)\operatorname{Aut}(G).

Theorem 3.5.24. Aut⁡(G)\operatorname{Aut}(G) is a group under composition.

Definition 3.5.25. For g∈Gg \in G, the inner automorphism induced by gg is:ιg:G→G,ιg(x)=gxg−1.\iota_g: G \to G, \qquad \iota_g(x) = g x g^{-1}.

Theorem 3.5.26. Every inner automorphism is an automorphism. The set of all inner automorphisms, denoted Inn⁡(G)\operatorname{Inn}(G), is a subgroup of Aut⁡(G)\operatorname{Aut}(G).

Theorem 3.5.27. Inn⁡(G)◃Aut⁡(G)\operatorname{Inn}(G) \triangleleft \operatorname{Aut}(G).

Example 3.5.28. For an abelian group GG, every inner automorphism is the identity map. So Inn⁡(G)={e}\operatorname{Inn}(G) = \{e\}.

Example 3.5.29. The map φ:Z→Z\varphi: \mathbb{Z} \to \mathbb{Z} defined by φ(n)=−n\varphi(n) = -n is an automorphism.

Exercise 3.5.31. Show that Aut⁡(Z)≅Z2\operatorname{Aut}(\mathbb{Z}) \cong \mathbb{Z}_2.

Exercise 3.5.32. Show that Aut⁡(Zn)≅(Z/nZ)×\operatorname{Aut}(\mathbb{Z}_n) \cong (\mathbb{Z}/n\mathbb{Z})^\times.


Summary#

We have introduced:

  • Homomorphisms: operation-preserving maps between groups
  • Kernel: a normal subgroup; injectivity criterion
  • Image: a subgroup
  • Isomorphisms: bijective homomorphisms
  • Invariance properties of isomorphisms
  • Automorphisms and inner automorphisms