Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, proof of Proposition 3, pp. 20–21 — E[max_l −a_l xᵀξ* − b_l] ≥ Σ_k (−a_k xᵀλ_k − b_k ν_k)

Proved
MomentDRO.WorstCov.mixture_value_ge

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

distributionally-robust-optimizationmixture-distributionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1piecewise-linear-utility

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, γ2>0\gamma_2>0γ2​>0, let {(Λk,λk,νk)}k=1K\{(\Lambda_k,\lambda_k,\nu_k)\}_{k=1}^K{(Λk​,λk​,νk​)}k=1K​ be feasible for (19) with every νk>0\nu_k>0νk​>0, and let P1,…,PKP_1,\dots,P_KP1​,…,PK​ be distributions with finite second moments, EPk[ζ]=λk/νk\mathbb E_{P_k}[\zeta]=\lambda_k/\nu_kEPk​​[ζ]=λk​/νk​ and EPk[ζζT]=Λk/νk\mathbb E_{P_k}[\zeta\zeta^{\mathsf T}]=\Lambda_k/\nu_kEPk​​[ζζT]=Λk​/νk​. Then the mixture P∗=∑kνkPkP^*=\sum_k\nu_kP_kP∗=∑k​νk​Pk​ satisfies

∑k=1K(−ak xTλk−bkνk) ≤ EP∗[max⁡l −al xTξ−bl].\sum_{k=1}^K\big(-a_k\,x^{\mathsf T}\lambda_k-b_k\nu_k\big)\ \le\ \mathbb E_{P^*}\Big[\max_{l}\ -a_l\,x^{\mathsf T}\xi-b_l\Big].k=1∑K​(−ak​xTλk​−bk​νk​) ≤ EP∗​[lmax​ −al​xTξ−bl​].

Combined with the bound of (18) by (19), this shows that the mixture built from an optimal solution of (19) attains the maximum of (18).

Formalization Note The objective is written with the sign of the page's displayed computation (p. 21), which is also the sign used throughout this mission.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_WorstCov_Setting

open MeasureTheory Matrix
Formal statement
namespace MomentDRO.WorstCov

theorem mixture_value_ge {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)
    (Lam : Fin K → Matrix (Fin n) (Fin n) ℝ) (lam : Fin K → Fin n → ℝ) (nu : Fin K → ℝ)
    (hfeas : Feasible19 μhat Sighat γ2 Lam lam nu)
    (hpos : ∀ k, 0 < nu k)
    (Pk : Fin K → Measure (Fin n → ℝ)) (hPk : ∀ k, MomentDRO.Conf.HasSecondMoments (Pk k))
    (hmean : ∀ k, MomentDRO.Conf.meanVec (Pk k) = (nu k)⁻¹ • lam k)
    (hsecond : ∀ k, MomentDRO.Conf.secondMomentAbout (Pk k) 0 = (nu k)⁻¹ • Lam k) :
    obj19 a b x lam nu ≤ ∫ ξ, pwCost a b x ξ ∂(mixture nu Pk) := 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), pp. 20–21, §5.2, proof of Proposition 3, last display
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