The Setting
Deleting a letter with a coefficient determined by its neighbors gives scalar tests on associative words in the pentagon substitutions. The coefficients come from integral hyperplane weights and four deletion kernels over .
The deletion alphabet is . The type hyperplane family consists of the coordinate labels and the diagonal labels .✦ Write for the coordinate covectors of the free -module on . For a hyperplane label and deletion letters , the integral deletion weights are symmetric integer edge weights, with coefficient vector specified in (12).
The target alphabet is the disjoint union of the fiber alphabet and the base alphabet .✦ Each target letter has a list of hyperplane labels, defined by (1). (1) The target deletion weight is the sum of the integral weights on this list, reduced modulo two, as in (2); the row edge weights use the same deletion letters in (13). (2)
Weighted Deletion and Word Weights
For a commutative ring and an alphabet , the free associative algebra is the monoid algebra of the words on .✦ Write for the basis monomial associated with a word , and for the empty word.✦ For an -algebra , associative evaluation is the algebra homomorphism extending an assignment .✦
Let be a letter weight. For a word on , its word weight is the nonnegative integer given by the sum in (3). For a predicate on words, the prescribed word span is the -span of their monomials satisfying .✦ For a nonnegative integer , the homogeneous component and the strictly lower weight space are the submodules of spanned respectively by monomials of weight and of weight less than , as in (3). (3)
For deletion labels , let be a coefficient for a label and three letters of . For a deletion label and boundary letters , the weighted deletion operator is the -linear endomorphism of given on basis monomials by the sum in (4). Here and , and the empty word has image zero. (4) The weighted deletion representation is the algebra homomorphism from to that sends each deletion label to , as in (5). For a word on , the complete deletion coefficient is the linear functional on defined there by extracting the coefficient of the empty word. (5) For costs , the weight-matched kernel is the function that retains precisely the coefficients whose deleted letter has weight equal to the label cost, as defined in (6). (6)✦
The Pentagon Row Kernels
The substitution alphabet is , with , , for free associative letters in characteristic two, of weights , respectively. The counting weights on and on are the indicator functions in (7), where denotes the indicator of a condition . The resulting -count differs from ordinary -depth: has depth one and -count zero. (7)
The four pentagon rows are indexed by .✦ For a substitution letter , the row substitution list consists of target letters in and is defined in slot order by (8). (8) The slot edge weight is the sum of row edge weights along .✦ For a row , a substitution letter , and deletion letters , the raw deletion kernel is the difference in of the slot edge weights at the two edges meeting the deleted letter , as in (9). (9)
The deletion weights of the second row are the functions in (10). (10) The four row deletion kernels are given by (11), with the arguments of suppressed and all sums taken in . (11)✦
The Claim
Theorem 1. The integral deletion weights are given by (12), with the listed pairs unordered. (12)✦ For and , the row edge weight is (13). (13)✦ For a row , a slot , and letters with and , the cut identity is (14). (14)✦
Let be a commutative ring, let be alphabets, and give them weights and costs . Suppose every nonzero coefficient satisfies . For boundary letters , a word on , and , the scalar vanishing statement is (15). (15)✦
Suppose instead that every nonzero coefficient satisfies . For boundary letters , a word on , and , the exact allocation statement is (16). (16)✦
In the paper, the result reads: with denoting the coordinates and the generator associated with a hyperplane , in the integral basis , , , the edge weights are (17), with denoting the paper’s , (17) equal-letter edges have weight zero, and after reduction modulo two a word containing zeros has zero scalar test against every product with fewer than factors , while with exactly such factors every one must delete a zero in a nonzero contribution.
What Is Checked
The statements concern integral hyperplane weights and row kernels with and , while the scalar assertions range over arbitrary commutative coefficient rings and alphabets under their respective inequalities on nonzero deletion weights.