Skip to content
Tutorials Center
My learning

Topics

Lesson 35 of 37 ยท Projects and Practice

Practice: Homomorphisms and Quotients

Practice set on group homomorphisms, kernels, normal subgroups and quotient groups, with a Python checker for each problem and worked answers.

Reading proofs is not the same as writing them. This practice set mixes pen-and-paper reasoning with a computer check: you decide an answer first, then run code to test your claim. Try each problem on paper before you run the solution cell.

Problems

  1. Counting maps. How many group homomorphisms are there from โ„คโ‚โ‚‚ to โ„คโ‚ˆ (both under addition)?
  2. Kernel and image. Let f: โ„คโ‚‚โ‚„ โ†’ โ„คโ‚‚โ‚„ be f(x) = 9x mod 24. Find the kernel, the image and check |ker| ร— |im| = 24.
  3. Normal or not? The dihedral group Dโ‚„ of the square has 8 elements (4 rotations and 4 reflections). How many of its subgroups are normal?
  4. Quotient structure. Is โ„คโ‚‚โ‚„ / โŸจ6โŸฉ cyclic? What is its order?
  5. Proof. Show that a homomorphism from a group of order 7 to a group of order 10 is trivial.

Hints

  • Problem 1: a homomorphism out of a cyclic group is decided by the image of 1, and the image k must satisfy 12 k โ‰ก 0 (mod 8).
  • Problem 2: use gcd(9, 24) to predict the size of the kernel.
  • Problem 3: find all subgroups first (each is generated by at most two elements here), then test conjugation.
  • Problem 5: the image is a subgroup of the target whose order divides 7 (by the first isomorphism theorem) and also divides 10 (by Lagrange). Which numbers divide both?

Solutions with code

Run the first cell to check problems 1 and 2.

Python Check problems 1 and 2

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 count in problem 1 equals gcd(12, 8) = 4: in general there are gcd(m, n) homomorphisms โ„คโ‚˜ โ†’ โ„คโ‚™. For problem 2 the kernel is the multiples of 8 and the image the multiples of 3.

Now problem 3. We build Dโ‚„ as permutations of the square's vertices 0, 1, 2, 3 and test every subgroup for normality.

Python Problem 3: normal subgroups of D4

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 result is 10 subgroups, of which 6 are normal, of orders 1, 2, 4, 4, 4 and 8. The three subgroups of order 4 have index 2. The subgroup {e, rยฒ} is the center. The other four subgroups of order 2 are generated by reflections and are not normal.

The last cell answers problem 4 and tests the claim of problem 5 by brute force on a smaller analogue: homomorphisms from โ„คโ‚‡ to โ„คโ‚โ‚€ are all trivial.

Python Problems 4 and 5

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.

For problem 4, โ„คโ‚‚โ‚„/โŸจ6โŸฉ has order 24/4 = 6 and is generated by the coset 1 + โŸจ6โŸฉ, so it is cyclic and isomorphic to โ„คโ‚†. For problem 5, by the first isomorphism theorem the image has order 7 / |ker|, which divides 7, and by Lagrange it divides 10; the only common divisor is 1, so the image is trivial.

Check your understanding

Quick check ยท 3 questions

of 3 answered You scored / 3 ยท perfect!

  1. 1. How many homomorphisms exist from Z_m to Z_n (additive groups)?

    The generator 1 must map to an element k with m k = 0 mod n; there are gcd(m, n) of them.
  2. 2. A surjective homomorphism from a group of order 18 has kernel of order 3. The target has order...

    By the first isomorphism theorem the image has order 18 / 3 = 6.
  3. 3. Which subgroups of D4 are certainly normal?

    Subgroups of index 2 are always normal. A reflection generates a non-normal subgroup in D4.

Summary

  • There are gcd(m, n) homomorphisms from โ„คโ‚˜ to โ„คโ‚™.
  • |G| = |ker f| ร— |im f|; the first isomorphism theorem identifies G/ker f with im f.
  • Dโ‚„ has 10 subgroups, 6 of them normal.
  • โ„ค_n/โŸจdโŸฉ has order d for a divisor d of n, and is cyclic.
  • Orders must divide both groups: that rules out most homomorphisms between groups of coprime orders.

Next: Practice: Rings and Fields