Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational silent-step transition law

Proved
CountingLLL.ReciprocalTest.operational_silent_transition

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

algorithmsprobability

For an operational ReciprocalTest state that makes no entropy query, the next state is deterministic: the probability of a state-and-next-state event is the state probability when the deterministic successor matches, and zero otherwise. These are one-step laws; eventual return and total expected cost are separate.

Preamble
import Definitions.Def_CountingLLL_ReciprocalEncodedLaw
open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest CountingLLL.RevealMachine
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.operational_silent_transition (B : ℝ≥0∞) (n : ℕ) (s s' : State)
    (ha : readIndex s = none) :
    (step (uniformEntropy 0) s = s' →
      entropyLaw B {ω | CountingLLL.ReciprocalTest.run ω n = s ∧ CountingLLL.ReciprocalTest.run ω (n+1) = s'} =
        entropyLaw B {ω | CountingLLL.ReciprocalTest.run ω n = s}) ∧
    (step (uniformEntropy 0) s ≠ s' →
      entropyLaw B {ω | CountingLLL.ReciprocalTest.run ω n = s ∧ CountingLLL.ReciprocalTest.run ω (n+1) = s'} = 0) := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC #442, Algorithm 6, 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