The Setting
Given an associative ring with identity and an integer , the Steinberg group maps into the general linear group via the elementary matrix representation . When is the concrete algebra over the two-element field constructed from a self-simulating machine hierarchy, the question is whether every element of has finite order for every rank , and at .
Steinberg Groups and Elementary Matrices
In a group , the commutator of two elements is the product .✦ Given a non-negative integer , a root of rank is an ordered pair of distinct indices .✦ Over an associative ring with identity, a generator of rank is a pair consisting of a root of rank and a ring element , and denotes the canonical image of in the free group on the generators of rank .
In the free group on the generators of rank over an associative ring with identity, the Steinberg relations consist of the three families of relators (1)✦ for roots , , and of rank with and , pairwise distinct indices , and elements . The Steinberg group is the group presented by the generators subject to the relators (1).✦ By its universal property, any map into a group descends to a group homomorphism sending to provided that, for all , for every root , and commute whenever and satisfy and , and for pairwise distinct .✦
Let be the general linear group of invertible matrices over indexed by , with identity matrix and matrix having in entry and elsewhere. For a root of rank and , the elementary matrix is , with inverse .✦ The elementary matrix group is the subgroup of generated by the elementary matrices for all roots of rank and elements . Applying the universal property of to defines the elementary matrix representation sending to , and the Steinberg kernel is the kernel subgroup of .✦
Rewriting-table Algebras and the Concrete Algebra
For an alphabet , the free monoid of words over is ✦; for a ring with identity, the monoid algebra of words is ✦, and the basis monomial of a word is the single-term element with coefficient at . A word rewriting table over consists of a binary replacement relation and a set of zero words .✦ Over , the defining relations of generate the defining two-sided ideal ✦, and the algebra of is the quotient ring given by (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 and a positive integer , a one-hot binary coding of bit width encodes tape cell labels into , and a combinational circuit of two-input not-and (NAND) gates realizes the three-cell local tape transition. Given a positive integer height and an integer dilation factor , set capacity , time , tape width , and data block size ; whenever the cell encoding, data block size, variable and clause counts, and input length satisfy the layout fitting bounds for , , and , 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- rewriting table has alphabet , 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 , a self-simulating machine hierarchy consists of a Boolean program and a threshold height such that, for every height , 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 and a zero-word flag) and every Boolean assignment to the data addresses (indexed by two sides, ten blocks, and positions below ), a certificate vector satisfies all clauses of the height- tableau if and only if the word lists of bitstrings of length 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 .✦ At height over a ring , the machine hierarchy algebra is the rewriting-table algebra (2) of over .✦ Setting yields the concrete machine hierarchy with threshold , and taking at defines the concrete reference ring .✦
The Claim
Theorem 1. Let be an integer, and let satisfy . Then there exists a positive integer such that (3)✦ At rank , let satisfy ; then there exists a positive integer such that (4)✦ and over the reference ring at rank , let satisfy ; then there exists a positive integer such that (5)✦
What Is Checked
The claims (3), (4), and (5) are stated over the Steinberg group (with in (3) and in (4) and (5)), the elementary matrix representation , and the concrete -algebra . For these constructions, given any , the elementary matrices satisfy for every root of rank ✦, commute as whenever and have and ✦, and obey for pairwise distinct indices .✦