Skip to content
Tutorials Center
My learning

Topics

Lesson 19 of 37 · Homomorphisms and Quotient Groups

Group Homomorphisms

Learn what a group homomorphism is, why it preserves identity and inverses, and how to test maps between finite groups with a brute-force Python checker.

So far you have studied groups one at a time. Real structure shows up when you compare groups. A map that respects the group operation lets you move a calculation from one group to another without changing the answer. Such a map is called a homomorphism, and it is the central tool of the rest of this track.

In this lesson you will define homomorphisms, prove the three basic facts about them, and write a checker that tests any map between small finite groups.

The definition

Let (G, ∗) and (H, ⋆) be groups. A function f: G → H is a group homomorphism if, for all a and b in G:

Text
f(a ∗ b) = f(a) ⋆ f(b)

Read it as: "multiply first, then map" gives the same result as "map first, then multiply". The left side uses the operation of G. The right side uses the operation of H.

Here are some maps you may already know:

Map From To Why it works
x ↦ 2x integers under + integers under + 2(a + b) = 2a + 2b
x ↦ x mod n integers under + ℤₙ under + mod n remainders respect addition
x ↦ eˣ reals under + positive reals under × e^(a+b) = eᵃ · eᵇ
det invertible matrices under × nonzero reals under × det(AB) = det(A) det(B)

The map x ↦ x + 1 on the integers is not a homomorphism, because f(a + b) = a + b + 1 but f(a) + f(b) = a + b + 2.

An isomorphism is a homomorphism that is also a bijection. Two groups with an isomorphism between them are "the same group wearing different names".

Three facts every homomorphism obeys

Let f: G → H be a homomorphism, e_G the identity of G and e_H the identity of H.

  1. Identity goes to identity: f(e_G) = e_H.
  2. Inverses go to inverses: f(a⁻¹) = f(a)⁻¹.
  3. Powers go to powers: f(aⁿ) = f(a)ⁿ for every integer n.

Proof of fact 1. We have f(e_G) = f(e_G ∗ e_G) = f(e_G) ⋆ f(e_G). Multiply both sides on the left by f(e_G)⁻¹ in H. The left side becomes e_H and the right side becomes f(e_G). So f(e_G) = e_H.

Proof of fact 2. f(a) ⋆ f(a⁻¹) = f(a ∗ a⁻¹) = f(e_G) = e_H. So f(a⁻¹) is the inverse of f(a), and inverses are unique.

Fact 3 follows from the defining rule by induction for positive n, and from fact 2 for negative n.

These facts give you a fast disproof: if a map sends the identity somewhere other than the identity, it cannot be a homomorphism. x ↦ x + 1 fails this test at once, since f(0) = 1.

Testing a map by brute force

For finite groups you can simply check every pair. The checker below takes the two sets and two operations, and returns the first pair that breaks the rule. We test the maps x ↦ k·x mod 12 from ℤ₆ to ℤ₁₂.

Python Which maps from Z6 to Z12 are homomorphisms?

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The working values of k are exactly the even numbers. There is a reason: in ℤ₆ the element 1 has order 6, so f(1) = k must satisfy 6k ≡ 0 (mod 12), which means k is even. A homomorphism out of a cyclic group is decided by where it sends a generator, and the image of the generator must have an order that divides the generator's order.

A non-obvious homomorphism: the sign of a permutation

Every permutation can be written as a product of swaps. The sign is +1 if the number of swaps is even and -1 if odd. Counting inversions (pairs that appear out of order) gives the same parity. The sign map is a homomorphism from the symmetric group S₄ to {+1, -1} under multiplication.

Compare it with a second map, "number of fixed points", which looks natural but is not a homomorphism.

Python Sign is a homomorphism, fixed-point count is not

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The sign map succeeds on all 576 pairs. The fixed-point count fails, and you could have predicted that: it sends the identity to 4, and 4 is not the identity of (ℤ, +).

Where homomorphisms come from

Three families cover most of what you will meet:

  • Reduction maps such as ℤ → ℤₙ. They forget information and keep the arithmetic.
  • Embeddings, which copy a small group inside a larger one, like rotations of a square inside all symmetries of the square.
  • Homomorphisms into matrix groups, called representations. They turn abstract groups into concrete matrices.

The next lesson, kernel and image, studies what a homomorphism forgets (its kernel) and what it reaches (its image).

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. Which condition defines a homomorphism f from G to H?

    A homomorphism only has to respect the operation. Being a bijection is the extra condition for an isomorphism.
  2. 2. Why is x -> x + 1 on the integers under addition not a homomorphism?

    Every homomorphism sends identity to identity, but f(0) = 1.
  3. 3. If f is a homomorphism and a has order 5, which statement is guaranteed?

    Since f(a)^5 = f(a^5) = f(e) = e, the order of f(a) divides 5. For a prime 5 that leaves 1 or 5.
  4. 4. How many homomorphisms are there from Z6 to Z12 (additive groups)?

    The generator 1 must go to an element k with 6k = 0 mod 12, i.e. k even: 0, 2, 4, 6, 8, 10. That is 6 maps.

Summary

  • A homomorphism satisfies f(a ∗ b) = f(a) ⋆ f(b); an isomorphism is a bijective homomorphism.
  • It sends the identity to the identity, inverses to inverses and powers to powers.
  • A homomorphism from a cyclic group is determined by the image of a generator, and the image's order must divide the generator's order.
  • Finite maps can be tested by checking every pair of elements.
  • The sign of a permutation is a homomorphism; counting fixed points is not.

Next: Kernel and Image