Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Contracted walk upward-step probability

Proved
CountingLLL.ReciprocalTest.contracted_up_probability

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsprobability

Let independent calls to Coin return one with probability u∈[0,1]u\in[0,1]u∈[0,1]. In one walk iteration, two ones cause an upward change, a one followed by zero is a self-loop, and an initial zero causes a downward change. After suppressing any number of self-loops, the probability of an upward change is u2/(1−u+u2)u^2/(1-u+u^2)u2/(1−u+u2). The theorem models the fresh Coin outcomes as IID Boolean pairs; the construction of the full recursive walk from the small-step machine remains separate.

Preamble
import Definitions.Def_CountingLLL_ReciprocalTest
open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.contracted_up_probability (u : ℝ) (hu0 : 0 ≤ u) (hu1 : u ≤ 1) :
    let ν := (oracleLaw (ENNReal.ofReal (1-u))).prod (oracleLaw (ENNReal.ofReal (1-u)))
    let μ := Measure.infinitePi fun _ : ℕ => ν
    μ {ω : ℕ → Bool × Bool | ∃ n, (∀ i < n, ω i = (true,false)) ∧ ω n = (true,true)} =
      ENNReal.ofReal (u^2/(1-u+u^2)) := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC 2027 #442, proof of Lemma 6.5, PDF p. 27, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/442.pdf

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