Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pairing independent product streams

Proved
CountingLLL.ReciprocalTest.paired_streams

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

probability

Let (Xn)(X_n)(Xn​) and (Yn)(Y_n)(Yn​) be independent sequences of independent identically distributed Boolean variables, with respective laws μ\muμ and ν\nuν. Then the paired sequence ((Xn,Yn))((X_n,Y_n))((Xn​,Yn​)) is an independent identically distributed sequence with common law μ⊗ν\mu\otimes\nuμ⊗ν. This reindexes the oracle and fair-bit entropy of Algorithm 6 into the trial-pair model of Coin.

Preamble
import Mathlib
open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.paired_streams (μ ν : Measure Bool) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] :
    let μs := Measure.infinitePi fun _ : ℕ => μ
    let νs := Measure.infinitePi fun _ : ℕ => ν
    (μs.prod νs).map (fun p n => (p.1 n, p.2 n)) =
      Measure.infinitePi (fun _ : ℕ => μ.prod ν) := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC 2027 #442, Algorithm 6, PDF p. 27, 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