The Setting
A coordinate support in a product of prime fields has a conductor given by the product of its primes. Conditional energy measures a real observable at one vertex against the configuration at the remaining vertices. The conductor estimates concern sums of complete exact coordinate supports.
Let and be finite sets, let be finite nonempty state spaces, and put . All averages below are uniform probability averages; sums are counting sums. For a real linear functional on functions on a finite set , its point mass and its uniform relative joint density for a bijection are defined by (1). (1)
For a real kernel on , the conditional energy of a real function is the quantity in (2), with a zero denominator contributing zero. (2)✦
For configurations on , fix and write . The vertex decomposition separates from , and gives the bijection . Write .
For functionals on real functions on , their tensor product is the real linear functional on defined by (3); the configuration assembled from has value at . (3)✦
An exact-support function on with support is a real function whose coordinate replacements satisfy (4), where is obtained from by replacing its th coordinate by . (4)✦ Here the conditions hold for every , and the second for every . For prime coordinates , define the support conductor by .
The Tuple Laws
The tuple construction uses height , block cutoff , and blocks. Put , , and . Write for the group of permutations of . A permutation word on a block set is a function assigning such a permutation to every block✦; the tuple vertex set is , of cardinality .✦ The cyclic shift sends each position to the next, returning the last to zero.✦ For a finite block set , a group , and group-valued words , threshold shift adjacency with shift and threshold means that .✦ The list base is .✦ The interaction parameter is .✦
An ordered position pair consists of two integers and satisfying .✦ For a tuple vertex and a block , the position transposition replaces by and leaves the other blocks unchanged.✦ For active blocks , the transposition interaction is the matrix in (5). (5)✦
For a real matrix on a finite set and labelings , the label coincidence pairing , index energy , and index Boltzmann weight are defined by (6). (6)
For active blocks , an inactive-block address is an element of the set .✦ The addressed list indices are ✦, and addressed list entries form .✦ The inactive-block projection is restriction to .✦ For a prime , list values , and labels , the sampled tuple configuration is .✦ Let be the list constraint edges specifying the square-difference constraints. The nonzero square indicator is one on nonzero squares in and zero elsewhere.✦ The square-constraint indicator and tuple Boltzmann weight are those in (7), which defines the tuple component average as a real linear functional on observables . (7)
For a family of block subsets, the restricted tuple mixture is the weighted sum in (8), with block subset mixture weight . For a truncation level , the truncated family consists of the subsets of of cardinality at most .✦ The unnormalized full mixture , normalized restricted law , full tuple law , and good tuple law are defined in the same display. (8) The product tuple law on is .✦
The Prime Threshold
For a bijection and an edge set , the graph pullback is .✦ The crossing edges of an edge set on a disjoint union are the pairs in present in either orientation.✦ For an edge set on , let count the crossing edges between and . The graph conditional energy constant of an edge set on at a vertex is the quantity in (9). (9)✦
The empty-block list index is the unique index .✦ The leading list identification sends to ; its inverse reads the permutation at each block from the address.✦ Let be the leading constraint graph, the pullback of along this identification✦, and let be the leading graph edge count.✦ The leading mass lower bound and Boltzmann weight upper bound , together with the conditional error numerator and conditional decay constant , are defined by (10). (10)
The mass positivity threshold , conditional decay threshold , and their common prime cutoff are given by (11). (11)
The Claim
Theorem 1. Let be finite, let be prime for every , and put . Fix and . Let be a finite family of subsets of , and let have exact support for each . Assume throughout this family, and put .
Suppose are positive real linear functionals on with uniform marginals at every vertex. Assume that every mean-zero real function satisfies (12). (12) The tensor conductor estimate is (13). (13)✦
For and at every coordinate, the good tuple product satisfies (14). (14)✦ Under the same prime threshold, the full tuple product satisfies (15). (15)✦
For the slot estimate, let be any finite nonempty state space, let be finite, and let have . Let be a positive real linear functional on , let , and let for each . If a real number satisfies for every , then (16) holds. (16)✦
Suppose the coordinate laws satisfy (12). Let be a finite index set with assigned supports , allowing repetitions. Let have exact support , and suppose for every . The grouped conductor estimate is (17). (17)✦
In the paper, the result reads: for a finite set of primes at least a cutoff , independently chosen laws , , and complex functions such that one slot has whenever a character has denominator , one has with constant one and uniform norms.
What Is Checked
The conductor claims concern real functions with complete exact coordinate supports in a fixed finite prime family, under positive coordinate laws with uniform marginals and (12), or under the specified tuple laws above (11); the slot estimate (16) concerns any positive real linear functional on a finite nonempty configuration space with at least two vertices and the stated moments. The tensor product law, tuple component averages, and full and restricted tuple mixtures preserve sums of observables and multiplication by real scalars.