The involution cancels the configurations meeting
ProvedBunkbedAux.cancel_at_pivotThis is the cancellation step of the involution argument of Gladkov--Pak--Zimin, in the form in which it is actually used.
Let be the sixteen-element set of refined pair states of Definition 3.4, and let be the set of legal refined configurations in which some hyperedge has its state in . Partition according to the pivot: the first hyperedge , in the order of the path , whose state lies in . This theorem is the cancellation on a single block of that partition. Writing the block as
the assertion is
where is the product of the refined per-hyperedge weights.
In words: on each block, the same-level and the cross-level connection events carry exactly the same weight. Summing over the six possible pivots, the whole of contributes nothing to the difference of the two connection probabilities, which is what reduces the robustness lemma to the configurations avoiding entirely.
Why the statement is phrased by pivot rather than for at once. The involution is only defined relative to a chosen hyperedge, and it is an involution precisely because it preserves the pivot — applying it twice selects the same and so undoes itself. Splitting into blocks makes this available block by block and avoids having to introduce the pivot as a partial function on .
No hypothesis on is needed: the identity holds for an arbitrary weight function, since it is a rearrangement of a finite sum rather than a probabilistic statement.
import Definitions.Def_BunkbedWZSurgery open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **The cancellation on configurations with pivot `e`.** Over the legal refined configurations
whose first hyperedge in `Λ²₊` is `e`, the weighted count of same-level connections equals the
weighted count of cross-level connections. The involution `phiExt e` is a weight-preserving
bijection of this set that exchanges the two events. -/
theorem cancel_at_pivot (P : WZ → ℚ) (e : Fin 6) :
∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
(∀ h, WZExt.legal (Ψ h) = true) ∧ WZExt.inLamSq (Ψ e) = true ∧
∀ h : Fin 6, h.val < e.val → WZExt.inLamSq (Ψ h) = false),
(∏ 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) ∧ WZExt.inLamSq (Ψ e) = true ∧
∀ h : Fin 6, h.val < e.val → WZExt.inLamSq (Ψ h) = false),
(∏ 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