The Setting
The graph of the counterexample to Sidorenko’s conjecture is the incidence graph of 13 points and 22 faces: each face is a set of three points, and each point is joined to the faces containing it. Any two points of a face form a side of it, and each of the 33 point pairs that occur as sides lies on exactly two faces.
Take a vector space over a field with a bilinear form , place at each point a Lagrangian subspace of for , that is, a subspace equal to its orthogonal for , and record how the 13 subspaces meet: at a face , the dimension of the intersection of its three subspaces; at a pair , the dimension of . Numbers of this kind are weighed by a cost, built from them and from a three-bit label on each face, and the cost is compared with a sum of baselines, one for each face. At a single face, tail tuples refine the data further, and the baseline of the face is set against a gain. The library defines all of these and states one identity relating the cost to the baselines.
Faces, Labels and Profiles
The points are , and the faces are, in this order, the sets (1)✦ If are the points of , the face has the side in slot , the side in slot and the side in slot .✦
Each face carries a fixed three-bit label. The separation count of a pair is the number of bits at which the labels of the two faces containing differ, their Hamming distance, a number between and ; we write .✦
For a bilinear form on a vector space over a field , a Lagrangian subspace of is a subspace equal to its orthogonal .✦
A profile is a pair of functions, assigning a natural number to each face and a natural number to each pair . The sizes of a profile at a face are the three numbers , one for each slot .✦
The Claim
Definition 1. Let , one for each of the 13 points , be Lagrangian subspaces of for . A profile is the point profile of these subspaces if, for every face and every pair , (2)✦ For a natural number , a profile is a geometric profile in dimension if, for every face and every slot , (3)✦ The triangular function on the real numbers is given by (4)✦ The face cost of a face for a profile in dimension is the natural number (5)✦ and the profile cost of in dimension is the real number (6)✦ the sums running over the 22 faces and the 33 pairs. The face baseline of real numbers , and is (7)✦ and the separation excess of a function on the pairs is (8)✦
Theorem 1. Let be a natural number and a profile with for every face and every slot . Then (9)✦
Definition 2. A tail tuple is a quintuple (10)✦ The sizes of a tail tuple are ✦ and its heights ✦, for ; its maximal height is ✦, its offset the real number ✦ and its tail sum ✦. For a natural number and a flag , the tail tuple is feasible in dimension with flag if (11)✦ The planted gain of real numbers , , , and real triples , is (12)✦ the sums running over . The tail gain of in dimension with flag is (13)✦ The tail slack of in dimension with flag is (14)✦
What Is Checked
The definitions and the theorem are stated over the configuration fixed above: the 22 faces (1) on the 13 points, the sides of each face in its three slots, the two faces of each pair and the three-bit labels that give the separation counts, and, for the point profile, Lagrangian subspaces for a bilinear form on a vector space over a field.