Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The half-reflection involution and its connectivity properties

Proved
BunkbedAux.eta_half_reflection

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

bunkbedcombinatoricspercolationprobability

Let Λ={abc, ab∣c, ac∣b, a∣b∣c}\Lambda = \{abc,\, ab|c,\, ac|b,\, a|b|c\}Λ={abc,ab∣c,ac∣b,a∣b∣c} be the Wierman--Ziff state space with the state a∣bca|bca∣bc removed, and let Λ+2\Lambda^2_+Λ+2​ be the 161616-element set of pairs from Λ\LambdaΛ in which the two pairs (abc,a∣b∣c)(abc,a|b|c)(abc,a∣b∣c) and (a∣b∣c,abc)(a|b|c,abc)(a∣b∣c,abc) are represented by their refined +++ variants. The half-reflection η\etaη is the identity on

Ω0={(abc,ac∣b), (ac∣b,abc), (a∣b∣c,ab∣c), (ab∣c,a∣b∣c), (abc,abc), (a∣b∣c,a∣b∣c), (ab∣c,ab∣c), (ac∣b,ac∣b)},\Omega_0 = \bigl\{(abc,ac|b),\,(ac|b,abc),\,(a|b|c,ab|c),\,(ab|c,a|b|c),\,(abc,abc),\,(a|b|c,a|b|c),\,(ab|c,ab|c),\,(ac|b,ac|b)\bigr\},Ω0​={(abc,ac∣b),(ac∣b,abc),(a∣b∣c,ab∣c),(ab∣c,a∣b∣c),(abc,abc),(a∣b∣c,a∣b∣c),(ab∣c,ab∣c),(ac∣b,ac∣b)},

agrees with the level swap ρ\rhoρ on Ω1={(abc,ab∣c),(ab∣c,abc),(a∣b∣c,ac∣b),(ac∣b,a∣b∣c)}\Omega_1 = \{(abc,ab|c),(ab|c,abc),(a|b|c,ac|b),(ac|b,a|b|c)\}Ω1​={(abc,ab∣c),(ab∣c,abc),(a∣b∣c,ac∣b),(ac∣b,a∣b∣c)}, and on Ξ\XiΞ exchanges

(abc,a∣b∣c)+↔(ab∣c,ac∣b),(a∣b∣c,abc)+↔(ac∣b,ab∣c).(abc,a|b|c)^{+} \leftrightarrow (ab|c,ac|b), \qquad (a|b|c,abc)^{+} \leftrightarrow (ac|b,ab|c).(abc,a∣b∣c)+↔(ab∣c,ac∣b),(a∣b∣c,abc)+↔(ac∣b,ab∣c).

This theorem collects the properties of η\etaη that the involution argument requires. It is an involution of Λ+2\Lambda^2_+Λ+2​, it preserves Λ+2\Lambda^2_+Λ+2​, and it is weight-preserving: the only nonobvious case is Ξ\XiΞ, where both (abc,a∣b∣c)+(abc,a|b|c)^{+}(abc,a∣b∣c)+ and (ab∣c,ac∣b)(ab|c,ac|b)(ab∣c,ac∣b) carry weight Pab∣cPac∣bP_{ab|c}P_{ac|b}Pab∣c​Pac∣b​. It also commutes with ρ\rhoρ, which is what makes the roles of a hyperedge and its mirror image interchangeable.

The last three conjuncts are Proposition 3.7, the connectivity content. Writing a hyperedge as (a,b,c)(a,b,c)(a,b,c) with aaa transversal, and reading the first component of a pair as the lower-level state:

  1. if bbb and ccc are joined within the hyperedge, then after applying η\etaη the first component joins aaa to bbb and the second joins aaa to ccc — so bbb reaches c′c'c′ along b→a→a′→c′b \to a \to a' \to c'b→a→a′→c′, using the post at the transversal vertex aaa;
  2. if aaa and bbb are joined, they remain joined;
  3. if aaa and ccc are joined, then a′a'a′ and c′c'c′ become joined.

Mathematical role. These three transformations are exactly what is needed to convert a path realising u1↔u10u_1 \leftrightarrow u_{10}u1​↔u10​ into one realising u1↔u10′u_1 \leftrightarrow u_{10}'u1​↔u10′​, and conversely. Combined with weight preservation they show that the configurations meeting Λ+2\Lambda^2_+Λ+2​ contribute equally to the two connection events and therefore cancel from their difference — which reduces the robustness lemma to the configurations avoiding Λ+2\Lambda^2_+Λ+2​, where the alternative model and Hollom's computation take over.

Formalization note. Every assertion here is a finite check over the 161616 elements of Λ+2\Lambda^2_+Λ+2​, so all but the weight identity are decided by kernel reduction; the weight identity needs a case analysis because the state probabilities are arbitrary rationals.

Preamble
import Definitions.Def_BunkbedWZRefined
open Bunkbed.Hyper
Formal statement
namespace BunkbedAux

/-- **The half-reflection involution and its connectivity properties** (Definition 3.6 and
Proposition 3.7 of Gladkov-Pak-Zimin). On the 16-element set `Λ²₊` the map `eta` is a
weight-preserving involution which commutes with the level swap `rho`, and it transforms the
within-hyperedge connections in the three ways needed for the path-surgery argument. -/
theorem eta_half_reflection (P : WZ → ℚ) :
    (∀ q : WZExt, WZExt.inLamSq q = true → WZExt.eta (WZExt.eta q) = q) ∧
    (∀ q : WZExt, WZExt.inLamSq q = true → WZExt.inLamSq (WZExt.eta q) = true) ∧
    (∀ q : WZExt, WZExt.inLamSq q = true → WZExt.wt P (WZExt.eta q) = WZExt.wt P q) ∧
    (∀ q : WZExt, WZExt.inLamSq q = true →
      WZExt.eta (WZExt.rho q) = WZExt.rho (WZExt.eta q)) ∧
    (∀ q : WZExt, WZExt.inLamSq q = true → (WZExt.toPair q).1 = WZ.abc →
       ((WZExt.toPair (WZExt.eta q)).1 = WZ.abc ∨ (WZExt.toPair (WZExt.eta q)).1 = WZ.ab_c) ∧
       ((WZExt.toPair (WZExt.eta q)).2 = WZ.abc ∨ (WZExt.toPair (WZExt.eta q)).2 = WZ.ac_b)) ∧
    (∀ q : WZExt, WZExt.inLamSq q = true →
       ((WZExt.toPair q).1 = WZ.abc ∨ (WZExt.toPair q).1 = WZ.ab_c) →
       ((WZExt.toPair (WZExt.eta q)).1 = WZ.abc ∨
         (WZExt.toPair (WZExt.eta q)).1 = WZ.ab_c)) ∧
    (∀ q : WZExt, WZExt.inLamSq q = true →
       ((WZExt.toPair q).1 = WZ.abc ∨ (WZExt.toPair q).1 = WZ.ac_b) →
       ((WZExt.toPair (WZExt.eta q)).2 = WZ.abc ∨
         (WZExt.toPair (WZExt.eta q)).2 = WZ.ac_b)) := 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, Definition 3.6 and Proposition 3.7 (pp. 4-5).

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