OctoInformBeta

OpenAI preprint, September 2026 · §5. Centrality and rational stability

Proposition 5.4: For n≥6n \ge 6, Jn(R)J_n(R) is central, and Jn(S)J_n(S) is central when matrices over the kernel of ε:S→𝔽2\varepsilon : S \to \mathbb{F}_2 are nilpotent

Steinberg kernel centrality from rank six under matrix nilpotency.

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 an associative ring SS and a nonnegative integer nn. The question is whether, under stable range conditions and for n≥6n \ge 6, the kernel of the homomorphism from the Steinberg group St⁡n(S)\operatorname{St}_n(S) to the elementary matrix group E⁡n(S)\operatorname{E}_n(S) lies in the center of St⁡n(S)\operatorname{St}_n(S): when does centrality hold for a ring SS admitting a homomorphism to the two-element field 𝔽2\mathbb{F}_2 whose matrix kernel consists of nilpotent matrices, and does it hold for the concrete finitely presented algebra over 𝔽2\mathbb{F}_2 built from a self-simulating machine hierarchy?

Steinberg Groups and Elementary Matrices

In a group GG, the commutator [x,y][x, y] of elements x,y∈Gx, y \in G is the element [x,y]=xyx−1y−1.[x, y] = x y x^{-1} y^{-1}.(1)✦ The center Z(G)Z(G) of a group GG is the subgroup of elements z∈Gz \in G satisfying zg=gzz g = g z for all g∈Gg \in G.

For a nonnegative integer nn, a root pp of rank nn is an ordered pair p=(i,j)p = (i, j) of distinct indices i≠ji \ne j in {1,…,n}\{1, \dots, n\}, with row index prow=ip_{\mathrm{row}} = i and column index pcol=jp_{\mathrm{col}} = j.✦ Given a nonnegative integer nn and an associative ring SS, a Steinberg generator (p,a)(p, a) of rank nn over SS is a pair consisting of a root pp of rank nn and an element a∈Sa \in S.✦ In the free group on the Steinberg generators of rank nn over SS, the free generator xp(a)=xij(a)x_p(a) = x_{ij}(a) for a root p=(i,j)p = (i, j) and a∈Sa \in S is the canonical image of (p,a)(p, a).✦

For a nonnegative integer nn and an associative ring SS, the Steinberg relations over SS in rank nn are the three families of relators in the free group on the Steinberg generators given for all a,b∈Sa, b \in S by xp(a+b)(xp(a)xp(b))−1,[xq(a),xr(b)],[xij(a),xjk(b)]xik(ab)−1,x_p(a + b)(x_p(a) x_p(b))^{-1}, \qquad [x_q(a), x_r(b)], \qquad [x_{ij}(a), x_{jk}(b)] x_{ik}(ab)^{-1},(2)✦ where pp is any root of rank nn, qq and rr are roots of rank nn with qcol≠rrowq_{\mathrm{col}} \ne r_{\mathrm{row}} and qrow≠rcolq_{\mathrm{row}} \ne r_{\mathrm{col}}, and i,j,k∈{1,…,n}i, j, k \in \{1, \dots, n\} are pairwise distinct. The Steinberg group St⁡n(S)\operatorname{St}_n(S) is the quotient of the free group on the Steinberg generators of rank nn over SS by the normal subgroup generated by the relators (2), and the image of xp(a)=xij(a)x_p(a) = x_{ij}(a) in St⁡n(S)\operatorname{St}_n(S) is again written xp(a)=xij(a)x_p(a) = x_{ij}(a).✦ By the universal property of St⁡n(S)\operatorname{St}_n(S), any map (p,a)↦f(p,a)(p, a) \mapsto f(p, a) from the Steinberg generators into a group GG satisfying f(p,a+b)=f(p,a)f(p,b)f(p, a + b) = f(p, a) f(p, b), f(q,a)f(r,b)=f(r,b)f(q,a)f(q, a) f(r, b) = f(r, b) f(q, a) when qcol≠rrowq_{\mathrm{col}} \ne r_{\mathrm{row}} and qrow≠rcolq_{\mathrm{row}} \ne r_{\mathrm{col}}, 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 induces a group homomorphism St⁡n(S)→G\operatorname{St}_n(S) \to G sending xp(a)x_p(a) to f(p,a)f(p, a).✦

