Bunkbed reachability depends only on the per-copy boundary partitions
ProvedBunkbedFalse.bb_boundary_reduceThis is the geometric heart of the gadget substitution: it says that the -vertex substituted graph and the -vertex Wierman--Ziff graph have the same bunkbed connectivity between hypergraph vertices, provided each gadget copy realises the partition its state prescribes.
Let and be the open edges of copy on levels and , and let assign a Wierman--Ziff state to each (hyperedge, level) pair. Assume the matching hypothesis: for every copy and level , the three attachment vertices of copy are joined by the open edges of that copy at that level exactly as says — the apex to the first path end iff , the two path ends to each other iff , and the apex to the second path end iff . Then for all hypergraph vertices and every level ,
Why it holds: both graphs are unions of parts meeting only along the lifted hypergraph vertices — on one side the six copies at each level plus the posts, on the other the canonical state edge sets plus the posts. A copy's interior vertices are private to it, and the canonical edge sets have no interior vertices at all. So connectivity between boundary vertices depends only on what each part does to the boundary, and the matching hypothesis says the corresponding parts do the same thing.
Note the hypothesis is satisfiable and the statement is not vacuous: with every gadget edge closed, each copy realises the state on both levels.
Mathematical role. This is what collapses the substituted graph's enormous configuration space onto the hypergraph. Combined with the factorisation of percolation across the edge-disjoint copies and the identification of each copy's partition probabilities with the gadget's, it shows that bunkbed percolation on the counterexample graph is a Wierman--Ziff model on Hollom's hypergraph — which is what allows the robustness lemma to transfer Hollom's hypergraph counterexample to an honest graph.
import Definitions.Def_BunkbedSubstituted open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedFalse
/-- **Bunkbed reachability depends only on the per-copy boundary partitions.** If, for every copy
and every level, the open edges of that copy connect its three attachment vertices exactly as the
Wierman-Ziff state prescribes, then reachability between lifted hypergraph vertices in the bunkbed
graph over the substituted graph agrees with reachability in the Wierman-Ziff graph. -/
theorem bb_boundary_reduce (S₀ S₁ : Fin 6 → Finset (Sym2 (Fin 7222)))
(hsub : ∀ i, S₀ i ⊆ (gadgetE 1204).image (Sym2.map (Bunkbed.Sub.emb i)))
(hsub' : ∀ i, S₁ i ⊆ (gadgetE 1204).image (Sym2.map (Bunkbed.Sub.emb i)))
(ψ : Fin 6 × Fin 2 → WZ)
(hmatch : ∀ (i : Fin 6) (l : Fin 2),
((ofEdges (if l = 0 then S₀ i else S₁ i)).Reachable
(Bunkbed.Sub.emb i 0) (Bunkbed.Sub.emb i 1)
↔ (ψ (i, l) = WZ.abc ∨ ψ (i, l) = WZ.ab_c))
∧ ((ofEdges (if l = 0 then S₀ i else S₁ i)).Reachable
(Bunkbed.Sub.emb i 1) (Bunkbed.Sub.emb i 1204)
↔ (ψ (i, l) = WZ.abc ∨ ψ (i, l) = WZ.a_bc))
∧ ((ofEdges (if l = 0 then S₀ i else S₁ i)).Reachable
(Bunkbed.Sub.emb i 0) (Bunkbed.Sub.emb i 1204)
↔ (ψ (i, l) = WZ.abc ∨ ψ (i, l) = WZ.ac_b)))
(x y : Fin 10) (l : Fin 2) :
(bbGraph Bunkbed.Sub.subT (Finset.univ.biUnion S₀) (Finset.univ.biUnion S₁)).Reachable
(Bunkbed.Sub.iota x, 0) (Bunkbed.Sub.iota y, l)
↔ (wzGraph hollomTriple hollomT ψ).Reachable (x, 0) (y, l) := by
sorry
end BunkbedFalse