Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The weight of the complement of Λ+2\Lambda^2_+Λ+2​

Proved
BunkbedAux.xc_weight

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

bunkbedcombinatoricspercolationprobability

In the involution argument of Gladkov--Pak--Zimin, the configurations meeting Λ+2\Lambda^2_+Λ+2​ cancel between the two connection events, and what remains is the complementary set XcX^cXc: the configurations in which every hyperedge avoids Λ+2\Lambda^2_+Λ+2​. This theorem computes the per-hyperedge weight of that complement, which is the normalizing constant of the conditional measure on XcX^cXc.

Write 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​ for the determinant-like quantity of Eq. [1], and let PPP be a probability distribution on the five Wierman--Ziff states, so Pabc+Pa∣b∣c+Pa∣bc+Pab∣c+Pac∣b=1P_{abc} + P_{a|b|c} + P_{a|bc} + P_{ab|c} + P_{ac|b} = 1Pabc​+Pa∣b∣c​+Pa∣bc​+Pab∣c​+Pac∣b​=1. Then the total weight of the legal refined states of a single hyperedge lying outside Λ+2\Lambda^2_+Λ+2​ is

Z  =  2W  +  2Pa∣bc  −  Pa∣bc2,Z \;=\; 2W \;+\; 2P_{a|bc} \;-\; P_{a|bc}^{2},Z=2W+2Pa∣bc​−Pa∣bc2​,

and the two −-− variants alone contribute 2W2W2W.

Where the two terms come from. Of the 272727 legal refined states, 161616 lie in Λ+2\Lambda^2_+Λ+2​, leaving 111111. Two of these are the −-− variants of the split pairs, each of weight WWW, giving 2W2W2W; these are exactly the configurations in which the hyperedge is fully present on one level and fully absent on the other. The other nine are the pairs having the state a∣bca|bca∣bc in at least one coordinate: five of the form (a∣bc,β)(a|bc, \beta)(a∣bc,β), five of the form (α,a∣bc)(\alpha, a|bc)(α,a∣bc), with the pair (a∣bc,a∣bc)(a|bc,a|bc)(a∣bc,a∣bc) counted in both. Their total weight is

Pa∣bc∑βPβ  +  (∑αPα)Pa∣bc  −  Pa∣bc2  =  2Pa∣bc−Pa∣bc2,P_{a|bc}\sum_\beta P_\beta \;+\; \Bigl(\sum_\alpha P_\alpha\Bigr)P_{a|bc} \;-\; P_{a|bc}^2 \;=\; 2P_{a|bc} - P_{a|bc}^2,Pa∣bc​β∑​Pβ​+(α∑​Pα​)Pa∣bc​−Pa∣bc2​=2Pa∣bc​−Pa∣bc2​,

using that PPP sums to 111. This is the only place the normalisation hypothesis is needed.

Mathematical role. The ratio 2W/Z2W/Z2W/Z is the conditional probability, given XcX^cXc, that a single hyperedge is in a −-− state; raised to the sixth power it is the probability of the event AAA that all hyperedges are, and conditioned on AAA the Wierman--Ziff model reduces to the alternative bunkbed hypergraph model, where Hollom's computation applies. The hypothesis Eq. [1], 400Pa∣bc≤W400P_{a|bc} \le W400Pa∣bc​≤W, enters precisely here: it forces 2Pa∣bc−Pa∣bc22P_{a|bc} - P_{a|bc}^22Pa∣bc​−Pa∣bc2​ to be small compared with 2W2W2W, hence AAA to have probability close to one, and the sign of the difference is then inherited from Hollom's 12/6412/6412/64 versus 13/6413/6413/64.

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

/-- **The weight of the complement of `Λ²₊`.** Summed over the legal refined states of a single
hyperedge that do *not* lie in `Λ²₊`, the weight is the normalizing constant
`Z = 2W + 2 P_a|bc - P_a|bc ^ 2` of Gladkov-Pak-Zimin, where
`W = P_abc * P_a|b|c - P_ab|c * P_ac|b`; and the two `-` variants alone contribute `2W`. -/
theorem xc_weight (P : WZ → ℚ)
    (hsum : P .abc + P .a_b_c + P .a_bc + P .ab_c + P .ac_b = 1) :
    (∑ q ∈ Finset.univ.filter
        (fun q : WZExt => WZExt.legal q = true ∧ WZExt.inLamSq q = false), WZExt.wt P q)
      = 2 * (P .abc * P .a_b_c - P .ab_c * P .ac_b) + 2 * P .a_bc - P .a_bc * P .a_bc
    ∧ (WZExt.wt P (Sum.inr 1) + WZExt.wt P (Sum.inr 3))
      = 2 * (P .abc * P .a_b_c - P .ab_c * P .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, Section 3.6 (p. 6): the list of pairs in Upsilon^2_ext minus Lambda^2_+ and the normalizing constant Z.

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