Groups and Subgroups - Main Theorem
Lagrange's theorem is one of the cornerstone results in finite group theory, establishing a fundamental constraint on the structure of subgroups.
Let be a finite group and a subgroup of . Then the order of divides the order of :
More precisely, , where denotes the index of in (the number of distinct left cosets of in ).
The proof relies on the observation that left cosets partition into disjoint sets of equal size. If are the distinct left cosets, then:
Each coset has exactly elements, giving where .
Let be a finite group. Then:
- For any , the order divides
- For any , we have
- If is prime, then is cyclic
If where is prime, then has no proper subgroups. Take any in . Then is a subgroup of order . By Lagrange, divides , so . Thus , proving is cyclic.
This shows that is, up to isomorphism, the unique group of prime order .
The converse of Lagrange's theorem is generally false. A group of order need not have a subgroup of order for every divisor of . The alternating group (order 12) has no subgroup of order 6, providing a counterexample.
While Lagrange's theorem constrains subgroup orders, additional structure is needed to guarantee existence. The Sylow theorems strengthen Lagrange's result by guaranteeing subgroups of prime power order. For abelian groups, the fundamental theorem ensures that subgroups exist for all divisors.
Lagrange's theorem extends naturally to arbitrary chains of subgroups. If , then:
This multiplicative property of indices is crucial for analyzing group structure through successive refinements. The theorem fundamentally limits the complexity of finite groups by tying the size of any subgroup to the size of the whole group.