Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 909 (upper-bound part) — sup over 𝔽₁ of E_ℙ((r⁰ + r′ζ̃)⁺) ≤ π¹(r⁰, r)

Proved
TractableDRO.MeanSupport.theorem_1_upper

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

distributionally-robust-optimizationdualitymoment-boundsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

This is the upper-bound half of Theorem 1 of Goh and Sim (2010).

Let V,V^⊆Rn\mathcal V, \widehat{\mathcal V} \subseteq \mathbb R^nV,V⊆Rn be arbitrary sets, and let F1\mathbb F_1F1​ be the family of probability distributions of a random vector ζ~∈Rn\tilde\zeta \in \mathbb R^nζ~​∈Rn with integrable coordinates, mean EP(ζ~)∈V^\mathbb E_{\mathbb P}(\tilde\zeta) \in \widehat{\mathcal V}EP​(ζ~​)∈V and P(ζ~∈V)=1\mathbb P(\tilde\zeta \in \mathcal V) = 1P(ζ~​∈V)=1. For every r0∈Rr^0 \in \mathbb Rr0∈R and r∈Rnr \in \mathbb R^nr∈Rn,

sup⁡P∈F1EP((r0+r′ζ~)+)≤π1(r0,r)=inf⁡s∈Rn(sup⁡ζ^∈V^{s′ζ^}+sup⁡ζ∈Vmax⁡{r0+r′ζ−s′ζ, −s′ζ}),\sup_{\mathbb P \in \mathbb F_1} \mathbb E_{\mathbb P}\big((r^0 + r'\tilde\zeta)^+\big) \le \pi^1(r^0, r) = \inf_{s \in \mathbb R^{n}} \Big( \sup_{\hat\zeta \in \widehat{\mathcal V}} \{s'\hat\zeta\} + \sup_{\zeta \in \mathcal V} \max\{r^0 + r'\zeta - s'\zeta,\ -s'\zeta\} \Big),P∈F1​sup​EP​((r0+r′ζ~​)+)≤π1(r0,r)=s∈Rninf​(ζ^​∈Vsup​{s′ζ^​}+ζ∈Vsup​max{r0+r′ζ−s′ζ, −s′ζ}),

both sides taken in the extended reals.

The bound π1\pi^1π1 is a deterministic convex program over the sets V\mathcal VV and V^\widehat{\mathcal V}V, so this inequality turns an optimization over distributions into a tractable robust optimization problem.

Formalization Note No convexity, closedness or nonemptiness is assumed: the inequality holds for all sets. When F1\mathbb F_1F1​ is empty the left side is −∞-\infty−∞ (⊥). All values are in EReal; see the definition TractableDRO.MeanSupport.Model.

Preamble
import Mathlib
import Definitions.Def_TractableDRO_MeanSupport_Model

open MeasureTheory
Formal statement
namespace TractableDRO.MeanSupport

theorem theorem_1_upper {n : ℕ} (V Vhat : Set (Fin n → ℝ)) (r0 : ℝ) (r : Fin n → ℝ) :
    worstCase (family1 V Vhat) r0 r ≤ pi1 V Vhat r0 r := by sorry

end TractableDRO.MeanSupport
Source
Goh & Sim, Distributionally Robust Optimization and Its Tractable Approximations, Oper. Res. 58(4), 2010, p. 909, Theorem 1 (upper-bound part), (21)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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