The configurations meeting contribute nothing to the difference
ProvedBunkbedAux.cancel_on_XThis is the cancellation step of the involution argument of Gladkov--Pak--Zimin, stated for the whole set rather than one block at a time.
Let be the set of legal refined configurations in which some hyperedge has its state in the sixteen-element set . Then
where is the product of the refined per-hyperedge weights. In words: on the same-level and the cross-level connection events carry exactly the same weight, so contributes nothing whatsoever to the difference of the two connection probabilities.
The mechanism. Each configuration in has a well-defined pivot: the first hyperedge, in the order of the path , whose state lies in . The involution applies the half-reflection at the pivot and the level swap to every later hyperedge, leaving the earlier ones untouched. It is weight-preserving, it maps to itself, it returns each configuration's own pivot unchanged — which is what makes it an involution — and by the path-surgery lemma it exchanges the two connection events. Reindexing the sum along it therefore turns one side into the other.
Consequence. The robustness lemma is thereby reduced to the complementary configurations, those in which every hyperedge avoids . There the sub-block in which every hyperedge is fully on one level is precisely the alternative bunkbed hypergraph model, contributing Hollom's surplus of one cross-level connection out of sixty-four, and everything else is an error term controlled by the hypothesis .
No hypothesis on is needed: the identity is a rearrangement of a finite sum, valid for an arbitrary weight function.
import Definitions.Def_BunkbedWZSurgery open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **The configurations meeting `Λ²₊` cancel.** Over all legal refined configurations in which
some hyperedge has its state in `Λ²₊`, the weighted count of same-level connections equals the
weighted count of cross-level connections. -/
theorem cancel_on_X (P : WZ → ℚ) :
∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
(∀ h, WZExt.legal (Ψ h) = true) ∧ ∃ k, WZExt.inLamSq (Ψ k) = true),
(∏ h, WZExt.wt P (Ψ h)) *
(if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2)) then (1 : ℚ) else 0)
= ∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
(∀ h, WZExt.legal (Ψ h) = true) ∧ ∃ k, WZExt.inLamSq (Ψ k) = true),
(∏ h, WZExt.wt P (Ψ h)) *
(if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2)) then (1 : ℚ) else 0) := by
sorry
end BunkbedAux