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.
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.
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.
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. Zelmanov's solution of the restricted problem used deep structure theory for Lie algebras.
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.
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.
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 (89th 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