OctoInformBeta

An infinite finitely presented periodic group

A group is periodic if every element has finite order. An ordinary finite presentation is a presentation with finitely many generators and finitely many relator words, defining the quotient of the free group by their normal closure. The finitely presented Burnside question asks whether a periodic group with an ordinary finite presentation must be finite. The restricted Burnside problem asks whether every finite group with a fixed number of generators and a fixed exponent has bounded order. Write 𝔽2\mathbb{F}_2 for the two-element field. For a unital ring SS and an integer n≥3n \ge 3, write St⁡n(S)\operatorname{St}_n(S) for the Steinberg group of SS. A discrete group has Kazhdan’s property (T)(T) if every unitary representation with almost invariant unit vectors has a nonzero invariant vector.

Infinite finitely generated periodic groups were constructed by Golod. Novikov and Adian constructed infinite finitely generated groups of bounded exponent. For the restricted Burnside problem, Zel’manov proved the order bounds for odd exponents and for powers of two. Ol’shanskii and Sapir distinguished the finitely presented Burnside question. Ol’shanskii and Sapir constructed finitely presented torsion-by-infinite-cyclic groups with an infinite cyclic quotient. Infinite finitely generated periodic groups with Kazhdan’s property (T)(T) that are also residually finite were constructed by Ershov. For every finitely generated unital ring SS and every n≥3n \ge 3, Ershov and Jaikin-Zapirain proved that St⁡n(S)\operatorname{St}_n(S) has Kazhdan’s property (T)(T). When SS is a finitely presented unital ring and n≥4n \ge 4, Krstić and McCool proved that St⁡n(S)\operatorname{St}_n(S) is finitely presented.

The September 23, 2026 preprint constructs a unital associative 𝔽2\mathbb{F}_2-algebra RR such that St⁡12(R)\operatorname{St}_{12}(R) is an infinite periodic group with an ordinary finite presentation, answering the finitely presented Burnside question negatively. From this theorem, the preprint further deduces that St⁡12(R)\operatorname{St}_{12}(R) has Kazhdan’s property (T)(T), a conclusion that the Lean library does not contain.

Lean has checked every result of the Lean library PeriodicGroups without unfinished proofs or unproved hypotheses, so the Lean library is the reference. Each result on these pages is stated as the Lean library states it and linked to its Lean declaration, with the preprint’s statement given beside it where the two differ. The preprint serves only as a guide to the order and names of the results. An October 5, 2026 preprint on an infinite finitely presented residually finite 22-group is not covered; the Lean library covers only the September 23, 2026 preprint and excludes its separate nil-algebra and radical-algebra conclusions.

The Lean library: PeriodicGroups

PeriodicGroups is a Lean library: 47 items, in six groups. Each has a page written by OctoInform, listed below.

§1. Introduction 2 items
  1. §1 (setting): Steinberg groups, elementary matrices, periodicity, and finite presentation Defining Steinberg groups over rings and periodic groups.
  2. Theorem 1.1 An infinite, finitely presented periodic Steinberg group.
§2. A hierarchy defined by finite local rules 10 items
  1. §2 (setting): word-relation algebra presentations, encoded blocks, and cuts Word-relation algebra presentations and fixed-width encoded cells.
  2. Lemma 2.1 Homogeneous word rewriting tables preserve length and grade their algebras.
  3. Proposition 2.2 Local rewriting tables with block embeddings and token decompositions.
  4. Lemma 2.3 Color completeness and normalization in surviving cell words.
  5. Lemma 2.4 Syntax invariance and region head ownership for finite cell words.
  6. Lemma 2.5 Head tours verify regions and match coded table certificates.
  7. Lemma 2.6 Rollback and release of active cell components.
  8. Lemma 2.7 Block embeddings simulate hierarchy rules above the threshold.
  9. Lemma 2.8 Length bounds for surviving palette or cut-free words.
  10. Lemma 2.9 Internal normalization of surviving tokens and cut intervals.
