Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The canonical edge set of a state touches only its three lifted vertices

Proved
BunkbedAux.wzEdges_support

by burkh4rt · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

bunkbedcombinatoricsgraph-theorypercolation

The canonical edge set that a Wierman--Ziff state sss contributes for a hyperedge (a,b,c)(a,b,c)(a,b,c) on level lll consists of edges among the three lifted vertices (a,l)(a,l)(a,l), (b,l)(b,l)(b,l), (c,l)(c,l)(c,l) only. This theorem records that: every endpoint of every such edge is one of those three.

The statement is immediate by inspection of the five states, but it is worth having as a lemma rather than re-deriving, because it is exactly the support hypothesis needed to apply the boundary-partition principle.

Mathematical role. To conclude that connectivity in a union of parts depends only on the partitions the parts induce on a boundary set, one needs that no vertex outside the boundary is shared between parts. In the Wierman--Ziff bunkbed graph the parts are the per-hyperedge, per-level canonical edge sets together with the posts, and the boundary is the set of lifted hypergraph vertices. This lemma says each such part is supported on its own three lifted vertices, all of which lie in the boundary — so the support hypothesis holds trivially, with no non-boundary vertices at all. That is what allows a gadget copy, whose configuration does involve many private internal vertices, to be exchanged for the abstract state it simulates.

Preamble
import Definitions.Def_BunkbedHypergraph
open Bunkbed Bunkbed.Hyper Finset SimpleGraph
Formal statement
namespace BunkbedAux

/-- **The canonical edge set of a state touches only its own three lifted vertices.** -/
theorem wzEdges_support {V : Type*} [DecidableEq V] (a b c : V) (l : Fin 2) (s : WZ)
    (e : Sym2 (V × Fin 2)) (he : e ∈ WZ.edges s (a, b, c) l) (v : V × Fin 2) (hv : v ∈ e) :
    v = (a, l) ∨ v = (b, l) ∨ v = (c, l) := by
  sorry

end BunkbedAux
Source
N. Gladkov, I. Pak, A. Zimin, The bunkbed conjecture is false, PNAS 122 (2025) no. 24, e2420725122, https://doi.org/10.1073/pnas.2420725122, Sections 3.2 and 4 (pp. 3, 6-7).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me