Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational Coin expected oracle-call count

Proved
CountingLLL.ReciprocalTest.operational_coin_expected_calls

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

algorithmsprobability

For 0≤B≤10\le B\le10≤B≤1, start the operational local Coin procedure on the independent oracle and fair-bit entropy streams. The expected number of oracle calls up to its first return is exactly 2/(2−B)2/(2-B)2/(2−B), interpreted in the extended nonnegative reals. This concerns one local Coin call, not the total number of calls made by the full ReciprocalTest.

Preamble
import Definitions.Def_CountingLLL_CoinCost
open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.operational_coin_expected_calls (B : ℝ) (hB0 : 0 ≤ B) (hB1 : B ≤ 1) :
    (∫⁻ ω, coinOracleCost ω ∂entropyLaw (ENNReal.ofReal B)) = ENNReal.ofReal (2/(2-B)) := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC #442, Algorithm 6 and proof of Lemma 6.5, pp. 27–28, 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