Abstract Algebra · Undergraduate

Cosets and Lagrange's Theorem

Quick answer

A coset of a subgroup H is what you get by shifting all of H by one element: aH = {ah : h in H}. The cosets of H split the group into pieces that do not overlap and all have the same size as H. So the order of H divides the order of G, which is Lagrange's theorem. It has quick consequences: the order of every element divides |G|, every group of prime order is cyclic, and a^(p − 1) ≡ 1 (mod p) for every a not divisible by a prime p, which is Fermat's little theorem.

What you'll learn

  • List the cosets of a subgroup
  • Prove Lagrange's theorem by counting cosets
  • Use Lagrange's theorem to rule out subgroups and element orders
  • Derive Fermat's little theorem and compute large powers mod p

Shifting a subgroup

Let HH be a subgroup of GG. For any a∈Ga \in G, the left coset of HH by aa is

aH={ah:h∈H}aH = \{ah : h \in H\}

In Z12\mathbb{Z}_{12} with H=⟨4⟩={0,4,8}H = \langle 4\rangle = \{0, 4, 8\}, the cosets are the shifts of HH:

CosetElements
0+H0 + H0,4,80, 4, 8
1+H1 + H1,5,91, 5, 9
2+H2 + H2,6,102, 6, 10
3+H3 + H3,7,113, 7, 11

Four cosets, each of size 33, covering all 1212 elements exactly once.

Lagrange’s theorem. If HH is a subgroup of a finite group GG, then ∣H∣|H| divides ∣G∣|G|, and the number of cosets, the index, is ∣G∣∣H∣\tfrac{|G|}{|H|}.

Why the cosets tile the group

Two facts do the work. Each coset has exactly ∣H∣|H| elements, because h↦ahh \mapsto ah is one-to-one: ah1=ah2ah_1 = ah_2 forces h1=h2h_1 = h_2 after multiplying by a−1a^{-1}. Two cosets are either equal or disjoint: if cc lies in both aHaH and bHbH, then c=ah1=bh2c = ah_1 = bh_2, so a=bh2h1−1a = bh_2h_1^{-1}, and every element ahah of aHaH equals b(h2h1−1h)b(h_2h_1^{-1}h), which lies in bHbH; by symmetry the two cosets are equal. Every element aa lies in its own coset aHaH. So GG is cut into equal pieces of size ∣H∣|H|, and ∣G∣|G| is a multiple of ∣H∣|H|.

Worked examples

Common mistakes

Practice problems

  1. List the possible orders of subgroups of a group of order 1212.

    Answer

    1,2,3,4,6,121, 2, 3, 4, 6, 12

    Full solution

    By Lagrange’s theorem they must divide 1212.

  2. Find the index of ⟨3⟩\langle 3\rangle in Z12\mathbb{Z}_{12}.

    Answer

    33

    Full solution

    ⟨3⟩={0,3,6,9}\langle 3\rangle = \{0, 3, 6, 9\} has 44 elements, and 124=3\tfrac{12}{4} = 3.

  3. Find 210 mod 112^{10} \bmod 11 without multiplying it out.

    Answer

    11

    Full solution

    Fermat’s little theorem with p=11p = 11.

  4. Find 420 mod 74^{20} \bmod 7.

    Answer

    22

    Full solution

    46≡14^6 \equiv 1 and 20=18+220 = 18 + 2, so 420≡42=16≡24^{20} \equiv 4^2 = 16 \equiv 2.

  5. Explain why every group of order 77 is cyclic.

    Answer

    Any element other than ee has order dividing 77 and greater than 11, so its order is 77.

    Full solution

    That element generates a subgroup of size 77: the whole group.

  6. Does S4S_4 have an element of order 55?

    Answer

    No

    Full solution

    ∣S4∣=24|S_4| = 24, and 55 does not divide 2424. (A 5-cycle needs five symbols.)

  7. List the cosets of ⟨6⟩\langle 6\rangle in Z12\mathbb{Z}_{12}.

    Answer

    {0,6},{1,7},{2,8},{3,9},{4,10},{5,11}\{0, 6\}, \{1, 7\}, \{2, 8\}, \{3, 9\}, \{4, 10\}, \{5, 11\}

    Full solution

    Six cosets of size 22, matching 122=6\tfrac{12}{2} = 6.

  8. A student says a group of order 1212 must have a subgroup of order 66 because 66 divides 1212. Respond.

    Answer

    Lagrange’s theorem does not run backward; A4A_4 is a counterexample.

    Full solution

    The theorem says subgroup orders divide ∣G∣|G|. It does not promise a subgroup for each divisor.

Frequently asked questions

What is a coset?

For a subgroup H of G and an element a of G, the left coset aH is the set of all products ah with h in H. In additive notation it is a + H.

What does Lagrange's theorem say?

If H is a subgroup of a finite group G, then |H| divides |G|. The number of cosets, |G|/|H|, is the index of H.

What follows about the order of an element?

The order of a divides |G|, since it is the size of the subgroup ⟨a⟩. So a^|G| = e.

Is the converse true?

No. A₄ has 12 elements but no subgroup of order 6, even though 6 divides 12.

How does Lagrange's theorem give Fermat's little theorem?

The nonzero numbers mod a prime p form a group under multiplication of order p − 1, so a^(p − 1) = 1 for each of them.

What to learn next