Burnside's paqb theorem

Burnside's paqb theorem
Name	Burnside's paqb theorem
Field	Group theory
Introduced	1911
Named after	William Burnside

Burnside's paqb theorem is a result in group theory asserting that any finite group whose order is divisible by at most two distinct primes is solvable. The theorem, proved by William Burnside in the early 20th century, sits at the intersection of work by contemporaries on Sylow theorems, Frobenius groups, and the structural analysis that later culminated in the classification of finite simple groups. Burnside's theorem influenced research by figures such as Richard Brauer, Gustav Frobenius, Issai Schur, and Emil Artin.

Statement of the theorem

Burnside proved that every finite group of order paqb for primes p and q and nonnegative integers a and b is solvable. The statement is often phrased for positive integers of the form paqb with at most two distinct prime divisors, linking directly to the Sylow theorems, Cauchy's theorem, and the concept of simple groups. Burnside's conclusion ruled out nonabelian simple groups of that order and thus constrains the possibilities considered by Évariste Galois and successors in Galois theory and representation theory.

Historical context and significance

Burnside published the theorem during a period when algebraists such as Camille Jordan, Ferdinand Georg Frobenius, and Issai Schur were developing the foundations of representation theory, and when Frobenius and Schur had already studied characters and group actions. The result addressed questions raised in efforts by Galois and later by Arthur Cayley and Leopold Kronecker about the structure of finite groups of restricted order. Burnside's work influenced later contributions by John Thompson, Walter Feit, G. A. Miller, and Richard Brauer, and it played a role in shaping the program that eventually led to the Feit–Thompson theorem and the classification of finite simple groups project involving researchers at institutions like Princeton University and the Massachusetts Institute of Technology.

Proof outline and key lemmas

Burnside's proof combines character theory developed by Frobenius and Schur with counting arguments relying on the Sylow theorems of Ludwig Sylow. A key step uses the notion of complex characters and orthogonality relations introduced by Frobenius to show constraints on possible irreducible degrees, invoking results related to Schur's lemma and inducement techniques used by Frobenius. Another central lemma shows that a minimal counterexample would have a nontrivial center or a normal p-subgroup; this approach resembles strategies later used by G. A. Miller and Bertram Huppert. Burnside also employs transfer and fusion arguments anticipating methods formalized by R. Brauer and John Thompson in the mid-20th century.

Applications and consequences

Burnside's paqb theorem serves as a tool in Galois theory to prove solvability of Galois groups of certain polynomial equations, influencing the work of Évariste Galois-inspired algebraists like Émile Picard and Emil Artin. The theorem is applied in classification efforts for small-order groups studied by G. A. Miller and Gustav A. Hedlund, and it provides constraints used in proofs by Feit and Thompson for the solvability of broader families of groups. In representation theory, Burnside's result informs restrictions on possible irreducible representation degrees considered by Richard Brauer and Isaacs. Its consequences reach into arithmetic investigations by Andrew Wiles-era number theorists and are referenced in algorithmic group theory work at institutions such as University of Cambridge and University of Oxford.

Examples and counterexamples

Typical examples illustrating the theorem include groups of order p, p^2, pq, and p^aq^b where primes like 2 and 3 act, such as cyclic groups and certain semidirect products constructed using results of Frobenius. Classical counterexamples to naive generalizations include finite simple groups with orders divisible by three or more distinct primes, such as the alternating group A_5 (order 60) studied by Augustin-Louis Cauchy and Niels Henrik Abel, or families like the projective special linear groups PSL(2,7) and larger groups analyzed by Émile Picard and Évariste Galois. These examples show the sharpness of Burnside's restriction to orders with at most two prime factors.

Generalizations and related results

Burnside's theorem motivated stronger results such as the Feit–Thompson theorem establishing that every finite group of odd order is solvable, proven by Walter Feit and John Thompson, and frameworks in character theory refined by Richard Brauer and Bertrand Russell-era algebraists. Related work includes the Hall–Higman theorem and results on p-solvability by Philip Hall and Graham Higman, and the Burnside problem explored by William Burnside and later by G. Baumslag and Novikov–Adian groups. The landscape of finite group theory further expanded through contributions from institutions like Institute for Advanced Study and researchers such as Daniel Gorenstein who advanced the classification of finite simple groups program.

Category:Group theory theorems