Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Encoded oracle, fair-bit and uniform read probabilities

Proved
CountingLLL.ReciprocalTest.encoded_read_marginals

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

algorithmsprobability

For an oracle probability B≤1B\le1B≤1, all encoded coordinate laws are probability measures. An oracle coordinate is zero with probability BBB, a fair-bit coordinate is one with probability 1/21/21/2, and a uniform coordinate with range size m+1m+1m+1 is zero with probability 1/(m+1)1/(m+1)1/(m+1). These are the one-coordinate laws of the independent encoded reveal-machine input.

Preamble
import Definitions.Def_CountingLLL_ReciprocalEncodedLaw
open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.encoded_read_marginals (B : ℝ≥0∞) (hB : B ≤ 1) :
    (∀ a, IsProbabilityMeasure (readLaw B a)) ∧
    (∀ i, readLaw B (.inl i) {0} = B) ∧
    (∀ i, readLaw B (.inr (.inl i)) {1} = 1/2) ∧
    (∀ a, readLaw B (.inr (.inr a)) {0} = 1/((a.1+1 : ℕ) : ℝ≥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