The Setting
Fix a commutative ring of characteristic two and a finitely presented associative algebra over , given as a quotient of a monoid algebra by word rewriting relations and zero words. For a finite alphabet of chunks labeled by nonempty words of length at most over the generating alphabet and weighted by matrices over , summing the matrix-weighted word products over all chunk sequences whose concatenated labels have total length produces a matrix over the algebra. For the height- rewriting algebra of a self-simulating machine hierarchy with , the question is when every such dimension- chunk test of label bound vanishes for all sufficiently large , and whether suffices.
Packets, Chunk Sums, and Eligible Intervals
For a natural number , write (empty when ), and for a ring or semiring , finite index set , and natural number , write for the ring of matrices over and . For an alphabet , the free monoid consists of finite words over under concatenation, with denoting the length of .✦ Given a finite alphabet and , the set of candidate words up to length is the finite set .✦
Given an alphabet , a ring , and a map , the word evaluation of under is given by (1): (1) For a finite chunk alphabet , a ring , a length map , a weight map , and , the scalar chunk sum of target length is the element of defined by (2): (2) where .
A packet over an alphabet is a triple of words over , consisting of a prefix , an interior , and a suffix .✦ For a packet over an alphabet , the concatenation of is the word , and the invariant key of is the triple , where is the multiset of entries of . The permuted packet word of a packet over an alphabet with under a permutation of is the word . Given and a matrix weight map over a ring , the chunk sequence weight matrix of is the matrix product (3): (3)
For alphabets and and a label map , the word spelled by is the concatenation .✦ When is a finite chunk alphabet, is an alphabet, is a label map, is a ring, is a -algebra, , , , and , the entrywise chunk sum is given by (4): (4) Given a finite index set , a -algebra , , and , the tensor product is the matrix with -entry for all .✦ For finite and , a label map , , , and , setting for each , the matrix chunk sum is the special case of (2) in given by (5): (5) A sequence in eventually vanishes if for all sufficiently large .
Suppose is an alphabet, is a predicate on , , and . A pair of integers with is a -eligible interval for with respect to if and there exists satisfying such that for all , whenever , and whenever .✦ For any map , write for letterwise application of .
Rewriting-table Algebras and Machine Hierarchies
Given a semiring and an alphabet , the monoid algebra of words is the monoid algebra of over , in which each has a basis monomial supported at with coefficient . A word rewriting table over consists of a binary replacement relation on and a set of zero words.✦ When is a ring, the defining relations of form the subset in (6): (6)✦ Writing for the two-sided ideal generated by , the algebra of the rewriting table is the quotient ring , with canonical quotient homomorphism sending to the word element .
The raw bitstring alphabet at height is .✦ For an integer dilation factor , a self-simulating machine hierarchy consists of a Boolean program and a threshold such that, for every height , the size of the program specialized to itself fits a computation tableau of address capacity , and satisfiability of that height- tableau’s Boolean clauses is equivalent to acceptance under the replacement and zero conditions of the height- rewriting table on words over .✦ Each height determines a clause schedule at capacity and an induced word rewriting table over ; over a ring , the machine hierarchy algebra is the quotient algebra with , and when is commutative the letter map sends each to for the one-letter word .
For a commutative ring , height , and integers , a dimension- chunk test of label bound at height over is a tuple consisting of a finite index set with , a finite chunk alphabet , a map with each nonempty and , and . The chunk vanishing property for is the condition that eventually vanishes in for every dimension- chunk test of label bound at height over .
The Claim
For a commutative ring of characteristic two, take a -module , an alphabet , , a finite set , , , and an assignment of packets over . Assume that for every and every permutation of , one has , pairwise distinct entries in , , , invariant key for , and . Every matrix index pair then satisfies (7): (7)✦
Let be an algebra over a commutative ring of characteristic two, let be a finite chunk alphabet, let and be alphabets, and fix . Given with each nonempty and , together with , , , and , suppose that for every with and , writing and , one has , , pairwise distinct letters , and an element such that for and whenever . Then (8) holds for all : (8)✦
Keeping , , , , , , , , , and as in (8), let satisfy , let be a predicate on , and let . Assume that whenever satisfies and , that whenever satisfies , and that every word with and admits a -eligible interval in with respect to . For every and all , the entrywise chunk sum satisfies (9): (9)✦
Under the hypotheses of (9), for every the matrix chunk sum in satisfies (10): (10)✦
Replacing by an arbitrary finite index set , the bound by , and by a map while retaining all remaining hypotheses of (9), for every the matrix chunk sum in satisfies (11): (11)✦
Theorem 1. Let , let be a self-simulating machine hierarchy of dilation factor and threshold , let , let be a commutative ring of characteristic two, and let satisfy . Then for every dimension- chunk test of label bound at height over , there exists such that (12) holds for all : (12)✦ in .
In the paper, the result reads: if , then every dimension- chunk test of label bound at level eventually vanishes over every field of characteristic two, where and stand for the paper’s and .
What Is Checked
The main claim (12) is stated over a commutative ring of characteristic two, a self-simulating machine hierarchy of dilation factor and threshold , a height , the rewriting-table algebra generated by via , and parameters with , while the general cancellation claims (7), (8), (9), (10), and (11) are stated over a commutative ring of characteristic two, an arbitrary -module or -algebra , and finite matrix-weighted chunk alphabets satisfying the packet, range, or eligible-interval hypotheses.