Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, proof of Proposition 3, p. 20 — the law of ξ* = ζ_k̃ lies in D₁(ℝⁿ, µ̂, Σ̂, 0, γ₂) and has largest covariance

Proved
MomentDRO.WorstCov.mixture_mem_D1_tight

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

covariancedistributionally-robust-optimizationmixture-distributionmoment-uncertaintyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K≥1K\ge1K≥1, μ^∈Rn\hat\mu\in\mathbb R^nμ^​∈Rn, Σ^≻0\hat\Sigma\succ0Σ^≻0, γ2>0\gamma_2>0γ2​>0, and 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 (19b) tight,

∑kΛk=γ2Σ^+μ^μ^T,\sum_k\Lambda_k=\gamma_2\hat\Sigma+\hat\mu\hat\mu^{\mathsf T},k∑​Λk​=γ2​Σ^+μ^​μ^​T,

and with νk>0\nu_k>0νk​>0 for every kkk. Let P1,…,PKP_1,\dots,P_KP1​,…,PK​ be distributions on Rn\mathbb R^nRn with finite second moments such that 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​, which is the law of ξ∗=ζk~\xi^*=\zeta_{\tilde k}ξ∗=ζk~​ for an independent index k~\tilde kk~ with P(k~=k)=νk\mathbb P(\tilde k=k)=\nu_kP(k~=k)=νk​, satisfies

P∗∈D1(Rn,μ^,Σ^,0,γ2)andEP∗[(ξ−μ^)(ξ−μ^)T]=γ2Σ^.P^*\in\mathcal D_1(\mathbb R^n,\hat\mu,\hat\Sigma,0,\gamma_2)\qquad\text{and}\qquad \mathbb E_{P^*}\big[(\xi-\hat\mu)(\xi-\hat\mu)^{\mathsf T}\big]=\gamma_2\hat\Sigma .P∗∈D1​(Rn,μ^​,Σ^,0,γ2​)andEP∗​[(ξ−μ^​)(ξ−μ^​)T]=γ2​Σ^.

So the constructed distribution meets the covariance constraint (1b) with equality: it has the largest covariance the set allows.

Formalization Note The hypothesis νk>0\nu_k>0νk​>0 is the page's "assuming without loss of generality that all νk>0\nu_k>0νk​>0". The mixture is the measure-level form of ξ∗=ζk~\xi^*=\zeta_{\tilde k}ξ∗=ζk~​.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_WorstCov_Setting

open MeasureTheory Matrix
Formal statement
namespace MomentDRO.WorstCov

theorem mixture_mem_D1_tight {n K : ℕ} [NeZero K]
    (μ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)
    (htight : ∑ k, Lam k = γ2 • Sighat + Matrix.vecMulVec μhat μhat)
    (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) :
    mixture nu Pk ∈ D1 Set.univ μhat Sighat 0 γ2 ∧
      MomentDRO.Conf.secondMomentAbout (mixture nu Pk) μhat = γ2 • Sighat := 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, construction of ξ* = ζ_k̃ and the displays for E[ξ*], E[ξ*ξ*ᵀ]
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