Lagrange's Theorem

In a finite group, the order of a subgroup divides the order of the group
Lagrange's Theorem

Lagrange’s Theorem. Let GG be a finite , and let HGH \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|.

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

Proof sketch. Pick one representative from each left coset; multiplying by that representative gives a bijection HgHH \to gH, so each coset has size H|H|. Since cosets are disjoint and cover GG, the total size of GG is (number of cosets)×H\times |H|.