Solvable group

Solvable group
Original: Jakob.scholbach Vector: Pbroks13 · CC BY-SA 3.0 · source
Name	Solvable group
Type	Algebraic structure
Field	Abstract algebra
Introduced by	Évariste Galois
Introduced date	19th century

Solvable group

A solvable group is a group with a finite chain of subgroups whose successive quotients are abelian, a notion that originated in the work of Évariste Galois on polynomial equations and later was formalized in group theory by Camille Jordan and others. Solvability connects algebraic structures such as Galois groups, Lie groups, and matrix groups to classical problems in the theory of equations, and it plays a role in major results associated with figures like Émile Picard, Emmy Noether, and Joseph Wedderburn. The concept interacts with many institutions and events in mathematics, including the development at places like École Normale Supérieure and conferences such as the International Congress of Mathematicians.

Definition and basic properties

A group G is called solvable if there exists a finite subnormal chain G = G_0 ≥ G_1 ≥ ... ≥ G_n = {e} with each quotient G_i/G_{i+1} abelian; this definition appears in classical writings by Arthur Cayley and was used implicitly by Niels Henrik Abel in work related to the Abel–Ruffini theorem. Equivalent characterizations use derived series G^{(0)} = G, G^{(i+1)} = [G^{(i)},G^{(i)}], terminating at the trivial group after finitely many steps, a viewpoint employed by Emil Artin and Otto Schreier. Basic closure properties include: subgroups and quotients of solvable groups are solvable (observations used by Issai Schur), extensions of solvable groups are solvable (applied in studies by Philip Hall), and finite solvable groups admit Sylow theory analogues exploited by William Burnside.

Examples and non-examples

Classical examples include finite abelian groups such as cyclic groups, symmetric groups of small degree like S3 which relates to Cardano's formulas, and solvable matrix groups such as the group of upper triangular matrices studied by Sophus Lie and Wilhelm Killing. The dihedral groups D_n are solvable for all n, an observation connected to investigations by Evariste Galois and Augustin-Louis Cauchy. Non-examples include simple non-abelian groups such as A5 (the alternating group on five letters), which played a role in proofs of the unsolvability of general quintic equations by Paolo Ruffini and Niels Henrik Abel. Other non-solvable families include most non-abelian finite simple groups classified in the Classification of finite simple groups, which involved contributors like Daniel Gorenstein, Robert Griess, and John Conway.

Series and characterizations (derived, normal, composition)

The derived series G^{(i)} gives one characterization: solvability is equivalent to G^{(n)} = {e} for some n, a technique used in expositions by Issai Schur and Emmy Noether. The lower central series and upper central series provide alternate filtrations studied by Philip Hall and Hans Zassenhaus; nilpotent groups, introduced by Otto Hölder, are those whose lower central series terminates and are therefore solvable. Composition series and Jordan–Hölder theory, developed by Camille Jordan and refined by Philip Hall, relate solvability to composition factors: a finite group is solvable iff all composition factors are cyclic of prime order, a criterion leveraged in the work of William Burnside and Frobenius.

Solvability criteria and tests

Classical tests include Burnside's p^a q^b theorem, proved by William Burnside, which guarantees solvability for groups of order p^a q^b, and Hall subgroup existence theorems by Philip Hall giving criteria in terms of π-subgroups. Frobenius' theorem and results by Marshall Hall Jr. give constraints using character theory as in the work of Issai Schur and Frobenius. The Feit–Thompson theorem, proved by Walter Feit and John G. Thompson, asserts that groups of odd order are solvable and was a milestone connecting solvability to deep structural analysis. Representation-theoretic techniques from Richard Brauer and local analysis examined by George Glauberman also provide solvability tests via p-local subgroups and transfer maps investigated by Emil Artin and Hans Zassenhaus.

Structure and classification results

Finite solvable groups admit a layered structure built from p-groups and cyclic prime order factors; this is formalized in the Fitting subgroup theory developed by Hans Fitting and in the Hall–Higman theorems contributed by Marshall Hall Jr. and Gordon Higman. The role of nilpotent normal subgroups and the structure of complements were studied by Philip Hall and Karl Gruenberg. The historical path to classification of finite simple groups, involving the Atlas of Finite Groups and authors such as Robert Griess and John Conway, clarified which simple groups are non-solvable, and O'Nan–Scott type analyses by Michael O'Nan and Leon Scott influenced permutation group structure related to solvability. For infinite groups, solvability interacts with solvable Lie algebras studied by Nikolai Chebotaryov and Élie Cartan and with algebraic groups analyzed by Claude Chevalley.

Applications and connections to Galois theory and algebraic structures

Solvability is central to Galois theory where the solvability of a polynomial by radicals corresponds to solvability of its Galois group, a paradigm established by Évariste Galois and expounded by Joseph-Louis Lagrange. The insolvability of the general quintic, shown by Niels Henrik Abel and later clarified by Galois, links A5 to the failure of radical expressions; this theme influenced later work by Émile Picard and Emmy Noether in algebraic equations. Solvable groups appear in the theory of algebraic equations over fields studied by Alexander Grothendieck and in modern computational algebra systems developed at institutions like Massachusetts Institute of Technology and University of Cambridge. They also arise in the representation theory of finite groups explored by Richard Brauer and in cohomological methods initiated by Henri Cartan and Jean-Pierre Serre.

Category:Group theory