OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.1: Over a unital associative 𝔽2\mathbb{F}_2-algebra at rank 1212, with periodicity extending to all ranks n≥12n \ge 12

An infinite, finitely presented periodic Steinberg group.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Take a finitely presented group GG in which every element has finite order. Must GG be finite, or can finitely many generators and defining relations produce an infinite group whose elements all have finite order?

These notes go through the theorem addressing that question via a Steinberg group of rank 1212 over a concrete algebra over the two-element field 𝔽2\mathbb{F}_2, together with the definitions it is built on.

Steinberg Groups and Periodicity

A group GG is periodic if every element g∈Gg \in G satisfies gm=1g^m = 1 for some positive integer mm.✦

For elements xx and yy of a group GG, the commutator [x,y][x, y] is the product xyx−1y−1x y x^{-1} y^{-1}.✦

Let R′R' be a unital associative ring and let nn be a nonnegative integer. For a nonnegative integer nn, a root (i,j)(i, j) of rank nn is an ordered pair of distinct indices i,j∈{1,…,n}i, j \in \{1, \dots, n\}.✦ For a unital associative ring R′R' and a nonnegative integer nn, a Steinberg generator ((i,j),a)((i, j), a) of rank nn over R′R' is a pair of a root (i,j)(i, j) of rank nn and a scalar a∈R′a \in R', corresponding to the free generator xij(a)x_{ij}(a) in the free group Fn(R′)F_n(R') on all such pairs.✦ The Steinberg group St⁡n(R′)\operatorname{St}_n(R') is the quotient of Fn(R′)F_n(R') by the normal closure of the Steinberg relators (1) for indices i,j,k,l∈{1,…,n}i, j, k, l \in \{1, \dots, n\} and scalars a,b∈R′a, b \in R': xij(a+b)(xij(a)xij(b))−1(i≠j),[xij(a),xkl(b)](i≠j,k≠l,j≠k,i≠l),[xij(a),xjk(b)]xik(ab)−1(i,j,k pairwise distinct).\begin{aligned} & x_{ij}(a + b)\bigl(x_{ij}(a) x_{ij}(b)\bigr)^{-1} && (i \neq j), \\ & [x_{ij}(a), x_{kl}(b)] && (i \neq j,\; k \neq l,\; j \neq k,\; i \neq l), \\ & [x_{ij}(a), x_{jk}(b)]\, x_{ik}(ab)^{-1} && (i, j, k \text{ pairwise distinct}). \end{aligned}(1)✦

The Steinberg group statement ℳ\mathcal{M} is the assertion that there exists a unital associative 𝔽2\mathbb{F}_2-algebra SS such that St⁡12(S)\operatorname{St}_{12}(S) is infinite, finitely presented, and periodic.✦ The Burnside group statement ℬ\mathcal{B} is the assertion that there exists an infinite, finitely presented periodic group.✦

Word-rewriting Algebras

For a set Σ\Sigma, the free monoid Σ*\Sigma^* is the monoid of finite words over Σ\Sigma under concatenation.✦ Over a unital associative ring KK, the monoid algebra K[Σ*]K[\Sigma^*] is the free KK-module with basis monomials ewe_w indexed by words w∈Σ*w \in \Sigma^* and multiplication determined by euev=euve_u e_v = e_{uv} for all u,v∈Σ*u, v \in \Sigma^*.✦

A rewriting table TT on Σ\Sigma is a pair (Trep,T0)(T_{\mathrm{rep}}, T_0) consisting of a replacement relation Trep⊆Σ*×Σ*T_{\mathrm{rep}} \subseteq \Sigma^* \times \Sigma^* and a zero set T0⊆Σ*T_0 \subseteq \Sigma^*.✦ Over a unital associative ring KK, the defining relation set Rel(T)⊆K[Σ*]\mathrm{Rel}(T) \subseteq K[\Sigma^*] of TT is given by (2), Rel(T)={ev−ew:(v,w)∈Trep}∪{ez:z∈T0},\mathrm{Rel}(T) = \{e_v - e_w : (v, w) \in T_{\mathrm{rep}}\} \cup \{e_z : z \in T_0\},(2)✦ and the algebra K⟨T⟩K\langle T \rangle of TT over KK is the quotient K[Σ*]/I(T)K[\Sigma^*] / I(T) by the two-sided ideal I(T)I(T) generated by Rel(T)\mathrm{Rel}(T).✦

Circuits, Schedules, and Finite-table Rewriting

For a positive integer mm, a circuit wire on mm signals is either a Boolean constant in {0,1}\{0, 1\} or an index in {0,…,m−1}\{0, \dots, m-1\}.✦ A three-wire circuit clause on mm signals consists of three circuit wires on mm signals together with a Boolean truth function {0,1}3→{0,1}\{0, 1\}^3 \to \{0, 1\}.✦ A combinational not-AND (NAND) circuit CC on mm inputs with gg gates is a sequence of gg two-input NAND gates whose inputs are wires on earlier signals; evaluating CC at an assignment in {0,1}m\{0, 1\}^m produces values on all m+gm + g signals, and its defining clauses form a list of three-wire clauses on m+gm + g signals.✦

A single-tape Turing machine with finite alphabet Γ\Gamma and state set QQ is specified by a transition rule δ:Q×Γ→Γ×Q×{left,stay,right}\delta : Q \times \Gamma \to \Gamma \times Q \times \{\mathrm{left}, \mathrm{stay}, \mathrm{right}\}, which determines the local update of each tape cell label (carrying a symbol in Γ\Gamma, an origin bit, and either a head state in QQ or none) from itself and its two neighbors. A binary coding of width β>0\beta > 0 for (Γ,Q)(\Gamma, Q) consists of an encoding map from tape cell labels to {0,1}β\{0, 1\}^\beta together with a left-inverse decoding map✦, and a circuit realization of δ\delta consists of a combinational NAND circuit of gg gates on 3β3\beta inputs and β\beta output wires computing the encoded local update.✦ Compiling a universal stack-machine interpreter wrapped with a bit-packet input decoder of positive packet width (the number of input token packets) onto one tape yields a concrete transition rule δ0\delta_0 equipped with a one-hot coding of width β0>0\beta_0 > 0 and a NAND circuit realization C0C_0 of g0g_0 gates.

Fix an integer scale q>0q > 0. For an integer scale q>0q > 0, a table memory address of scale qq is either a data address (s,b,p)∈{0,1}×{0,…,9}×{0,…,q−1}(s, b, p) \in \{0, 1\} \times \{0, \dots, 9\} \times \{0, \dots, q-1\} or a certificate address p∈{0,…,q−1}p \in \{0, \dots, q-1\}.✦ A verification task t=(a,z)t = (a, z) is a pair consisting of an arity a∈{0,…,9}a \in \{0, \dots, 9\} and a zero-task flag z∈{0,1}z \in \{0, 1\}.✦ A verification clause of scale qq consists of three memory addresses of scale qq and a Boolean truth function on 𝔽23\mathbb{F}_2^3, holding on a Boolean assignment to data and certificate addresses when its truth function evaluates to 11 on its three address readings.✦ A clause schedule SS of scale qq assigns to each verification task tt a positive clause count cS(t)∈{1,…,q}c_S(t) \in \{1, \dots, q\} and a family of verification clauses indexed by {0,…,q−1}\{0, \dots, q-1\}.✦

For a nonnegative integer kk, the binary length binSize(k)\mathrm{binSize}(k) is the number of bits in the binary expansion of kk (with binSize(0)=1\mathrm{binSize}(0) = 1)✦, and the prefix encoding enc(k)\mathrm{enc}(k) is the bitstring obtained by prepending binSize(k)\mathrm{binSize}(k) ones and a zero to the binSize(k)\mathrm{binSize}(k)-bit binary expansion of kk.✦ For bitstrings tt and vv, the program specialization spec(t,v)\mathrm{spec}(t, v) is the concatenation of 11, enc(|t|)\mathrm{enc}(|t|), tt, enc(|v|)\mathrm{enc}(|v|), and vv.✦ A tableau layout of scale qq for bit width β>0\beta > 0, gate count gg, time T>0T > 0, and width W≥3W \ge 3 is an origin column o∈{0,…,W−1}o \in \{0, \dots, W-1\} together with the capacity bounds βWT+g(W−2)(T−1)≤q\beta W T + g(W-2)(T-1) \le q and 2βW+2β(T−1)+(3g+2β)(W−2)(T−1)+β≤q2\beta W + 2\beta(T-1) + (3g+2\beta)(W-2)(T-1) + \beta \le q✦; it indexes the βWT\beta W T tape cell bits and g(W−2)(T−1)g(W-2)(T-1) interior gate bits as certificate addresses of scale qq and compiles a combinational NAND circuit, initial row input bits, boundary blanks, and an accepting origin pattern into a clause schedule of scale qq. Given a program aa, a height parameter H>0H > 0 with 10000H≤q10000 H \le q, and a task t=(arity,z)t = (\mathrm{arity}, z), the initial row configuration places along row 00 starting after oo the concatenation of enc(|a|)\mathrm{enc}(|a|), aa, enc(H)\mathrm{enc}(H), enc(arity+1)\mathrm{enc}(\mathrm{arity} + 1), and zz followed by data addresses for arity+1\mathrm{arity}+1 blocks of 10000H10000 H bits (doubled to both sides when z=0z = 0).

For an integer scale q>0q > 0, a finite-table cell of scale qq consists of a syntactic skeleton (a core position in {0,…,q−1}\{0, \dots, q-1\}, palette color in {0,…,q−1}\{0, \dots, q-1\}, or stop position; an idle, left, boundary, full, or right marker; and block metadata specifying task arity in {0,…,9}\{0, \dots, 9\}, zero-task flag, and block index at most the arity), a palette checker state (idle, passed, or head seeking a color), two 𝔽2\mathbb{F}_2 data bits, an 𝔽2\mathbb{F}_2 certificate bit, and a head state (side flag, clause index in {0,…,q−1}\{0, \dots, q-1\}, one of nine execution phases, and a three-bit 𝔽2\mathbb{F}_2 register).✦ Relative to a schedule SS of scale qq and a data bound dd, formatted cells undergo symmetric unary transitions on single cells and symmetric binary transitions on compatible adjacent pairs that sweep across blocks, accumulate clause address bits in 𝔽23\mathbb{F}_2^3, test the truth predicates of SS, and check palette color distinctness, defining the cell replacement relation ∼S,d\sim_{S, d}.✦ A single cell belongs to the unary zero set if it fails formatting, hits a register or truth-predicate violation in an execution phase (or reaches success with zero-task flag 11), or holds a passed palette check on its own color✦, while a pair of cells belongs to the binary zero set if it violates local adjacency compatibility, repeats a palette color adjacently, or places a head checker seeking another color immediately before a stop position.✦

For an integer h>0h > 0, set qh=2hq_h = 2^h and let Rawh={0,1}10000h\mathrm{Raw}_h = \{0, 1\}^{10000h} be the alphabet of 10000h10000h-bit strings.✦ Encoding each cell of scale qhq_h into 64h64h integer bits and 512512 flag bits yields a partial decoding map from Rawh\mathrm{Raw}_h to cells of scale qhq_h. For a schedule SS of scale qhq_h and a data bound dd, the finite-table rewriting table Th(S,d)T_h(S, d) on Rawh\mathrm{Raw}_h has replacement relation lifting ∼S,d\sim_{S, d} to decoded words of length one or two, and zero set consisting of all decoded unary or binary zero words together with all one-letter words whose letter fails to decode✦; given a flag z∈{0,1}z \in \{0, 1\} and words v,w∈Rawh*v, w \in \mathrm{Raw}_h^*, the table entry predicate for (S,d,z,v,w)(S, d, z, v, w) holds when either z=1z = 1, ww is empty, and vv is a zero word of Th(S,d)T_h(S, d), or z=0z = 0 and (v,w)(v, w) lies in the replacement relation of Th(S,d)T_h(S, d).✦

Machine Hierarchies and the Coordinate Ring

Let D≥2D \ge 2 and h≥1h \ge 1 be integers, and set Th=2⌊h/5⌋T_h = 2^{\lfloor h/5 \rfloor} and Wh=4ThW_h = 4 T_h. For integers D≥2D \ge 2 and h≥1h \ge 1, bit width β>0\beta > 0, and gate count gg, a program of length mm satisfies the layout fit condition at (D,h)(D, h) for (β,g)(\beta, g) if 64h+512≤10000h64h + 512 \le 10000h, 10≤22h10 \le 2^{2h}, 2h≤22h2^h \le 2^{2h}, 10000Dh≤qh10000 D h \le q_h, both the tableau certificate count and clause count for (β,g,Th,Wh)(\beta, g, T_h, W_h) are at most qhq_h, and m+2binSize(m)+2binSize(Dh)+12+20(10000Dh)<⌊Th/4⌋m + 2\,\mathrm{binSize}(m) + 2\,\mathrm{binSize}(Dh) + 12 + 20(10000 D h) < \lfloor T_h / 4 \rfloor.✦

A self-simulating machine hierarchy of dilation D≥2D \ge 2 consists of a finite bitstring program PP and a threshold height h0≥4h_0 \ge 4 such that for every integer h≥h0h \ge h_0, the self-specialized program P*=spec(P,P)P^* = \mathrm{spec}(P, P) satisfies the layout fit condition at (D,h)(D, h) for (β0,g0)(\beta_0, g_0), and the tableau schedule ShS_h at height hh (compiled from the circuit C0C_0 and the initial row configuration for P*P^* and DhDh with origin 2Th2 T_h) satisfies the certification equivalence: for every verification task t=(arity,z)t = (\mathrm{arity}, z) and data assignment uu, there exists a certificate assignment satisfying all clauses of ShS_h together with uu if and only if the table entry predicate holds for (SDh,10000D2h,z,v0,w1)(S_{Dh}, 10000 D^2 h, z, v_0, w_1), where v0v_0 and w1w_1 are the candidate words of length arity+1\mathrm{arity} + 1 in RawDh*\mathrm{Raw}_{Dh}^* read from the two sides of uu (with w1w_1 empty when z=1z = 1).✦ For any unital associative ring KK and integer h≥h0h \ge h_0, the hierarchy algebra Ah(K)A_h(K) is the table algebra K⟨Th(Sh,10000Dh)⟩K\langle T_h(S_h, 10000 D h) \rangle.✦

For the dilation factor D=10(10000+1)(10+1)+1D = 10(10000 + 1)(10 + 1) + 1, let h0≥4h_0 \ge 4 be the threshold height of the concrete self-simulating machine hierarchy of dilation DD constructed from δ0\delta_0 and C0C_0. The coordinate ring RR is the unital associative 𝔽2\mathbb{F}_2-algebra defined by (3): R=Ah0(𝔽2).R = A_{h_0}(\mathbb{F}_2).(3)✦

The Claim

Theorem 1. Let R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2) be the coordinate ring defined in (3). Then (4) and (5) hold: ℳ∧ℬ,\mathcal{M} \land \mathcal{B},(4)✦ |St⁡12(R)|=∞,St⁡12(R) is finitely presented and periodic.|\operatorname{St}_{12}(R)| = \infty, \qquad \operatorname{St}_{12}(R) \text{ is finitely presented and periodic}.(5)✦ Moreover, (6), (7), (8), and (9) hold: ℳ,\mathcal{M},(6)✦ there exists an infinite, finitely presented periodic group,\text{there exists an infinite, finitely presented periodic group},(7)✦ ℬ,\mathcal{B},(8)✦ St⁡12(R) is periodic.\operatorname{St}_{12}(R) \text{ is periodic}.(9)✦ In addition, (10) holds: if n≥12 is an integer, then St⁡n(R) is periodic.\text{if } n \ge 12 \text{ is an integer, then } \operatorname{St}_n(R) \text{ is periodic}.(10)✦

What Is Checked

The claims are stated over the Steinberg groups St⁡n(R)\operatorname{St}_n(R) (at rank n=12n = 12 and for integers n≥12n \ge 12), the periodicity predicate on groups, the statements ℳ\mathcal{M} and ℬ\mathcal{B}, and the concrete 𝔽2\mathbb{F}_2-algebra R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2) determined by the self-simulating machine hierarchy of dilation D=10(10000+1)(10+1)+1D = 10(10000 + 1)(10 + 1) + 1 at threshold height h0h_0.

For these constructions, the library proves that D≥2D \ge 2 and that the bit width β0\beta_0, packet width, tableau clause count, heights h≥h0h \ge h_0, and data sizes 10000Dh10000 D h are positive; it also constructs the one-hot tape coding with its left inverse, a combinational NAND circuit realizing δ0\delta_0, and a concrete self-simulating machine hierarchy of dilation DD.