Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 5 — coupling form of the primal for f=1Af = 1_Af=1A​: sup⁡{P(A):dc(μ,P)≤δ}=sup⁡{π(S×A):π∈Φμ,δ}\sup\{P(A) : d_c(\mu,P) \le \delta\} = \sup\{\pi(S \times A) : \pi \in \Phi_{\mu,\delta}\}sup{P(A):dc​(μ,P)≤δ}=sup{π(S×A):π∈Φμ,δ​}

Proved
ModelRiskOT.WorstProb.coupling_form

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, ccc a cost satisfying (A1), μ\muμ a probability measure on SSS, δ>0\delta > 0δ>0, and A⊆SA \subseteq SA⊆S a nonempty closed set. Then

sup⁡{P(A):dc(μ,P)≤δ}=sup⁡{π(S×A):π∈Φμ,δ}.\sup\{P(A) : d_c(\mu,P) \le \delta\} = \sup\{\pi(S \times A) : \pi \in \Phi_{\mu,\delta}\}.sup{P(A):dc​(μ,P)≤δ}=sup{π(S×A):π∈Φμ,δ​}.

This is the rewriting of the primal problem on p. 5, sup⁡{∫f dν:dc(μ,ν)≤δ}=sup⁡{∫f(y) dπ(x,y):π∈Φμ,δ}\sup\{\int f\,d\nu : d_c(\mu,\nu) \le \delta\} = \sup\{\int f(y)\,d\pi(x,y) : \pi \in \Phi_{\mu,\delta}\}sup{∫fdν:dc​(μ,ν)≤δ}=sup{∫f(y)dπ(x,y):π∈Φμ,δ​}, in the instance f=1Af = 1_Af=1A​ used throughout §2.4. It turns an optimization over models PPP into one over transport plans with fixed first marginal, which is the linear problem the duality theory treats.

Formalization Note Only the instance f=1Af = 1_Af=1A​ is stated, which is how §2.4 uses the display ("I(π)=∫1A(y) dπ(x,y)=π(S×A)I(\pi) = \int 1_A(y)\,d\pi(x,y) = \pi(S \times A)I(π)=∫1A​(y)dπ(x,y)=π(S×A)", p. 9). Values are in [0,∞][0,\infty][0,∞].

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_WorstProb_WorstCaseProb

open MeasureTheory
open scoped ENNReal
Formal statement
namespace ModelRiskOT.WorstProb

/-- §2.2, p. 5 (the display before (3)), for `f = 1_A` with `A` closed: the worst-case probability
over the optimal-transport ball equals its coupling form,
`sup {P(A) : d_c(μ, P) ≤ δ} = sup {π(S × A) : π ∈ Φ_{μ,δ}}`
(the instance used in §2.4, p. 9, "I(π) = ∫1_A(y)dπ(x, y) = π(S × A)"). -/
theorem coupling_form {S : Type*} [TopologicalSpace S] [PolishSpace S] [MeasurableSpace S]
    [BorelSpace S] (c : S → S → ℝ) (hc : ModelRiskOT.Duality.AssumptionA1 c) (μ : Measure S) [IsProbabilityMeasure μ]
    (δ : ℝ) (hδ : 0 < δ) (A : Set S) (hA : IsClosed A) (hAne : A.Nonempty) :
    worstProb c μ δ A = worstProbCoupling c μ δ A := by sorry

end ModelRiskOT.WorstProb
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, p. 5, §2.2 (display defining I), instance f = 1_A as on p. 9
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