Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, proof of Proposition 3, p. 20 — (19) has an optimal solution satisfying (19b) with equality

Proved
MomentDRO.WorstCov.exists_optimal_tight

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

loewner-orderoptimal-solutionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

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. The SDP (19) of p. 19 (with objective ∑k−akxTλk−bkνk\sum_k -a_kx^{\mathsf T}\lambda_k-b_k\nu_k∑k​−ak​xTλk​−bk​νk​) has an optimal solution X∗={(Λk∗,λk∗,νk∗)}k=1KX^*=\{(\Lambda_k^*,\lambda_k^*,\nu_k^*)\}_{k=1}^KX∗={(Λk∗​,λk∗​,νk∗​)}k=1K​ for which constraint (19b) holds with equality:

∑k=1KΛk∗=γ2Σ^+μ^μ^T.\sum_{k=1}^K\Lambda_k^*=\gamma_2\hat\Sigma+\hat\mu\hat\mu^{\mathsf T}.k=1∑K​Λk∗​=γ2​Σ^+μ^​μ^​T.

That is, X∗X^*X∗ is feasible, no feasible point has a larger objective value, and the sum of the matrices Λk∗\Lambda_k^*Λk∗​ fills the whole budget γ2Σ^+μ^μ^T\gamma_2\hat\Sigma+\hat\mu\hat\mu^{\mathsf T}γ2​Σ^+μ^​μ^​T.

This is the step where the largest covariance enters: the tight matrix constraint becomes the second moment of the worst-case distribution built from X∗X^*X∗.

Formalization Note The page starts from "an optimal assignment X∗X^*X∗"; the statement includes the existence of an optimum, which the page uses implicitly.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_WorstCov_Setting

open MeasureTheory Matrix
Formal statement
namespace MomentDRO.WorstCov

theorem exists_optimal_tight {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 → ℝ),
      Feasible19 μhat Sighat γ2 Lam lam nu ∧
        (∀ (Lam' : Fin K → Matrix (Fin n) (Fin n) ℝ) (lam' : Fin K → Fin n → ℝ)
            (nu' : Fin K → ℝ), Feasible19 μhat Sighat γ2 Lam' lam' nu' →
            obj19 a b x lam' nu' ≤ obj19 a b x lam nu) ∧
        ∑ k, Lam k = γ2 • Sighat + Matrix.vecMulVec μhat μhat := 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. 20, §5.2, proof of Proposition 3, after (19d)
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