Lagrange's theorem, in the mathematics of group theory, states that for any finite group G, the order (number of elements) of every subgroup H of G divides the order of G. The theorem is named after Joseph Lagrange.
Proof of Lagrange's Theorem
This can be shown using the concept of left cosets of H in G. The left cosets are the equivalence classes of a certain equivalence relation on G and therefore form a partition of G. Specifically, x and y in G are related if and only if there exists h in H such that x = yh. If we can show that all cosets of H have the same number of elements, then each coset of H has precisely |H| elements. We are then done since the order of H times the number of cosets is equal to the number of elements in G, thereby proving that the order H divides the order of G. Now, if aH and bH are two left cosets of H, we can define a map f : aH → bH by setting f(x) = ba-1x. This map is bijective because its inverse is given by f −1(y) = ab−1y.
This proof also shows that the quotient of the orders |G| / |H| is equal to the index [G : H] (the number of left cosets of H in G). If we write this statement as
then, seen as a statement about cardinal numbers, it is equivalent to the Axiom of choice.
Using the theorem
A consequence of the theorem is that the order of any element a of a finite group (i.e. the smallest positive integer number k with ak = e, where e is the identity element of the group) divides the order of that group, since the order of a is equal to the order of the cyclic subgroup generated by a. If the group has n elements, it follows
This can be used to prove Fermat's little theorem and its generalization, Euler's theorem. These special cases were known long before the general theorem was proved.
The theorem also shows that any group of prime order is cyclic and simple. This in turn can be used to prove Wilson's theorem, that if p is prime then p is a factor of (p-1)!+1.
Existence of subgroups of given order
Full article ▸