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 and be groups. A function is a homomorphism if for all :
Example 3.5.2. The map given by is a homomorphism.
Example 3.5.3. The sign map defined by if is even and if is odd is a homomorphism.
Definition 3.5.4. The kernel of a homomorphism is:
Definition 3.5.5. The image of a homomorphism is:
Theorem 3.5.6. If is a homomorphism, then:
- .
- for all .
- for all and .
Theorem 3.5.7. If is a homomorphism, then:
- is a normal subgroup of .
- is a subgroup of .
Theorem 3.5.8. A homomorphism is injective iff .
Suppose, for contradiction, there exists that .
By definition of ,
However, by . Contradiction arises.
Therefore, supposition is wrong. is injective.
Corollary 3.5.9. If is injective, then (as groups).
Isomorphisms#
Definition 3.5.13. A homomorphism is an isomorphism if it is bijective. If such a map exists, we write and say is isomorphic to .
Theorem 3.5.14. If is an isomorphism, then is also an isomorphism.
Theorem 3.5.15. If and are isomorphisms, then is an isomorphism.
Theorem 3.5.16. An isomorphism preserves:
- The identity element.
- Inverses.
- The order of every element.
- The property of being abelian.
- The property of being cyclic.
- The property of being generated by a set.
Theorem 3.5.17 (Invariance of Group Properties). If , then and have the same cardinality, same element orders, same number of subgroups of each order, and the same group-theoretic structure.
Example 3.5.18. via .
Example 3.5.19. and are not isomorphic: one has an element of order 4, the other does not.
Exercise 3.5.20. Show that .
Exercise 3.5.21. Show that under addition is not isomorphic to under addition.
Exercise 3.5.22. Prove Theorem 3.5.14.
Automorphisms#
Definition 3.5.23. An automorphism of a group is an isomorphism . The set of all automorphisms of is denoted .
Theorem 3.5.24. is a group under composition.
Definition 3.5.25. For , the inner automorphism induced by is:
Theorem 3.5.26. Every inner automorphism is an automorphism. The set of all inner automorphisms, denoted , is a subgroup of .
Example 3.5.28. For an abelian group , every inner automorphism is the identity map. So .
Example 3.5.29. The map defined by is an automorphism.
Exercise 3.5.31. Show that .
Exercise 3.5.32. Show that .
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