The first eight class products of Hollom's hypergraph
ProvedBunkbedTM.class_products_lobunkbedcombinatoricsgraph-theorypercolation
The Wierman--Ziff difference polynomial of Hollom's hypergraph is the sum of fifteen products , one for each of the fifteen classes into which the level- profiles fall. This statement verifies the first eight of them against the expanded polynomial wzDlo.
Both sides are homogeneous of degree in , , , . Splitting the fifteen products into two halves keeps each half inside the compile budget; grading both sides by powers of then replaces one four-variable polynomial identity by thirteen three-variable ones, which is what makes the ring normalisation affordable.
Preamble
import Definitions.Def_BunkbedTransferPartial open Bunkbed Bunkbed.Hyper Bunkbed.TM
Formal statement
theorem BunkbedTM.class_products_lo (x y z u : Rat) :
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
= wzDlo 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.