OctoInformBeta

OpenAI preprint, September 2026 · §6. Torsion in the Steinberg kernel

Theorem 6.9: The kernel of the elementary matrix representation over the concrete 𝔽2\mathbb{F}_2-algebra is torsion for rank n≥12n \ge 12 and n=12n = 12

Torsion in Steinberg kernels for rank at least twelve.

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

Given an associative ring RR with identity and an integer n≥1n \ge 1, the Steinberg group St⁡n(R)\operatorname{St}_n(R) maps into the general linear group GL⁡n(R)\operatorname{GL}_n(R) via the elementary matrix representation πn\pi_n. When RR is the concrete algebra over the two-element field 𝔽2\mathbb{F}_2 constructed from a self-simulating machine hierarchy, the question is whether every element of ker⁡πn\ker \pi_n has finite order for every rank n≥12n \ge 12, and at n=12n = 12.

Steinberg Groups and Elementary Matrices

In a group GG, the commutator [x,y][x, y] of two elements x,y∈Gx, y \in G is the product xyx−1y−1x y x^{-1} y^{-1}.✦ Given a non-negative integer nn, a root p=(i,j)p = (i, j) of rank nn is an ordered pair of distinct indices i,j∈{0,…,n−1}i, j \in \{0, \dots, n - 1\}.✦ Over an associative ring RR with identity, a generator (p,a)(p, a) of rank nn is a pair consisting of a root pp of rank nn and a ring element a∈Ra \in R, and xp(a)=xij(a)x_p(a) = x_{ij}(a) denotes the canonical image of (p,a)(p, a) in the free group on the generators of rank nn.

In the free group on the generators of rank nn over an associative ring RR with identity, the Steinberg relations consist of the three families of relators xp(a+b)(xp(a)xp(b))−1,[xij(a),xkl(b)],[xij(a),xjk(b)]xik(ab)−1x_p(a + b)\bigl(x_p(a)x_p(b)\bigr)^{-1}, \qquad [x_{ij}(a), x_{kl}(b)], \qquad [x_{ij}(a), x_{jk}(b)]\,x_{ik}(ab)^{-1}(1)✦ for roots pp, (i,j)(i, j), and (k,l)(k, l) of rank nn with j≠kj \ne k and i≠li \ne l, pairwise distinct indices i,j,k∈{0,…,n−1}i, j, k \in \{0, \dots, n - 1\}, and elements a,b∈Ra, b \in R. The Steinberg group St⁡n(R)\operatorname{St}_n(R) is the group presented by the generators (p,a)(p, a) subject to the relators (1).✦ By its universal property, any map (p,a)↦f(p,a)(p, a) \mapsto f(p, a) into a group GG descends to a group homomorphism St⁡n(R)→G\operatorname{St}_n(R) \to G sending xp(a)x_p(a) to f(p,a)f(p, a) provided that, for all a,b∈Ra, b \in R, f(p,a+b)=f(p,a)f(p,b)f(p, a + b) = f(p, a)f(p, b) for every root pp, f(p,a)f(p, a) and f(q,b)f(q, b) commute whenever p=(i,j)p = (i, j) and q=(k,l)q = (k, l) satisfy j≠kj \ne k and i≠li \ne l, and [f((i,j),a),f((j,k),b)]=f((i,k),ab)[f((i, j), a), f((j, k), b)] = f((i, k), ab) for pairwise distinct i,j,ki, j, k.✦

Let GL⁡n(R)\operatorname{GL}_n(R) be the general linear group of invertible n×nn \times n matrices over RR indexed by {0,…,n−1}\{0, \dots, n - 1\}, with identity matrix II and matrix EijE_{ij} having 11 in entry (i,j)(i, j) and 00 elsewhere. For a root p=(i,j)p = (i, j) of rank nn and a∈Ra \in R, the elementary matrix ep(a)=eij(a)∈GL⁡n(R)e_p(a) = e_{ij}(a) \in \operatorname{GL}_n(R) is I+aEijI + a E_{ij}, with inverse I−aEijI - a E_{ij}.✦ The elementary matrix group E⁡n(R)\operatorname{E}_n(R) is the subgroup of GL⁡n(R)\operatorname{GL}_n(R) generated by the elementary matrices ep(a)e_p(a) for all roots pp of rank nn and elements a∈Ra \in R. Applying the universal property of St⁡n(R)\operatorname{St}_n(R) to (p,a)↦ep(a)(p, a) \mapsto e_p(a) defines the elementary matrix representation πn:St⁡n(R)→GL⁡n(R)\pi_n : \operatorname{St}_n(R) \to \operatorname{GL}_n(R) sending xp(a)x_p(a) to ep(a)e_p(a), and the Steinberg kernel Jn(R)J_n(R) is the kernel subgroup ker⁡πn\ker \pi_n of St⁡n(R)\operatorname{St}_n(R).✦

Rewriting-table Algebras and the Concrete Algebra

For an alphabet Σ\Sigma, the free monoid of words over Σ\Sigma is Σ*\Sigma^*✦; for a ring KK with identity, the monoid algebra of words is K[Σ*]K[\Sigma^*]✦, and the basis monomial [w]∈K[Σ*][w] \in K[\Sigma^*] of a word w∈Σ*w \in \Sigma^* is the single-term element with coefficient 11 at ww. A word rewriting table 𝒯=(rep,Z)\mathcal{T} = (\mathrm{rep}, Z) over Σ\Sigma consists of a binary replacement relation rep⊆Σ*×Σ*\mathrm{rep} \subseteq \Sigma^* \times \Sigma^* and a set of zero words Z⊆Σ*Z \subseteq \Sigma^*.✦ Over KK, the defining relations of 𝒯\mathcal{T} generate the defining two-sided ideal I𝒯⊆K[Σ*]I_{\mathcal{T}} \subseteq K[\Sigma^*]✦, and the algebra 𝒜K(𝒯)\mathcal{A}_K(\mathcal{T}) of 𝒯\mathcal{T} is the quotient ring given by I𝒯=⟨{[v]−[w]:(v,w)∈rep}∪{[z]:z∈Z}⟩,𝒜K(𝒯)=K[Σ*]/I𝒯.I_{\mathcal{T}} = \bigl\langle \{[v] - [w] : (v, w) \in \mathrm{rep}\} \cup \{[z] : z \in Z\} \bigr\rangle, \qquad \mathcal{A}_K(\mathcal{T}) = K[\Sigma^*] / I_{\mathcal{T}}.(2)✦

