Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

False output equals suppressed absorption with all checks survived

Proved
CountingLLL.ReciprocalTest.false_output_iff_suppressed_survival

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

formalizationprobability

The operational ReciprocalTest algorithm returns false exactly when its coupled suppressed-return execution reaches false absorption and every initial or uniform return check before that time is survived. This is a pathwise identity valid for every entropy tape, without a termination or probability assumption.

Preamble
import Definitions.Def_CountingLLL_ReciprocalSuppressed
open CountingLLL.ReciprocalTest
Formal statement
theorem CountingLLL.ReciprocalTest.false_output_iff_suppressed_survival (ω : Entropy) :
    Returns ω false ↔ ∃ n : ℕ, (suppressedRun ω n).phase = .done false ∧
      ∀ 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) := by sorry
Source
Liu, Wang, Yin, Zhang, Zhou, A Counting and Sampling Lovász Local Lemma, STOC submission #442, §6.2, Lemma 6.5; pathwise coupling underlying the product of return-check survival probabilities.

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