The Setting
Take an integer , a finite alphabet , and a finitely generated two-sided ideal in the free associative algebra on over the two-element field . Even when the resulting quotient algebra is infinite, the question is whether its Steinberg group of rank is finitely presented, and whether the same holds in rank twelve over the concrete coordinate ring built from a self-simulating machine hierarchy. These notes go through the finite presentation theorems and the definitions they are built on.
Steinberg Groups and the Free Presentation
In any group , the commutator of two elements is the element .✦ For a natural number , a root of rank is an ordered pair of distinct indices with row and column ; the set of all roots of rank is denoted .✦
Let be a unital associative ring. A Steinberg generator pair of rank over is an element of , and its canonical image in the free group is denoted (or when ).✦ The Steinberg group relations in form the subset consisting of the relators (1)✦ for all , every root , all pairs with and , and all pairwise distinct indices . The Steinberg group is the quotient of by the normal closure of the relators (1)✦; for and , the Steinberg generator is the image of .✦
By the universal property of , if a map into a group satisfies for all and , the elements and commute whenever and , and for all pairwise distinct and , then descends to a group homomorphism sending to .✦ For any ring homomorphism , the induced Steinberg homomorphism is the group homomorphism sending each generator to .✦
For an alphabet , the free monoid of words over is denoted , and the length of a word is denoted .✦ For a unital semiring , the monoid algebra is the free associative -algebra on ✦, and for each word , the basis monomial is the single-term element with coefficient at ✦; over , we write .✦
A short word over an alphabet is a word of with , and the Steinberg presentation generating set is the product of with the set of short words over .✦ Writing for the free generator in the free group , the Steinberg presentation relations form the subset of consisting of the relators (2)✦ for all with and , all pairwise distinct , and all short words over with in the third family, where is word concatenation. The presented Steinberg group is the quotient of by the normal closure of the relators (2); for and a short word over , the presented Steinberg generator is the image of .✦
For an integer , an alphabet , and a group , a monomial completion seed is a map satisfying three conditions for all words of length at most : for every , whenever and , and whenever are distinct and .✦
Given , a monomial completion seed into , and a root , the completed word map agrees with when , and on any word with (viewed as a word of length ) and is given recursively by (3)✦ for a chosen index .
For each , the elements () given by and (3) generate a root subgroup .✦ Viewing inside and extending the map (, ) over the coefficients of a polynomial defines an element ✦, and applying the universal property of to produces the seed lift homomorphism sending to .✦
The presentation-to-Steinberg homomorphism is the group homomorphism sending each generator () to the Steinberg generator .✦ On , the canonical presentation seed is the monomial completion seed mapping to when and to when ; for , the Steinberg-to-presentation homomorphism is the seed lift of .
Quotient Steinberg Groups and the Concrete Algebra
Let be a unital associative ring and a subset. The coefficient ideal is the two-sided ideal generated by , with quotient ring . In , the Steinberg root relations for form the subset , whose normal closure in is denoted . The Steinberg quotient group of by is the quotient group of by , equipped with the canonical quotient homomorphism .
The quotient-to-Steinberg homomorphism is the group homomorphism induced on quotients by applying to the canonical ring projection .✦ For and each root , the quotient root map is the map sending each coset to , and the Steinberg-to-quotient homomorphism is the group homomorphism induced on by the quotient root maps via the universal property.
A word rewriting table over an alphabet consists of a binary replacement relation on and a set of zero words.✦ Over a unital associative ring , the defining relations of in form the set consisting of the differences for and the basis monomials for ✦; these generate the defining two-sided ideal ✦, and the algebra of over is the quotient ring .✦
For an integer dilation factor , a self-simulating machine hierarchy consists of a Boolean program and a threshold height satisfying size bounds at capacity and a self-certification equivalence at every height between Boolean satisfiability at height and the rewriting or zero condition at height .✦ At each , produces a word rewriting table over the finite alphabet of bitstrings of length with data block size , whose algebra over is denoted . For the concrete dilation factor , the concrete source machine is a self-simulating machine hierarchy with threshold height , and its coordinate ring over is .✦
The Claim
Theorem 1. Let be an integer, let be an alphabet, and let . Then (4)✦ is a group isomorphism. If is finite, then (5)✦ Let be a unital associative ring and let be a subset, with two-sided ideal and relator normal closure . Then (6)✦ is a group isomorphism. If is finite and is finitely presented, then (7)✦ For , a finite alphabet , and a finite subset generating the two-sided ideal , (8)✦ For the concrete coordinate ring , (9)✦
In the paper, the result reads: for and a finite presentation as a unital associative -algebra (where the paper writes for and for ), has the ordinary finite presentation with generators (, ), recursive words , and relators , (, ), (, distinct), and . In the library, the explicit presentation is stated over the free algebra in (4) and (5), while (6), (7), (8), and (9) treat quotients and the concrete ring .
What Is Checked
The quotient theorem (8) is stated over an integer , a finite alphabet , the algebra , a finite subset generating the two-sided ideal , and the Steinberg group . Over an arbitrary alphabet (finite in (5)), the free-algebra claims (4) and (5) concern , the presented Steinberg group , the homomorphisms and , and . For a unital associative ring , a subset (finite in (7), where is also assumed finitely presented), and , the quotient claims (6) and (7) involve the ideal , the normal closure , the maps and , and the groups and . Claim (9) is stated over for the concrete coordinate ring at the threshold height of the concrete self-simulating machine hierarchy with dilation factor .
For these constructions, the library proves that for any , alphabet , group , and monomial completion seed , the polynomial map satisfies for all and ✦, that and commute whenever and ✦, and that for pairwise distinct .✦ For any ring and subset , the library proves that lies in the kernel of the homomorphism induced by .✦ For the machine constructions, the library also proves that the concrete dilation factor satisfies ✦ and that at any height of a self-simulating machine hierarchy, both and the data block size hold.