Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.2, p. 13 — under Assumption 4.1, the optimal values of (10) and (12f) coincide

Proved
WassDDRO.Reduction.worstCase_eq_program12f

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

convex-reformulationdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wasserstein

Let EEE, Ξ\XiΞ, ℓ=max⁡k≤Kℓk\ell=\max_{k\le K}\ell_kℓ=maxk≤K​ℓk​ and 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. Then for every ε≥0\varepsilon\ge0ε≥0

sup⁡Q∈Bε(P^N)EQ[ℓ(ξ)]={inf⁡λ,si,zikλε+1N∑i=1Nsis.t.[−ℓk+χΞ]∗(zik)−⟨zik,ξ^i⟩≤si∀i≤N, ∀k≤K∥zik∥∗≤λ∀i≤N, ∀k≤K.\sup_{\mathbb Q\in\mathbb B_\varepsilon(\widehat{\mathbb P}_N)}\mathbb E^{\mathbb Q}[\ell(\xi)]=\left\{\begin{array}{ll}\inf\limits_{\lambda,s_i,z_{ik}}&\lambda\varepsilon+\frac1N\sum_{i=1}^N s_i\\ \text{s.t.}&[-\ell_k+\chi_\Xi]^*(z_{ik})-\langle z_{ik},\hat\xi_i\rangle\le s_i\quad\forall i\le N,\ \forall k\le K\\ &\|z_{ik}\|_*\le\lambda\quad\forall i\le N,\ \forall k\le K.\end{array}\right.Q∈Bε​(PN​)sup​EQ[ℓ(ξ)]=⎩⎨⎧​λ,si​,zik​inf​s.t.​λε+N1​∑i=1N​si​[−ℓk​+χΞ​]∗(zik​)−⟨zik​,ξ^​i​⟩≤si​∀i≤N, ∀k≤K∥zik​∥∗​≤λ∀i≤N, ∀k≤K.​

This is the reduction of the infinite-dimensional worst-case expectation problem to the finite convex program (12f); Theorem 4.4 (worst-case distributions) is built on it.

Formalization Note [−ℓk+χΞ]∗(z)[-\ell_k+\chi_\Xi]^*(z)[−ℓk​+χΞ​]∗(z) is encoded as sup⁡ξ∈Ξ(⟨z,ξ⟩+ℓk(ξ))\sup_{\xi\in\Xi}\big(\langle z,\xi\rangle+\ell_k(\xi)\big)supξ∈Ξ​(⟨z,ξ⟩+ℓk​(ξ)).

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, for any `ε ≥ 0` the optimal values of
(10) and (12f) coincide. -/
theorem worstCase_eq_program12f {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ε : 0 ≤ ε) (hA : Assumption41 Ξ ℓ) :
    worstCaseExpectation ε Ξ ξhat (maxLoss ℓ) = program12fValue ε Ξ ξhat ℓ := by sorry

end WassDDRO.Reduction
Source
Mohajerin Esfahani & Kuhn, arXiv:1505.05116v3, proof of Theorem 4.2, p. 13 ("Thus, the optimal values of (10) and (12f) coincide.")
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