MathLabs
TheoremProved

Lagrange's theorem (group theory)

Statement

If GG is a finite group and HH is a subgroup of GG, then ∣H∣|H| divides ∣G∣|G|; in fact ∣G∣=[G:H]⋅∣H∣|G| = [G:H]\cdot|H|, where [G:H][G:H] is the number of cosets of HH in GG.

Why is it true?

A subgroup HH slices the whole group GG into cosets gHgH that are all exactly the same size as HH (translating by gg is a bijection) and that never overlap — every element of GG lands in exactly one coset. Since GG is completely tiled by same-sized, non-overlapping pieces, its size must be a whole multiple of the piece size ∣H∣|H|.

Proof sketch

Show that the left cosets gHgH partition GG: they cover GG (each g∈gHg\in gH) and any two cosets are either identical or disjoint (if g1H∩g2H≠∅g_1H\cap g_2H\neq\varnothing then g1H=g2Hg_1H=g_2H). Each coset has exactly ∣H∣|H| elements because h↦ghh\mapsto gh is a bijection H→gHH\to gH. Summing ∣H∣|H| over the [G:H][G:H] cosets gives ∣G∣=[G:H]⋅∣H∣|G|=[G:H]\cdot|H|.

Stated by

Topics that use this theorem

Related theorems

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. David S. Dummit, Richard M. Foote (2004). Abstract Algebra