Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(13) — sup⁡{P(A):dc(μ,P)≤δ}=inf⁡λ≥0{λδ+Eμ[(1−λc(X,A))+]}\sup\{P(A) : d_c(\mu,P) \le \delta\} = \inf_{\lambda \ge 0}\{\lambda\delta + E_\mu[(1 - \lambda c(X,A))^+]\}sup{P(A):dc​(μ,P)≤δ}=infλ≥0​{λδ+Eμ​[(1−λc(X,A))+]}

Proved
ModelRiskOT.WorstProb.eq_13

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

dualityoptimal-transportp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-probability

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 the worst-case probability (12) is the value of a univariate convex problem:

sup⁡{P(A):dc(μ,P)≤δ}=inf⁡λ≥0{λδ+Eμ[(1−λc(X,A))+]}.\sup\{P(A) : d_c(\mu,P) \le \delta\} = \inf_{\lambda \ge 0}\Big\{\lambda\delta + E_\mu\big[(1 - \lambda c(X,A))^+\big]\Big\}.sup{P(A):dc​(μ,P)≤δ}=λ≥0inf​{λδ+Eμ​[(1−λc(X,A))+]}.

The only measure on the right-hand side is the baseline μ\muμ, so the infinite-dimensional worst case is computed by a one-dimensional minimization. It is the specialization of the paper's strong duality theorem (Theorem 1, with Remark 1's (9)) to f=1Af = 1_Af=1A​, which is upper semicontinuous because AAA is closed.

Formalization Note Both sides are in [0,∞][0,\infty][0,∞]; the expectation is a lower Lebesgue integral, which equals the integral under the completion of μ\muμ since x↦c(x,A)x \mapsto c(x,A)x↦c(x,A) is universally measurable.

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_WorstProb_WorstCaseProb

open MeasureTheory
open scoped ENNReal
Formal statement
namespace ModelRiskOT.WorstProb

/-- (13), p. 9: for a nonempty closed set `A`, the worst-case probability (12) is the value of a
univariate problem,
`sup {P(A) : d_c(μ, P) ≤ δ} = inf_{λ ≥ 0} {λδ + E_μ[(1 − λ c(X, A))⁺]}`. -/
theorem eq_13 {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 = ⨅ lam ∈ Set.Ici (0 : ℝ), obj13 c μ δ A lam := by sorry

end ModelRiskOT.WorstProb
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, p. 9, Eq. (13)
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