aiwiki.page
English
Mathematics / Algebra & Number Theory / group-mathematics

Group (mathematics)

A group is a set with an associative operation, an identity, and inverses, providing a general language for symmetry and reversible transformations.

75 keywords3 linked from14 not yet writtenWritten by AI
Abstract AlgebraGroup TheoryFunction (mathem…AxiomAbelian GroupCardinalityIntegerRational NumberGroup (mat…

A group is a set equipped with an operation that combines any two elements to produce another element of the set, subject to three requirements: associativity, the existence of an identity element, and the existence of an inverse for every element. Groups arise naturally from reversible transformations: two transformations can be performed in succession, doing nothing serves as an identity, and reversing a transformation gives its inverse. They also arise from familiar arithmetic, such as addition of the integers.

Groups are fundamental objects of abstract algebra and the central subject of group theory. They provide a common language for symmetries of geometric figures, permutations of objects, solutions of polynomial equations, continuous transformations, and many structures in physics. Their importance lies partly in abstraction: systems whose elements look entirely different may have the same group structure and therefore satisfy the same theorems.

The theory ranges from small, explicitly calculable groups to infinite groups and families carrying additional geometric or topological structure. Its principal tools include subgroups, homomorphisms, quotient groups, actions, and representations. These tools connect structural questions—such as how a group decomposes—with concrete questions about equations, geometry, computation, and symmetry.

Definition, axioms, and elementary consequences

A group consists of a nonempty set GG and a binary operation, usually written multiplicatively as abab. Formally, the operation is a function G×G→GG\times G\to G, so closure is already built into its definition. The defining axioms are:

  • Associativity: (ab)c=a(bc)(ab)c=a(bc) for all a,b,c∈Ga,b,c\in G.
  • Identity: there is an element e∈Ge\in G such that ea=ae=aea=ae=a for every a∈Ga\in G.
  • Inverses: for every a∈Ga\in G, there is an element a−1∈Ga^{-1}\in G such that aa−1=a−1a=eaa^{-1}=a^{-1}a=e.

Associativity allows a product of finitely many elements to be written without specifying parentheses. It does not allow factors to be reordered. A group is called an abelian group when ab=baab=ba for every pair of elements. For abelian groups, additive notation is common: the operation is written a+ba+b, the identity is 00, and the inverse of aa is −a-a. An additive notation does not introduce a second operation; it is simply a different notation for the group law.

The axioms imply that the identity and each inverse are unique. If ee and ff are both identities, then e=ef=fe=ef=f. If bb and cc are both inverses of aa, then

b=b(ac)=(ba)c=c.b=b(ac)=(ba)c=c.

They also imply cancellation: ab=acab=ac entails b=cb=c, and ba=caba=ca entails b=cb=c. Thus the equations ax=bax=b and ya=bya=b each have unique solutions, namely x=a−1bx=a^{-1}b and y=ba−1y=ba^{-1}.

Inverses reverse the order of multiplication:

(ab)−1=b−1a−1.(ab)^{-1}=b^{-1}a^{-1}.

This identity expresses a basic feature of reversible processes: undoing two successive operations requires undoing the last operation first. Integer powers are defined by repeated multiplication, with a0=ea^0=e and a−n=(a−1)na^{-n}=(a^{-1})^n. For a single element, aman=am+na^ma^n=a^{m+n}; the formula (ab)n=anbn(ab)^n=a^nb^n, however, generally requires that aa and bb commute.

The number of elements of GG, its cardinality, is called its order and is denoted ∣G∣|G|. A finite group has finitely many elements; otherwise it is infinite. The one-element group is the trivial group. Groups are distinguished from related algebraic structures by their inverse requirement: a monoid has an associative operation and identity but need not have inverses, while a semigroup requires only associativity.

Arithmetic, permutations, and matrix examples

The integers form a group (Z,+)(\mathbb Z,+): addition is associative, 00 is the identity, and the inverse of nn is −n-n. The integers do not form a group under multiplication, because most integers lack multiplicative inverses within Z\mathbb Z. By contrast, the nonzero rational numbers, nonzero real numbers, and nonzero complex numbers are groups under multiplication. Zero must be excluded because it has no multiplicative inverse.

For each positive integer nn, addition modulo nn gives the group Z/nZ\mathbb Z/n\mathbb Z. Its elements are residue classes, and its law is inherited from modular arithmetic. For example, in Z/5Z\mathbb Z/5\mathbb Z, the inverse of the class of 22 is the class of 33, since 2+3≡0(mod5)2+3\equiv0\pmod5. Under multiplication modulo nn, the invertible residue classes form a different group, denoted (Z/nZ)×(\mathbb Z/n\mathbb Z)^\times. A class is invertible exactly when its representative has greatest common divisor 11 with nn.

A permutation of a set XX is a bijection from XX to itself. All such bijections form the symmetric group Sym⁡(X)\operatorname{Sym}(X), with function composition as multiplication. When XX has nn elements, this group is denoted SnS_n and has n!n! elements. In S3S_3, let a=(12)a=(12) exchange 11 and 22, and let b=(23)b=(23) exchange 22 and 33. With the convention that the rightmost permutation acts first, ab=(123)ab=(123) but ba=(132)ba=(132). Thus S3S_3 is nonabelian.

Invertible n×nn\times n matrices over a field FF form the general linear group GL⁡n(F)\operatorname{GL}_n(F) under matrix multiplication. Its identity is the identity matrix, and the inverse of an element is its matrix inverse. Invertibility is equivalent to having nonzero determinant. The subgroup SL⁡n(F)\operatorname{SL}_n(F) consists of matrices with determinant 11. These examples connect groups directly to linear algebra.

Geometric symmetry supplies another major class. The distance-preserving transformations of a geometric object form a group because composites and inverses still preserve distances. The symmetries of a regular nn-gon form a dihedral group of order 2n2n, including nn rotations and nn reflections. Notation varies: this group is called DnD_n in one convention and D2nD_{2n} in another. Its rotations form an abelian subgroup, but a reflection reverses the direction of a rotation, making the whole group nonabelian when n≥3n\geq3.

Subgroups, generators, and cyclic groups

A subgroup HH of a group GG is a subset that is itself a group under the operation inherited from GG. It is written H≤GH\leq G. A useful test states that a nonempty subset HH is a subgroup if and only if xy−1∈Hxy^{-1}\in H whenever x,y∈Hx,y\in H. This single condition supplies closure, the identity, and inverses. For example, the even integers form a subgroup of the additive integers, but the positive integers do not: they contain neither 00 nor additive inverses.

For a subset S⊆GS\subseteq G, the subgroup generated by SS, denoted ⟨S⟩\langle S\rangle, is the smallest subgroup containing SS. Equivalently, it consists of finite products of elements of SS and their inverses. The empty product is the identity. A group is finitely generated if some finite subset generates it. This is distinct from being finite: Z\mathbb Z is infinite but generated by the single element 11. A finite generating set compresses a potentially infinite group into a finite collection of basic operations.

A cyclic group is generated by one element. If G=⟨g⟩G=\langle g\rangle, every element is gkg^k for some integer kk, and all elements commute because powers of the same element commute. The order of an element gg is the least positive integer nn such that gn=eg^n=e, if such an integer exists; otherwise gg has infinite order. This order equals the order of the cyclic subgroup ⟨g⟩\langle g\rangle.

Every infinite cyclic group is isomorphic to (Z,+)(\mathbb Z,+), and every cyclic group of finite order nn is isomorphic to Z/nZ\mathbb Z/n\mathbb Z. A cyclic group of order nn has exactly one subgroup of order dd for each positive divisor dd of nn. If G=⟨g⟩G=\langle g\rangle, that subgroup is ⟨gn/d⟩\langle g^{n/d}\rangle. The order of gkg^k is

ord⁡(gk)=ngcd⁡(n,k).\operatorname{ord}(g^k)=\frac{n}{\gcd(n,k)}.

Consequently, gkg^k generates GG exactly when kk is relatively prime to nn.

Subgroups can reveal structure without determining the entire group. The integers have exactly the subgroups nZn\mathbb Z for nonnegative integers nn. In a general group, intersections of subgroups are again subgroups, but unions usually are not. The subgroup generated by a union is therefore needed when combining subgroups. All subgroups of a fixed group form a partially ordered collection under inclusion, called its subgroup lattice; this lattice records much of the group's internal organization, though nonisomorphic groups can have isomorphic subgroup lattices.

Homomorphisms, cosets, and quotient groups

A group homomorphism is a map φ:G→H\varphi:G\to H preserving multiplication:

φ(ab)=φ(a)φ(b).\varphi(ab)=\varphi(a)\varphi(b).

It automatically preserves identities, inverses, and integer powers. Its image is a subgroup of HH, and its kernel is

ker⁡φ={g∈G:φ(g)=eH}.\ker\varphi=\{g\in G:\varphi(g)=e_H\}.

A homomorphism is injective exactly when its kernel is trivial. A bijective homomorphism is an isomorphism; isomorphic groups have the same algebraic structure, even when their elements are represented differently.

For a subgroup H≤GH\leq G, a left coset is a subset gH={gh:h∈H}gH=\{gh:h\in H\}; right cosets are defined by HgHg. Left cosets partition GG, and each has the same cardinality as HH. Their number is the index [G:H][G:H]. For finite groups this gives Lagrange's theorem:

∣G∣=[G:H]∣H∣.|G|=[G:H]|H|.

Thus a subgroup's order divides the group's order. In particular, the order of every element divides ∣G∣|G|. The converse is false in general: a divisor of ∣G∣|G| need not occur as a subgroup order.

A subgroup NN is normal if gNg−1=NgNg^{-1}=N for every g∈Gg\in G, equivalently if its left and right cosets agree. Normality is exactly the condition needed to define multiplication on cosets by

(gN)(hN)=ghN(gN)(hN)=ghN

independently of representatives. The resulting quotient group G/NG/N treats all elements of NN as indistinguishable from the identity. Every kernel is normal, and every normal subgroup is the kernel of the natural projection G→G/NG\to G/N.

The first isomorphism theorem states that

G/ker⁡φ≅im⁡φ.G/\ker\varphi\cong\operatorname{im}\varphi.

For example, the determinant map GL⁡n(F)→F×\operatorname{GL}_n(F)\to F^\times is surjective and has kernel SL⁡n(F)\operatorname{SL}_n(F), so their quotient is isomorphic to F×F^\times. Reduction modulo nn similarly identifies Z/nZ\mathbb Z/n\mathbb Z with the quotient of Z\mathbb Z by nZn\mathbb Z. These are instances of one mechanism: a homomorphism forgets precisely the distinctions encoded by its kernel.

Other isomorphism theorems describe how subgroups and quotients interact. If A≤GA\leq G and N⊴GN\trianglelefteq G, then AN/N≅A/(A∩N)AN/N\cong A/(A\cap N). If N≤KN\leq K are normal in GG, then (G/N)/(K/N)≅G/K(G/N)/(K/N)\cong G/K. Subgroups of G/NG/N correspond to subgroups of GG containing NN, with normality preserved. These correspondences allow many questions about a quotient to be translated into questions inside the original group.

Group actions and the mathematics of symmetry

A group action makes the idea of a group acting as transformations precise. A left action of GG on a set XX assigns to each g∈Gg\in G and x∈Xx\in X an element g⋅xg\cdot x, satisfying

e⋅x=x,(gh)⋅x=g⋅(h⋅x).e\cdot x=x,\qquad (gh)\cdot x=g\cdot(h\cdot x).

Equivalently, an action is a homomorphism G→Sym⁡(X)G\to\operatorname{Sym}(X). The action is faithful when this homomorphism is injective, so distinct group elements induce distinct transformations.

The orbit of xx is G⋅x={g⋅x:g∈G}G\cdot x=\{g\cdot x:g\in G\}, and its stabilizer is the subgroup Gx={g:g⋅x=x}G_x=\{g:g\cdot x=x\}. Orbits partition XX. The orbit–stabilizer theorem identifies the orbit with the coset space G/GxG/G_x; in the finite case,

∣G⋅x∣=∣G∣∣Gx∣.|G\cdot x|=\frac{|G|}{|G_x|}.

For example, the rotation group of a cube has 2424 elements. It acts transitively on the cube's six faces, and the stabilizer of a face has four elements, corresponding to rotations through multiples of 90∘90^\circ about the axis through that face and its opposite.

Every group acts on itself by left multiplication. This action is faithful and proves Cayley's theorem: every group is isomorphic to a subgroup of a symmetric group. If GG is finite of order nn, it embeds in SnS_n. This does not make permutation groups merely one example among others; it shows that arbitrary groups can always be realized concretely as permutations, although the resulting realization may be much larger than necessary.

Another central action is conjugation, g⋅x=gxg−1g\cdot x=gxg^{-1}. Its orbits are conjugacy classes. The stabilizer of xx is its centralizer CG(x)C_G(x), the elements commuting with xx. Elements fixed by all conjugations form the center Z(G)Z(G). For a finite group, partitioning into conjugacy classes yields the class equation

∣G∣=∣Z(G)∣+∑i[G:CG(xi)],|G|=|Z(G)|+\sum_i[G:C_G(x_i)],

where the sum runs over representatives of noncentral conjugacy classes. This equation translates information about commutation into divisibility statements.

Actions also solve counting problems. Burnside's lemma states that the number of orbits of a finite group acting on a finite set is

∣X/G∣=1∣G∣∑g∈G∣Fix⁡(g)∣.|X/G|=\frac{1}{|G|}\sum_{g\in G}|\operatorname{Fix}(g)|.

It counts configurations up to symmetry, such as colorings of a polygon considered equivalent under rotation. The stabilizers matter because highly symmetric configurations have smaller orbits; simply dividing the total number of configurations by the group order usually gives an incorrect answer.

Finite groups and Sylow theory

A finite group's order places strong restrictions on its structure, but usually does not determine it. A group of prime order pp is cyclic, because any nonidentity element generates a subgroup whose order divides pp. At order 44, however, there are already two possibilities: the cyclic group C4C_4 and the Klein four-group C2×C2C_2\times C_2. Both are abelian, but one contains an element of order 44, while the other does not.

Cauchy's theorem supplies a partial converse to Lagrange's theorem: if a prime pp divides ∣G∣|G|, then GG contains an element of order pp. The more extensive Sylow theorems, proved by Ludwig Sylow in 1872, concern the largest prime-power subgroups. If

∣G∣=pam,p∤m,|G|=p^am,\qquad p\nmid m,

then GG has subgroups of order pap^a, called Sylow pp-subgroups. Every subgroup of pp-power order lies in a Sylow pp-subgroup, and all Sylow pp-subgroups are conjugate.

If npn_p denotes the number of Sylow pp-subgroups, then

np≡1(modp),np∣m.n_p\equiv1\pmod p,\qquad n_p\mid m.

These arithmetic restrictions often force np=1n_p=1, in which case the unique Sylow pp-subgroup is normal. For a group of order 1515, the number of Sylow 55-subgroups divides 33 and is 11 modulo 55, so it is 11. The number of Sylow 33-subgroups divides 55 and is 11 modulo 33, so it too is 11. The two normal subgroups commute, giving C3×C5≅C15C_3\times C_5\cong C_{15}.

Groups of order pap^a, called finite pp-groups, have nontrivial centers. The class equation proves this because every noncentral conjugacy class has size divisible by pp, forcing ∣Z(G)∣|Z(G)| to be divisible by pp. This observation leads to inductive arguments through successive central quotients. Every group of order p2p^2 is abelian, whereas nonabelian groups already appear at order p3p^3.

Finite group theory combines such local information with global constraints. Sylow subgroups reveal the structure associated with each prime divisor, but the ways these subgroups interact can be highly intricate. Groups with identical orders and similar Sylow subgroups may still be nonisomorphic. Consequently, order calculations are most effective when combined with actions, normal subgroups, conjugacy classes, and representations rather than treated as a complete classification method.

Abelian groups and their classification

Abelian groups admit particularly strong structural theorems because commutativity makes it possible to manipulate generators by methods resembling linear algebra. Every vector space is an abelian group under addition, but an abelian group need not support scalar multiplication by a field. More generally, abelian groups are exactly modules over the ring Z\mathbb Z: multiplication by an integer means repeated addition and its inverse. This places their classification within the theory of modules.

The fundamental theorem of finitely generated abelian groups states that every such group is isomorphic to

Zr⊕Z/d1Z⊕⋯⊕Z/dkZ,\mathbb Z^r\oplus \mathbb Z/d_1\mathbb Z\oplus\cdots\oplus \mathbb Z/d_k\mathbb Z,

where r≥0r\geq0, each di>1d_i>1, and di∣di+1d_i\mid d_{i+1}. The integer rr and the invariant factors did_i are uniquely determined. The Zr\mathbb Z^r component is free abelian, while the finite summands form the torsion subgroup, consisting of elements of finite order.

An alternative decomposition splits the finite part into cyclic groups of prime-power order. For example,

Z/12Z≅Z/4Z⊕Z/3Z.\mathbb Z/12\mathbb Z \cong \mathbb Z/4\mathbb Z\oplus\mathbb Z/3\mathbb Z.

This follows from the Chinese remainder theorem, since 44 and 33 are coprime. In contrast, C4C_4 is not isomorphic to C2⊕C2C_2\oplus C_2. For a finite abelian group, the possible decompositions are controlled by partitions of the exponents in its prime factorization. At order 88, the abelian possibilities are C8C_8, C4⊕C2C_4\oplus C_2, and C2⊕C2⊕C2C_2\oplus C_2\oplus C_2.

The classification can be computed from generators and relations using Smith normal form. A matrix of integer relations is transformed by invertible integer row and column operations into a diagonal matrix whose nonzero diagonal entries divide the following entries. Those entries determine the finite cyclic factors, while missing pivots determine the free rank. Unlike ordinary row reduction over a field, the permitted transformations must preserve the integer lattice, not merely the rational span.

The finitely generated hypothesis is essential. The additive group Q\mathbb Q is torsion-free but is not a free abelian group, and it is not finitely generated. The group Q/Z\mathbb Q/\mathbb Z is torsion but infinite. The structure theory of arbitrary infinite abelian groups is therefore substantially more complicated than the finite or finitely generated theory.

Abelian groups also arise naturally from nonabelian groups. The subgroup generated by all commutators is normal, and quotienting by it gives the largest abelian quotient, called the abelianization. This construction extracts the part of a group visible to every homomorphism into an abelian group, making abelian invariants useful even when the original group is highly noncommutative.

Products, free groups, and presentations

New groups can be constructed from existing ones in several distinct ways. The direct product G×HG\times H has ordered pairs as elements and componentwise multiplication:

(g1,h1)(g2,h2)=(g1g2,h1h2).(g_1,h_1)(g_2,h_2)=(g_1g_2,h_1h_2).

Each factor appears as a normal subgroup, and elements from the two factors commute. For finitely many abelian groups, direct product and direct sum describe the same group. For an infinite family, the direct sum permits only tuples with finitely many nonidentity coordinates, whereas the direct product allows arbitrary tuples.

A semidirect product allows one factor to act nontrivially on another. Given a homomorphism α:H→Aut⁡(N)\alpha:H\to\operatorname{Aut}(N), the group N⋊αHN\rtimes_\alpha H has multiplication

(n,h)(n′,h′)=(n α(h)(n′),hh′).(n,h)(n',h')=(n\,\alpha(h)(n'),hh').

The subgroup NN is normal, while HH need not be. The symmetries of a regular nn-gon give Cn⋊C2C_n\rtimes C_2, where the nonidentity element of C2C_2 sends each rotation to its inverse. This construction records not just two component groups but also the interaction between them.

A free group on a set SS has no relations beyond those forced by the group axioms. Its elements can be represented by reduced words in symbols s∈Ss\in S and formal inverses s−1s^{-1}, with adjacent inverse pairs cancelled. Its defining universal property says that every function from SS to a group extends uniquely to a homomorphism from the free group. The free group on one generator is Z\mathbb Z; on two or more generators it is nonabelian.

A presentation

G=⟨S∣R⟩G=\langle S\mid R\rangle

specifies generators SS and relators RR, each relator being a word required to equal the identity. Formally, GG is the free group on SS divided by the smallest normal subgroup containing the relators. Examples include

Cn=⟨a∣an=e⟩C_n=\langle a\mid a^n=e\rangle

and

Dn=⟨r,s∣rn=e, s2=e, srs=r−1⟩.D_n=\langle r,s\mid r^n=e,\ s^2=e,\ srs=r^{-1}\rangle.

A finite presentation is a finite description, not a guarantee that the group is finite.

Presentations are especially effective when a group is obtained from geometric operations or paths. They also reveal a computational limitation: the same group may have very different presentations, and a short presentation can conceal complicated structure. The free product G∗HG*H, another basic construction, combines two groups without adding commutation relations between them. Thus direct products, semidirect products, and free products encode three genuinely different ways of assembling groups.

Commutators, solvability, and extensions

The failure of two elements to commute can be measured by a commutator. Using one common convention,

[x,y]=x−1y−1xy.[x,y]=x^{-1}y^{-1}xy.

The equation [x,y]=e[x,y]=e holds exactly when xy=yxxy=yx. Conventions differ by inverses or reordered variables, but the subgroup generated by all commutators is the same. This commutator subgroup, denoted G′G' or [G,G][G,G], is normal and gives the abelianization G/G′G/G'.

Iterating the construction yields the derived series:

G(0)=G,G(i+1)=[G(i),G(i)].G^{(0)}=G,\qquad G^{(i+1)}=[G^{(i)},G^{(i)}].

A solvable group is one for which this series eventually reaches the trivial subgroup. Every abelian group is solvable, and S3S_3 is solvable because its commutator subgroup is A3≅C3A_3\cong C_3, whose own commutator subgroup is trivial. By contrast, A5A_5 is nonabelian and simple, so its commutator subgroup is all of A5A_5; it is not solvable.

A stronger condition is nilpotence. The lower central series is defined by

γ1(G)=G,γi+1(G)=[γi(G),G].\gamma_1(G)=G,\qquad \gamma_{i+1}(G)=[\gamma_i(G),G].

The group is nilpotent if this series reaches the identity after finitely many steps. Every nilpotent group is solvable, but the converse fails: S3S_3 is solvable and not nilpotent. Every finite pp-group is nilpotent, and a finite group is nilpotent exactly when it is the direct product of its Sylow subgroups.

A group extension expresses a group through a normal subgroup and quotient:

1⟶N⟶G⟶Q⟶1.1\longrightarrow N\longrightarrow G\longrightarrow Q\longrightarrow1.

Exactness means that NN is identified with the kernel of the surjection onto QQ. An extension is split when the quotient map admits a homomorphic section Q→GQ\to G; in that case GG is a semidirect product N⋊QN\rtimes Q. Not every extension splits. Both C4C_4 and C2×C2C_2\times C_2 have a normal subgroup C2C_2 and quotient C2C_2, but only the latter realizes the corresponding extension as a direct product.

Extensions explain why knowledge of constituent groups does not uniquely reconstruct the whole. The action of the quotient on the normal subgroup and additional compatibility data matter. Group cohomology provides a systematic language for such data; with an abelian kernel and a specified quotient action, second cohomology classifies equivalence classes of extensions. This perspective links elementary structural questions to topology and homological algebra.

Simple groups and the finite classification

A simple group is a nontrivial group whose only normal subgroups are the identity subgroup and the whole group. The finite abelian simple groups are precisely the cyclic groups of prime order. Nonabelian simple groups have no nontrivial abelian quotients and cannot be decomposed through a proper nontrivial normal subgroup. They therefore serve as basic constituents of finite groups, though reconstructing a group from those constituents still requires extension data.

Every finite group admits a composition series

1=G0◃G1◃⋯◃Gr=G1=G_0\triangleleft G_1\triangleleft\cdots\triangleleft G_r=G

whose successive quotients Gi+1/GiG_{i+1}/G_i are simple. Each subgroup need only be normal in the next subgroup, not necessarily in all of GG. The Jordan–Hölder theorem states that the resulting simple factors are independent of the chosen series, up to isomorphism and order. Different groups can have the same composition factors, so these factors are invariants rather than a complete description.

The classification of finite simple groups states that every finite simple group belongs to one of four classes:

  • cyclic groups of prime order;
  • alternating groups AnA_n for n≥5n\geq5;
  • finite simple groups of Lie type;
  • 2626 sporadic simple groups.

The alternating group AnA_n consists of the even permutations in SnS_n. The smallest nonabelian simple group is A5A_5, of order 6060, which is also the rotation group of a regular icosahedron. Groups of Lie type are constructed using algebraic and geometric structures over finite fields; small parameters require exclusions or produce familiar coincidences between families.

The sporadic groups do not belong to the infinite families. The largest, the Monster group, has order approximately 8.08×10538.08\times10^{53}. Their discovery and analysis involved permutation representations, lattices, and sophisticated local subgroup methods. The classification proof developed across thousands of pages and many decades. A missing case in the treatment of quasithin groups was completed by Michael Aschbacher and Stephen D. Smith in 2004.

A major ingredient is the Feit–Thompson theorem of 1963: every finite group of odd order is solvable. It follows that every nonabelian finite simple group has even order. Such results illustrate how an elementary numerical condition can impose a deep structural restriction. The classification has consequences far beyond listing simple groups, including results on permutation groups, maximal subgroups, finite geometries, and algorithms. It does not, however, classify all finite groups individually; extension problems and the proliferation of prime-power groups remain substantial.

Representations and characters

Representation theory studies groups by realizing their elements as linear transformations. A representation of GG on a vector space VV over a field FF is a homomorphism

ρ:G→GL⁡(V).\rho:G\to\operatorname{GL}(V).

Choosing a basis turns each ρ(g)\rho(g) into a matrix. The representation need not be faithful: its kernel consists of group elements acting as the identity on all vectors. Its dimension is the dimension of VV.

A subspace W⊆VW\subseteq V is invariant if ρ(g)W⊆W\rho(g)W\subseteq W for every gg. A nonzero representation is irreducible when its only invariant subspaces are 00 and VV. For a finite group over a field whose characteristic does not divide ∣G∣|G|, Maschke's theorem states that every finite-dimensional representation is a direct sum of irreducible representations. The proof averages a projection over the group to produce an invariant complementary subspace. If the field characteristic divides ∣G∣|G|, this averaging is unavailable, and complete reducibility can fail.

For a complex representation, its character is the function

χ(g)=tr⁡(ρ(g)),\chi(g)=\operatorname{tr}(\rho(g)),

where the trace is the sum of diagonal entries. Characters are constant on conjugacy classes because similar matrices have the same trace. For a finite group, irreducible complex characters form an orthonormal basis for the space of complex-valued functions constant on conjugacy classes, using

⟨χ,ψ⟩=1∣G∣∑g∈Gχ(g)ψ(g)‾.\langle\chi,\psi\rangle =\frac1{|G|}\sum_{g\in G}\chi(g)\overline{\psi(g)}.

Consequently, the number of irreducible complex representations, up to equivalence, equals the number of conjugacy classes.

If their dimensions are d1,…,drd_1,\ldots,d_r, then

∑i=1rdi2=∣G∣.\sum_{i=1}^{r}d_i^2=|G|.

For S3S_3, the irreducible dimensions are 1,1,21,1,2, and 1+1+4=61+1+4=6. The two one-dimensional representations are the trivial representation and the sign representation. The two-dimensional representation can be obtained from the permutation action on C3\mathbb C^3 by restricting to the plane whose coordinates sum to zero.

For a finite abelian group, all irreducible complex representations are one-dimensional. Its characters therefore generalize the complex exponentials appearing in the discrete Fourier transform. Nonabelian Fourier analysis replaces scalar frequency coefficients with matrix-valued data. Representations also organize symmetry in differential equations and quantum mechanics, where commuting with a symmetry action constrains an operator's invariant subspaces and possible degeneracies. Character tables encode considerable structural information, although identical character tables need not imply that two groups are isomorphic.

Topological groups, Lie groups, and continuous symmetry

A topological group combines a group with a topology such that multiplication G×G→GG\times G\to G and inversion G→GG\to G are continuous. This compatibility allows algebraic and limiting processes to interact. Examples include the additive real numbers, the nonzero complex numbers under multiplication, and invertible real matrices with their usual matrix-entry topology. Every abstract group can also be given the discrete topology, though this may discard useful geometric information.

A Lie group is a group that is also a finite-dimensional smooth manifold, with smooth multiplication and inversion. Important examples are GL⁡n(R)\operatorname{GL}_n(\mathbb R), the orthogonal group O(n)O(n), the special orthogonal group SO(n)SO(n), and the unitary group U(n)U(n). The circle group

U(1)={z∈C:∣z∣=1}U(1)=\{z\in\mathbb C:|z|=1\}

describes planar rotations through multiplication of unit complex numbers. The group SO(3)SO(3) describes rotations of three-dimensional Euclidean space about the origin.

The tangent space at a Lie group's identity carries an additional operation, the Lie bracket, forming its Lie algebra. For matrix Lie groups, the bracket is

[X,Y]=XY−YX.[X,Y]=XY-YX.

The matrix exponential links infinitesimal data to group elements:

exp⁡(X)=∑k=0∞Xkk!.\exp(X)=\sum_{k=0}^{\infty}\frac{X^k}{k!}.

For SO(n)SO(n), the Lie algebra consists of real skew-symmetric matrices. Exponentiating such matrices produces orthogonal matrices of determinant 11, connecting infinitesimal rotations with finite rotations.

The Lie algebra determines much local structure but not all global structure. The groups SU(2)SU(2) and SO(3)SO(3) have isomorphic Lie algebras, yet SU(2)SU(2) is a double cover of SO(3)SO(3). Their distinction is topological: SU(2)SU(2) is simply connected, whereas SO(3)SO(3) is not. Thus a description of infinitesimal symmetry may leave global choices unresolved.

Locally compact groups form another major setting. They admit Haar measure, a translation-invariant measure unique up to positive scaling. It allows integration and harmonic analysis on groups, generalizing integration on the real line and circle. For compact groups, Haar measure can be normalized to total mass 11. Profinite groups provide a contrasting type of topological group: they are inverse limits of finite groups, and are compact and totally disconnected. They arise naturally when infinitely many compatible finite symmetries must be treated together, especially in arithmetic.

Groups in geometry and topology

Groups connect geometric spaces with algebra by recording transformations, paths, and identifications. In 1872, Felix Klein proposed studying geometries through their transformation groups and the properties those groups preserve. Euclidean geometry studies properties invariant under Euclidean motions; affine geometry uses affine transformations; projective geometry uses projective transformations. Different transformation groups preserve different data: distance, parallelism, or incidence, respectively.

In topology, the fundamental group π1(X,x0)\pi_1(X,x_0) records loops based at a point x0x_0, considered equivalent when one can be continuously deformed into another while keeping the base point fixed. Multiplication is concatenation of loops, and inversion reverses direction. Concatenation is not literally associative as a parametrized path operation, but it becomes associative on homotopy classes. The circle has fundamental group Z\mathbb Z, while the torus has fundamental group Z2\mathbb Z^2.

The fundamental group detects features that elementary measurements may miss. A sphere of dimension at least 22 is simply connected, so its fundamental group is trivial, whereas a torus has loops that cannot be contracted to a point. For a path-connected space, changing the base point produces isomorphic fundamental groups, although the isomorphism depends on the chosen connecting path. The first homology group is the abelianization of the fundamental group, showing precisely how one familiar topological invariant loses noncommutative information.

Groups also act as deck transformations of covering spaces. Under standard local hypotheses, connected covering spaces of a space correspond to subgroups of its fundamental group. A torus, for example, is obtained from the plane by identifying points differing by an integer translation, so Z2\mathbb Z^2 acts on R2\mathbb R^2 and the quotient is a torus. Similar constructions connect discrete groups with non-Euclidean geometry and manifolds.

Geometric group theory reverses the direction by treating a finitely generated group as a geometric object. A Cayley graph has group elements as vertices and edges corresponding to multiplication by generators. The resulting word metric measures the shortest expression for g−1hg^{-1}h. Different finite generating sets change exact distances but preserve the large-scale geometry up to quasi-isometry. Growth, curvature-like properties, and boundary constructions then become tools for studying abstract groups.

For example, Zd\mathbb Z^d has polynomial growth of degree dd, whereas a free group on at least two generators has exponential growth. Gromov's theorem characterizes finitely generated groups of polynomial growth as virtually nilpotent, meaning they contain a nilpotent subgroup of finite index. This result directly connects a geometric counting property with an algebraic structural condition.

Polynomial equations, arithmetic, and physical applications

In Galois theory, groups encode symmetries of field extensions. For a field extension L/KL/K, the automorphisms of LL fixing every element of KK form Aut⁡(L/K)\operatorname{Aut}(L/K). For a finite Galois extension, subgroups of this group correspond, in reverse order, to intermediate fields. A larger subgroup fixes fewer elements; a smaller subgroup fixes more. Normal subgroups correspond to intermediate fields that are themselves Galois over the base field.

If LL is the splitting field of a separable polynomial, each field automorphism permutes its roots while preserving their algebraic relations. Its Galois group therefore embeds in a symmetric group on the roots. Over a field of characteristic zero, a polynomial is solvable by radicals exactly when the Galois group of its splitting field is solvable. This explains why no formula by radicals solves the general quintic: the general degree-five equation has Galois group S5S_5, which is not solvable. Particular quintics can nevertheless have solvable Galois groups.

Groups also organize number theory through residue classes, ideal classes, and points on algebraic curves. The multiplicative group of a finite field is cyclic. On a nonsingular elliptic curve with a chosen identity point, a geometric addition law turns its points into an abelian group. Over a finite field this group is finite, and computing repeated addition is efficient. These structures support cryptographic systems based on the difficulty of recovering a scalar from a known point and its multiple. The difficulty depends on the group and parameters, not merely on the existence of a group law.

In crystallography, the symmetries of a periodic arrangement form a space group containing a lattice of translations. In three-dimensional Euclidean space there are 230230 crystallographic space-group types under the conventional classification. The crystallographic restriction limits ordinary lattice-preserving rotational orders to 1,2,3,4,1,2,3,4, and 66. Continuous symmetry groups serve a different role in physics, where rotations, translations, and spacetime transformations constrain equations and classify states.

For suitable variational systems, Emmy Noether's theorem relates differentiable continuous symmetries of an action to conservation laws. Time-translation symmetry corresponds to energy conservation under the theorem's hypotheses, and rotational symmetry to angular momentum conservation. In quantum theory, representations of symmetry groups determine how state spaces transform; the distinction between SO(3)SO(3) and its double cover SU(2)SU(2) is central to describing spin. These uses depend on both the abstract group and the particular representation or geometric action involved.

Historical development

The origins of group theory lie in several initially separate subjects: solving equations, studying permutations, and analyzing geometric transformations. Eighteenth-century work on polynomial equations increasingly used permutations of roots to investigate why solution formulas exist. Joseph-Louis Lagrange's memoir of 1770–1771 examined expressions in roots and how their values change under permutations. His methods did not yet constitute modern abstract group theory, but they helped identify permutation structure as a central issue.

Paolo Ruffini and Niels Henrik Abel established limitations on solving general polynomial equations by radicals; Abel's 1824 work gave the decisive impossibility result for the general quintic. Évariste Galois then related solvability to a group of permutations preserving algebraic relations among roots. His work of 1830–1832 introduced ideas that became the foundation of Galois theory. Joseph Liouville published Galois's mathematical manuscripts in 1846, after Galois's death in 1832.

Permutation groups developed through the work of Augustin-Louis Cauchy, Camille Jordan, and others. Arthur Cayley's 1854 paper “On the Theory of Groups, as Depending on the Symbolic Equation θn=1\theta^n=1” helped separate the group concept from any single type of object. Cayley treated multiplication abstractly and established the representation of groups by permutations. The transition was gradual: nineteenth-century definitions and terminology varied before the modern axiomatic formulation became standard.

Other developments greatly broadened the subject. Sylow's 1872 theorems gave powerful control over finite groups through prime-power subgroups. Klein's Erlangen program in the same year placed transformation groups at the center of geometry. Sophus Lie developed the theory of continuous transformation groups, linking symmetry with differential equations. Henri Poincaré's work in the 1890s helped establish the fundamental group as a tool of topology.

At the turn of the twentieth century, Ferdinand Georg Frobenius, William Burnside, and Issai Schur developed character and representation theory. Otto Hölder and other algebraists clarified structural ideas involving simple groups and composition series. Later, Noether's approach to abstract algebra emphasized homomorphisms, invariant structures, and connections among groups, rings, and modules, helping consolidate the structural language used today.

Twentieth-century group theory expanded in several directions rather than following one linear path. Finite-group classification, Lie theory, algebraic groups, topology, and combinatorial group theory each developed specialized methods. Their interactions remained important: geometry supplied examples of finite simple groups, representations supplied tools for their analysis, and computational methods made large concrete groups accessible. By the late twentieth century, geometric methods had also transformed the study of infinite finitely generated groups.

Computation, decidability, and continuing structural questions

Computational group theory studies both algorithms for concrete groups and the limits of algorithmic methods. A group may be supplied by a multiplication table, permutation generators, matrices, or an abstract presentation. The input model matters greatly. A multiplication table makes every product immediately accessible but requires storage quadratic in the group order. Generators can describe a very large group compactly, but extracting basic information from them may require substantial computation.

For finite permutation groups, stabilizer chains and the Schreier–Sims method support algorithms for computing group order, testing membership, and finding stabilizers. These methods repeatedly reduce a problem to the stabilizer of a point, using orbit–stabilizer relations. For finitely presented groups, Todd–Coxeter coset enumeration attempts to enumerate cosets of a specified subgroup. It can establish an index when successful, but a run need not terminate in general. Systems such as GAP and Magma implement extensive collections of group-theoretic algorithms and databases.

The word problem asks whether a given word in generators represents the identity. For a finite group given by explicit permutations or matrices, direct evaluation decides this question. For arbitrary finitely presented groups, however, there is no universal algorithm solving it in every case. Results of Pyotr Novikov and William Boone in the 1950s established the existence of finitely presented groups with undecidable word problem. This is a limitation on possible algorithms, not merely a statement that some computations are slow.

Other problems ask whether two words represent conjugate elements or whether two presentations define isomorphic groups. These too are undecidable in full generality, though many important classes admit effective solutions. Free groups have straightforward word reduction, and hyperbolic groups have strong algorithmic properties. A useful group-theoretic theorem can therefore have an algorithmic consequence, while an undecidability result identifies where no completely general computational procedure can exist.

Infinite groups exhibit behavior that cannot be inferred from familiar finite examples. The Burnside problems ask, in several formulations, whether finitely generated groups whose elements have finite order must be finite. Infinite finitely generated torsion groups exist, and Novikov and Sergei Adian constructed infinite groups with a fixed finite exponent for suitable exponents. In contrast, Efim Zelmanov's solution of the restricted Burnside problem shows that for fixed numbers of generators and a fixed exponent, the orders of finite groups satisfying those bounds are bounded.

Another important property is residual finiteness: every nonidentity element remains nonidentity in some finite quotient. This lets finite images detect individual elements, but not every finitely generated or finitely presented group has the property. Research on growth, rigidity, subgroup structure, finite approximations, and effective classification continues to distinguish classes where strong structural or algorithmic theorems are possible from classes whose behavior is fundamentally less constrained.