Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, proof of Proposition 3, p. 19 — the SDP (19) and the inner problem (18) have the same optimal value

Proved
MomentDRO.WorstCov.optimal_values_eq

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

distributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programmingstrong-duality

Let K≥1K\ge1K≥1, a,b∈RKa,b\in\mathbb R^Ka,b∈RK, x,μ^∈Rnx,\hat\mu\in\mathbb R^nx,μ^​∈Rn, Σ^≻0\hat\Sigma\succ0Σ^≻0 and γ2>0\gamma_2>0γ2​>0. For every real vvv, vvv is the maximum (attained) of the SDP

max⁡{∑k−ak xTλk−bkνk : {(Λk,λk,νk)}k=1K feasible for (19b)–(19d)}\max\Big\{\textstyle\sum_k -a_k\,x^{\mathsf T}\lambda_k-b_k\nu_k\ :\ \{(\Lambda_k,\lambda_k,\nu_k)\}_{k=1}^K\ \text{feasible for (19b)–(19d)}\Big\}max{∑k​−ak​xTλk​−bk​νk​ : {(Λk​,λk​,νk​)}k=1K​ feasible for (19b)–(19d)}

if and only if vvv is the maximum (attained) of the inner problem

max⁡Q∈D1(Rn,μ^,Σ^,0,γ2) EQ[max⁡k−ak ξTx−bk].(18)\max_{Q\in\mathcal D_1(\mathbb R^n,\hat\mu,\hat\Sigma,0,\gamma_2)}\ \mathbb E_Q\big[\max_k -a_k\,\xi^{\mathsf T}x-b_k\big].\tag{18}Q∈D1​(Rn,μ^​,Σ^,0,γ2​)max​ EQ​[kmax​−ak​ξTx−bk​].(18)

This is the page's claim that (19) "by strong duality achieves the same optimum" as (18), stated as an equality of attained maxima.

Formalization Note "vvv is the maximum" is IsGreatest, never a real supremum. γ1=0\gamma_1=0γ1​=0, S=RnS=\mathbb R^nS=Rn.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_WorstCov_Setting

open MeasureTheory Matrix
Formal statement
namespace MomentDRO.WorstCov

theorem optimal_values_eq {n K : ℕ} [NeZero K] (a b : Fin K → ℝ) (x : Fin n → ℝ)
    (μhat : Fin n → ℝ) (Sighat : Matrix (Fin n) (Fin n) ℝ) (hSig : Sighat.PosDef)
    (γ2 : ℝ) (hγ2 : 0 < γ2) (v : ℝ) :
    IsGreatest {t | ∃ (Lam : Fin K → Matrix (Fin n) (Fin n) ℝ) (lam : Fin K → Fin n → ℝ)
        (nu : Fin K → ℝ), Feasible19 μhat Sighat γ2 Lam lam nu ∧ t = obj19 a b x lam nu} v ↔
      IsGreatest ((fun Q => ∫ ξ, pwCost a b x ξ ∂Q) '' D1 Set.univ μhat Sighat 0 γ2) v := by sorry

end MomentDRO.WorstCov
Source
Delage & Ye, Distributionally robust optimization under moment uncertainty with application to data-driven problems, authors' draft of 20 Feb 2008 (OR 58(3), 2010), p. 19, §5.2, proof of Proposition 3, (18) and (19)
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