← Group Theory
↔

Homomorphisms & Isomorphisms

A homomorphism is a map between groups that respects the group operation. Homomorphisms reveal how groups are related to each other — and the first isomorphism theorem gives a precise sense in which every homomorphism is secretly a quotient map. Isomorphisms tell you when two groups are structurally identical, even if they look different.

Key Concepts

Homomorphism
A map ϕ:G→H\phi: G \to H satisfying ϕ(ab)=ϕ(a)ϕ(b)\phi(ab) = \phi(a)\phi(b) for all a,b∈Ga,b \in G. Automatically sends identity to identity and inverses to inverses.
Kernel
ker⁡(ϕ)={g∈G:ϕ(g)=eH}\ker(\phi) = \{g \in G : \phi(g) = e_H\}. Always a normal subgroup of GG. A homomorphism is injective iff ker⁡(ϕ)={e}\ker(\phi) = \{e\}.
Image
im(ϕ)={ϕ(g):g∈G}\text{im}(\phi) = \{\phi(g) : g \in G\}. Always a subgroup of HH.
Isomorphism
A bijective homomorphism. G≅HG \cong H means GG and HH are structurally identical — same multiplication table, same element orders.
Automorphism
An isomorphism ϕ:G→G\phi: G \to G from a group to itself. The set Aut(G)\text{Aut}(G) of all automorphisms forms a group. ∣Aut(Zn)∣=φ(n)|\text{Aut}(\mathbb{Z}_n)| = \varphi(n) (Euler's totient).

Key Equations

First Isomorphism Theorem
G/ker⁡(ϕ)  ≅  im(ϕ)G / \ker(\phi) \;\cong\; \mathrm{im}(\phi)
Every homomorphism factors through the quotient by its kernel.
Order Relation
∣G∣=∣ker⁡(ϕ)∣⋅∣im(ϕ)∣|G| = |\ker(\phi)| \cdot |\mathrm{im}(\phi)|
For finite groups, the kernel and image sizes multiply to ∣G∣|G|.
Homomorphisms Zm→Zn\mathbb{Z}_m \to \mathbb{Z}_n
∣Hom(Zm,Zn)∣=gcd⁡(m,n)|\mathrm{Hom}(\mathbb{Z}_m, \mathbb{Z}_n)| = \gcd(m, n)
The number of distinct homomorphisms between cyclic groups.
Worked Example

Kernel of a Cyclic Homomorphism

Problem

Let ϕ:Z12→Z3\phi: \mathbb{Z}_{12} \to \mathbb{Z}_3 be defined by ϕ(n)=n mod 3\phi(n) = n \bmod 3. Find ∣ker⁡(ϕ)∣|\ker(\phi)| and verify the first isomorphism theorem.

Solution

ker⁡(ϕ)={n∈Z12:n≡0(mod3)}={0,3,6,9}\ker(\phi) = \{n \in \mathbb{Z}_{12} : n \equiv 0 \pmod 3\} = \{0, 3, 6, 9\}.

∣ker⁡(ϕ)∣=4|\ker(\phi)| = 4. The image is im(ϕ)=Z3\text{im}(\phi) = \mathbb{Z}_3, so ∣im(ϕ)∣=3|\text{im}(\phi)| = 3.

Check: ∣ker⁡∣×∣im∣=4×3=12=∣Z12∣|\ker|\times|\text{im}| = 4\times3 = 12 = |\mathbb{Z}_{12}|. ✓

First isomorphism theorem: Z12/ker⁡(ϕ)≅Z3\mathbb{Z}_{12}/\ker(\phi) \cong \mathbb{Z}_3, i.e. Z12/{0,3,6,9}≅Z3\mathbb{Z}_{12}/\{0,3,6,9\} \cong \mathbb{Z}_3. ✓

Answer ∣ker⁡(ϕ)∣=4|\ker(\phi)| = 4.
Practice

Exercises

6 problems
1 of 6

For ϕ:Z18→Z6\phi: \mathbb{Z}_{18} \to \mathbb{Z}_6 defined by ϕ(n)=n mod 6\phi(n) = n \bmod 6, what is ∣ker⁡(ϕ)∣|\ker(\phi)|?

2 of 6

The number of homomorphisms Zm→Zn\mathbb{Z}_m \to \mathbb{Z}_n equals gcd⁡(m,n)\gcd(m,n). How many homomorphisms are there from Z8\mathbb{Z}_8 to Z12\mathbb{Z}_{12}?

3 of 6

∣Aut(Zn)∣=φ(n)|\mathrm{Aut}(\mathbb{Z}_n)| = \varphi(n) (Euler's totient). Compute ∣Aut(Z10)∣|\mathrm{Aut}(\mathbb{Z}_{10})|. Recall φ(10)=φ(2)φ(5)=1×4\varphi(10) = \varphi(2)\varphi(5) = 1\times4.

Unlock Exercise 3

Subscribe to PhysWeb Premium to access all exercises and track your progress.

4 of 6

If ϕ:G→H\phi: G \to H is an isomorphism and ∣G∣=120|G| = 120, what is ∣H∣|H|?

Unlock Exercise 4

Subscribe to PhysWeb Premium to access all exercises and track your progress.

5 of 6

For ϕ:Z20→Z5\phi: \mathbb{Z}_{20} \to \mathbb{Z}_5 defined by ϕ(n)=n mod 5\phi(n) = n \bmod 5, find ∣ker⁡(ϕ)∣|\ker(\phi)|.

Unlock Exercise 5

Subscribe to PhysWeb Premium to access all exercises and track your progress.

6 of 6

Since 7 is prime, φ(7)=7−1=6\varphi(7) = 7 - 1 = 6. What is ∣Aut(Z7)∣|\mathrm{Aut}(\mathbb{Z}_7)|?

Unlock Exercise 6

Subscribe to PhysWeb Premium to access all exercises and track your progress.

Key Takeaways

  • A homomorphism ϕ:G→H\phi: G \to H respects the group operation: ϕ(ab)=ϕ(a)ϕ(b)\phi(ab)=\phi(a)\phi(b). The kernel is always a normal subgroup.
  • First isomorphism theorem: G/ker⁡(ϕ)≅im(ϕ)G/\ker(\phi) \cong \text{im}(\phi). Every homomorphism is (up to isomorphism) a quotient map.
  • Two groups are isomorphic (G≅HG\cong H) iff there is a bijective homomorphism between them — they are structurally the same group.
  • ∣Hom(Zm,Zn)∣=gcd⁡(m,n)|\text{Hom}(\mathbb{Z}_m, \mathbb{Z}_n)| = \gcd(m,n) and ∣Aut(Zn)∣=φ(n)|\text{Aut}(\mathbb{Z}_n)| = \varphi(n) are fundamental counting results.