Burnside Problem¶

Ask when a finitely generated group whose elements all have finite order must itself be finite, separating the general, bounded-exponent, and restricted finite-quotient versions whose answers differ.

Version: v3 · 2026-09-06 · History
Domain-specific #: 1420
Origin domain: mathematics
Subdomain: combinatorial group theory
Aliases: Burnside's problem, Burnside group problem, Burnside finiteness problem

Core Idea¶

The Burnside problem begins with a local-to-global finiteness question: if a group is generated by finitely many elements and every element has finite order, must the group be finite? Burnside formulated the question in 1902 and distinguished the stronger bounded-exponent setting in which a common (n) satisfies (g^n=1) for every group element.^[1]

The name now covers three questions that must not be merged. The general problem has infinite finitely generated periodic counterexamples. The bounded problem asks whether the free Burnside group (B(m,n)) is finite and has exponent-dependent answers. The restricted problem asks, for fixed (m,n), whether only finitely many finite (m)-generator groups of exponent (n) exist; Zelmanov proved the positive result.

Structural Signature¶

A group generated by a finite set of size (m).
Torsion or periodicity: each element has finite order.
Optional uniform exponent (n).
Global finiteness as the target conclusion.
A universal free Burnside group (B(m,n)) in the bounded version.
Quotients representing all (m)-generator exponent-(n) groups.
Counterexample constructions for sufficiently large exponents.
A restricted version confined to finite groups or finite quotients.
Dependence of the answer on exponent and version.
Explicit separation of existence, finiteness, and residual-finiteness claims.

What It Is Not¶

It is not Burnside's (p^aqb) solvability theorem, Burnside's lemma in enumeration, or Burnside's normal (p)-complement theorem. Elementwise finite order is not the same as one uniform exponent, and an infinite group of bounded exponent need not be finitely presented or residually finite.

Scope of Application¶

The problem drove combinatorial group theory, small-cancellation methods, Lie methods, and the theory of varieties of groups. Novikov and Adian constructed infinite finitely generated groups of sufficiently large odd exponent, answering the general and many bounded cases negatively.^[2] Zelmanov's solution of the restricted problem used deep structure theory for Lie algebras.^[3]

Clarity¶

Always name the version; specify generator number, exponent, odd/even restrictions, finite versus arbitrary groups, and whether the claim concerns the free object, all quotients, or finite quotients. Do not transfer a theorem from the restricted problem to the unrestricted bounded problem.

Manages Complexity¶

The family isolates exactly which finiteness assumptions fail to aggregate. Finite generation constrains vocabulary; torsion constrains each element; bounded exponent strengthens that constraint; yet global cardinality can remain infinite. Restricting to finite quotients changes the question enough to restore a positive theorem.

Abstract Reasoning¶

Fix generator rank (m) and, where relevant, exponent (n).
Distinguish periodic from uniformly bounded exponent.
Form the universal group \(B(m,n)=F_m/\langle g^n:g\in F_m\rangle\).
Ask whether that universal object is finite.
Construct or rule out infinite quotients.
For the restricted problem, bound finite quotients uniformly.
Track exponent classes and exceptional small cases.
State precisely which version a proof resolves.

Adian's monograph supplies the modern combinatorial framework and counterexample boundary.^[4]

Knowledge Transfer¶

The portable pattern is test whether finitely many generators plus a finite local behavior force a finite global state space; if not, identify the missing uniformity or quotient restriction. It transfers to local–global finiteness questions. The proposed immediate parent is Local-to-Global Aggregation.

Examples¶

Every finitely generated abelian torsion group is finite, so the implication holds in that restricted class. In general it fails: there are infinite finitely generated groups in which every element has finite order.

The restricted Burnside theorem does not say (B(m,n)) is always finite; it bounds the finite (m)-generator exponent-(n) groups through a largest finite quotient.

Structural Tensions¶

Elementwise finiteness versus global finiteness.
Finite generation versus finite cardinality.
Periodic orders versus one bounded exponent.
Arbitrary quotients versus finite quotients.
Elementary statement versus deep proof machinery.

Structural–Framed Character¶

Local-to-global finiteness testing is structural. Groups, words, generators, exponents, torsion, free objects, and finite quotients are constitutive. The identity is domain-specific.

Structural Core vs. Domain Accent¶

The structural core is finite generators + locally finite behavior ? global finiteness. The domain accent is exponent identities in group theory.

Local-to-Global Aggregation is the proposed immediate parent. Boundedness, Counterexample, Finiteness, Generation, and Universality are related primes.

The prospective queue contains one strict edge to prime:local_to_global_aggregation. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Burnside Problem Domain-specific

Parents (1) — more general patterns this builds on

Burnside Problem is a kind of Local-to-Global Aggregation Prime

Local-to-Global Aggregation is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

Burnside Problem → Local-to-Global Aggregation

Neighborhood in Abstraction Space¶

Burnside Problem sits in a sparse region of the domain-specific corpus (89^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Elliptic Arithmetic & Group Finiteness (5 abstractions)

Nearest neighbors

Howson Property — 0.82
Structure Theorem for Finitely Generated Modules over a Principal Ideal Domain — 0.81
Mordell–Weil Theorem — 0.80
Homogeneous Graph — 0.79
Mordell–Weil Rank of an Elliptic Curve — 0.78

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Restricted Burnside problem treated as identical to the general problem.
Burnside's lemma.
Burnside's (p^aqb) theorem.
Local finiteness of every finitely generated subgroup.
Finite exponent without finite generation.
Residual finiteness.

References¶

[1] William Burnside, “On an Unsettled Question in the Theory of Discontinuous Groups,” Quarterly Journal of Pure and Applied Mathematics 33 (1902): 230–238. registry ↩

[2] P. S. Novikov and S. I. Adian, “Infinite Periodic Groups I–III,” Izvestiya Akademii Nauk SSSR, Seriya Matematicheskaya 32 (1968): 212–244, 251–524, 709–731. registry ↩

[3] Efim I. Zelmanov, “Solution of the Restricted Burnside Problem for Groups of Odd Exponent,” Mathematics of the USSR-Izvestiya 36, no. 1 (1991): 41–60, doi:10.1070/IM1991v036n01ABEH001932. registry ↩

[4] S. I. Adian, The Burnside Problem and Identities in Groups (Springer, 1979), doi:10.1007/978-3-642-67582-0. registry ↩