Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 17 — every feasible plan is improved by one concentrated on {f(y) ≥ f(x)}

Proved
ModelRiskOT.PrimalOpt.lemma_17

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

distributionally-robust-optimizationoptimal-transportp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let SSS be a Polish space, μ\muμ a probability measure on SSS, δ>0\delta>0δ>0, and let ccc and fff satisfy (A1) and (A2). Then for every π∈Φμ,δ\pi\in\Phi_{\mu,\delta}π∈Φμ,δ​ there is π′∈Φμ,δ\pi'\in\Phi_{\mu,\delta}π′∈Φμ,δ​ concentrated on {(x,y)∈S×S:f(y)≥f(x)}\{(x,y)\in S\times S: f(y)\ge f(x)\}{(x,y)∈S×S:f(y)≥f(x)}, i.e. π′∈Φμ,δ′\pi'\in\Phi'_{\mu,\delta}π′∈Φμ,δ′​, such that

∫f+(y) dπ′(x,y)≥∫f+(y) dπ(x,y)and∫f−(y) dπ′(x,y)≤∫f−(x) dμ(x),(55)\int f^+(y)\,d\pi'(x,y)\ge\int f^+(y)\,d\pi(x,y)\qquad\text{and}\qquad\int f^-(y)\,d\pi'(x,y)\le\int f^-(x)\,d\mu(x),\tag{55}∫f+(y)dπ′(x,y)≥∫f+(y)dπ(x,y)and∫f−(y)dπ′(x,y)≤∫f−(x)dμ(x),(55)

and moreover ∫f(y) dπ′(x,y)≥∫f(y) dπ(x,y)\int f(y)\,d\pi'(x,y)\ge\int f(y)\,d\pi(x,y)∫f(y)dπ′(x,y)≥∫f(y)dπ(x,y) whenever ∫f(y) dπ(x,y)\int f(y)\,d\pi(x,y)∫f(y)dπ(x,y) is well defined.

The lemma shows that the primal problem may be restricted to monotone plans, and that its value is never an ∞−∞\infty-\infty∞−∞ ambiguity.

Formalization Note "Concentrated on" means measure one (p. 4). The last inequality is stated for every π\piπ, as I(π)≤I(π′)I(\pi)\le I(\pi')I(π)≤I(π′) in EReal: when ∫f(y) dπ\int f(y)\,d\pi∫f(y)dπ is not well defined (∞−∞\infty-\infty∞−∞), I(π)=−∞I(\pi)=-\inftyI(π)=−∞ by the EReal convention, so the unconditional statement is equivalent to the paper's.

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_PrimalOpt_PrimalFeasibleMono
Formal statement
namespace ModelRiskOT.PrimalOpt

open MeasureTheory

/-- **Lemma 17** (App. B.4, p. 43). Under (A1) and (A2), for every `π ∈ Φ_{μ,δ}` there is
`π′ ∈ Φ_{μ,δ}` concentrated on `{(x, y) : f(y) ≥ f(x)}` (i.e. `π′ ∈ Φ′_{μ,δ}`) with
`∫ f⁺(y) dπ′ ≥ ∫ f⁺(y) dπ` and `∫ f⁻(y) dπ′ ≤ ∫ f⁻ dμ` (55), and `I(π′) ≥ I(π)`. The last
inequality is stated for every `π`: when `∫ f(y) dπ` is not well defined (`∞ − ∞`), `I(π) = ⊥`. -/
theorem lemma_17 {S : Type*} [TopologicalSpace S] [PolishSpace S] [MeasurableSpace S]
    [BorelSpace S] (c : S → S → ℝ) (f : S → ℝ) (μ : Measure S) [IsProbabilityMeasure μ]
    (δ : ℝ) (hδ : 0 < δ) (hA1 : ModelRiskOT.Duality.AssumptionA1 c) (hA2 : AssumptionA2 f μ)
    (π : Measure (S × S)) (hπ : π ∈ ModelRiskOT.Duality.primalFeasible c μ δ) :
    ∃ π' ∈ primalFeasibleMono c f μ δ,
      ∫⁻ p, ENNReal.ofReal (f p.2) ∂π ≤ ∫⁻ p, ENNReal.ofReal (f p.2) ∂π' ∧
      ∫⁻ p, ENNReal.ofReal (-f p.2) ∂π' ≤ ∫⁻ x, ENNReal.ofReal (-f x) ∂μ ∧
      ModelRiskOT.Duality.primalObj f π ≤ ModelRiskOT.Duality.primalObj f π' := by sorry

end ModelRiskOT.PrimalOpt
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, p. 43, Appendix B.4, Lemma 17, Eq. (55)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me