Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational Coin return-one probability

Proved
CountingLLL.ReciprocalTest.coin_operational_probability

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

algorithmsprobability

For 0≤B≤10\le B\le10≤B≤1, execute the initial Coin call of Algorithm 6 in its small-step machine, using independent oracle, fair-bit and uniform-draw streams. The probability that the call returns one is exactly 2(1−B)/(2−B)2(1-B)/(2-B)2(1−B)/(2−B). This is the source’s Coin output claim applied to the actual operational semantics.

Preamble
import Definitions.Def_CountingLLL_ReciprocalTest
open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.coin_operational_probability (B : ℝ) (hB0 : 0 ≤ B) (hB1 : B ≤ 1) :
    entropyLaw (ENNReal.ofReal B)
      {ω | ∃ t, ((step ω)^[t] ({phase := .coinOracle .initial} : State)).phase = .initialCheck} =
      ENNReal.ofReal (2*(1-B)/(2-B)) := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC 2027 #442, Algorithm 6 and 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