Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A measurable shared seed bounds Wasserstein distance by bit-disagreement probabilities

Proved
StabilityDichotomies.Solvability.wasserstein_le_measurable_seed_bit_changes

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

Let fff and ggg be measurable maps from a common probability space into assignments on a finite set of Boolean variables. Their output laws satisfy

W1(L(f),L(g))≤∑vPr⁡[f(v)≠g(v)].W_1(\mathcal L(f),\mathcal L(g))\le\sum_v\Pr[f(v)\ne g(v)].W1​(L(f),L(g))≤v∑​Pr[f(v)=g(v)].

This is the shared-randomness coupling bound needed for the continuous priority, cutoff, and shift seeds in Theorem 4.9.

Preamble
import Definitions.Def_StabilityDichotomies_Solvability_Stability
open scoped Classical ENNReal BigOperators
open MeasureTheory ProbabilityTheory Set Function StabilityDichotomies.Solvability
Formal statement
theorem StabilityDichotomies.Solvability.wasserstein_le_measurable_seed_bit_changes {V Ω : Type} [Fintype V] [MeasurableSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (f g : Ω → V → Bool)
    (hf : Measurable f) (hg : Measurable g) :
    letI : IsProbabilityMeasure (Measure.map f μ) := Measure.isProbabilityMeasure_map hf.aemeasurable
    letI : IsProbabilityMeasure (Measure.map g μ) := Measure.isProbabilityMeasure_map hg.aemeasurable
    wasserstein ((Measure.map f μ).toPMF) ((Measure.map g μ).toPMF) ≤
      ∑ v : V, (μ {ω | f ω v ≠ g ω v}).toReal := by
  sorry
Source
Wang and Yoshida, Stability Dichotomies for Boolean CSPs, STOC 2027, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/535.pdf, proof of Theorem 4.9, coupling and Hamming-distance bound.

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