OctoInformBeta

OpenAI preprint, September 2026 · §4. An ordinary finite presentation for the Steinberg group

Lemma 4.3: Perfectness in rank n≥3n \ge 3, injectivity of elementary matrix and generator maps, and infiniteness over infinite rings (n≥2n \ge 2)

Perfectness and infiniteness of Steinberg groups.

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 unital associative ring SS and a natural number nn, together with the Steinberg group St⁡n(S)\operatorname{St}_n(S), its generator maps, and the elementary matrix maps into invertible n×nn \times n matrices over SS. The questions are when St⁡n(S)\operatorname{St}_n(S) equals its commutator subgroup, whether each generator map and elementary matrix map is injective, and whether St⁡n(S)\operatorname{St}_n(S) is infinite when SS is infinite and n≥2n \ge 2, as well as whether St⁡12(R)\operatorname{St}_{12}(R) is infinite for the concrete source algebra RR over the two-element field 𝔽2\mathbb{F}_2 arising from a machine hierarchy.

Steinberg Groups and Elementary Matrices

The commutator [x,y][x, y] of two elements x,yx, y in a group GG is the product xyx−1y−1x y x^{-1} y^{-1}.✦ The commutator subgroup [G,G][G, G] of a group GG is the subgroup of GG generated by all commutators [x,y][x, y] with x,y∈Gx, y \in G. A group GG is perfect if [G,G]=G[G, G] = G.

For a natural number nn, a root p=(i,j)p = (i, j) of rank nn is a pair of distinct indices i,j∈{0,…,n−1}i, j \in \{0, \dots, n - 1\} with row index ii and column index jj.✦ Given a unital associative ring SS and a natural number nn, a generator (p,a)(p, a) of rank nn over SS is a pair consisting of a root pp of rank nn and a ring element a∈Sa \in S.✦ The free group Fn(S)F_n(S) on the generators of rank nn over SS is the free group generated by the set of generators of rank nn over SS. For a root p=(i,j)p = (i, j) of rank nn and a∈Sa \in S, the free generator x̃p(a)=x̃ij(a)\tilde{x}_p(a) = \tilde{x}_{ij}(a) in Fn(S)F_n(S) is the canonical image of (p,a)(p, a). In Fn(S)F_n(S), the Steinberg relations consist of the three families of relators (1): x̃p(a+b)(x̃p(a)x̃p(b))−1(p a root of rank n,a,b∈S),[x̃p(a),x̃q(b)](p=(i,j),q=(k,l) roots of rank n,j≠k,i≠l,a,b∈S),[x̃ij(a),x̃jk(b)]x̃ik(ab)−1(i,j,k∈{0,…,n−1} pairwise distinct,a,b∈S).\begin{aligned} &\tilde{x}_p(a + b)\bigl(\tilde{x}_p(a)\tilde{x}_p(b)\bigr)^{-1} && (p \text{ a root of rank } n,\; a, b \in S),\\ &[\tilde{x}_p(a), \tilde{x}_q(b)] && (p = (i, j),\; q = (k, l) \text{ roots of rank } n,\; j \neq k,\; i \neq l,\; a, b \in S),\\ &[\tilde{x}_{ij}(a), \tilde{x}_{jk}(b)]\,\tilde{x}_{ik}(ab)^{-1} && (i, j, k \in \{0, \dots, n - 1\} \text{ pairwise distinct},\; a, b \in S). \end{aligned}(1)✦ The Steinberg group St⁡n(S)\operatorname{St}_n(S) of rank nn over a unital associative ring SS is the quotient of Fn(S)F_n(S) by the normal subgroup generated by the relators (1). For a root p=(i,j)p = (i, j) of rank nn and a∈Sa \in S, the Steinberg generator xp(a)=xij(a)x_p(a) = x_{ij}(a) in St⁡n(S)\operatorname{St}_n(S) is the image of x̃p(a)\tilde{x}_p(a) in the quotient St⁡n(S)\operatorname{St}_n(S).✦

The general linear group GL⁡n(S)\operatorname{GL}_n(S) over a unital associative ring SS is the group of invertible n×nn \times n matrices over SS, with identity matrix II and standard basis matrices EijE_{ij} (0≤i,j<n0 \le i, j < n) 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∈Sa \in S, the elementary matrix ep(a)=eij(a)e_p(a) = e_{ij}(a) in GL⁡n(S)\operatorname{GL}_n(S) is given by (2): eij(a)=I+aEij.e_{ij}(a) = I + a E_{ij}.(2)✦ The elementary matrix group E⁡n(S)\operatorname{E}_n(S) of rank nn over a unital associative ring SS is the subgroup of GL⁡n(S)\operatorname{GL}_n(S) generated by all elementary matrices ep(a)e_p(a) with pp a root of rank nn and a∈Sa \in S.

The Source Algebra