§3. Cancellation and the matrix-nil algebra 8 items
  1. §3 (setting): hierarchy parameters and scalar extension Hierarchy algebras above a threshold and matrix tensor maps.
  2. Definition 3.1 [Weighted tests] Weighted matrix tests and eventual vanishing.
  3. Lemma 3.2 [Alternating matrix sum] Vanishing of alternating matrix sums in characteristic two.
  4. Lemma 3.3 [Direct cancellation] Direct cancellation yields eventual vanishing of chunk tests.
  5. Lemma 3.4 [Reduction by the cuts] Letter vanishing in hierarchy algebras reduces to chunk vanishing.
  6. Lemma 3.5 [A matrix automaton for chunks] Realizing bounded chunk tests by matrix letter tests.
  7. Proposition 3.6 [Eventual vanishing of every fixed test] Eventual vanishing of matrix letter and chunk tests.
  8. Theorem 3.7 A concrete machine 𝔽2\mathbb{F}_2-algebra has a matrix-nil augmentation kernel.
§4. An ordinary finite presentation for the Steinberg group 5 items
  1. §4 (setting): Steinberg presentations and ordered support over free algebras Ring-induced maps and short-word presentations for Steinberg groups.
  2. Theorem 4.1 [Finite presentation of the Steinberg group] Finite presentation of Steinberg groups over quotient algebras.
  3. Lemma 4.2 [Three-factor commutator identity] Six commutation hypotheses equate two three-factor commutators.
  4. Lemma 4.3 Perfectness and infiniteness of Steinberg groups.
  5. Lemma 4.4 [Periodicity of the matrix groups] Matrix periodicity from matrix-nil kernels in characteristic 22.
§5. Centrality and rational stability 12 items
  1. §5 (setting): matrix group H_n, frame complex X_n, and rational stability setup Matrix subgroups and rank stabilization over augmented rings.
  2. Lemma 5.1 Invertible matrices and general linear group generation over RR.
  3. Lemma 5.2 Low-degree frame exactness and flat transport uniqueness in high rank.
  4. Proposition 5.3 Five-coordinate presentations under the matrix nil kernel property.
  5. Proposition 5.4 Steinberg kernel centrality from rank six under matrix nilpotency.
  6. Lemma 5.5 Normality of elementary subgroups and K1K_1 stability.
  7. Lemma 5.6 Central extensions of locally finite groups by ℚ\mathbb{Q} split uniquely.
  8. Lemma 5.7 Rational central extensions and Steinberg kernel characters.
  9. Lemma 5.8 Relative coinvariants preserve homology for locally finite normal subgroups.
  10. Lemma 5.9 Frame transitivity and stabilizer homology in elementary matrix groups.
  11. Proposition 5.10 Second rational homology stability for elementary matrix groups.
  12. Proposition 5.11 Rational character stability under the matrix nil kernel property.
§6. Torsion in the Steinberg kernel 10 items
  1. §6 (setting): block roots, triangular subgroup U, and slice embeddings Block roots and coordinate embeddings in Steinberg groups.
  2. Lemma 6.1 Abelian group elements killed by every rational homomorphism are torsion.
  3. Lemma 6.2 Periodicity of stabilized Steinberg images over 𝔽2\mathbb{F}_2 from rank three.
  4. Lemma 6.3 Matrix lifts and stabilized permutation invariance in Steinberg groups.
  5. Lemma 6.4 Steinberg relations for block roots and stable similarity.
  6. Lemma 6.5 Faithfulness and normalization in Steinberg groups over any ring.
  7. Lemma 6.6 Constant-diagonal upper-triangular Steinberg kernel evaluation equals a diagonal copy.
  8. Lemma 6.7 Shift wrap removal in the Steinberg kernel.
  9. Proposition 6.8 Stable torsion in the concrete Steinberg kernel.
  10. Theorem 6.9 Torsion in Steinberg kernels for rank at least twelve.

No item matches.