Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.3, pp. 590–591 — the Gaussian mixture P_m(x) has mean μ and second moment Q

Proved
MinimaxSLP.RhsExtremal.mixture_mem_momentClass

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

gaussianmoment-problemp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let (Vki,vki,vk0i)k=1,…,K, i=1,…,N(V_k^i,v_k^i,v_{k0}^i)_{k=1,\dots,K,\ i=1,\dots,N}(Vki​,vki​,vk0i​)k=1,…,K, i=1,…,N​ be a feasible point of (16) in which every block has vk0i>0v_{k0}^i>0vk0i​>0 or is zero. Let Pm(x)P_m(x)Pm​(x) be the mixed distribution that, with probability vk0iv_{k0}^ivk0i​, draws

h~ki∼N ⁣(vkivk0i, Vkivk0i−vki(vki)′(vk0i)2).\tilde h_k^i\sim\mathbb N\!\left(\frac{v_k^i}{v_{k0}^i},\ \frac{V_k^i v_{k0}^i-v_k^i(v_k^i)'}{(v_{k0}^i)^2}\right).h~ki​∼N(vk0i​vki​​, (vk0i​)2Vki​vk0i​−vki​(vki​)′​).

Then Pm(x)P_m(x)Pm​(x) is a probability distribution with finite second moments and

EPm(x)[h~]=μ,EPm(x)[h~h~′]=Q,\mathbb E_{P_m(x)}[\tilde h]=\mu,\qquad \mathbb E_{P_m(x)}[\tilde h\tilde h']=Q,EPm​(x)​[h~]=μ,EPm​(x)​[h~h~′]=Q,

i.e. Pm(x)∈PP_m(x)\in\mathcal PPm​(x)∈P.

This is the moment-matching step of the construction of the extremal distribution.

Formalization Note The normal components are Mathlib's multivariateGaussian (which accepts singular positive semidefinite covariances), transported from EuclideanSpace ℝ (Fin r) to Fin r → ℝ; weights are ENNReal.ofReal vk0iv_{k0}^ivk0i​. The paper's "Vkivk0V_k^iv_{k0}Vki​vk0​", "vk02v_{k0}^2vk02​" and "with probability vk0v_{k0}vk0​" are read with the superscript iii.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_Conf_Setting
import Definitions.Def_MinimaxSLP_RhsExtremal_Model
Formal statement
namespace MinimaxSLP.RhsExtremal

open MeasureTheory Matrix

/-- Proof of Theorem 3.3, pp. 590–591: if `s` is feasible for (16) and every block has
`v_k0^i > 0` or is zero, the mixture `P_m(x)` that draws `h̃_k^i ∼ ℕ(v_k^i/v_k0^i,
(V_k^i v_k0^i − v_k^i (v_k^i)′)/(v_k0^i)²)` with probability `v_k0^i` lies in `𝒫`:
`E[h̃] = μ` and `E[h̃h̃′] = Q`. -/
theorem mixture_mem_momentClass {r K N : ℕ} (μ : Fin r → ℝ) (Q : Matrix (Fin r) (Fin r) ℝ)
    (s : Fin K → Fin N → (Matrix (Fin r) (Fin r) ℝ × (Fin r → ℝ) × ℝ))
    (hs : s ∈ feasible16 K N μ Q)
    (hpos : ∀ k i, 0 < (s k i).2.2 ∨ s k i = 0) :
    mixture s ∈ MinimaxSLP.ObjSDP.momentClass μ Q := by sorry

end MinimaxSLP.RhsExtremal
Source
Bertsimas, Doan, Natarajan & Teo, Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion, Math. Oper. Res. 35(3), 2010, pp. 590–591, proof of Theorem 3.3
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