For an alphabet α\alpha, the free monoid α*\alpha^* is the free monoid generated by α\alpha.✦ Over a unital associative ring KK and an alphabet α\alpha, the monoid algebra K[α*]K[\alpha^*] is the ring of formal finite KK-linear combinations of words in α*\alpha^*, in which each word w∈α*w \in \alpha^* corresponds to its basis monomial with coefficient 11 at ww and 00 elsewhere.✦ A word rewriting table T=(rep,Z)T = (\mathrm{rep}, Z) on an alphabet α\alpha consists of a binary replacement relation rep\mathrm{rep} on α*\alpha^* and a subset Z⊆α*Z \subseteq \alpha^* of zero words.✦ Given a unital associative ring KK, the defining relations of a word rewriting table T=(rep,Z)T = (\mathrm{rep}, Z) in K[α*]K[\alpha^*] form the set ℛT(K)\mathcal{R}_T(K) given by (3): ℛT(K)={v−w:(v,w)∈rep}∪{z:z∈Z},\mathcal{R}_T(K) = \{v - w : (v, w) \in \mathrm{rep}\} \cup \{z : z \in Z\},(3)✦ identifying each word with its basis monomial. The defining ideal IT(K)I_T(K) of a word rewriting table TT in K[α*]K[\alpha^*] is the two-sided ideal generated by ℛT(K)\mathcal{R}_T(K), and the algebra of the rewriting table TT over KK is the quotient ring K[α*]/IT(K)K[\alpha^*] / I_T(K).

For each natural number hh, the alphabet BhB_h of Boolean vectors of length 10000h10000h is {0,1}10000h\{0, 1\}^{10000h}.✦ Given an integer dilation factor D≥2D \ge 2, a self-simulating machine hierarchy AA has a threshold h0≥4h_0 \ge 4 and assigns to each height h≥h0h \ge h_0 a word rewriting table ThT_h on BhB_h; for a unital associative ring KK, the machine hierarchy algebra Ah(K)A_h(K) is the algebra of the rewriting table ThT_h over KK. Fixing the dilation factor D=10(10000+1)(10+1)+1≥2D = 10(10000 + 1)(10 + 1) + 1 \ge 2, the concrete source machine is a self-simulating machine hierarchy with threshold height h0h_0, and the concrete source algebra is R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2) over the two-element field 𝔽2\mathbb{F}_2.

The Claim

Theorem 1. Let SS be a unital associative ring and nn a natural number. If n≥3n \ge 3, then the Steinberg group satisfies (4): [St⁡n(S),St⁡n(S)]=St⁡n(S).[\operatorname{St}_n(S), \operatorname{St}_n(S)] = \operatorname{St}_n(S).(4)✦ For any root pp of rank nn, the elementary matrix map and the Steinberg generator map satisfy (5) and (6): ep:S→GL⁡n(S) is injective,e_p : S \to \operatorname{GL}_n(S) \text{ is injective,}(5)✦ xp:S→St⁡n(S) is injective.x_p : S \to \operatorname{St}_n(S) \text{ is injective.}(6)✦ If SS is infinite and pp is a root of rank nn, then (7) holds: St⁡n(S) is infinite.\operatorname{St}_n(S) \text{ is infinite.}(7)✦ For the concrete source algebra R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2) at rank 1212, (8) holds: St⁡12(R) is infinite.\operatorname{St}_{12}(R) \text{ is infinite.}(8)✦

In the paper, the result reads: for every unital associative 𝔽2\mathbb{F}_2-algebra SS and n≥3n \ge 3, the groups St⁡n(S)\operatorname{St}_n(S) and E⁡n(S)\operatorname{E}_n(S) are perfect; if SS is infinite, both groups are infinite (with SS standing for the paper’s RR). Relative to the paper’s hypotheses of an 𝔽2\mathbb{F}_2-algebra and n≥3n \ge 3, the library states (4) through (7) over any unital associative ring SS (requiring a root of rank nn, equivalently n≥2n \ge 2, in (5) through (7)), and adds the statement (8) for RR at rank 1212.

What Is Checked

The claims are stated over an arbitrary unital associative ring SS (assumed infinite in (7)), a natural number nn (assumed at least 33 in (4)), roots pp of rank nn (in (5) through (7)), the Steinberg group St⁡n(S)\operatorname{St}_n(S) with its commutator subgroup and generator maps xpx_p, the elementary matrix maps epe_p into GL⁡n(S)\operatorname{GL}_n(S), and at rank 1212 the concrete 𝔽2\mathbb{F}_2-algebra R=Ah0(𝔽2)R = A_{h_0}(\mathbb{F}_2) built from the concrete self-simulating machine hierarchy of dilation factor D=10(10000+1)(10+1)+1D = 10(10000 + 1)(10 + 1) + 1 at its threshold height h0h_0.