Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The five partition probabilities of a triple exhaust the measure

Proved
BunkbedAux.partition_sum_eq_total

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

combinatoricspercolationprobabilityutility

Fix a finite edge set EEE, a weight function www, and three vertices a,b,ca, b, ca,b,c. In the percolation, the connected components induce a partition of {a,b,c}\{a,b,c\}{a,b,c}, and there are exactly five possibilities: all three together, one of the three pairs together with the third vertex apart, or all three separate. Writing Pabc,Pab∣c,Pac∣b,Pa∣bc,Pa∣b∣cP_{abc}, P_{ab|c}, P_{ac|b}, P_{a|bc}, P_{a|b|c}Pabc​,Pab∣c​,Pac∣b​,Pa∣bc​,Pa∣b∣c​ for the probabilities of these five events,

Pabc+Pab∣c+Pac∣b+Pa∣bc+Pa∣b∣c  =  ∑S⊆Eweight(S).P_{abc} + P_{ab|c} + P_{ac|b} + P_{a|bc} + P_{a|b|c} \;=\; \sum_{S \subseteq E} \mathrm{weight}(S).Pabc​+Pab∣c​+Pac∣b​+Pa∣bc​+Pa∣b∣c​=S⊆E∑​weight(S).

The content is that the five events are mutually exclusive and exhaustive. This holds because reachability in any fixed open subgraph is an equivalence relation: the triple of truth values of (a↔b,  b↔c,  a↔c)(a \leftrightarrow b,\; b \leftrightarrow c,\; a \leftrightarrow c)(a↔b,b↔c,a↔c) can therefore only be (T,T,T)(T,T,T)(T,T,T), (T,F,F)(T,F,F)(T,F,F), (F,T,F)(F,T,F)(F,T,F), (F,F,T)(F,F,T)(F,F,T) or (F,F,F)(F,F,F)(F,F,F), and these five patterns correspond bijectively to the five quantities. The three patterns ruled out by transitivity — those with exactly two of the relations true — are precisely what makes the count five rather than eight.

Combined with the fact that the total mass is 111, this gives the relation used to eliminate Pa∣b∣cP_{a|b|c}Pa∣b∣c​ from any expression in the five, which is how the source converts its determinant-shaped quantity PabcPa∣b∣c−Pab∣cPac∣bP_{abc}P_{a|b|c} - P_{ab|c}P_{ac|b}Pabc​Pa∣b∣c​−Pab∣c​Pac∣b​ into connection probabilities.

Formalization Note The right-hand side is left as the total mass rather than 111, so that this lemma is independent of the normalisation lemma and the two can be combined as needed. The five definitions in BunkbedPercolation are phrased asymmetrically — for instance Pa∣bcP_{a|bc}Pa∣bc​ negates a↔ba \leftrightarrow ba↔b while Pac∣bP_{ac|b}Pac∣b​ also negates a↔ba \leftrightarrow ba↔b — and they agree with the symmetric descriptions only via transitivity, which the proof must supply.

Preamble
import Definitions.Def_BunkbedPercolation
open Bunkbed Finset
Formal statement
namespace BunkbedAux

/-- The five partition probabilities of a triple exhaust the measure. -/
theorem partition_sum_eq_total {V : Type*} [Fintype V] [DecidableEq V] (E : Finset (Sym2 V))
    (w : Sym2 V → ℚ) (a b c : V) :
    Pabc E w a b c + Pab_c E w a b c + Pac_b E w a b c + Pa_bc E w a b c + Pa_b_c E w a b c
      = ∑ S ∈ E.powerset, weight E w S := by sorry

end BunkbedAux
Source
Auxiliary identity for Bernoulli bond percolation as defined by the platform definition BunkbedPercolation. Standard measure-theoretic bookkeeping (total mass; exhaustive partition of a triple by its component structure; splitting a connection event by a third vertex), contributed as reusable infrastructure for the mission The Bunkbed Conjecture is False (N. Gladkov, I. Pak, A. Zimin, PNAS 122 (2025) e2420725122), where they underpin Proposition 5.4 on p. 8.

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