Skip to content
Tutorials Center
My learning

Topics

Lesson 15 of 37 · Cosets and Lagrange

Cosets

Define left and right cosets of a subgroup, see that cosets partition a group into equal-sized pieces, and compare them in Z12 and the non-abelian S3.

A subgroup H of a group G slices G into equal-sized, non-overlapping pieces called cosets. This simple picture is behind Lagrange's theorem, quotient groups and counting arguments throughout algebra.

Definition

Let H ≤ G and g ∈ G. The left coset of H containing g is

gH = {gh : h ∈ H},

and the right coset is Hg = {hg : h ∈ H}. In additive notation the coset is g + H. The element g is a representative; any element of the coset can serve as one.

Example: in ℤ with H = 3ℤ (multiples of 3), the cosets are 0 + H = {..., -3, 0, 3, ...}, 1 + H = {..., -2, 1, 4, ...} and 2 + H = {..., -1, 2, 5, ...}. These are exactly the residue classes mod 3.

Computing cosets

Python Cosets of {0,4,8} in Z12

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.

We obtain four cosets of size 3 each, covering all 12 elements with no overlap: 12 = 4 · 3.

The key facts

For H ≤ G:

  1. g ∈ gH (because e ∈ H).
  2. Two left cosets are either equal or disjoint: aH = bH exactly when a⁻¹b ∈ H.
  3. Every coset has the same size as H: the map h ↦ gh is a bijection H → gH (cancellation gives injectivity).
  4. So the left cosets partition G.

Fact 2 is the statement that a ~ b ⟺ a⁻¹b ∈ H is an equivalence relation, whose classes are the left cosets. Right cosets are the classes of ab⁻¹ ∈ H.

Python Cosets form a partition of equal-sized pieces

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.

Left and right cosets can differ

In an abelian group gH = Hg always. In a non-abelian group they can differ. In S₃ take H = {e, (0 1)}.

Python Left versus right cosets in S₃

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 two partitions are different, so H is not "normal" in S₃. Subgroups for which left and right cosets coincide are exactly the normal subgroups, the key to quotient groups in chapter 5.

The number of left cosets equals the number of right cosets (gH ↦ Hg⁻¹ is a bijection between them), even when the cosets themselves differ. This number is the index [G : H].

A picture

flowchart TB
    G["G"] --> A["H = eH"]
    G --> B["g₁H"]
    G --> C["g₂H"]
    G --> D["g₃H"]

The cosets of H are disjoint blocks of equal size that together fill G.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. What is the coset 1 + H for H = {0, 4, 8} in ℤ₁₂?

    Add 1 to each element: {1, 5, 9}.
  2. 2. Two left cosets aH and bH are:

    Cosets are the classes of an equivalence relation, so they are equal or disjoint.
  3. 3. If |G| = 20 and |H| = 4, how many left cosets does H have?

    The cosets are equal-sized blocks of 4 that partition 20 elements, giving 20/4 = 5.
  4. 4. When are all left cosets of H equal to the corresponding right cosets?

    That is the definition of a normal subgroup; it always happens in abelian groups.

Summary

  • A left coset is gH; a right coset is Hg.
  • The left cosets partition G into pieces of size |H|.
  • aH = bH if and only if a⁻¹b ∈ H.
  • Left and right cosets agree in abelian groups but can differ otherwise; the number of cosets is the index [G : H].

Next: Lagrange's Theorem