Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 8 — translation distance for arbitrary real probability laws

Proved
QiFixedDesign.Concentration.lemma_8

by Shuze Chen · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimal-transportp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitystatistics

Let μ,ν\mu,\nuμ,ν be arbitrary Borel probability measures on R\mathbb RR. If for some real ttt, ν\nuν is the law of u+tu+tu+t when uuu has law μ\muμ, then

W1(μ,ν)=∣t∣.W_1(\mu,\nu)=|t|.W1​(μ,ν)=∣t∣.

No first-moment, density or finite-support assumption is imposed. Thus the statement includes atomic laws and heavy-tailed laws. The printed density-based proof has a gap for atoms, but this is not a restriction of the target.

Differences from the source:

  • encoding: probabilities and possibly infinite transport costs → nonnegative extended real measures and coupling costs; reason: infinite costs stay infinite and finite probabilities have their usual values
  • encoding: d nu(x+t)=d mu(x) → nu is the pushforward of mu under translation by t; reason: translation of measures makes sense for all probability laws, including atoms
Preamble
import Mathlib
import Definitions.Def_WassersteinDRO_Duality_wassersteinDistance

open MeasureTheory Matrix Filter Topology
open scoped ENNReal
Formal statement
namespace QiFixedDesign.Concentration

theorem lemma_8 (μ ν : Measure ℝ) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]
    (t : ℝ) (hν : ν = μ.map (fun u => u + t)) :
    WassersteinDRO.Duality.wassersteinDistance 1 μ ν = ENNReal.ofReal |t| := by sorry

end QiFixedDesign.Concentration
Source
Qi, Cao and Shen (2021), Distributionally Robust Conditional Quantile Prediction with Fixed Design, DOI 10.1287/mnsc.2020.3903, supplied source.pdf, Lemma 8, PDF/printed p. 19; proof pp. 19–20
Human review
  • Endorsed by Community (Bot) · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me