TheoremComplete

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.

TheoremLagrange's Theorem

Let GG be a finite group and HH a subgroup of GG. Then the order of HH divides the order of GG: HG|H| \mid |G|

More precisely, G=H[G:H]|G| = |H| \cdot [G:H], where [G:H][G:H] denotes the index of HH in GG (the number of distinct left cosets of HH in GG).

The proof relies on the observation that left cosets partition GG into disjoint sets of equal size. If g1H,g2H,,gkHg_1H, g_2H, \ldots, g_kH are the distinct left cosets, then: G=g1Hg2HgkHG = g_1H \cup g_2H \cup \cdots \cup g_kH

Each coset giHg_iH has exactly H|H| elements, giving G=kH|G| = k \cdot |H| where k=[G:H]k = [G:H].

TheoremConsequences of Lagrange's Theorem

Let GG be a finite group. Then:

  1. For any gGg \in G, the order g|g| divides G|G|
  2. For any gGg \in G, we have gG=eg^{|G|} = e
  3. If G=p|G| = p is prime, then GG is cyclic
ExampleApplication: Groups of Prime Order

If G=p|G| = p where pp is prime, then GG has no proper subgroups. Take any geg \neq e in GG. Then g\langle g \rangle is a subgroup of order g>1|g| > 1. By Lagrange, g|g| divides pp, so g=p|g| = p. Thus g=G\langle g \rangle = G, proving GG is cyclic.

This shows that Zp\mathbb{Z}_p is, up to isomorphism, the unique group of prime order pp.

The converse of Lagrange's theorem is generally false. A group of order nn need not have a subgroup of order dd for every divisor dd of nn. The alternating group A4A_4 (order 12) has no subgroup of order 6, providing a counterexample.

Remark

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 KHGK \leq H \leq G, then: [G:K]=[G:H][H:K][G:K] = [G:H] \cdot [H:K]

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.