This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Lagrange's theorem (group theory) | |
|---|---|
![]() | |
| Name | Lagrange's theorem |
| Field | Group theory |
| Statement | In a finite group, the order of every subgroup divides the order of the group |
| First proved | 18th century |
| Attributed to | Joseph-Louis Lagrange |
Lagrange's theorem (group theory)
Lagrange's theorem is a fundamental result in Group theory that asserts a divisibility relation between the orders of finite groups and their subgroups. It serves as a cornerstone linking structural properties of groups to arithmetic properties of integers, informing classification results in the study of symmetric group, alternating group, cyclic group, and many finite simple groups. The theorem underlies major developments connected to figures and institutions such as École Polytechnique, Société d'encouragement pour l'industrie nationale, Royal Society, and mathematical movements associated with Paris, Berlin, and Cambridge schools.
Lagrange's theorem states: if G is a finite group and H is a subgroup of G, then the order of H divides the order of G, and the index [G:H] equals |G|/|H|. This statement directly influences classification tasks in finite group theory, constrains possible orders of elements via the relation between element orders and subgroup orders, and interacts with major results like the Sylow theorems, Cauchy's theorem, and the theory of p-groups. It is central to analysis in contexts involving Galois groups of extensions studied by figures associated with Académie des sciences, Princeton University, and University of Göttingen.
Standard proofs employ the partitioning of G into left cosets of H and show all cosets have cardinality |H|, yielding |G| = [G:H]|H|. Alternative proofs use right cosets, bijections between coset sets, or the action of G on left cosets giving a homomorphism into a symmetric group S_n and invoking kernel properties. More sophisticated demonstrations connect to orbit-stabilizer theorem methods found in expositions influenced by scholars at Cambridge University, Harvard University, and University of Bonn.
Direct corollaries include that the order of any element divides the order of the ambient group, constraining element structure in cyclic groups and providing immediate obstructions in candidate groups examined by researchers from École Normale Supérieure and Mathematical Association of America expositions. Combined with Cauchy's theorem, it yields existence of elements of prime order dividing |G|, while the Sylow theorems refine subgroup existence to prime power divisors, a line developed in seminars at École Polytechnique and University of Chicago. The theorem is used in classification proofs for small orders, enabling results about groups of order pq studied by mathematicians connected to Princeton University and Institute for Advanced Study.
Practical applications appear in analysis of permutation groups like S_3, S_4, and A_5, in which subgroup order divisibility informs possible subgroup lattice structures investigated in courses at Massachusetts Institute of Technology and Stanford University. In algebraic number theory, Lagrange-type divisibility constrains Galois group sizes for extensions studied by researchers at University of Cambridge and Sorbonne University. Concrete examples include demonstrating impossibility of a subgroup of order 6 in a group of order 10, clarifying subgroup counts in dihedral groups and quaternion groups, topics addressed in texts from Springer Science+Business Media and Cambridge University Press.
Generalizations extend to infinite settings via index theory, coset enumeration, and Haar measure considerations in compact topological groups developed in contexts connected to Institut des Hautes Études Scientifiques and Max Planck Institute for Mathematics. Related results include Lagrange's four-square theorem analogies in naming, links to Burnside's lemma in counting orbits, and integrations with Jordan–Hölder theorem chains and composition factors studied in research at University of Oxford and ETH Zurich. Further categorical generalizations appear in studies of group objects in category theory prominent at University of California, Berkeley.
The theorem is named for Joseph-Louis Lagrange, whose work in the late 18th century at institutions like Académie des sciences and Royal Society influenced algebraic thinking; the result later became a staple in the formalization of abstract algebra in 19th-century schools at University of Göttingen and École Polytechnique. Subsequent development by mathematicians linked to École Normale Supérieure, University of Cambridge, and Princeton University integrated Lagrange's observation into the modern corpus of group theory and its pedagogy.
Category:Theorems in group theory