Skip to content
Tutorials Center
My learning

Topics

Lesson 20 of 37 ยท Homomorphisms and Quotient Groups

Kernel and Image of a Homomorphism

Compute the kernel and image of a group homomorphism, see why a trivial kernel means injective, and explore both with runnable Python examples.

A homomorphism does two things you can measure. It forgets some information (several elements may land on the same output) and it reaches only some of the target group. The kernel measures what is forgotten. The image measures what is reached. Together they tell you almost everything about the map.

Definitions

Let f: G โ†’ H be a homomorphism and let e_H be the identity of H.

  • The kernel is the set of elements of G that f sends to the identity: ker f = { g in G : f(g) = e_H }.
  • The image is the set of outputs: im f = { f(g) : g in G }.

Both are subgroups. The kernel is a subgroup of G and the image is a subgroup of H.

Quick proof for the kernel: e_G is in it because f(e_G) = e_H. If a and b are in it, then f(a โˆ— b) = f(a) โ‹† f(b) = e_H โ‹† e_H = e_H, so a โˆ— b is in it. And f(aโปยน) = f(a)โปยน = e_H, so inverses stay inside.

A worked example

Take f: โ„คโ‚โ‚‚ โ†’ โ„คโ‚โ‚‚ given by f(x) = 3x mod 12. This is a homomorphism (multiplying by a constant respects addition).

  • Kernel: solve 3x โ‰ก 0 (mod 12), so x is a multiple of 4. The kernel is {0, 4, 8}.
  • Image: the outputs are multiples of 3: {0, 3, 6, 9}.

Notice |G| = 12, |ker f| = 3 and |im f| = 4, and 3 ร— 4 = 12. That is not a coincidence. We will prove a general version of it in the first isomorphism theorem.

Let's compute kernels and images by machine, for every multiplication map on โ„คโ‚™.

Python Kernel and image of multiplication maps

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.

Every row ends with |ker| ร— |im| = 12. Rows with k = 1, 5, 7, 11 have kernel and image all of โ„คโ‚โ‚‚: these are the automorphisms (isomorphisms from the group to itself), and k there is coprime to 12.

Kernel tells you whether the map is injective

Theorem. A homomorphism f is injective (one-to-one) if and only if ker f = {e_G}.

Proof. If f is injective, only e_G can map to e_H, so the kernel is trivial. Conversely suppose the kernel is trivial and f(a) = f(b). Then f(a โˆ— bโปยน) = f(a) โ‹† f(b)โปยน = e_H, so a โˆ— bโปยน is in the kernel, hence a โˆ— bโปยน = e_G and a = b.

That is a big saving. To check injectivity you do not compare all pairs of elements; you only look for the elements that map to the identity.

More generally, all elements with the same output differ by a kernel element. If f(a) = f(b), then b = a โˆ— k for some k in the kernel. The set of all elements that land on the same output f(a) is the set a โˆ— ker f, a coset of the kernel. Each output has the same number of preimages as the kernel has elements.

Surjectivity and the image

A homomorphism is surjective (onto) when im f = H. There is no kernel-style shortcut, but the image is a subgroup of H, so for finite groups Lagrange's theorem says |im f| divides |H|. Since each output has |ker f| preimages, |im f| = |G| / |ker f| also divides |G|. So a surjective homomorphism from a group of order 12 onto a group of order 5 cannot exist: 5 does not divide 12.

A permutation example

The sign map from Sโ‚ƒ to {+1, -1} has kernel equal to the even permutations, called Aโ‚ƒ, which has 3 elements. Let's compute it and then look at the fibres (the sets of inputs sharing one output).

Python Kernel and fibres of the sign map on S3

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.

Both fibres have 3 elements, the size of the kernel. The kernel is a subgroup of size 3 sitting inside a group of size 6, and the two fibres are the kernel and its "other half".

A subgroup is not always a kernel. Which subgroups are kernels of some homomorphism? The answer is the normal subgroups, the topic of the next lesson.

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. What is the kernel of f: Z12 -> Z12, f(x) = 3x mod 12?

    3x is 0 mod 12 exactly when x is a multiple of 4, so x is 0, 4 or 8.
  2. 2. A homomorphism f is injective exactly when...

    Trivial kernel is equivalent to injective. The image being everything is surjectivity.
  3. 3. A homomorphism f from a group of order 20 has kernel of order 4. How many elements does the image have?

    Each output has exactly |ker f| = 4 preimages, so the image has 20 / 4 = 5 elements.
  4. 4. The kernel of a homomorphism is always...

    The kernel lives inside G, the domain, and is closed under the operation and inverses.

Summary

  • ker f is the set of elements sent to the identity; im f is the set of outputs.
  • The kernel is a subgroup of the domain and the image is a subgroup of the target.
  • f is injective exactly when its kernel is trivial.
  • Elements with equal outputs differ by a kernel element, so each fibre is a coset of the kernel.
  • For finite groups, |G| = |ker f| ร— |im f|.

Next: Normal Subgroups