Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational Coin cost equals the geometric trial count

Proved
CountingLLL.ReciprocalTest.coin_cost_geometric_all

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

algorithmsprobability

For every entropy tape, the number of oracle calls up to the first return of the operational local Coin equals the geometric trial count: the number of consecutive false oracle/fair-bit pairs, plus the terminating trial. Both sides are infinite when every pair is false. This is a pathwise coupling between the Algorithm 6 local machine and the IID trial model.

Preamble
import Definitions.Def_CountingLLL_CoinCost
open MeasureTheory CountingLLL.ReciprocalTest
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.coin_cost_geometric_all (ω : Entropy) :
    coinOracleCost ω = ∑' k : ℕ,
      ({x : ℕ → Bool × Bool | ∀ i < k, x i = (false,false)}).indicator
        (1 : (ℕ → Bool × Bool) → ℝ≥0∞) (fun i => (ω.1 i, ω.2.1 i)) := 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