The Setting
Given a commutative ring , a dimension , a finite alphabet , and an associative -algebra generated by , matrix letter tests sum -fold products of scalar matrices and algebra generators over all length- words in , while chunk tests sum over sequences of multi-letter blocks of total length . When words decompose at designated cut letters into bounded prefixes, sequences of tokens, and bounded suffixes, both sums enter an abstract cut reduction. For a self-simulating hierarchy of rewriting-table algebras over with dilation factor , the question is how eventual vanishing of dimension- matrix letter tests at height reduces to eventual vanishing of dimension- matrix chunk tests of label bound at height .
Cut Intervals and Abstract Word Sums
For an alphabet , write for the free monoid of words over ; the word evaluation of a word along a map into a monoid or ring is the product in (taking value on the empty word). Given a cut predicate on an alphabet , a word is cut-free for if no letter occurring in satisfies ✦, and is a cut interval for if for a letter satisfying and a cut-free word for .✦
For a finite alphabet and , the set of candidate words up to length is the finite set of all words over of length at most , and is the subset of words of length .✦ The letter sum of a map from a finite alphabet into a ring at is (1)✦ For a finite chunk alphabet , a ring , a length map , a weight map , and , the chunk sum is (2)✦
A token map between alphabets and extends to words by , and for any triple , the token join is .✦ When and are finite, the token decomposition language for finite subsets and is the finite set of all triples satisfying .✦
Matrix Tests and Rewriting Table Algebras
Let be a finite index set, a commutative ring, and an associative -algebra. The tensor product of a matrix and an element is the matrix over with -entry for all .✦ For a finite alphabet , a matrix weight , a map , and , the matrix letter sum is defined via (1) by .✦ For a finite chunk alphabet , a label map , a matrix weight , a map , and , the matrix chunk sum is defined via (2) by .✦
For an alphabet and a ring , write for the monoid algebra of over , in which each word determines a basis monomial with coefficient at . A word rewriting table over consists of a binary replacement relation on and a subset of zero words.✦ For a word rewriting table over , the defining relations of over form the subset of , generating a two-sided ideal . The rewriting-table algebra is the quotient ring of by , equipped with the quotient homomorphism sending each basis monomial to its word class .
Finite Table Cells and the Machine Hierarchy
For , let be the finite alphabet of raw bitstrings of length .✦ A verification task is a pair consisting of an arity in and a Boolean zero-task flag.✦ For , a cell memory address is either a data address (a Boolean side, a block index in , and a position strictly less than ) or a certificate address (a position strictly less than )✦; a verification clause of capacity consists of three cell memory addresses indexed by together with a Boolean truth function on ✦; and a verification clause schedule of capacity assigns to each verification task a positive clause count at most and a family of verification clauses indexed by clause index strictly less than .✦ A finite table cell of capacity consists of a skeleton (a position that is a core coordinate strictly less than , a palette color strictly less than , or stop; a marker from idle, left, boundary, full, or right; and metadata giving an arity strictly less than , a zero-task flag, and a block index at most that arity), a palette checker state (idle, passed with a sought color strictly less than , or an active head seeking a color strictly less than ), two side-indexed data bits, an certificate bit, and a reading head state (a Boolean side, a clause index strictly less than , one of nine computation phases, and a register in ).✦
For , a finite table cell of capacity satisfies the cut predicate if its position is the core coordinate and either its marker is idle or the block index in its metadata equals .✦ Given a schedule of capacity and a data size , two cell lists satisfy the replacement relation when every cell in both lists is formatted and the lists are singletons or pairs related in either direction by a unary or binary transition✦; replacing a subword by a replacement-related subword defines a rewriting step, whose reflexive-transitive closure is reachability. A cell word satisfies the zero cell word predicate if it is a single cell failing formatting, hitting a semantic head-phase failure, or resting in a passed state at its own palette color (a unary-zero cell), or a pair of cells failing skeleton or checker compatibility, sharing a palette position, or pairing a palette cell seeking a distinct color with a stop cell (a binary-zero cell pair).✦ A cell word survives under and if no reachable word contains a subword satisfying the zero cell word predicate✦, and a cell token for and is a cut interval for the cut predicate such that survives for some cell satisfying the cut predicate. For , cell encoding embeds cells of capacity into , and cell decoding (extended letterwise to words) recovers a cell from precisely when parsing yields and encoding reproduces ; a raw token for , , and is the letterwise encoding of a cell token.✦ The algebra table over has replacement relation holding whenever both raw words decode to replacement-related cell lists, and zero words consisting of raw singletons that fail to decode or decode to a unary-zero cell together with raw pairs decoding to a binary-zero cell pair; for a Boolean selector and , the codec table entry holds if is empty and is zero in when is true, and if is a replacement pair when is false.✦
A fixed timed-tape stack machine implementing a wrapped universal stack interpreter has a one-hot binary tape coding of bit width , an input-packet decoder of packet bit width equal to the cardinality of its packet set, and a combinational not-and (NAND) circuit realization with gates computing its local step. For with , , and , a tableau layout specifies an origin index strictly less than such that both the total certificate variable count and the total tableau clause count are at most .✦ Letting be for and the binary length of otherwise, for height , dilation , and code length , with and , the layout parameter bounds hold when , , , , the certificate and clause counts for are at most , and .✦ Under these bounds with , the source clause schedule at height for a code is the verification clause schedule of capacity constructed from the tableau layout with and origin , the circuit realization, and the initial inputs formed from and data size . Given an integer dilation , a self-simulating machine hierarchy consists of a Boolean program and a threshold such that every height satisfies the layout parameter bounds for the self-specialized code of the program (prepending a true bit to the prefix encoding of the length and bits of the program twice, where the prefix encoding of concatenates true bits, a false delimiter bit, and the binary digits of ) together with the self-certification equivalence: for every verification task of arity and every Boolean assignment on data addresses of capacity , there exists a Boolean certificate on positions strictly less than satisfying every clause of the height- tableau layout on the assignment assembled from that data assignment and certificate if and only if the codec table entry at height (for the source clause schedule of that self-specialized code at height , data size , and selector equal to the zero-task flag) accepts the length- sequence of candidate raw words in extracted from the false-side blocks of that data assignment and, when the zero-task flag is false, the corresponding true-side sequence (otherwise empty).✦
Fix , a self-simulating machine hierarchy , a commutative ring , and a height at least the threshold of . The hierarchy clause schedule is the source clause schedule of capacity for the self-specialized code of at height ✦, and is its algebra table over .✦ The rewriting-table algebra of is , and the letter map sends each raw bitstring to the word class .✦ The hierarchy token set is the set of raw tokens for , , and data size ✦, and the token normal-form map sends each token in to a normalized raw word of height .✦ Say that a sequence eventually vanishes if there exists such that for all . For , satisfies letter vanishing in dimension , written , if eventually vanishes for every finite index set with and every matrix weight ✦, and for , the algebra satisfies chunk vanishing in dimension with label bound , written , if eventually vanishes for every finite index set with , every finite chunk alphabet , every label map with for all , and every matrix weight .
The Claim
Theorem 1. Let , let be a self-simulating machine hierarchy with dilation , let be a commutative ring, let be at least the threshold of , and let . If satisfies chunk vanishing in dimension with label bound , then (3)✦
For the same , , , and , let be a finite index set and let be a matrix weight. If for every token weight the sequence eventually vanishes, then there exists such that (4)✦
Let and be finite alphabets, let be a ring, let be a cut predicate on , and let be an injective map such that is a cut interval for for every . Let be finite sets of cut-free words and cut intervals for , respectively, with for all and for all for some , and let and satisfy , , and for all . If and are such that every word with and factors as for some , , and , and such that for all , then for every , (5)✦
Under the same , , , , , , , and , if is such that every word with factors as for some , , and , then (6)✦
In the paper, the result reads: for a level , a field of characteristic two, and a dimension , if every dimension- chunk test of label bound at level eventually vanishes, then every dimension- letter test at level eventually vanishes. The library’s statement (3) replaces the level indices and with the hierarchy heights and , fixes the label bound at , and holds over an arbitrary commutative ring rather than only over a field of characteristic two.
What Is Checked
Claims (3) and (4) are stated over an arbitrary commutative ring , a self-simulating machine hierarchy of dilation , a height at least the threshold of , the rewriting-table algebras and over the raw bitstring alphabets and , the token set with normal-form map , a finite index set (of cardinality at most in (3)), and matrix weights on and over , while (5) and (6) are stated over finite alphabets and , a ring , a cut predicate on , an injective cut-interval token map , finite sets and of cut-free prefixes and cut-interval suffixes, a weight map , and (in (5)) positive chunk lengths , a positive multiplier , a bound , and thresholds . Beyond (3) through (6), the library establishes for these constructions that every height meeting the threshold of is positive, has positive data size , and yields a dilated height that also meets the threshold of , and that the tape-coding bit width , the packet bit width of the input decoder, and the total clause count of any tableau layout are positive.