For an index set ι\iota, an associative ring SS, distinct indices i,j∈ιi, j \in \iota, and an element a∈Sa \in S, the elementary matrix eij(a)e_{ij}(a) is the invertible matrix I+aEijI + a E_{ij} in the group GL⁡ι(S)\operatorname{GL}_\iota(S) of invertible ι×ι\iota \times \iota matrices over SS, where II is the identity matrix and aEija E_{ij} has entry aa in position (i,j)(i, j) and 00 elsewhere (with inverse I−aEijI - a E_{ij}).✦ The elementary subgroup E⁡ι(S)\operatorname{E}_\iota(S) of GL⁡ι(S)\operatorname{GL}_\iota(S) is the subgroup generated by all elementary matrices eij(a)e_{ij}(a) with i≠ji \ne j in ι\iota and a∈Sa \in S.✦ When ι={1,…,n}\iota = \{1, \dots, n\}, write GL⁡n(S)\operatorname{GL}_n(S) for GL⁡ι(S)\operatorname{GL}_\iota(S), E⁡n(S)\operatorname{E}_n(S) for E⁡ι(S)\operatorname{E}_\iota(S), and ep(a)=eij(a)e_p(a) = e_{ij}(a) for a root p=(i,j)p = (i, j) of rank nn.

Over an associative ring SS, the elementary matrices in GL⁡n(S)\operatorname{GL}_n(S) 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 and all a,b∈Sa, b \in S✦, eq(a)er(b)=er(b)eq(a)e_q(a) e_r(b) = e_r(b) e_q(a) for roots q,rq, r with qcol≠rrowq_{\mathrm{col}} \ne r_{\mathrm{row}} and qrow≠rcolq_{\mathrm{row}} \ne r_{\mathrm{col}}, and [eij(a),ejk(b)]=eik(ab)[e_{ij}(a), e_{jk}(b)] = e_{ik}(ab) for pairwise distinct i,j,k∈{1,…,n}i, j, k \in \{1, \dots, n\}.✦ The Steinberg representation πn:St⁡n(S)→GL⁡n(S)\pi_n : \operatorname{St}_n(S) \to \operatorname{GL}_n(S) is the group homomorphism sending each xp(a)x_p(a) to ep(a)e_p(a) obtained from the universal property of St⁡n(S)\operatorname{St}_n(S).✦ For a nonnegative integer nn and an associative ring SS, restricting the codomain of the Steinberg representation πn:St⁡n(S)→GL⁡n(S)\pi_n : \operatorname{St}_n(S) \to \operatorname{GL}_n(S) to E⁡n(S)\operatorname{E}_n(S) gives a group homomorphism πn:St⁡n(S)→E⁡n(S)\pi_n : \operatorname{St}_n(S) \to \operatorname{E}_n(S).✦ For a nonnegative integer nn and an associative ring SS, the kernel ker⁡πn\ker \pi_n of the Steinberg representation πn:St⁡n(S)→GL⁡n(S)\pi_n : \operatorname{St}_n(S) \to \operatorname{GL}_n(S) coincides with the Steinberg kernel Jn(S)J_n(S), which is the subgroup of St⁡n(S)\operatorname{St}_n(S) defined by Jn(S)=ker⁡(πn:St⁡n(S)→E⁡n(S)).J_n(S) = \ker(\pi_n : \operatorname{St}_n(S) \to \operatorname{E}_n(S)).(3)✦

Nilpotent Kernels and the Machine Algebra

A ring homomorphism ε:S→𝔽2\varepsilon : S \to \mathbb{F}_2 from an associative ring SS to 𝔽2\mathbb{F}_2 has the matrix nil kernel property if for every nonnegative integer mm and every m×mm \times m matrix A=(Aij)A = (A_{ij}) over SS such that ε(Aij)=0\varepsilon(A_{ij}) = 0 for all i,j∈{1,…,m}i, j \in \{1, \dots, m\}, the matrix AA is nilpotent.✦

Given an alphabet α\alpha and a ring KK, denote by Word⁡(α)\operatorname{Word}(\alpha) the free monoid of words over α\alpha and by K[Word⁡(α)]K[\operatorname{Word}(\alpha)] its monoid algebra over KK, identifying each word w∈Word⁡(α)w \in \operatorname{Word}(\alpha) with the single-term basis monomial 1⋅w1 \cdot w. A word rewriting table TT over α\alpha consists of a binary replacement relation rep\operatorname{rep} on Word⁡(α)\operatorname{Word}(\alpha) and a subset zero⁡⊆Word⁡(α)\operatorname{zero} \subseteq \operatorname{Word}(\alpha) of zero words.✦ Over a ring KK, the defining relations of TT in K[Word⁡(α)]K[\operatorname{Word}(\alpha)] consist of all differences v−wv - w of basis monomials with rep⁡(v,w)\operatorname{rep}(v, w) together with the basis monomials of all words z∈zeroz \in \operatorname{zero}✦, and the algebra of TT over KK is the quotient ring K[Word⁡(α)]/I(T)K[\operatorname{Word}(\alpha)] / I(T)✦, where I(T)I(T) is the two-sided ideal generated by those defining relations.✦

