Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The all-minus block contributes exactly W6W^6W6

Proved
BunkbedAux.A_block_value

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

bunkbedcombinatoricspercolationprobability

In the involution argument, after the configurations meeting Λ+2\Lambda^2_+Λ+2​ have cancelled, the leading contribution comes from the configurations in which every hyperedge is in a −-− state, that is, fully present on one level and fully absent on the other. This theorem evaluates that contribution exactly.

Writing W=PabcPa∣b∣c−Pab∣cPac∣bW = P_{abc}P_{a|b|c} - P_{ab|c}P_{ac|b}W=Pabc​Pa∣b∣c​−Pab∣c​Pac∣b​, the claim is

∑Ψ∈Awt(Ψ)(1[u1↔u10′]−1[u1↔u10])  =  W6,\sum_{\Psi \in A} \mathrm{wt}(\Psi)\Bigl(\mathbf{1}\bigl[u_1 \leftrightarrow u_{10}'\bigr] - \mathbf{1}\bigl[u_1 \leftrightarrow u_{10}\bigr]\Bigr) \;=\; W^{6},Ψ∈A∑​wt(Ψ)(1[u1​↔u10′​]−1[u1​↔u10​])=W6,

where AAA is the set of configurations all of whose hyperedges are in a −-− state.

Two things combine to give this. Each of the 26=642^6 = 6426=64 configurations in AAA carries weight exactly W6W^6W6, since each −-− variant has weight WWW. And AAA is in bijection with the level assignments σ\sigmaσ, under which the realised graph is exactly the alternative-model graph at σ\sigmaσ; so the net indicator difference summed over AAA is the alternative model's surplus, which by Hollom's computation is 13−12=113 - 12 = 113−12=1.

Mathematical role. This is the term that makes the robustness lemma true. Everything else in the argument is either an exact cancellation or an error bound: the configurations meeting Λ+2\Lambda^2_+Λ+2​ contribute zero, and the remaining ones are controlled in absolute value by their total weight. The single positive term is this W6W^6W6, and it is positive precisely under the hypothesis W>0W > 0W>0 — which is why that hypothesis cannot be dropped. Under Eq. [1] the error is at most Z6−64W6Z^6 - 64W^6Z6−64W6 with Z=2W+2Pa∣bc−Pa∣bc2Z = 2W + 2P_{a|bc} - P_{a|bc}^2Z=2W+2Pa∣bc​−Pa∣bc2​, and W6W^6W6 dominates it because 64⋅4016<65⋅400664 \cdot 401^6 < 65 \cdot 400^664⋅4016<65⋅4006.

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

/-- **The all-minus block contributes exactly `W ^ 6`.** Summed over the refined configurations
in which every hyperedge is in a `-` state, the weight times the net indicator difference is
`W ^ 6`, where `W = P_abc * P_a|b|c - P_ab|c * P_ac|b`. -/
theorem A_block_value (P : WZ → ℚ) :
    ∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
        ∀ h, Ψ h ∈ ({Sum.inr 1, Sum.inr 3} : Finset WZExt)),
        (∏ 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)
          - (if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
              ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2)) then (1 : ℚ) else 0))
      = (P .abc * P .a_b_c - P .ab_c * P .ac_b) ^ 6 := 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.6 (p. 6): conditioning on A and applying Lemma 3.1.

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