Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.4, p. 17 — for every feasible point of (13), Q = (1/N)ΣΣ α_ik δ_{ξ_ik} lies in B_ε(P̂_N)

Proved
WassDDRO.Extremal.discreteQ_mem_ball

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

distributionally-robust-optimizationoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wasserstein

Let N≥1N \ge 1N≥1, let ξ^1,…,ξ^N∈Ξ\hat\xi_1,\dots,\hat\xi_N \in \Xiξ^​1​,…,ξ^​N​∈Ξ, and let (αik,qik)(\alpha_{ik}, q_{ik})(αik​,qik​) be feasible for program (13): 1N∑i,k∥qik∥≤ε\frac1N\sum_{i,k}\|q_{ik}\| \le \varepsilonN1​∑i,k​∥qik​∥≤ε, ∑kαik=1\sum_k \alpha_{ik} = 1∑k​αik​=1, αik≥0\alpha_{ik} \ge 0αik​≥0, and ξik:=ξ^i−qik/αik∈Ξ\xi_{ik} := \hat\xi_i - q_{ik}/\alpha_{ik} \in \Xiξik​:=ξ^​i​−qik​/αik​∈Ξ (with qik=0q_{ik} = 0qik​=0 when αik=0\alpha_{ik} = 0αik​=0). Then the discrete distribution

Q=1N∑i=1N∑k=1Kαik δξik\mathbb Q = \frac1N\sum_{i=1}^N\sum_{k=1}^K \alpha_{ik}\,\delta_{\xi_{ik}}Q=N1​i=1∑N​k=1∑K​αik​δξik​​

belongs to the Wasserstein ball Bε(P^N)\mathbb B_\varepsilon(\widehat{\mathbb P}_N)Bε​(PN​): it is a probability measure supported on Ξ\XiΞ with dW(Q,P^N)≤εd_W(\mathbb Q, \widehat{\mathbb P}_N) \le \varepsilondW​(Q,PN​)≤ε.

This is the first half of the second claim of Theorem 4.4: every sequence of feasible decisions of (13) yields distributions inside the ambiguity set.

Formalization Note The ball is the published ambiguitySet ε 1 Ξ around the published empiricalDistribution. When αik=0\alpha_{ik} = 0αik​=0 the Lean atom is ξ^i\hat\xi_iξ^​i​ and carries weight 000.

Preamble
import Mathlib
import Definitions.Def_WassDDRO_Extremal_Setting
Formal statement
namespace WassDDRO.Extremal

/-- Proof of Theorem 4.4, second claim, p. 17: for any feasible point (α, q) of (13), the
discrete distribution Q = (1/N) Σᵢ Σ_k α_ik δ_{ξ̂ᵢ − q_ik/α_ik} lies in the Wasserstein ball
B_ε(P̂_N); the coupling (1/N) Σᵢ Σ_k α_ik δ_{(ξ_ik, ξ̂ᵢ)} has transport cost (1/N) Σᵢ Σ_k ‖q_ik‖ ≤ ε. -/
theorem discreteQ_mem_ball {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
    {K N : ℕ} (hN : 0 < N) (Ξ : Set E) (ξhat : Fin N → E) (hξ : ∀ i, ξhat i ∈ Ξ) (ε : ℝ)
    (α : Fin N → Fin K → ℝ) (q : Fin N → Fin K → E) (h : Feasible13 ε Ξ ξhat α q) :
    discreteQ ξhat α q ∈ WassersteinDRO.Duality.ambiguitySet ε 1 Ξ
      (WassersteinDRO.Duality.empiricalDistribution ξhat) := by sorry

end WassDDRO.Extremal
Source
Mohajerin Esfahani & Kuhn, arXiv:1505.05116v3, proof of Theorem 4.4 (second claim), p. 17
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