The Setting
Residue slices of a square-difference-free set give real functions on a product of prime fields. Their multilinear average is taken against normalized good tuple laws, which couple a fixed family of permutation vertices.
For a positive integer , write for the public integer interval and for the natural interval. Translation by one sends to . A finite set is square-difference-free when for all and positive integers .✦
For a positive integer , a permutation word on a block set is a function assigning a permutation of to each block.✦ Write for the symmetric group on . The permutation tuple vertices and their parameters are specified in (1): (1) The cyclic shift sends each position to the next, returning the last to zero.✦ The cyclic tuple vertex has value in every block.✦
Fix a finite small prime family . Its local quadratic moduli and combined modulus are given in (2); let be canonical reduction. The strict local square sets in that equation consist of the residue modulo at the prime , and nonzero squares at odd primes.✦ (2) A strict residue pair modulo is a pair of elements of satisfying for every .✦ A residue tuple is good when its consecutive cyclic vertices form strict residue pairs, as in (3): (3)
For a finite set , let be its indicator. The normalized residue slice at is the function in (4): (4)✦
Residue Lifts
Let be a finite prime family and its product residue space. Write . For a prime , the centered residue delta and the centered residue product are the real functions in (5): (5) For a cutoff , a conductor-bounded support is a subset of whose product of primes is at most . The family and the interval lift component are defined in (6) for and : (6) The component is zero for . The residue lift component on is .✦ Partial lifts retain complete exact supports: for a family , their sum and the conductor-truncated lift are as in (7): (7)
For a real parameter , the moment hypothesis at is the uniform probability bound (8), for every , and : (8)
The Good Tuple Laws
For an active block subset , an inactive-block address is a permutation word on .✦ The addressed list indices form ✦, and addressed list entries form .✦ The inactive-block projection of a vertex is .✦ For a prime , given list values and labels , the sampled tuple configuration is .✦
For group-valued addresses on a finite block set, threshold shift adjacency with shift and threshold is the relation that holds when at least blocks satisfy .✦ The list constraint edges specify the square-difference constraints between list values. The nonzero square indicator and square-constraint indicator are given in (9): (9) For a vertex , a block and positions , the position transposition composes the permutation of at block on the right with and leaves its other blocks fixed.✦ The transposition interaction is the matrix in (10): (10)✦ For a real matrix on a finite set and labelings of that set, the label coincidence pairing is the counting sum in (11).✦ For a real matrix on a finite set and a labeling of that set, the index energy is one half of the diagonal label coincidence pairing✦, and the index Boltzmann weight is its exponential✦; the tuple Boltzmann weight for the transposition interaction is .✦ (11) The tuple component average on real observables is the uniform probability average in (12) over list values and labelings: (12)✦ For a family of block subsets, the restricted mixture uses block subset weights . Its normalization and the good tuple law are defined by (13), using the truncated block family : (13)
A functional on a finite configuration space has point mass .✦ The tensor product law on and the multilinear integral are the counting sums and product observable in (14), where : (14)
An ordered position pair at height is a pair of positions in with .✦
Thresholds and Errors
The leading list identification sends to , where zero is the unique empty-block list index.✦ The leading constraint graph is the pullback of under this bijection: a pair is an edge precisely when its image is an edge of .✦ Let be the leading graph edge count.✦
For a vertex of a finite directed graph , split the vertices into and its complement. Let count the crossing edges, counting either orientation once. The graph conditional energy constant is defined by (15): (15)✦ The leading mass lower bound and Boltzmann weight upper bound are specified in (16), together with the mass positivity threshold : (16) The conditional error numerator determines the conditional decay constant and conditional decay threshold through (17): (17)
For positive integers and a real parameter , the absolute kernel constant and ordered interval error are given in (18): (18)
For the exponent specified in (19), the power cutoff is , with natural-number floor.✦ The decay parameters in (19) fix the exponent : (19)
For a finite vertex set and , the vertex index decomposition at is the bijection from the disjoint union of a singleton and onto that sends the singleton to and every other vertex to itself.✦
The Claim
The combined prime family on agrees with on and with on .✦
Theorem 1. Fix the small prime family . For a positive integer , suppose is injective, every prime at most occurs in , and and for every . Let be square-difference-free, and let be a good residue tuple.
Let be positive integers, let , and let be real. Assume the moment hypothesis (8) and the scale conditions (20): (20) The ordered global estimate is (21): (21)✦ There exist and an integer , depending on the fixed family , such that for every and every satisfying the hypotheses in the first paragraph of this theorem, the ordered contraction estimate (22) holds: (22)✦
In the paper, the result reads: there are absolute and such that whenever , has no positive square difference and is good, the bound (23) holds uniformly in and , for the paper’s prime family and cutoff , with good subprobabilities : (23)
What Is Checked
The assertions are stated over finite injective combined prime families and real residue lifts of square-difference-free subsets of , with the cyclic strict-square condition on their residue tuples. Each local quadratic modulus divides ✦, and its canonical reduction is a ring homomorphism. The tuple component averages are real linear functionals; the restricted mixtures and tensor product law preserve sums of observables and multiplication by real scalars.