The Setting
The graph of the counterexample to Sidorenko’s conjecture is built on points, numbered , and faces, each a triple of points: it is the bipartite graph on the points and the faces that joins each point to the faces containing it. Listed with their points , the faces are, in order, (1)✦ The sides of a face are the pairs , and , in that order, and each of the point pairs that occur as sides lies in exactly two faces.✦ A corner of is an edge of , the incidence of a point with a face; it is written for the face and the slot of its point , and there are corners.✦
In the construction of a negative kernel correlation, each pair of a point and a face carries a random activation of the corners: a random set of active corners and a random sign on every corner. The base laws are the laws of these activations. The question is how they correlate the signs on the corners of the two sides of a face that meet at a corner.
The Sets at a Corner
The left pair and the right pair of a corner are the two sides of the face that contain its point , the first and the second in the order of sides. The set of corners of a point pair is the set of the four corners at which a point of meets one of the two faces containing : (2)✦
For a corner , the corner union and the corner symmetric difference are the sets of corners (3)
The corner sign of a corner is the number when , the point in the face , and at every other corner.✦
Activations and Their Moments
A finite probability law on a finite set is a function with ✦, and the expectation of a real function on under is .✦ The point mass at an element of is the law on with weight at and weight elsewhere.✦ The mixture of two laws on , for , has weight at ✦, and the product of laws on and on is the law on with weight at .✦
An activation of a finite set is a pair of a subset of , the set of active elements, and a labelling .✦ The Boolean sign of a label is and ✦, and the Boolean monomial of a subset of at is the product ✦. The activation character of is the function on activations (4)✦ and the moment of a law on activations of at two subsets and of is (5)✦
For a nonempty subset of and a real number with , the tilted law is the law on labellings of with weights (6)✦ For a subset of , the branch law is the law of the activation whose active set is and whose labelling is drawn from .✦
The Claim
Definition 1. Let be a finite set, and subsets of with nonempty, and a real number with . The base activation law is the law on activations of (7)✦ The corner law at a corner is the base activation law on activations of the corners, with and as in (3).✦ The pair law at a point and a face is the law on activations of the corners (8)✦ where is the empty activation, with no active corner and every label false.
In the paper, the result reads: the type sets , and are the points, the faces and the corners; at the corner of a point and a face , with pairs and , the set has seven corners and has six; for a fixed and one negative corner sign , the base law takes or with probability each, with sign biases on the monomial , and at pairs of types that are not incident.
The corner law at a corner is the paper’s base law at with .
Theorem 1. Let be a corner and let , be sets of corners; write for the moment (5) of the corner law , and for when holds and otherwise. Then (9)✦ If is nonempty, then (10)✦ If and are disjoint and not both empty, then (11)✦ At the sets of corners of the left and right pairs of , (12)✦
What Is Checked
The claim is stated over the corners of the configuration of points and faces, with the left and right pairs of each corner, the sets , and and the corner sign , and over finite probability laws on activations of the corners, built from point masses, mixtures, products and tilted laws, with their characters and moments.
The library proves that the corner symmetric difference is nonempty at every corner .✦