Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.2, p. 13 — under Assumption 4.1, (12a) is an equality for every ε > 0

Proved
WassDDRO.Reduction.worstCase_eq_program12c_of_pos

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

distributionally-robust-optimizationmoment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-dualitywasserstein

Let EEE, Ξ\XiΞ, ℓ=max⁡k≤Kℓk\ell=\max_{k\le K}\ell_kℓ=maxk≤K​ℓk​ and the samples ξ^1,…,ξ^N∈Ξ\hat\xi_1,\dots,\hat\xi_N\in\Xiξ^​1​,…,ξ^​N​∈Ξ be as in Theorem 4.2 (K,N≥1K,N\ge1K,N≥1, each ℓk\ell_kℓk​ measurable), and suppose Assumption 4.1 holds: Ξ\XiΞ is convex and closed, each −ℓk-\ell_k−ℓk​ is proper, convex and lower semicontinuous, and no ℓk\ell_kℓk​ is identically −∞-\infty−∞ on Ξ\XiΞ. Then for every ε>0\varepsilon>0ε>0

sup⁡Q∈Bε(P^N)EQ[ℓ(ξ)]=inf⁡λ≥0, s∈RN{λε+1N∑i=1Nsi : sup⁡ξ∈Ξ(ℓ(ξ)−λ∥ξ−ξ^i∥)≤si  ∀i},\sup_{\mathbb Q\in\mathbb B_\varepsilon(\widehat{\mathbb P}_N)}\mathbb E^{\mathbb Q}[\ell(\xi)]=\inf_{\lambda\ge0,\ s\in\mathbb R^N}\Big\{\lambda\varepsilon+\frac1N\sum_{i=1}^N s_i\ :\ \sup_{\xi\in\Xi}\big(\ell(\xi)-\lambda\|\xi-\hat\xi_i\|\big)\le s_i\ \ \forall i\Big\},Q∈Bε​(PN​)sup​EQ[ℓ(ξ)]=λ≥0, s∈RNinf​{λε+N1​i=1∑N​si​ : ξ∈Ξsup​(ℓ(ξ)−λ∥ξ−ξ^​i​∥)≤si​  ∀i},

that is, the max-min inequality (12a) holds with equality and (10) equals the optimal value of (12c).

This is the strong-duality step of the proof, an instance of strong duality for moment problems.

Preamble
import Mathlib
import Definitions.Def_WassDDRO_Reduction_Setting

open MeasureTheory Filter Topology
Formal statement
namespace WassDDRO.Reduction

/-- Proof of Theorem 4.2, p. 13: under Assumption 4.1 the inequality (12a) is an equality
for any `ε > 0`, i.e. (10) equals the optimal value of (12c). -/
theorem worstCase_eq_program12c_of_pos {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    [MeasurableSpace E] [BorelSpace E]
    {K N : ℕ} (hK : 0 < K) (hN : 0 < N) (Ξ : Set E) (ℓ : Fin K → E → EReal)
    (hmeas : ∀ k, Measurable (ℓ k)) (ξhat : Fin N → E) (hξ : ∀ i, ξhat i ∈ Ξ)
    (ε : ℝ) (hεpos : 0 < ε) (hA : Assumption41 Ξ ℓ) :
    worstCaseExpectation ε Ξ ξhat (maxLoss ℓ) = program12cValue ε Ξ ξhat (maxLoss ℓ) := by sorry

end WassDDRO.Reduction
Source
Mohajerin Esfahani & Kuhn, arXiv:1505.05116v3, proof of Theorem 4.2, p. 13 (equality in (12a) for ε > 0)
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