The Setting
Square conditions couple coordinates in two finite lists, with the direction of each constrained difference prescribed separately. Let be an odd prime and let be finite index sets. Write and for the two lists.
For a field , the nonzero square indicator is the function in (1): (1)โฆ Write .
An oriented set of cross pairs between and is a pair consisting of a set and a function prescribing the direction at each pair. Put . The square-constraint kernel and its centered kernel are defined by (2): (2)โฆ
For a finite index set and a real function on , the uniform average and normalized norm are the real numbers given by (3): (3) For a real kernel on , write for the operator norm, with these normalized norms, of the map .
The Claim
Theorem 1. Let be an odd prime, let be finite index sets, and let be a set of pairs with prescribed orientation . For real functions and , the centered kernel satisfies (4)โฆ and (5)โฆ
In the paper, the result reads: for an odd prime , finite disjoint sets , and a directed graph on with edge set of size , all edges crossing between the two lists, with arbitrary directions and at most one edge on each unordered pair, the kernel , where combines and , satisfies , with both sides zero when .
What Is Checked
The estimates (4) and (5) are stated over real functions on finite coordinate powers of an odd prime field, with the square-constraint kernel formed from a finite set of cross pairs and a prescribed orientation on each pair.