The concrete algebra arises from a fixed universal one-tape Turing machine obtained by compiling a multi-stack machine that decodes a prefix-encoded program and executes a universal stack interpreter. For a positive integer bit width β\beta and a positive integer gg, a one-hot binary coding of bit width β\beta encodes tape cell labels into {0,1}β\{0, 1\}^{\beta}, and a combinational circuit of gg two-input not-and (NAND) gates realizes the three-cell local tape transition. Given a positive integer height hh and an integer dilation factor DD, set capacity qh=2hq_h = 2^h, time Th=2⌊h/5⌋T_h = 2^{\lfloor h/5 \rfloor}, tape width Wh=4ThW_h = 4 T_h, and data block size 10000Dh10000 D h; whenever the cell encoding, data block size, variable and clause counts, and input length satisfy the layout fitting bounds for qhq_h, ThT_h, and WhW_h, a finite verification schedule compiles the initial tape row, boundary conditions, local circuit transitions, and accepting condition into a tableau of three-variable Boolean clauses on data and certificate bit addresses with a fixed tableau clause count. The height-hh rewriting table 𝒯h\mathcal{T}_h has alphabet {0,1}10000h\{0, 1\}^{10000h}, encoding verification cells carrying local tableau syntax, data and certificate bits, and a clause-checking head; its replacement relation links formatted one-cell and two-cell words via local verification steps, and its zero set collects unformatted cells, failed clause checks, and incompatible adjacent cell pairs.

When D≥2D \ge 2, a self-simulating machine hierarchy consists of a Boolean program and a threshold height h0≥4h_0 \ge 4 such that, for every height h≥h0h \ge h_0, the prefix-encoded self-specialization of the program satisfies the layout fitting bounds and the self-certification equivalence holds: for every task (specified by an integer l∈{1,…,10}l \in \{1, \dots, 10\} and a zero-word flag) and every Boolean assignment to the data addresses (indexed by two sides, ten blocks, and positions below qhq_h), a certificate vector satisfies all clauses of the height-hh tableau if and only if the word lists of ll bitstrings of length 10000Dh10000 D h read from the two data sides (or from the false side alone when the zero-word flag holds) belong to the replacement relation (respectively, the zero set) of 𝒯Dh\mathcal{T}_{Dh}.✦ At height h≥h0h \ge h_0 over a ring KK, the machine hierarchy algebra Ah(K)A_h(K) is the rewriting-table algebra (2) of 𝒯h\mathcal{T}_h over KK.✦ Setting D=10(10000+1)(10+1)+1D = 10(10000 + 1)(10 + 1) + 1 yields the concrete machine hierarchy with threshold h0h_0, and taking K=𝔽2K = \mathbb{F}_2 at h=h0h = h_0 defines the concrete reference ring R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2).✦

The Claim

Theorem 1. Let n≥12n \ge 12 be an integer, and let u∈St⁡n(R)u \in \operatorname{St}_n(R) satisfy πn(u)=1\pi_n(u) = 1. Then there exists a positive integer mm such that um=1in St⁡n(R).u^m = 1 \qquad \text{in } \operatorname{St}_n(R).(3)✦ At rank n=12n = 12, let u∈St⁡12(R)u \in \operatorname{St}_{12}(R) satisfy π12(u)=1\pi_{12}(u) = 1; then there exists a positive integer mm such that um=1in St⁡12(R),u^m = 1 \qquad \text{in } \operatorname{St}_{12}(R),(4)✦ and over the reference ring RR at rank 1212, let u∈St⁡12(R)u \in \operatorname{St}_{12}(R) satisfy π12(u)=1\pi_{12}(u) = 1; then there exists a positive integer mm such that um=1in St⁡12(R).u^m = 1 \qquad \text{in } \operatorname{St}_{12}(R).(5)✦

What Is Checked

The claims (3), (4), and (5) are stated over the Steinberg group St⁡n(R)\operatorname{St}_n(R) (with n≥12n \ge 12 in (3) and n=12n = 12 in (4) and (5)), the elementary matrix representation πn:St⁡n(R)→GL⁡n(R)\pi_n : \operatorname{St}_n(R) \to \operatorname{GL}_n(R), and the concrete 𝔽2\mathbb{F}_2-algebra R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2). For these constructions, given any a,b∈Ra, b \in R, the elementary matrices satisfy ep(a+b)=ep(a)ep(b)e_p(a + b) = e_p(a) e_p(b) for every root pp of rank nn✦, commute as ep(a)eq(b)=eq(b)ep(a)e_p(a) e_q(b) = e_q(b) e_p(a) whenever p=(i,j)p = (i, j) and q=(k,l)q = (k, l) have j≠kj \ne k and i≠li \ne l✦, and obey [eij(a),ejk(b)]=eik(ab)[e_{ij}(a), e_{jk}(b)] = e_{ik}(ab) for pairwise distinct indices i,j,k∈{0,…,n−1}i, j, k \in \{0, \dots, n - 1\}.✦