The Setting
Square constraints on finite lists give a weighted quadratic form pairing a configuration on one side of a permutation cut with its reflection in a marked block.
Write for a natural number . The height and block cutoff determine the block count and block set . The list base , interaction parameter , lower interaction scale and half vertex count have the fixed values in (1): (1)
A permutation word on a block set at height is a function assigning each block an element of .✦ The tuple vertex set and the ordered position pairs are the sets in (2): (2)
For , and , the position transposition is the permutation word obtained from by exchanging positions in block .✦ For , and , the block transposition reflection is the permutation word obtained from by exchanging symbols in block .✦ Their compositions are specified by (3), with every other block unchanged: (3)
For a block and symbols , the positive cut predicate on a permutation word is the condition that the inverse permutation in block places before .✦ The positive cut half at a block and symbols , and its cardinality , are given in (4): (4)✦
Lists and Weights
Let be the mark set and put . An inactive-block address for a mark set is a choice of a permutation on each block outside .✦ The address set , addressed list index set and addressed list entry set are defined in (5); is the list length: (5)
The inactive-block projection restricts a word to .✦ For a prime , list values and indices , the sampled tuple configuration is the configuration in (6): (6)
The cyclic shift on is the permutation that sends each position to the next and the last to zero.✦ For a finite block set , a group , an element and a natural threshold , threshold shift adjacency is the relation on defined by (7): (7)✦
The list constraint edges are the ordered pairs specifying the square-difference constraints between list values. The nonzero square indicator of a field , and the square-constraint indicator on , are defined in (8): (8)
The transposition interaction sums the contributions of position transpositions in marked blocks, as in (9): (9)✦
For a finite index set , a real matrix on , a label set and labelings , the label coincidence pairing is the counting sum in (10).✦ For a real matrix on a finite index set and a labeling of , the index energy is half the label coincidence self-pairing of with respect to , and the index Boltzmann weight is the exponential of this energy. The tuple Boltzmann weight for a mark set is the index Boltzmann weight associated with the transposition interaction : (10)
The tuple component average of a real observable on is defined in (11). Every expectation is a uniform probability average over the indicated finite set: (11)✦
For a real function , the reflection quadratic form is the component average of the product in (12): (12)✦
The Claim
Theorem 1. Let be prime, let , and let . For distinct and every real function , the marked reflection lower bound is (13): (13)✦ The marked reflection constant is the real number in (14): (14)✦ It satisfies (15): (15)✦ For any mark set with , any block and distinct , the coefficient comparison is (16): (16)✦
In the paper, the result reads: put , and ; for , a cut in a marked block and every real , the estimate (17) holds, with all list values and only the indices on averaged uniformly, and its coefficient is at least independently of and the list values, where denotes the paper’s and its : (17)
What Is Checked
The statements are over the tuple component average (11) and its reflection quadratic form (12) on prime field configurations, with the fixed permutation and list parameters of (1).