finite group

finite group
Name	finite group
Caption	Cayley graph visualization for a small finite group
Order	finite
Type	algebraic structure

finite group A finite group is a set with a binary operation that satisfies closure, associativity, identity, and inverses, and has a finite number of elements. Finite groups arise throughout Euclid-era arithmetic, Galois theory, and modern algebraic studies such as the Langlands program, linking algebraic structures to geometry and number theory. They underpin classification results in Jordan-type theorems, computational methods in Turing-style algorithms, and symmetry analyses in Noether-inspired frameworks.

Definition and basic properties

A finite group is formally a group (as in definitions by Galois, Cayley, Lagrange) whose underlying set has finite cardinality, called the order of the group. Basic properties include Lagrange's theorem (attributed to Lagrange), the existence of subgroups whose orders divide the order of the whole group, and consequences such as Cauchy's theorem (historically linked to Cauchy), which ensures elements of prime order. Further structural results use concepts from Sylow, Jordan, and Burnside traditions to analyze element orders, center, commutator subgroups, and solvability in contexts connected to the work of Feit and Thompson.

Examples and classifications

Classical examples include cyclic groups such as those studied by Euler and Gauss, symmetric groups S_n arising from permutation studies by Cauchy and Galois, and alternating groups with roles in Galois correspondence. Matrix groups over finite fields, investigated by Chevalley, Steinberg, and Weyl, produce families like the projective special linear groups PSL(n, q), while sporadic groups discovered by researchers such as Conway, Fischer, Thompson, and Griess form exceptional examples including the Monster group revealed in moonshine conjectures with influences from McKay and Norton. Smaller and instructive examples include dihedral groups linked to polygonal symmetries studied by Euclid-era geometers, quaternion groups connected to Hamilton's innovations, and direct or semidirect products considered by Schur and Wielandt.

Group actions and representations

Action theory, developed following ideas of Cayley and refined by Burnside and Frobenius, studies finite groups acting on sets, giving permutation representations tied to Galois theory and combinatorial enumeration problems linked to Pólya. Linear representations over fields stem from the work of Maschke, Frobenius, and Schur, while character theory, advanced by Burnside, Frobenius, Brauer, and Feit, produces powerful invariants used in classification and counting arguments, and connects to module theory as studied by Noether and Artin. Induction and restriction principles, as formulated by Mackey and applied in contexts like the Langlands program, allow transfer between subgroup representations and whole-group representations.

Sylow theory and subgroup structure

Sylow theory, originating from Sylow's results, gives existence and conjugacy of p-subgroups and determines constraints on the number of Sylow subgroups via congruence relations used by Burnside and further exploited by Hall and Thompson in solvability criteria. Concepts like nilpotent and solvable groups trace through results of Hall, Wielandt, and Frobenius, while focal subgroup theorems and transfer maps relate to Burnside and Gaschutz insights. The study of maximal subgroups has historical contributions from Aschbacher and O'Nan in characterizing subgroup lattices that appear in families identified by Gorenstein and Harada.

Finite simple groups and classification theorem

Finite simple groups, those with no nontrivial normal subgroups, are the building blocks in the Jordan–Hölder sense used by Jordan and Hölder. The classification of finite simple groups is a major collaborative achievement involving mathematicians such as Gorenstein, Lyons, Solomon, Conway, Fischer, Thompson, Feit, and Tits, culminating in lists of cyclic groups of prime order, alternating groups, groups of Lie type (Chevalley, Steinberg, Suzuki, Ree) and 26 sporadic groups including the Baby Monster and the Monster group. Deep methods employed include character theory from Brauer and Fong, geometry of buildings from Tits, and computational approaches influenced by Holt and Wilson.

Applications and connections in mathematics

Finite groups are central to Galois theory in classifying polynomial solvability and field extensions, they inform algebraic topology via actions on homology groups studied by Poincaré and Hurewicz, and they appear in algebraic geometry in the study of automorphism groups of varieties as in work by Grothendieck and Mumford. Connections to number theory include modular forms and monstrous moonshine linking the Monster group to modular functions investigated by Conway and Borcherds, and to combinatorics through block designs and coding theory as in contributions by Erdős, Sloane, and Hamming. Computational group theory, advanced by Todd and Coxeter and implemented in systems motivated by Turing-era computation, enables explicit enumeration, isomorphism testing, and applications to cryptography influenced by Diffie and Hellman.

Category:Group theory