The Setting
A reflection cut compares a real observable on one half of a tuple configuration with its value on the reflected half. The configurations are sampled from lists indexed by permutations on the blocks that have not been marked.
For a height , a permutation word on a block set is a function from to the permutations of .✦ The tuple vertex set is the set of permutation words on the block set in (1); the height, block cutoff, list base and half vertex count are fixed by (1)
For a block and distinct symbols , the positive cut predicate says that precedes in block .✦ The positive cut half is the set of words in which precedes in block , and the block transposition reflection composes the permutation at on the left with : (2) The reflection half decomposition sends a word in the first copy to itself and a word in the second copy to its reflection in (2).✦
For an active block set , an inactive-block address is a permutation word on .✦ An addressed list index is an integer in , and an addressed list entry is a pair in , with these sets and the inactive-block projection defined by (3): (3)
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 , a shift and a nonnegative integer , threshold shift adjacency of is the condition (4): (4)✦ The list constraint edges are the directed edges specifying the square-difference constraints between list values.
Let be prime. For a field and an element , the nonzero square indicator is given by (5); for a finite directed edge set and a labeling of its vertices by , the graph square-constraint indicator is given by the same display, and the tuple square-constraint indicator is on list values : (5)
Weights and Half Moments
An ordered position pair is a pair in with .✦ For a block and a permutation word , the position transposition composes on the right with and fixes the other blocks.✦ The transposition interaction on , with interaction parameter , is the counting sum in (6): (6)
For a finite index set , label set , real matrix on and labelings , the label coincidence pairing , index energy and index Boltzmann weight are the real quantities in (7): (7) The tuple Boltzmann weight on labelings is the function given by .
For list values and a labeling , the sampled tuple configuration selects the list value at the vertex’s inactive-block address and index.✦ The component functional on real observables is the weighted uniform average in (8): (8) All averages here and below use uniform probability on the indicated finite sets. The tuple reflection quadratic form on real functions is defined by (9): (9)✦ The symbols specifying the cut are suppressed in this notation.
Suppose . A positive half address is an inactive-block address in which precedes in block , and a positive half list entry is a pair consisting of a positive half address and an index in . Their sets and the inactive-block half projection are (10): (10) The list reflection half decomposition leaves the list index fixed, sending the address to itself on the first copy and to its block transposition reflection on the second.✦
For a directed graph on a finite set and a bijection , the pullback is the directed graph on consisting of the pairs for which .✦ For a directed graph on two copies of a finite set , the positive half internal edge set is the set of pairs in whose corresponding pair in the first copy belongs to .✦ The unmarked half graph and its positive half internal edges are specified in (11), where denotes the first copy: (11) The unmarked quadratic moment of the real half-label function is the real second moment in (12): (12)
The interaction lower-bound parameter , Boltzmann weight bound , and marked and unmarked reflection constants are fixed by (13): (13) The reflection positivity threshold is the real number in (14): (14)
The Claim
Theorem 1. Let be prime, let have , and let . Fix distinct , write , and let . Then (15)✦ If , then also (16)✦
In the paper, the result reads: for , , and every real half-label function , one has , and consequently has a positive semidefinite matrix at this cut whenever , with denoting the paper’s .
What Is Checked
The claims (15) and (16) are stated for the component functionals and unmarked quadratic moments over prime fields, with real half-label functions, at a cut in an inactive block and with at most active blocks; the prime threshold is required for (16). The word and list reflection half decompositions are bijections between their respective finite sets.