Order (group theory)

Order (group theory)
Name	Order (group theory)
Field	Mathematics

Order (group theory) is a fundamental notion in Mathematics that measures the size of algebraic structures studied in Group theory. It appears in the work of figures associated with Évariste Galois, Augustin-Louis Cauchy, Émile Mathieu, Camille Jordan and later developments connected to Sophus Lie, Emmy Noether, Richard Dedekind and Felix Klein. The concept underpins results in areas influenced by Carl Friedrich Gauss, Niels Henrik Abel, Hermann Weyl and William Rowan Hamilton.

Definition and basic properties

In Group theory, the term "order" assigns a cardinal or numerical size: for an element, it is the smallest positive integer n such that the n-fold product equals the identity, linking to ideas from Galois theory and work by Joseph-Louis Lagrange; for a group, it denotes the cardinality of the underlying set, as treated in texts by David Hilbert and Arthur Cayley. Properties of orders relate to structural theorems in the tradition of Émile Picard, H. S. M. Coxeter, Issai Schur and Philip Hall. Basic assertions connect to the classification program pursued by Daniel Gorenstein, John Conway, Robert Griess and Michael Aschbacher.

Finite and infinite order elements

Elements may have finite order, as in cyclic groups studied by Leonhard Euler, Pierre-Simon Laplace and Adrien-Marie Legendre, or infinite order, as encountered in infinite discrete groups considered by Henri Poincaré, Kurt Gödel-influenced foundational work and the topology-related studies of William Thurston. Torsion elements and torsion-free phenomena appear in the work of Bernhard Riemann and in modern expositions by John Milnor and Serge Lang. Finiteness of element order is central to results by Aleksandr Lyapunov, Niels Henrik Abel classics, and structural analyses by Emil Artin and Jean-Pierre Serre.

Order of a group

The order of a finite group appears in foundational classification efforts such as the Atlas of Finite Groups compiled by contributors including John Conway and Robert Griess; notable finite orders arise in groups like the Monster group, Mathieu group M24, Janko groups and symmetry groups connected to Klein quartic studies by Felix Klein. Infinite groups with cardinal orders are central in work by Georg Cantor and model-theoretic approaches by Alfred Tarski. Group order influences representation theory examined by Issai Schur, Frobenius, Richard Brauer and later by George Mackey.

Lagrange's theorem and consequences

Joseph-Louis Lagrange's theorem states that the order of a subgroup divides the order of a finite group; this result underpins classical theorems attributed to Évariste Galois and informed the development of Galois theory. Consequences include Cauchy's theorem, due to Augustin-Louis Cauchy, which guarantees elements of prime order tied to primes studied by Carl Friedrich Gauss; Sylow theorems, developed by Ludwig Sylow, give existence and conjugacy of p-subgroups and connect to results by Camille Jordan and Wielandt. Applications appear in classification results pursued by Daniel Gorenstein and in the proof strategies of Feit–Thompson theorem authors Walter Feit and John G. Thompson.

Computation and examples

Computational techniques for orders of elements and groups leverage algorithms from Évariste Galois-inspired algebra, modern algorithmic advances from Donald Knuth and Stephen Cook-influenced complexity theory, and software systems following designs by Richard Fateman and projects aligned with SageMath contributors. Examples include cyclic groups Cauchy-style, symmetric groups Augustin-Louis Cauchy and Émile Mathieu permutations, alternating groups linked to Niels Henrik Abel-era problems, dihedral groups arising in Fibonacci-periodicity contexts, and matrix groups over finite fields studied by Évariste Galois and Emil Artin. Orders are explicitly computed in the classification of small groups as in work by Hans Zassenhaus and tabulations related to Burnside and William Burnside's problems.

Applications and related concepts

Order considerations inform representation theory developed by Issai Schur and Frobenius, influence symmetry analysis in physics associated with Hermann Weyl and Paul Dirac, and intersect with number-theoretic topics studied by Carl Friedrich Gauss and G. H. Hardy. Orders appear in algebraic topology through ideas of Henri Poincaré and Lefschetz, in geometry via Felix Klein's Erlangen program, and in combinatorics as in designs studied by Raymond T. Wilson and Ronald Graham. Related concepts include index, torsion, exponent, Sylow subgroups, simple groups from the Classification of Finite Simple Groups project led by Daniel Gorenstein and collaborators, and automorphism groups treated by Otto Schreier and Steinberg.

Category:Group theory