OctoInformBeta

OpenAI preprint, September 2026 · §2. The finite complex · §2

§2 (setting): pairs, opposite faces, bits and the separation a_e: Tables of 22 faces and 33 point pairs on 13 points, and the number s(e)s(e) of bits where the faces on ee differ

The finite complex and the bit labels of its faces.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The counterexample to Sidorenko’s conjecture is built on a bipartite graph HH that comes from a finite complex: 1313 points, numbered 0,1,…,120,1,\dots,12, and 2222 faces, numbered 0,1,…,210,1,\dots,21, each face a set of three points. The vertices of HH are the points and the faces, and a point is joined to every face that contains it.

Beyond HH, the construction attaches a number to each pair of points that share a face, read off from a labelling of the faces by three bits.

The Definition

Definition 1. Face ff of the complex is the set of three points vf(0)<vf(1)<vf(2)v_f(0)<v_f(1)<v_f(2), in its slots 0,1,20,1,2, listed under ff in f012345678910vf0,1,30,1,90,2,30,2,91,3,101,7,101,7,121,9,122,3,42,4,93,4,11f1112131415161718192021vf3,10,114,8,94,8,115,6,75,6,115,7,105,10,116,7,126,8,116,8,128,9,12\begin{array}{c|ccccccccccc} f & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10\\ \hline v_f & 0,1,3 & 0,1,9 & 0,2,3 & 0,2,9 & 1,3,10 & 1,7,10 & 1,7,12 & 1,9,12 & 2,3,4 & 2,4,9 & 3,4,11\\[6pt] f & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & 21\\ \hline v_f & 3,10,11 & 4,8,9 & 4,8,11 & 5,6,7 & 5,6,11 & 5,7,10 & 5,10,11 & 6,7,12 & 6,8,11 & 6,8,12 & 8,9,12 \end{array}(1)✦ A point pair is a set of two points contained in a face. There are 3333 of them, the sets VeV_e listed under e∈{0,1,…,32}e\in\{0,1,\dots,32\} in e012345678910Ve0,20,32,30,92,90,11,32,43,41,94,9e1112131415161718192021Ve1,103,103,114,111,129,124,88,91,77,1010,11e2223242526272829303132Ve8,117,128,125,75,105,116,86,116,76,125,6\begin{array}{c|ccccccccccc} e & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10\\ \hline V_e & 0,2 & 0,3 & 2,3 & 0,9 & 2,9 & 0,1 & 1,3 & 2,4 & 3,4 & 1,9 & 4,9\\[6pt] e & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & 21\\ \hline V_e & 1,10 & 3,10 & 3,11 & 4,11 & 1,12 & 9,12 & 4,8 & 8,9 & 1,7 & 7,10 & 10,11\\[6pt] e & 22 & 23 & 24 & 25 & 26 & 27 & 28 & 29 & 30 & 31 & 32\\ \hline V_e & 8,11 & 7,12 & 8,12 & 5,7 & 5,10 & 5,11 & 6,8 & 6,11 & 6,7 & 6,12 & 5,6 \end{array}(2)✦ Face ff contains the three pairs εf(0)\varepsilon_f(0), εf(1)\varepsilon_f(1), εf(2)\varepsilon_f(2), with Vεf(0)={vf(0),vf(1)}V_{\varepsilon_f(0)}=\{v_f(0),v_f(1)\}, Vεf(1)={vf(0),vf(2)}V_{\varepsilon_f(1)}=\{v_f(0),v_f(2)\} and Vεf(2)={vf(1),vf(2)}V_{\varepsilon_f(2)}=\{v_f(1),v_f(2)\}: f012345678910εf5,1,65,3,90,1,20,3,46,11,1219,11,2019,15,239,15,162,7,87,4,108,13,14f1112131415161718192021εf12,13,2117,10,1817,14,2232,25,3032,27,2925,26,2026,27,2130,31,2328,29,2228,31,2418,24,16\begin{array}{c|ccccccccccc} f & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10\\ \hline \varepsilon_f & 5,1,6 & 5,3,9 & 0,1,2 & 0,3,4 & 6,11,12 & 19,11,20 & 19,15,23 & 9,15,16 & 2,7,8 & 7,4,10 & 8,13,14\\[6pt] f & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & 21\\ \hline \varepsilon_f & 12,13,21 & 17,10,18 & 17,14,22 & 32,25,30 & 32,27,29 & 25,26,20 & 26,27,21 & 30,31,23 & 28,29,22 & 28,31,24 & 18,24,16 \end{array}(3)✦ For a point pair ee, the two faces that contain VeV_e are φe(0)<φe(1)\varphi_e(0)<\varphi_e(1), listed in (4): e012345678910φe2,30,22,81,33,90,10,48,98,101,79,12e1112131415161718192021φe4,54,1110,1110,136,77,2112,1312,215,65,1611,17e2223242526272829303132φe13,196,1820,2114,1616,1715,1719,2015,1914,1818,2014,15\begin{array}{c|ccccccccccc} e & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10\\ \hline \varphi_e & 2,3 & 0,2 & 2,8 & 1,3 & 3,9 & 0,1 & 0,4 & 8,9 & 8,10 & 1,7 & 9,12\\[6pt] e & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & 21\\ \hline \varphi_e & 4,5 & 4,11 & 10,11 & 10,13 & 6,7 & 7,21 & 12,13 & 12,21 & 5,6 & 5,16 & 11,17\\[6pt] e & 22 & 23 & 24 & 25 & 26 & 27 & 28 & 29 & 30 & 31 & 32\\ \hline \varphi_e & 13,19 & 6,18 & 20,21 & 14,16 & 16,17 & 15,17 & 19,20 & 15,19 & 14,18 & 18,20 & 14,15 \end{array}(4)✦ The bit label of face ff is the word βf=βf(0)βf(1)βf(2)\beta_f=\beta_f(0)\beta_f(1)\beta_f(2) in {0,1}3\{0,1\}^3 given by f012345678910βf000010001110001000100110101100111f1112131415161718192021βf101101011000110010111001010011111\begin{array}{c|ccccccccccc} f & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10\\ \hline \beta_f & 000 & 010 & 001 & 110 & 001 & 000 & 100 & 110 & 101 & 100 & 111\\[6pt] f & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & 21\\ \hline \beta_f & 101 & 101 & 011 & 000 & 110 & 010 & 111 & 001 & 010 & 011 & 111 \end{array}(5)✦ The separation count s(e)s(e) of pair ee is the number of bit positions at which the labels of its two faces differ: s(e)=|{b∈{0,1,2}:βφe(0)(b)≠βφe(1)(b)}|.s(e)=\bigl|\{\,b\in\{0,1,2\}:\beta_{\varphi_e(0)}(b)\neq\beta_{\varphi_e(1)}(b)\,\}\bigr|.(6)✦

In the paper, the result reads: EE is the set of point pairs contained in a face, each face carries a 33-bit label, and aea_e is one third of the number of bit positions at which the two faces on ee differ. The paper’s aea_e is s(e)/3s(e)/3.

What Is Checked

The definition is stated over the 1313 points, the 2222 faces with their three slots and the 3333 point pairs, and the separation count (6) over the labels (5) of the two faces (4) on each pair.