Contracting the 47 profile pairs onto fifteen classes
ProvedBunkbedTM.delta_contractbunkbedcombinatoricsgraph-theorypercolation
The difference of the two connection probabilities on Hollom's hypergraph is the double sum over the pairs of level profiles, where and wFinal is the profile weight. This statement evaluates that contraction.
The key structural fact is that the two levels interact only through the posts over , so depends on only through its restriction to . That restriction takes only values, so the level- profiles fall into classes, and the double sum collapses to , where is the total weight of class and is the level- contraction .
Fifteen products replace the pairs on which is nonzero, and fifteen is optimal for a bilinear decomposition: it is exactly the rank of the integer matrix .
Preamble
import Definitions.Def_BunkbedTransferClasses import Definitions.Def_BunkbedWZPoly open Bunkbed Bunkbed.Hyper Bunkbed.TM SimpleGraph Finset
Formal statement
theorem BunkbedTM.delta_contract (x y z u : Rat) :
(∑ j : Fin 47, wFinal j x y z u *
(∑ m : Fin 47, ((if glueConn (stFinal j) (stFinal m) 1 then (1 : ℚ) else 0)
- (if glueConn (stFinal j) (stFinal m) 0 then (1 : ℚ) else 0)) * wFinal m x y z u))
= ck0 x y z u * wk0 x y z u + ck1 x y z u * wk1 x y z u + ck2 x y z u * wk2 x y z u + ck3 x y z u * wk3 x y z u + ck4 x y z u * wk4 x y z u + ck5 x y z u * wk5 x y z u + ck6 x y z u * wk6 x y z u + ck7 x y z u * wk7 x y z u + ck8 x y z u * wk8 x y z u + ck9 x y z u * wk9 x y z u + ck10 x y z u * wk10 x y z u + ck11 x y z u * wk11 x y z u + ck12 x y z u * wk12 x y z u + ck13 x y z u * wk13 x y z u + ck14 x y z u * wk14 x y z u := by sorrySource
Gladkov, Pak, Zimin, *The bunkbed conjecture is false*, PNAS 122 (2025) no. 24, e2420725122; Section 3, Lemma 3.3 and Hollom's 3-uniform hypergraph (Fig. 1), with the path of Eq. [5].