Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pathwise coupling of ReciprocalTest with its suppressed-return execution

Proved
CountingLLL.ReciprocalTest.suppressed_execution_coupling

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

formalizationprobability

Couple the operational algorithm and the execution in which its initial counter-dependent and later uniform return checks are suppressed, using the same entropy tape. At each time they are equal or the original has already returned true. If all suppressed checks through a given time are survived, their states are equal; if the next check fails while they are synchronized, the original immediately returns true. The suppressed execution is unchanged when the uniform-check entropy is replaced while keeping the oracle and fair-bit arrays fixed.

Preamble
import Definitions.Def_CountingLLL_ReciprocalSuppressed
open CountingLLL.ReciprocalTest
Formal statement
theorem CountingLLL.ReciprocalTest.suppressed_execution_coupling :
    (∀ ω : Entropy, ∀ n : ℕ, run ω n = suppressedRun ω n ∨ (run ω n).phase = .done true) ∧
    (∀ (ω : Entropy) (n : ℕ),
      (∀ t < n, ((suppressedRun ω t).phase = .initialCheck → ω.2.1 (suppressedRun ω t).fairUsed = false) ∧
        ((suppressedRun ω t).phase = .uniformCheck → (ω.2.2 ((suppressedRun ω t).j-1,(suppressedRun ω t).uniformUsed)).val ≠ 0)) →
      run ω n = suppressedRun ω n) ∧
    (∀ (ω : Entropy) (n : ℕ), run ω n = suppressedRun ω n →
      (((suppressedRun ω n).phase = .initialCheck ∧ ω.2.1 (suppressedRun ω n).fairUsed = true) ∨
       ((suppressedRun ω n).phase = .uniformCheck ∧ (ω.2.2 ((suppressedRun ω n).j-1,(suppressedRun ω n).uniformUsed)).val = 0)) →
      (run ω (n+1)).phase = .done true) ∧
    (∀ (ω ω' : Entropy), ω.1 = ω'.1 → ω.2.1 = ω'.2.1 → ∀ n : ℕ,
      suppressedRun ω n = suppressedRun ω' n) := by sorry
Source
Liu, Wang, Yin, Zhang, Zhou, A Counting and Sampling Lovász Local Lemma, STOC submission #442, §6.2, Lemma 6.5. This establishes the pathwise suppressed-check coupling used toward, but does not itself establish, the paper’s output and cost bounds.

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