The Setting
Take a unital associative ring and a natural number , together with the Steinberg group , its generator maps, and the elementary matrix maps into invertible matrices over . The questions are when equals its commutator subgroup, whether each generator map and elementary matrix map is injective, and whether is infinite when is infinite and , as well as whether is infinite for the concrete source algebra over the two-element field arising from a machine hierarchy.
Steinberg Groups and Elementary Matrices
The commutator of two elements in a group is the product .✦ The commutator subgroup of a group is the subgroup of generated by all commutators with . A group is perfect if .
For a natural number , a root of rank is a pair of distinct indices with row index and column index .✦ Given a unital associative ring and a natural number , a generator of rank over is a pair consisting of a root of rank and a ring element .✦ The free group on the generators of rank over is the free group generated by the set of generators of rank over . For a root of rank and , the free generator in is the canonical image of . In , the Steinberg relations consist of the three families of relators (1): (1)✦ The Steinberg group of rank over a unital associative ring is the quotient of by the normal subgroup generated by the relators (1). For a root of rank and , the Steinberg generator in is the image of in the quotient .✦
The general linear group over a unital associative ring is the group of invertible matrices over , with identity matrix and standard basis matrices () having in entry and elsewhere. For a root of rank and , the elementary matrix in is given by (2): (2)✦ The elementary matrix group of rank over a unital associative ring is the subgroup of generated by all elementary matrices with a root of rank and .
The Source Algebra
For an alphabet , the free monoid is the free monoid generated by .✦ Over a unital associative ring and an alphabet , the monoid algebra is the ring of formal finite -linear combinations of words in , in which each word corresponds to its basis monomial with coefficient at and elsewhere.✦ A word rewriting table on an alphabet consists of a binary replacement relation on and a subset of zero words.✦ Given a unital associative ring , the defining relations of a word rewriting table in form the set given by (3): (3)✦ identifying each word with its basis monomial. The defining ideal of a word rewriting table in is the two-sided ideal generated by , and the algebra of the rewriting table over is the quotient ring .
For each natural number , the alphabet of Boolean vectors of length is .✦ Given an integer dilation factor , a self-simulating machine hierarchy has a threshold and assigns to each height a word rewriting table on ; for a unital associative ring , the machine hierarchy algebra is the algebra of the rewriting table over . Fixing the dilation factor , the concrete source machine is a self-simulating machine hierarchy with threshold height , and the concrete source algebra is over the two-element field .
The Claim
Theorem 1. Let be a unital associative ring and a natural number. If , then the Steinberg group satisfies (4): (4)✦ For any root of rank , the elementary matrix map and the Steinberg generator map satisfy (5) and (6): (5)✦ (6)✦ If is infinite and is a root of rank , then (7) holds: (7)✦ For the concrete source algebra at rank , (8) holds: (8)✦
In the paper, the result reads: for every unital associative -algebra and , the groups and are perfect; if is infinite, both groups are infinite (with standing for the paper’s ). Relative to the paper’s hypotheses of an -algebra and , the library states (4) through (7) over any unital associative ring (requiring a root of rank , equivalently , in (5) through (7)), and adds the statement (8) for at rank .
What Is Checked
The claims are stated over an arbitrary unital associative ring (assumed infinite in (7)), a natural number (assumed at least in (4)), roots of rank (in (5) through (7)), the Steinberg group with its commutator subgroup and generator maps , the elementary matrix maps into , and at rank the concrete -algebra built from the concrete self-simulating machine hierarchy of dilation factor at its threshold height .