OctoInformBeta

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

Proposition 6.8: Every element of Jn(R)J_n(R) for n≥3n \ge 3 becomes torsion in St⁡q(R)\operatorname{St}_q(R) for some q≥nq \ge n under standard coordinate inclusion

Stable torsion in the concrete Steinberg kernel.

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

Let 𝔽2\mathbb{F}_2 be the field of two elements, and let RR be a concrete 𝔽2\mathbb{F}_2-algebra arising from a word rewriting table of a self-simulating machine. For each integer n≥0n \ge 0, the Steinberg group St⁡n(R)\operatorname{St}_n(R) maps into the general linear group GL⁡n(R)\operatorname{GL}_n(R), with image the elementary matrix group E⁡n(R)\operatorname{E}_n(R), through the representation πn\pi_n, whose kernel is the Steinberg kernel Jn(R)=ker⁡πnJ_n(R) = \ker \pi_n.

The question is whether every element of Jn(R)J_n(R) becomes torsion after stabilization in rank.

Steinberg Groups and Elementary Matrices

The commutator [x,y][x, y] of elements x,yx, y in a group GG is the element xyx−1y−1x y x^{-1} y^{-1} of GG.✦ Let BB be an associative unital ring and let n≥0n \ge 0 be an integer. 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\}, with row index prow=ip_{\mathrm{row}} = i and column index pcol=jp_{\mathrm{col}} = j; the set Root⁡n\operatorname{Root}_n is the set of roots of rank nn.✦ For each pair (p,a)∈Root⁡n×B(p, a) \in \operatorname{Root}_n \times B, the free group Fn(B)F_n(B) on Root⁡n×B\operatorname{Root}_n \times B has free generator xˆp(a)\hat{x}_p(a).✦ The Steinberg relations in Fn(B)F_n(B) consist of the three families of relators in (1) for all a,b∈Ba, b \in B: xˆp(a+b)(xˆp(a)xˆp(b))−1for p∈Root⁡n,[xˆp(a),xˆp′(b)]for p,p′∈Root⁡n with pcol≠prow′ and prow≠pcol′,[xˆij(a),xˆjk(b)]xˆik(ab)−1for pairwise distinct i,j,k∈{0,…,n−1}.\begin{aligned} &\hat{x}_p(a + b)\bigl(\hat{x}_p(a)\hat{x}_p(b)\bigr)^{-1} &&\text{for } p \in \operatorname{Root}_n,\\ &[\hat{x}_p(a), \hat{x}_{p'}(b)] &&\text{for } p, p' \in \operatorname{Root}_n \text{ with } p_{\mathrm{col}} \ne p'_{\mathrm{row}} \text{ and } p_{\mathrm{row}} \ne p'_{\mathrm{col}},\\ &[\hat{x}_{ij}(a), \hat{x}_{jk}(b)]\,\hat{x}_{ik}(ab)^{-1} &&\text{for pairwise distinct } i, j, k \in \{0, \dots, n - 1\}. \end{aligned}(1)✦ The Steinberg group St⁡n(B)\operatorname{St}_n(B) is the group presented by the generators Root⁡n×B\operatorname{Root}_n \times B subject to the relators (1)✦, and the Steinberg generator xp(a)=xij(a)∈St⁡n(B)x_p(a) = x_{ij}(a) \in \operatorname{St}_n(B) is the image of xˆp(a)\hat{x}_p(a) in St⁡n(B)\operatorname{St}_n(B).✦

By the universal property of St⁡n(B)\operatorname{St}_n(B), for any group GG, a map ϕ:Root⁡n×B→G\phi : \operatorname{Root}_n \times B \to G induces a group homomorphism St⁡n(B)→G\operatorname{St}_n(B) \to G sending xp(a)x_p(a) to ϕ(p,a)\phi(p, a) whenever ϕ(p,a+b)=ϕ(p,a)ϕ(p,b)\phi(p, a + b) = \phi(p, a)\phi(p, b) for all p∈Root⁡np \in \operatorname{Root}_n, ϕ(p,a)\phi(p, a) commutes with ϕ(p′,b)\phi(p', b) whenever pcol≠prow′p_{\mathrm{col}} \ne p'_{\mathrm{row}} and prow≠pcol′p_{\mathrm{row}} \ne p'_{\mathrm{col}}, and [ϕ((i,j),a),ϕ((j,k),b)]=ϕ((i,k),ab)[\phi((i, j), a), \phi((j, k), b)] = \phi((i, k), ab) for pairwise distinct i,j,k∈{0,…,n−1}i, j, k \in \{0, \dots, n - 1\}.✦ Any ring homomorphism φ:B→B′\varphi : B \to B' induces a group homomorphism φ*:St⁡n(B)→St⁡n(B′)\varphi_* : \operatorname{St}_n(B) \to \operatorname{St}_n(B') sending xp(a)x_p(a) to xp(φ(a))x_p(\varphi(a)).✦ Likewise, for an integer n′≥0n' \ge 0, any injective map f:{0,…,n−1}→{0,…,n′−1}f : \{0, \dots, n - 1\} \to \{0, \dots, n' - 1\} sends each root p=(i,j)p = (i, j) of rank nn to the induced root f(p)=(f(i),f(j))f(p) = (f(i), f(j)) of rank n′n' and induces a Steinberg coordinate homomorphism f#:St⁡n(B)→St⁡n′(B)f_\# : \operatorname{St}_n(B) \to \operatorname{St}_{n'}(B) mapping xp(a)x_p(a) to xf(p)(a)x_{f(p)}(a). For an integer q≥nq \ge n, the standard coordinate homomorphism σn,q:St⁡n(B)→St⁡q(B)\sigma_{n,q} : \operatorname{St}_n(B) \to \operatorname{St}_q(B) is the coordinate homomorphism induced by the canonical inclusion i↦ii \mapsto i from {0,…,n−1}\{0, \dots, n - 1\} into {0,…,q−1}\{0, \dots, q - 1\}.

Let Mn(B)M_n(B) be the ring of n×nn \times n matrices over BB indexed by {0,…,n−1}\{0, \dots, n - 1\}, and let the general linear group GL⁡n(B)\operatorname{GL}_n(B) be the group of invertible matrices in Mn(B)M_n(B). For a root p=(i,j)∈Root⁡np = (i, j) \in \operatorname{Root}_n and a∈Ba \in B, the elementary matrix ep(a)=eij(a)∈GL⁡n(B)e_p(a) = e_{ij}(a) \in \operatorname{GL}_n(B) is defined by eij(a)=I+aEij,e_{ij}(a) = I + a E_{ij},(2)✦ where II is the identity matrix, aEija E_{ij} has aa in entry (i,j)(i, j) and 00 elsewhere, and the inverse of eij(a)e_{ij}(a) is I−aEijI - a E_{ij}. The elementary matrix group E⁡n(B)\operatorname{E}_n(B) is the subgroup of GL⁡n(B)\operatorname{GL}_n(B) generated by the elementary matrices ep(a)e_p(a) for all roots p∈Root⁡np \in \operatorname{Root}_n and a∈Ba \in B. The Steinberg representation πn:St⁡n(B)→GL⁡n(B)\pi_n : \operatorname{St}_n(B) \to \operatorname{GL}_n(B) is the group homomorphism sending xp(a)x_p(a) to ep(a)e_p(a) for all roots p∈Root⁡np \in \operatorname{Root}_n and a∈Ba \in B✦, and the Steinberg kernel Jn(B)J_n(B) is the kernel ker⁡πn\ker \pi_n of πn\pi_n.

Block Maps, Copy Maps, and Matrix Evaluations

The Steinberg padding homomorphism ιn:St⁡n(B)→St⁡n+1(B)\iota_n : \operatorname{St}_n(B) \to \operatorname{St}_{n+1}(B) is the coordinate homomorphism induced by the inclusion i↦ii \mapsto i from {0,…,n−1}\{0, \dots, n - 1\} into {0,…,n}\{0, \dots, n\}.✦ For each root p∈Root⁡np \in \operatorname{Root}_n, the assignment a↦xp(a)a \mapsto x_p(a) defines a root homomorphism (B,+)→St⁡n(B)(B, +) \to \operatorname{St}_n(B) from the additive group of BB.✦ Given an integer N≥0N \ge 0, the canonical product bijection identifies {0,…,n−1}×{0,…,N−1}\{0, \dots, n - 1\} \times \{0, \dots, N - 1\} with {0,…,nN−1}\{0, \dots, nN - 1\}, sending each root p=(i,j)∈Root⁡np = (i, j) \in \operatorname{Root}_n and pair (s,t)∈{0,…,N−1}2(s, t) \in \{0, \dots, N - 1\}^2 to the block entry root ((i,s),(j,t))((i, s), (j, t)) of rank nNnN.✦ As the root homomorphisms at distinct pairs (s,t)(s, t) commute for a fixed root pp, they assemble into a block root homomorphism (MN(B),+)→St⁡nN(B)(M_N(B), +) \to \operatorname{St}_{nN}(B) sending each matrix Y∈MN(B)Y \in M_N(B) to the block generator bp(Y)∈St⁡nN(B)b_p(Y) \in \operatorname{St}_{nN}(B) defined by bp(Y)=∏s,t=0N−1x((i,s),(j,t))(Yst).b_p(Y) = \prod_{s,t = 0}^{N - 1} x_{((i,s),(j,t))}(Y_{st}).(3) The Steinberg block homomorphism βn,N:St⁡n(MN(B))→St⁡nN(B)\beta_{n,N} : \operatorname{St}_n(M_N(B)) \to \operatorname{St}_{nN}(B) is the group homomorphism sending each Steinberg generator xp(Y)x_p(Y) to the block generator bp(Y)b_p(Y) in (3).

For each index s∈{0,…,N−1}s \in \{0, \dots, N - 1\}, the Steinberg copy map κN,s:St⁡n(B)→St⁡nN(B)\kappa_{N,s} : \operatorname{St}_n(B) \to \operatorname{St}_{nN}(B) is the coordinate homomorphism induced by the coordinate injection i↦(i,s)i \mapsto (i, s) from {0,…,n−1}\{0, \dots, n - 1\} into {0,…,nN−1}\{0, \dots, nN - 1\}.✦ The diagonal copy homomorphism ΔN:St⁡n(B)→St⁡nN(B)\Delta_N : \operatorname{St}_n(B) \to \operatorname{St}_{nN}(B) is the group homomorphism obtained by composing the diagonal homomorphism u↦(u,…,u)u \mapsto (u, \dots, u) from St⁡n(B)\operatorname{St}_n(B) to St⁡n(B)N\operatorname{St}_n(B)^N with the copy family homomorphism St⁡n(B)N→St⁡nN(B)\operatorname{St}_n(B)^N \to \operatorname{St}_{nN}(B) agreeing with κN,s\kappa_{N,s} on each factor s∈{0,…,N−1}s \in \{0, \dots, N - 1\}.✦

Let BB be an 𝔽2\mathbb{F}_2-algebra, equipped with a central ring homomorphism ηB:𝔽2→B\eta_B : \mathbb{F}_2 \to B. For c∈𝔽2c \in \mathbb{F}_2, scalar evaluation ev⁡c:B[X]→B\operatorname{ev}_c : B[X] \to B is the ring homomorphism fixing BB and mapping XX to ηB(c)\eta_B(c).✦ For an integer N≥0N \ge 0 and a matrix T∈MN(𝔽2)T \in M_N(\mathbb{F}_2), the numeric matrix T¯∈MN(B)\overline{T} \in M_N(B) is the matrix obtained by applying ηB\eta_B entrywise to TT✦, the matrix evaluation ring homomorphism ev⁡T:B[X]→MN(B)\operatorname{ev}_T : B[X] \to M_N(B) is the ring homomorphism sending a∈Ba \in B to aINa I_N and XX to T¯\overline{T}, and the Steinberg evaluation homomorphism ΦT:St⁡n(B[X])→St⁡nN(B)\Phi_T : \operatorname{St}_n(B[X]) \to \operatorname{St}_{nN}(B) is the composite group homomorphism ΦT=βn,N∘(ev⁡T)*\Phi_T = \beta_{n,N} \circ (\operatorname{ev}_T)_*. The cyclic shift matrix CN∈MN(𝔽2)C_N \in M_N(\mathbb{F}_2) has (s,t)(s, t)-entry 11 when (s+1)mod⁡N=t(s + 1) \bmod N = t and 00 otherwise✦, while the truncated shift matrix UN∈MN(𝔽2)U_N \in M_N(\mathbb{F}_2) has (s,t)(s, t)-entry 11 when s+1=ts + 1 = t and 00 otherwise.✦ For any ring BB and finite sequence l=((p1,a1),…,(pr,ar))l = ((p_1, a_1), \dots, (p_r, a_r)) in Root⁡n×B\operatorname{Root}_n \times B, the root word w(l)∈St⁡n(B)w(l) \in \operatorname{St}_n(B) is the product ∏j=1rxpj(aj)\prod_{j=1}^r x_{p_j}(a_j).✦

The Concrete Algebra and Self-simulating Machine

For a ring KK and an alphabet α\alpha, let α*\alpha^* be the free monoid of words over α\alpha, and let K[α*]K[\alpha^*] be its monoid algebra, spanned by the basis monomials [w][w] for w∈α*w \in \alpha^*. A word rewriting table 𝒯\mathcal{T} over α\alpha consists of a binary replacement relation ∼𝒯\sim_{\mathcal{T}} on α*\alpha^* and a subset Z𝒯⊆α*Z_{\mathcal{T}} \subseteq \alpha^* of zero words.✦ The defining relations of 𝒯\mathcal{T} are all differences [v]−[w][v] - [w] for pairs with v∼𝒯wv \sim_{\mathcal{T}} w together with all monomials [z][z] for z∈Z𝒯z \in Z_{\mathcal{T}}; they generate a two-sided ideal I(𝒯)⊆K[α*]I(\mathcal{T}) \subseteq K[\alpha^*]✦, and the rewriting-table algebra of 𝒯\mathcal{T} over KK is the quotient ring K[α*]/I(𝒯)K[\alpha^*] / I(\mathcal{T}).✦

For a dilation factor D≥2D \ge 2, a self-simulating machine hierarchy consists of a finite binary program and a threshold height h0≥4h_0 \ge 4 such that every height h≥h0h \ge h_0 satisfies the layout parameter bounds and the self-certification equivalence below.✦ From the program specialized to itself, yielding the self-specialized binary code aa, the hierarchy constructs at each height h≥h0h \ge h_0 a verification clause schedule of capacity qh=2hq_h = 2^h and a rewriting table on raw bitstrings of length 10000h10000 h with data size 10000Dh10000 D h, whose quotient algebra over a ring KK is denoted Ah(K)A_h(K). For h≥h0h \ge h_0, set T=2⌊h/5⌋T = 2^{\lfloor h/5 \rfloor} and W=4TW = 4T, and let binary bit-length binSize⁡(k)\operatorname{binSize}(k) equal 11 for k=0k = 0 and the bit-length of kk for k>0k > 0.✦ The layout bounds at height hh require 64h+512≤10000h64h + 512 \le 10000h, 10≤22h10 \le 2^{2h}, 2h≤22h2^h \le 2^{2h}, 10000Dh≤2h10000 D h \le 2^h, certificate and clause counts at most 2h2^h, and the tape-capacity inequality (4) for the code length |a||a|: |a|+2binSize⁡(|a|)+2binSize⁡(Dh)+12+20(10000Dh)<⌊T/4⌋.|a| + 2\,\operatorname{binSize}(|a|) + 2\,\operatorname{binSize}(Dh) + 12 + 20(10000 D h) < \lfloor T / 4 \rfloor.(4)✦ The self-certification equivalence requires that for every h≥h0h \ge h_0, every verification task, and every Boolean assignment on data bit addresses of capacity qhq_h, there exists a Boolean certificate vector on {0,…,qh−1}\{0, \dots, q_h - 1\} under which every clause of the height hh tableau holds for the assembled assignment if and only if the height DhDh codec table entry accepts the candidate words determined by the data assignment (paired with an empty right word list when the zero-task flag holds, and the true-side candidate words otherwise). Fixing the dilation factor D=10(10000+1)(10+1)+1D = 10(10000 + 1)(10 + 1) + 1 yields a concrete self-simulating machine hierarchy of threshold height h0h_0, and the concrete 𝔽2\mathbb{F}_2-algebra RR is the quotient algebra Ah0(𝔽2)A_{h_0}(\mathbb{F}_2).

The hierarchy rewriting table acts on raw bitstrings that encode and decode finite-table cells of capacity qhq_h by packing integer slots and Boolean flags. Each cell carries a syntactic skeleton (a position in a core of size qhq_h, a palette of qhq_h colors, or a stop position; one of five markers, idle, left, boundary, full, or right; and block metadata specifying an arity below 1010, a zero-task flag, and a block index), a palette checker state (idle, passed, or head seeking a color), two 𝔽2\mathbb{F}_2-valued data bits, a certificate bit, and a reading head (recording side, clause index, nine-stage computation phase, and three-bit 𝔽2\mathbb{F}_2-register). A verification task pairs an arity below 1010 with a zero-task flag✦, and a verification clause schedule assigns to each task a positive clause count at most qhq_h and a family of three-address clauses over data and certificate memory addresses.✦ On formatted cells (enforcing admissible markers, active-head side constraints, and endpoint skeleton bounds) and compatible adjacent cell pairs (combining structural position adjacency, internal metadata consistency, left and right marker acceptance, external boundary conditions, and palette checker compatibility), cell replacement proceeds symmetrically by local unary rules at block boundaries and local binary rules reading or undoing scheduled clauses, advancing checker heads, or swapping head-free palette cells. Zero words correspond to unformatted cells, semantic head failures or zero-task acceptance, passed palette positions, or incompatible or color-mismatched adjacent pairs; lifting cell replacement and zero conditions through the bitstring codec gives the codec table entry.

The tableau clauses are generated by a combinational not-and (NAND) circuit of gg two-input NAND gates over 3β3\beta inputs, whose defining three-wire circuit clauses realize the local three-cell step of a one-tape Turing machine over a tape alphabet Γ\Gamma and state set QQ under a one-hot binary tape label coding of bit width β>0\beta > 0. In a tableau layout of parameters (q0,β,g,T,W)(q_0, \beta, g, T, W) with T,β>0T, \beta > 0, W≥3W \ge 3, an origin column below WW, certificate variable count βWT+g(W−2)(T−1)≤q0\beta W T + g(W - 2)(T - 1) \le q_0, and clause count 2βW+2β(T−1)+(3g+2β)(W−2)(T−1)+β≤q02\beta W + 2\beta(T - 1) + (3g + 2\beta)(W - 2)(T - 1) + \beta \le q_0, addressable three-wire clauses over constant bits and memory addresses compile to verification clauses encoding initial input bits, boundary blank conditions, local circuit transitions, and origin acceptance at time T−1T - 1. At height hh, the source machine layout sets q0=qhq_0 = q_h, and the source machine initial row places the encoded initial symbol at origin column 2T2T, followed immediately to the right by prefix-encoded program and parameter headers together with data bit references encoded via the bit symbol map, and blank symbols elsewhere.

The one-tape alphabet Γ\Gamma, state set QQ, and transition table arise by compiling a multi-track stack program with three register tracks (including designated source and destination tracks) into one-tape commands. That program layers a self-specialization prefix wrapper over a binary packet input decoder and a universal stack machine interpreter operating on front, back, program counter, and simulated register stacks with unary ticks, separators, and stop tokens.

The Claim

Given an integer k≥0k \ge 0, there exists an invertible matrix P∈GL⁡2k(𝔽2)P \in \operatorname{GL}_{2^k}(\mathbb{F}_2) satisfying (5) in M2k(𝔽2)M_{2^k}(\mathbb{F}_2): P−1C2kP=I+U2k.P^{-1} C_{2^k} P = I + U_{2^k}.(5)✦

For any 𝔽2\mathbb{F}_2-algebra BB, integers n≥3n \ge 3 and k≥0k \ge 0, and element u∈Jn(B[X])u \in J_n(B[X]), the identity (6) holds in St⁡n2k+1(B)\operatorname{St}_{n 2^k + 1}(B): ιn2k(ΦC2k(u))=ιn2k(Δ2k((ev⁡1)*(u))).\iota_{n 2^k}\bigl(\Phi_{C_{2^k}}(u)\bigr) = \iota_{n 2^k}\bigl(\Delta_{2^k}\bigl((\operatorname{ev}_1)_*(u)\bigr)\bigr).(6)✦

Let BB be an 𝔽2\mathbb{F}_2-algebra, let n≥3n \ge 3 and d,k≥0d, k \ge 0 be integers, and let ll be a nonempty finite sequence in Root⁡n×B[X]\operatorname{Root}_n \times B[X] whose polynomial entries have degree at most dd (with deg⁡0=0\deg 0 = 0) such that 2(|l|+1)max⁡(1,d)<2k2(|l| + 1)\max(1, d) < 2^k and w(l)∈Jn(B[X])w(l) \in J_n(B[X]). Then (7) holds in St⁡n2k+1(B)\operatorname{St}_{n 2^k + 1}(B): ιn2k(Δ2k((ev⁡1)*(w(l))))=ιn2k(Δ2k((ev⁡0)*(w(l)))).\iota_{n 2^k}\bigl(\Delta_{2^k}\bigl((\operatorname{ev}_1)_*(w(l))\bigr)\bigr) = \iota_{n 2^k}\bigl(\Delta_{2^k}\bigl((\operatorname{ev}_0)_*(w(l))\bigr)\bigr).(7)✦

Let BB be an 𝔽2\mathbb{F}_2-algebra, let n≥3n \ge 3 and d,k≥0d, k \ge 0 be integers, let ll be a nonempty finite sequence in Root⁡n×B[X]\operatorname{Root}_n \times B[X] whose polynomial entries have degree at most dd (with deg⁡0=0\deg 0 = 0) such that 2(|l|+1)max⁡(1,d)<2k2(|l| + 1)\max(1, d) < 2^k and w(l)∈Jn(B[X])w(l) \in J_n(B[X]), and suppose there exists v∈St⁡n(𝔽2)v \in \operatorname{St}_n(\mathbb{F}_2) satisfying (ev⁡0)*(w(l))=(ηB)*(v)(\operatorname{ev}_0)_*(w(l)) = (\eta_B)_*(v) in St⁡n(B)\operatorname{St}_n(B). Then for every s∈{0,…,2k−1}s \in \{0, \dots, 2^k - 1\}, there exists an integer m>0m > 0 satisfying (8) in St⁡n2k+1(B)\operatorname{St}_{n 2^k + 1}(B): ιn2k(κ2k,s((ev⁡1)*(w(l))))m=1.\iota_{n 2^k}\bigl(\kappa_{2^k, s}\bigl((\operatorname{ev}_1)_*(w(l))\bigr)\bigr)^m = 1.(8)✦

For any 𝔽2\mathbb{F}_2-algebra BB, integers n≥3n \ge 3 and N>0N > 0, index s∈{0,…,N−1}s \in \{0, \dots, N - 1\}, and element u∈Jn(B)u \in J_n(B), the relation (9) holds in St⁡nN+1(B)\operatorname{St}_{nN + 1}(B): ιnN(κN,s(u))=ιnN(σn,nN(u)).\iota_{nN}\bigl(\kappa_{N, s}(u)\bigr) = \iota_{nN}\bigl(\sigma_{n, nN}(u)\bigr).(9)✦

Given an 𝔽2\mathbb{F}_2-algebra BB, an integer n≥3n \ge 3, an element u∈Jn(B[X])u \in J_n(B[X]), and an element v∈St⁡n(𝔽2)v \in \operatorname{St}_n(\mathbb{F}_2) satisfying (ev⁡0)*(u)=(ηB)*(v)(\operatorname{ev}_0)_*(u) = (\eta_B)_*(v) in St⁡n(B)\operatorname{St}_n(B), there exist integers q≥nq \ge n and m>0m > 0 satisfying (10) in St⁡q(B)\operatorname{St}_q(B): σn,q((ev⁡1)*(u))m=1.\sigma_{n,q}\bigl((\operatorname{ev}_1)_*(u)\bigr)^m = 1.(10)✦

Over the concrete algebra RR, for any integer n≥3n \ge 3 and element u∈Jn(R)u \in J_n(R), there exist integers k≥0k \ge 0, s∈{0,…,2k−1}s \in \{0, \dots, 2^k - 1\}, and m>0m > 0 satisfying (11) in St⁡n2k+1(R)\operatorname{St}_{n 2^k + 1}(R): ιn2k(κ2k,s(u))m=1.\iota_{n 2^k}\bigl(\kappa_{2^k, s}(u)\bigr)^m = 1.(11)✦

Theorem 1. Let n≥3n \ge 3 be an integer and let u∈Jn(R)u \in J_n(R) over the concrete algebra RR. Then there exist integers q≥nq \ge n and m>0m > 0 satisfying (12) in St⁡q(R)\operatorname{St}_q(R): σn,q(u)m=1.\sigma_{n,q}(u)^m = 1.(12)✦

In the paper, the result reads: let n≥6n \ge 6 and u∈Jn(R)u \in J_n(R); then the image of uu in St⁡q(R)\operatorname{St}_q(R) is torsion for some q≥nq \ge n under the standard coordinate homomorphism. The library states the result for all n≥3n \ge 3 in (12), expressing the standard coordinate homomorphism as σn,q\sigma_{n,q}.

What Is Checked

Claims (12) and (11) are stated for n≥3n \ge 3 and elements u∈Jn(R)u \in J_n(R) over the concrete 𝔽2\mathbb{F}_2-algebra R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2) of the self-simulating machine hierarchy with dilation factor D=10(10000+1)(10+1)+1D = 10(10000 + 1)(10 + 1) + 1 at threshold height h0≥4h_0 \ge 4, using the standard coordinate inclusions σn,q\sigma_{n,q}, the padding maps ιn2k\iota_{n 2^k}, and the copy maps κ2k,s\kappa_{2^k, s}. Claims (10) through (9) are stated over an arbitrary 𝔽2\mathbb{F}_2-algebra BB in (10) through (6) and (9), and over 𝔽2\mathbb{F}_2 in (5), involving the padding maps ιnN\iota_{nN} and ιn2k\iota_{n 2^k}, the copy maps κN,s\kappa_{N, s} and κ2k,s\kappa_{2^k, s}, the Steinberg evaluation maps ΦC2k\Phi_{C_{2^k}}, the diagonal copy maps Δ2k\Delta_{2^k}, the cyclic and truncated shift matrices C2kC_{2^k} and U2kU_{2^k}, root words w(l)w(l), and polynomial evaluations ev⁡0\operatorname{ev}_0 and ev⁡1\operatorname{ev}_1.

For the underlying constructions, for any ring BB and integers n,N≥0n, N \ge 0, the library verifies that generators satisfy xp(0)=1x_p(0) = 1 for every p∈Root⁡np \in \operatorname{Root}_n✦, and that both the elementary matrices ep(a)e_p(a) in GL⁡n(B)\operatorname{GL}_n(B) and the block generators bp(Y)b_p(Y) in St⁡nN(B)\operatorname{St}_{nN}(B) (for a,b∈Ba, b \in B and Y,Y′∈MN(B)Y, Y' \in M_N(B)) satisfy the additivity, commutation, and commutator-product Steinberg relations: ep(a+b)=ep(a)ep(b)e_p(a + b) = e_p(a) e_p(b)✦ and bp(Y+Y′)=bp(Y)bp(Y′)b_p(Y + Y') = b_p(Y) b_p(Y')✦, commuting whenever p,p′∈Root⁡np, p' \in \operatorname{Root}_n satisfy pcol≠prow′p_{\mathrm{col}} \ne p'_{\mathrm{row}} and prow≠pcol′p_{\mathrm{row}} \ne p'_{\mathrm{col}}, with [eij(a),ejk(b)]=eik(ab)[e_{ij}(a), e_{jk}(b)] = e_{ik}(ab)✦ and [bij(Y),bjk(Y′)]=bik(YY′)[b_{ij}(Y), b_{jk}(Y')] = b_{ik}(YY')✦ for pairwise distinct i,j,k∈{0,…,n−1}i, j, k \in \{0, \dots, n - 1\}. The library also checks that the padding index map {0,…,n−1}→{0,…,n}\{0, \dots, n - 1\} \to \{0, \dots, n\} is injective✦, that κN,s(u)\kappa_{N,s}(u) and κN,t(v)\kappa_{N,t}(v) commute in St⁡nN(B)\operatorname{St}_{nN}(B) for all distinct s,t∈{0,…,N−1}s, t \in \{0, \dots, N - 1\} and u,v∈St⁡n(B)u, v \in \operatorname{St}_n(B)✦, and that for any 𝔽2\mathbb{F}_2-algebra BB, scalar matrices aINa I_N (a∈Ba \in B) commute with T¯\overline{T} in MN(B)M_N(B) for every T∈MN(𝔽2)T \in M_N(\mathbb{F}_2).✦ For the machine parameters, the library checks D≥2D \ge 2✦, positivity of hh and 10000Dh10000 D h for all h≥h0h \ge h_0, as well as positive tape coding width β\beta✦, positive tableau clause counts✦, and positive input-packet bit width✦.