Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Splitting a connection probability by the status of a third vertex

Proved
BunkbedAux.Pabc_add_Pab_c_eq_connProb

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. Then

Pabc+Pab∣c  =  P(a↔b).P_{abc} + P_{ab|c} \;=\; \mathbb{P}\bigl(a \leftrightarrow b\bigr).Pabc​+Pab∣c​=P(a↔b).

In words: the event that aaa and bbb are connected splits into exactly two disjoint sub-events according to whether the third vertex ccc joins them. The reason the split is exact is that, given a↔ba \leftrightarrow ba↔b, the relations b↔cb \leftrightarrow cb↔c and a↔ca \leftrightarrow ca↔c are equivalent, since reachability is transitive and symmetric; so the first sub-event is PabcP_{abc}Pabc​ and its complement within {a↔b}\{a \leftrightarrow b\}{a↔b} is Pab∣cP_{ab|c}Pab∣c​.

This identity is how partition probabilities of a triple are converted into ordinary two-point connection probabilities, which is what makes closed-form computations of the former possible: one computes P(a↔b)\mathbb{P}(a \leftrightarrow b)P(a↔b) and PabcP_{abc}Pabc​ by other means and reads off Pab∣cP_{ab|c}Pab∣c​ as the difference.

Formalization Note The definitions in BunkbedPercolation give PabcP_{abc}Pabc​ as the event a↔b∧b↔ca \leftrightarrow b \wedge b \leftrightarrow ca↔b∧b↔c and Pab∣cP_{ab|c}Pab∣c​ as a↔b∧¬(a↔c)a \leftrightarrow b \wedge \neg(a \leftrightarrow c)a↔b∧¬(a↔c), so the proof is a pointwise case analysis over configurations, using transitivity to see that the two conditions are complementary under a↔ba \leftrightarrow ba↔b. Both sides are sums over E.powerset, so the sums can be merged before the pointwise argument.

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

/-- Splitting a two-point connection probability by the status of a third vertex. -/
theorem Pabc_add_Pab_c_eq_connProb {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 = connProb E w a b := 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