Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The configurations meeting Λ+2\Lambda^2_+Λ+2​ contribute nothing to the difference

Proved
BunkbedAux.cancel_on_X

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

bunkbedcombinatoricspercolationprobability

This is the cancellation step of the involution argument of Gladkov--Pak--Zimin, stated for the whole set XXX rather than one block at a time.

Let XXX be the set of legal refined configurations in which some hyperedge has its state in the sixteen-element set Λ+2\Lambda^2_+Λ+2​. Then

∑Ψ∈Xwt(Ψ) 1[u1↔u10]  =  ∑Ψ∈Xwt(Ψ) 1[u1↔u10′],\sum_{\Psi \in X} \mathrm{wt}(\Psi)\,\mathbf{1}\bigl[u_1 \leftrightarrow u_{10}\bigr] \;=\; \sum_{\Psi \in X} \mathrm{wt}(\Psi)\,\mathbf{1}\bigl[u_1 \leftrightarrow u_{10}'\bigr],Ψ∈X∑​wt(Ψ)1[u1​↔u10​]=Ψ∈X∑​wt(Ψ)1[u1​↔u10′​],

where wt(Ψ)=∏hwt(Ψ(h))\mathrm{wt}(\Psi) = \prod_h \mathrm{wt}(\Psi(h))wt(Ψ)=∏h​wt(Ψ(h)) is the product of the refined per-hyperedge weights. In words: on XXX the same-level and the cross-level connection events carry exactly the same weight, so XXX contributes nothing whatsoever to the difference of the two connection probabilities.

The mechanism. Each configuration in XXX has a well-defined pivot: the first hyperedge, in the order of the path ρ\rhoρ, whose state lies in Λ+2\Lambda^2_+Λ+2​. The involution ϕ\phiϕ applies the half-reflection at the pivot and the level swap to every later hyperedge, leaving the earlier ones untouched. It is weight-preserving, it maps XXX to itself, it returns each configuration's own pivot unchanged — which is what makes it an involution — and by the path-surgery lemma it exchanges the two connection events. Reindexing the sum along it therefore turns one side into the other.

Consequence. The robustness lemma is thereby reduced to the complementary configurations, those in which every hyperedge avoids Λ+2\Lambda^2_+Λ+2​. There the sub-block in which every hyperedge is fully on one level is precisely the alternative bunkbed hypergraph model, contributing Hollom's surplus of one cross-level connection out of sixty-four, and everything else is an error term controlled by the hypothesis 400Pa∣bc≤PabcPa∣b∣c−Pab∣cPac∣b400P_{a|bc} \le P_{abc}P_{a|b|c} - P_{ab|c}P_{ac|b}400Pa∣bc​≤Pabc​Pa∣b∣c​−Pab∣c​Pac∣b​.

No hypothesis on PPP is needed: the identity is a rearrangement of a finite sum, valid for an arbitrary weight function.

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

/-- **The configurations meeting `Λ²₊` cancel.** Over all legal refined configurations in which
some hyperedge has its state in `Λ²₊`, the weighted count of same-level connections equals the
weighted count of cross-level connections. -/
theorem cancel_on_X (P : WZ → ℚ) :
    ∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
        (∀ h, WZExt.legal (Ψ h) = true) ∧ ∃ k, WZExt.inLamSq (Ψ k) = true),
        (∏ h, WZExt.wt P (Ψ h)) *
          (if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
              ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2)) then (1 : ℚ) else 0)
      = ∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
        (∀ h, WZExt.legal (Ψ h) = true) ∧ ∃ k, WZExt.inLamSq (Ψ k) = true),
        (∏ h, WZExt.wt P (Ψ h)) *
          (if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
              ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2)) then (1 : ℚ) else 0) := 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, Section 3.5 (p. 6): P(C and X) = P(C' and X).

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