Path surgery: the involution turns a same-level connection into a cross-level one
ProvedBunkbedAux.involution_crossesThis is the combinatorial heart of the involution argument by which Gladkov--Pak--Zimin prove their robustness lemma.
Work with the Wierman--Ziff model on Hollom's hypergraph, in the refined pair state space, and let be a refined configuration. Fix a hyperedge whose refined state lies in , and let be the involution that leaves the hyperedges before along the path untouched, applies the half-reflection at , and applies the level swap to every hyperedge after . Then
That is, turns a same-level connection between the two endpoints into a cross-level one. Since is a weight-preserving involution, the configurations in which some hyperedge lies in therefore contribute equally to the two connection events, and cancel from their difference — which reduces the robustness lemma to the configurations avoiding , where the model degenerates to the alternative bunkbed hypergraph model and Hollom's computation applies.
How the connection is transported. The proof exhibits a map on vertices, reflecting the level of every non-transversal vertex lying strictly beyond along and fixing everything else. The source sits at the start of and is fixed; the target sits at the end and is always reflected, which is exactly why a same-level connection becomes a cross-level one. The work is in checking that the image of a path is still a path, which is a case analysis over the four kinds of edge: a post, an edge of a hyperedge before , an edge of a hyperedge after , and an edge of itself. The last case is where Proposition 3.7 is used.
Formalization note. The vertex map is not a graph homomorphism, and the argument as printed in the source is slightly loose on this point. Transversal vertices cannot be reflected — each serves one hyperedge before and one after — so an edge joining a transversal vertex to a non-transversal one has exactly one endpoint moved, and its image is not an edge. What is true, and what is proved here, is that adjacency is carried to reachability: the mismatch is repaired using the post over the transversal vertex, which is present in every configuration. Reachability then transports along a walk by induction.
import Definitions.Def_BunkbedWZSurgery open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **Lemma 3.8 of Gladkov-Pak-Zimin** (path surgery). If the state of hyperedge `e` lies in
`Λ²₊`, then the involution `phiExt e` carries a same-level connection `u₁ ↔ u₁₀` to a
cross-level connection `u₁ ↔ u₁₀'`. -/
theorem involution_crosses (e : Fin 6) (Ψ : Fin 6 → WZExt)
(he : WZExt.inLamSq (Ψ e) = true)
(hr : (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2))) :
(wzGraph hollomTriple hollomT (wzOfExt (phiExt e Ψ))).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2)) := by
sorry
end BunkbedAux