Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.3, p. 590 — (16) has an optimal solution whose blocks have v_k0^i > 0 or vanish

Proved
MinimaxSLP.RhsExtremal.dual16_optimal_zero_or_positive

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

optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let μ∈Rr\mu\in\mathbb R^rμ∈Rr and a symmetric Q∈Rr×rQ\in\mathbb R^{r\times r}Q∈Rr×r satisfy Q−μμ′≻0Q-\mu\mu'\succ 0Q−μμ′≻0 (Assumption 4), let N≥1N\ge 1N≥1, and fix the data T,α,β,p1,…,pN,xT,\alpha,\beta,p_1,\dots,p_N,xT,α,β,p1​,…,pN​,x of the objective of (16). Then (16) has an optimal solution (Vki,vki,vk0i)k,i(V_k^i,v_k^i,v_{k0}^i)_{k,i}(Vki​,vki​,vk0i​)k,i​, that is, a feasible point at which the objective

∑k=1K∑i=1N(αkpi′vki+vk0i(βk−αkpi′Tx))\sum_{k=1}^K\sum_{i=1}^N\big(\alpha_k p_i'v_k^i+v_{k0}^i(\beta_k-\alpha_k p_i'Tx)\big)k=1∑K​i=1∑N​(αk​pi′​vki​+vk0i​(βk​−αk​pi′​Tx))

attains its maximum over the feasible set, such that for every pair (k,i)(k,i)(k,i) either vk0i>0v_{k0}^i>0vk0i​>0 or (Vki,vki,vk0i)=0(V_k^i,v_k^i,v_{k0}^i)=0(Vki​,vki​,vk0i​)=0.

The paper writes "without loss of generality, we can again assume that vk0i>0v_{k0}^i>0vk0i​>0 for all kkk and iii (see Theorem 2.2)"; the blocks with vk0i=0v_{k0}^i=0vk0i​=0 are discarded from the mixture, which is the form stated here. This optimal solution is the input to the construction of the extremal distribution.

Formalization Note "vk0i>0v_{k0}^i>0vk0i​>0 for all k,ik,ik,i" literally can fail at every optimum, so the zero-or-positive form is used; the zero blocks receive weight 000 in the mixture. N≥1N\ge 1N≥1 is assumed explicitly (with N=0N=0N=0 the program is infeasible); under Assumptions 2, 3 and 5 it holds automatically.

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, p. 590: under Assumption 4 (`Q` symmetric, `Q − μμ′ ≻ 0`) and
`N ≥ 1`, the problem (16) has an optimal solution in which every block either has
`v_k0^i > 0` or is identically zero (the reading of "without loss of generality `v_k0^i > 0`
(see Theorem 2.2)"). -/
theorem dual16_optimal_zero_or_positive {r n K N : ℕ} [NeZero K]
    (T : Matrix (Fin r) (Fin n) ℝ) (α β : Fin K → ℝ) (ps : Fin N → Fin r → ℝ)
    (μ : Fin r → ℝ) (Q : Matrix (Fin r) (Fin r) ℝ)
    (hN : 0 < N)
    (hQ : Q.IsSymm) (hA4 : (Q - Matrix.vecMulVec μ μ).PosDef)
    (x : Fin n → ℝ) :
    ∃ s ∈ feasible16 K N μ Q,
      IsGreatest (obj16 T α β ps x '' feasible16 K N μ Q) (obj16 T α β ps x s) ∧
      ∀ k i, 0 < (s k i).2.2 ∨ s k i = 0 := 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, p. 590, proof of Theorem 3.3; zero-weight argument in the proof of Theorem 2.2, p. 587
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