The involution is weight-preserving and fixes its pivot
ProvedBunkbedAux.phiExt_involutionThe involution used in the robustness lemma of Gladkov--Pak--Zimin is defined by locating the first hyperedge along the path whose refined state lies in , then applying the half-reflection at and the level swap to every hyperedge after , leaving the hyperedges before untouched. This theorem verifies that the resulting map really is a weight-preserving involution.
Assume is a legal refined configuration, that the state at lies in , and that no earlier hyperedge has its state in — so is the pivot selected by the construction. Then:
- is again legal;
- the state of at still lies in ;
- no hyperedge before has its -state in ;
- ;
- .
Points 2 and 3 together say that fixes its own pivot: the first hyperedge in is the same for and for . This is exactly what makes point 4 meaningful — applying the construction twice recovers only because the second application selects the same , so that is applied twice at and the level swap twice beyond it, and both are involutions.
Point 5 is where the refinement of the state space earns its keep. The level swap preserves weights for the trivial reason that a pair's weight is symmetric under transposition; but genuinely moves mass between different pairs, and preserves weight only because the refinement split off from precisely the sub-event of weight , which is the weight of .
Mathematical role. Together with the path-surgery lemma, which says that exchanges the same-level and cross-level connection events, this yields the cancellation: the configurations meeting contribute equally to the two events and drop out of their difference. The robustness lemma is thereby reduced to the configurations that avoid altogether, where the alternative bunkbed hypergraph model and Hollom's computation take over.
import Definitions.Def_BunkbedWZSurgery open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **`phiExt e` is a weight-preserving involution that fixes its own pivot.** If `e` is the
first hyperedge whose state lies in `Λ²₊`, then `phiExt e` maps legal configurations to legal
configurations, keeps `e` as the first hyperedge in `Λ²₊`, is an involution, and preserves the
configuration weight. -/
theorem phiExt_involution (P : WZ → ℚ) (e : Fin 6) (Ψ : Fin 6 → WZExt)
(hleg : ∀ h, WZExt.legal (Ψ h) = true)
(he : WZExt.inLamSq (Ψ e) = true)
(hmin : ∀ h : Fin 6, h.val < e.val → WZExt.inLamSq (Ψ h) = false) :
(∀ h, WZExt.legal (phiExt e Ψ h) = true)
∧ WZExt.inLamSq (phiExt e Ψ e) = true
∧ (∀ h : Fin 6, h.val < e.val → WZExt.inLamSq (phiExt e Ψ h) = false)
∧ phiExt e (phiExt e Ψ) = Ψ
∧ (∏ h, WZExt.wt P (phiExt e Ψ h)) = ∏ h, WZExt.wt P (Ψ h) := by
sorry
end BunkbedAux