Lagrange's theorem

Lagrange's theorem is a foundational result in group theory within abstract algebra that asserts a divisibility relation between the order of a finite group and the order of any of its subgroups. Originating in the work of Joseph Louis Lagrange in the 18th century, the theorem connects structural properties of symmetric groups, cyclic groups, and permutation groups to counting arguments used in algebraic investigations conducted by contemporaries such as Leonhard Euler, Adrien-Marie Legendre, and later formalizers like Augustin-Louis Cauchy and Évariste Galois.

Statement

Let G be a finite group with order |G| and let H be a subgroup of G with order |H|. The theorem states that |H| divides |G| and that the number of left cosets (or right cosets) of H in G, called the index [G:H], satisfies |G| = |H| · [G:H]. This formulation is central to the study of finite group structure and appears alongside classical results associated with Cauchy, Sylow theorems, and the orbit-stabilizer theorem used by mathematicians such as Camille Jordan, William Rowan Hamilton, and Sophus Lie.

Proofs

The standard proof uses coset partitioning: left cosets gH partition G, giving a bijection between cosets and elements of the quotient set G/H, a technique employed by Arthur Cayley and developed in modern expositions by authors like Emmy Noether and Niels Henrik Abel. A counting argument shows each coset has cardinality |H|, so |G| is a multiple of |H|. Alternative proofs exploit actions: letting H act on G by left multiplication yields orbits of size equal to |H|, reminiscent of methods in the work of Ferdinand Georg Frobenius and in the development of representation theory by Issai Schur and Richard Brauer. Category-theoretic perspectives, influenced by Saunders Mac Lane and Samuel Eilenberg, interpret coset decomposition via functorial quotients and monomorphisms in category theory frameworks. Historical proofs trace back to counting and permutation arguments used by Lagrange himself in the context of polynomial equations treated later by Évariste Galois.

Consequences and corollaries

Lagrange's theorem implies immediate corollaries including that possible orders of elements of G divide |G|, a statement leveraged in proofs of Cauchy's theorem and used in classification results culminating in the Sylow theorems by Ludvig Sylow. It restricts subgroup sizes in classical groups like alternating groups and dihedral groups and plays a role in the impossibility results found in Fermat's Last Theorem attempts predating Andrew Wiles. Combined with Cauchy and Sylow theorems, it informs the structure theory developed by William Burnside and the classification programs pursued by Daniel Gorenstein and the CFSG project involving figures like John G. Thompson and Walter Feit. Lagrange's theorem also underpins algorithms in computational algebra implemented in systems such as GAP and SageMath.

Examples and applications

Examples illustrating the theorem include subgroups of cyclic groups where subgroup orders correspond to divisors of the group order as studied by Richard Dedekind; the subgroup structure of the symmetric group S_n demonstrates limits on possible subgroup sizes discussed by Arthur Cayley; and the dihedral group provides concrete indices and coset decompositions used in geometric applications by Jean le Rond d'Alembert and Joseph Fourier. Applications extend to Galois theory where subgroup indices correspond to degrees of field extensions in the work of Évariste Galois and Niels Henrik Abel, to coding theory constructions influenced by Claude Shannon and Richard Hamming, and to cryptographic protocols analyzing group orders in contexts investigated by Whitfield Diffie and Ronald Rivest.

Generalizations and related results

Generalizations include Lagrange-type statements in infinite group contexts via index and cardinality considerations studied by Hermann Weyl and John von Neumann, and extensions to Lie groups relating subgroup dimension to manifold dimension as developed by Élie Cartan and Hermann Weyl. Related results are the index theory used in Bass–Serre theory explored by Jean-Pierre Serre, analogues in ring theory such as ideal index considerations studied by Emmy Noether, and extension to groupoid and category theory settings investigated by Ronald Brown and Alexandre Grothendieck. Further connections appear in homological algebra through cohomology computations by Samuel Eilenberg and Norman Steenrod, and in the Langlands program where group-theoretic divisibility motifs interplay with automorphic representations studied by Robert Langlands.

Category:Theorems in group theory