Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Percolation probabilities lie in [0,1][0,1][0,1]

Proved
BunkbedAux.probOf_mem_unitInterval

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

bunkbedcombinatoricspercolationprobability

In this development a percolation probability is defined combinatorially, as

P[E]  =  ∑S⊆E1[E(S)] wt(S),wt(S)  =  ∏e∈Sw(e)∏e∈E∖S(1−w(e)),\mathbb{P}[\mathcal{E}] \;=\; \sum_{S \subseteq E} \mathbf{1}[\mathcal{E}(S)]\,\mathrm{wt}(S), \qquad \mathrm{wt}(S) \;=\; \prod_{e \in S} w(e)\prod_{e \in E \setminus S}\bigl(1 - w(e)\bigr),P[E]=S⊆E∑​1[E(S)]wt(S),wt(S)=e∈S∏​w(e)e∈E∖S∏​(1−w(e)),

with no constraint imposed on the weight function www. In particular the definition makes sense for arbitrary w:Sym2(V)→Qw : \mathrm{Sym}^2(V) \to \mathbb{Q}w:Sym2(V)→Q, and for such www the resulting quantity need not lie in [0,1][0,1][0,1] — or even be nonnegative.

This lemma records that as soon as www is a genuine assignment of probabilities, 0≤w(e)≤10 \le w(e) \le 10≤w(e)≤1 for every edge, the quantity P[E]\mathbb{P}[\mathcal{E}]P[E] is a genuine probability:

0  ≤  P[E]  ≤  10 \;\le\; \mathbb{P}[\mathcal{E}] \;\le\; 10≤P[E]≤1

for every decidable event E\mathcal{E}E.

The lower bound holds because each configuration weight is a product of nonnegative factors. The upper bound holds because the weights sum to 111 over all configurations — the total-mass identity, which is itself valid for arbitrary www — and because dropping the indicator can only increase a sum of nonnegative terms.

Mathematical role. This is the basic sanity fact needed whenever a percolation probability is fed into an argument that expects a probability distribution. For instance, the five partition probabilities of a hyperedge gadget are used as the state distribution of a Wierman--Ziff model; that requires them to be nonnegative and to sum to one, and the nonnegativity is exactly this lemma. It is stated for an arbitrary finite vertex type and arbitrary event, so it applies uniformly.

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

/-- **Percolation probabilities lie in `[0,1]`.** If every edge weight is a genuine probability
then so is the probability of any event. -/
theorem probOf_mem_unitInterval {V : Type*} [Fintype V] [DecidableEq V] (E : Finset (Sym2 V))
    (w : Sym2 V → ℚ) (hw0 : ∀ e, 0 ≤ w e) (hw1 : ∀ e, w e ≤ 1)
    (ev : Finset (Sym2 V) → Prop) [DecidablePred ev] :
    0 ≤ probOf E w ev ∧ probOf E w ev ≤ 1 := 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 2 (p. 2), where Bernoulli bond percolation and its connection probabilities are set up.

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