Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.2, p. 587 — an optimal solution of (9) whose blocks have vk0>0v_{k0}>0vk0​>0 or vanish

Proved
MinimaxSLP.ObjExtremal.zero_weight_reduction

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

extremal-distributionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let x∈Xx\in Xx∈X, assume X(x)≠∅X(x)\neq\emptysetX(x)=∅, Assumption 3, αk≥0\alpha_k\ge0αk​≥0 for all kkk and Assumption 4. Let (Vk,vk,vk0,pk)k=1K(V_k,v_k,v_{k0},p_k)_{k=1}^K(Vk​,vk​,vk0​,pk​)k=1K​ be an optimal solution of (9). Then there is another feasible point (Vk′,vk′,vk0′,pk′)k=1K(V'_k,v'_k,v'_{k0},p'_k)_{k=1}^K(Vk′​,vk′​,vk0′​,pk′​)k=1K​ of (9) with the same objective value (hence also optimal) and the same weights, vk0′=vk0v'_{k0}=v_{k0}vk0′​=vk0​ for all kkk, such that for every kkk either

vk0′>0orVk′=0, vk′=0, vk0′=0, pk′=0.v'_{k0}>0\qquad\text{or}\qquad V'_k=0,\ v'_k=0,\ v'_{k0}=0,\ p'_k=0 .vk0′​>0orVk′​=0, vk′​=0, vk0′​=0, pk′​=0.

In particular, writing L={k:vk0=0}L=\{k : v_{k0}=0\}L={k:vk0​=0} (the same set for both solutions),

∑k∉L(Vk′vk′vk′′vk0′)=(Qμμ′1).\sum_{k\notin L}\begin{pmatrix}V'_k & v'_k\\ v'_k{}' & v'_{k0}\end{pmatrix}=\begin{pmatrix}Q&\mu\\ \mu'&1\end{pmatrix}.k∈/L∑​(Vk′​vk′​′​vk′​vk0′​​)=(Qμ′​μ1​).

This reduces the construction of the extremal distributions of Theorem 2.2 to the case where every block that is used has positive weight vk0v_{k0}vk0​.

Formalization Note The paper's construction sets Vk:=0V_k:=0Vk​:=0 for k∈Lk\in Lk∈L and leaves pkp_kpk​ unchanged, noting (h−Tx)′pk+vk0βk=0(h-Tx)'p_k+v_{k0}\beta_k=0(h−Tx)′pk​+vk0​βk​=0 for k∈Lk\in Lk∈L. Here pk′=0p'_k=0pk′​=0 is required for the zero blocks; it gives the same objective value, by that identity.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_Conf_Setting
import Definitions.Def_MinimaxSLP_ObjExtremal_Model

open MeasureTheory Matrix Filter Topology
Formal statement
namespace MinimaxSLP.ObjExtremal

/-- Proof of Theorem 2.2 (p. 587): from an optimal solution of (9) one obtains an optimal
solution with the same objective value in which every block either has `v_k0 > 0` or is entirely
zero (`V_k = 0`, `v_k = 0`, `v_k0 = 0`, `p_k = 0`), and the weights `v_k0` are those of the
given solution; so with `L = {k : v_k0 = 0}` the blocks with `k ∉ L` alone sum to
`( Q μ ; μ′ 1 )`. -/
theorem zero_weight_reduction {m₁ n r d K : ℕ} [NeZero K]
    (A : Matrix (Fin m₁) (Fin n) ℝ) (b : Fin m₁ → ℝ)
    (W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (h : Fin r → ℝ)
    (α β : Fin K → ℝ) (hα : ∀ k, 0 ≤ α k)
    (μ : Fin d → ℝ) (Q : Matrix (Fin d) (Fin d) ℝ)
    (hQ : Q.IsSymm) (hA4 : (Q - Matrix.vecMulVec μ μ).PosDef)
    (hA3 : ∀ q : Fin d → ℝ, ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
    (x : Fin n → ℝ) (hx : x ∈ MinimaxSLP.ObjSDP.X A b) (hrec : (MinimaxSLP.ObjSDP.recourseSet W T h x).Nonempty)
    (s : (Fin K → Matrix (Fin d) (Fin d) ℝ) × (Fin K → Fin d → ℝ) × (Fin K → ℝ) ×
      (Fin K → Fin r → ℝ))
    (hs : s ∈ feasible9 W α μ Q)
    (hopt : ∀ s' ∈ feasible9 W α μ Q, obj9 T h β x s' ≤ obj9 T h β x s) :
    ∃ s' ∈ feasible9 W α μ Q, obj9 T h β x s' = obj9 T h β x s ∧
      (∀ k, s'.2.2.1 k = s.2.2.1 k) ∧
      ∀ k, 0 < s'.2.2.1 k ∨
        (s'.1 k = 0 ∧ s'.2.1 k = 0 ∧ s'.2.2.1 k = 0 ∧ s'.2.2.2 k = 0) := by sorry

end MinimaxSLP.ObjExtremal
Source
Bertsimas, Doan, Natarajan & Teo, Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion, Math. Oper. Res. 35(3), 2010, p. 587, proof of Theorem 2.2 (the case v_k0 = 0 for k ∈ L)
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