Lagrange's Theorem. Let GG be a finite , and let H≤GH \le G be a . Then all left of HH in GG have the same as HH, the distinct left cosets form a of GG, and

∣G∣=[G:H]⋅∣H∣,|G| = [G:H]\cdot |H|,

where [G:H][G:H] is the of HH in GG. In particular, ∣H∣|H| divides ∣G∣|G|.

Remarks

This is the basic divisibility theorem for finite groups and is the starting point for many counting arguments. A standard consequence is .