The Setting
Configurations indexed by tuples of permutations combine nonzero square differences with an interaction between label assignments. Fix a prime and use the parameters in (1), where is the block set: (1) A permutation word on a block set with word length is a map assigning to each block a permutation of . Write and for its permutation group. The tuple vertex set is the set in (2): (2)✦
For a marked block set , an inactive-block address is a map assigning a permutation in to each block outside .✦ A list index is an integer between zero and , and an addressed list entry is a pair consisting of an inactive-block address in and a list index in . Their sets, together with the inactive-block projection , are given in (3): (3)
For maps from a finite block set to a group, threshold shift adjacency with shift and nonnegative integer threshold is the relation in (4). The fixed cyclic shift rotates the positions by one.✦ (4)✦
The list constraint edges are the ordered pairs of addressed list entries on which a nonzero square difference is imposed.✦ The nonzero square indicator and the square-constraint indicator for a residue label field are defined by (5): (5)
The Interaction and the Cut
An ordered position pair is an element of .✦ For , , and , the position transposition changes the permutation at by right composition with , as in (6): (6)✦ The transposition interaction is the counting sum in (7): (7)✦
For a finite index set , a label set , a real matrix on , and label assignments , the label coincidence pairing is the real number given in (8). For a finite index set , a label set , a real matrix on , and a label assignment , the index energy is the real number equal to half the label coincidence pairing of with itself, and the index Boltzmann weight is the real number equal to the exponential of , as in (8): (8) For a label assignment , the tuple Boltzmann weight is the real number given by (7) and (8).
The sampled tuple configuration reads the residue label at the address and index selected by each vertex.✦ The component functional on real functions is the weighted average in (9); both averages are uniform probability averages, and and are independent: (9)
For and , the symbol reflection changes block by left composition with .✦ The positive cut half of the symbol reflection is the set of words in which precedes in block , as specified in (10): (10) For a configuration , write . The cut bilinear form on real functions is defined in (11): (11)
The Claim
Theorem 1. Let be prime, let , and choose and . Set . For every real function , the component satisfies (12): (12)✦ For every pair of real functions , the cut form satisfies (13): (13)✦
In the paper, the result reads: for every allowed mark set and every reflection , is invariant under , and its matrix at that cut is symmetric.
What Is Checked
The statements are over every prime , every marked block set , and every block and pair of symbols, with arbitrary real functions on the full configuration space for (12) and on the positive cut half’s configuration space for (13).