For an integer dilation factor D≥2D \ge 2, a self-simulating machine hierarchy consists of a Boolean program and an integer threshold h0≥4h_0 \ge 4 such that for every integer h≥h0h \ge h_0, the hierarchy specifies a word rewriting table ThT_h over bitstrings of length 10000h10000 h at data size 10000Dh10000 D h, and the rewriting and zero conditions at height DhD h are equivalent to the existence of Boolean certificates of length 2h2^h for the program’s verification conditions at height hh✦; such a hierarchy exists for every D≥2D \ge 2.✦ For a machine hierarchy, an associative ring KK, and an integer h≥h0h \ge h_0, the machine hierarchy algebra Ah(K)A_h(K) is the algebra of ThT_h over KK.✦

The concrete dilation factor is the integer D=10(10000+1)(10+1)+1,D = 10(10000 + 1)(10 + 1) + 1,(4)✦ and the concrete source machine is the machine hierarchy constructed for this DD, with threshold height denoted hh.✦ The concrete coordinate ring RR is the machine hierarchy algebra of the concrete source machine over 𝔽2\mathbb{F}_2 at height hh: R=Ah(𝔽2).R = A_h(\mathbb{F}_2).(5)✦

The Claim

Theorem 1. For an 𝔽2\mathbb{F}_2-algebra SS with an augmentation ε:S→𝔽2\varepsilon : S \to \mathbb{F}_2 satisfying the matrix nil kernel property and an integer n≥6n \ge 6, the representation πn:St⁡n(S)→GL⁡n(S)\pi_n : \operatorname{St}_n(S) \to \operatorname{GL}_n(S) satisfies ker⁡πn⊆Z(St⁡n(S)).\ker \pi_n \subseteq Z(\operatorname{St}_n(S)).(6)✦ If SS is an 𝔽2\mathbb{F}_2-algebra equipped with a ring homomorphism ε:S→𝔽2\varepsilon : S \to \mathbb{F}_2 having the matrix nil kernel property and n≥6n \ge 6 is an integer, then Jn(S)⊆Z(St⁡n(S)).J_n(S) \subseteq Z(\operatorname{St}_n(S)).(7)✦ Over RR, for any integer n≥6n \ge 6, the representation πn:St⁡n(R)→GL⁡n(R)\pi_n : \operatorname{St}_n(R) \to \operatorname{GL}_n(R) satisfies ker⁡πn⊆Z(St⁡n(R)).\ker \pi_n \subseteq Z(\operatorname{St}_n(R)).(8)✦ At rank n=12n = 12 over RR, the representation π12:St⁡12(R)→GL⁡12(R)\pi_{12} : \operatorname{St}_{12}(R) \to \operatorname{GL}_{12}(R) satisfies ker⁡π12⊆Z(St⁡12(R)).\ker \pi_{12} \subseteq Z(\operatorname{St}_{12}(R)).(9)✦

What Is Checked

Claim (6) is stated over an associative ring SS and a nonnegative integer nn in terms of the Steinberg group St⁡n(S)\operatorname{St}_n(S) and the matrix representation πn:St⁡n(S)→GL⁡n(S)\pi_n : \operatorname{St}_n(S) \to \operatorname{GL}_n(S), whereas (7) is stated for Jn(S)J_n(S) at any rank n≥6n \ge 6 over an associative ring SS carrying a ring homomorphism ε:S→𝔽2\varepsilon : S \to \mathbb{F}_2 with the matrix nil kernel property. Claims (8) and (9) are stated for the kernel of πn:St⁡n(R)→GL⁡n(R)\pi_n : \operatorname{St}_n(R) \to \operatorname{GL}_n(R) over the concrete coordinate ring RR, at any integer n≥6n \ge 6 and at n=12n = 12, respectively.

For these constructions, the library also proves that the concrete dilation factor satisfies D≥2D \ge 2✦, and that for any machine hierarchy at an integer height hh at least its threshold, both hh and the data size 10000Dh10000 D h are positive.