Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 588 — the dual matrix Y of a feasible point of (12) is positive semidefinite

Proved
MinimaxSLP.RhsSDP.dual_Y_posSemidef

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

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

Let αk≥0\alpha_k\ge 0αk​≥0 for all kkk, and let W,T,qW,T,qW,T,q satisfy complete recourse (Assumption 2) and {p:W′p≤q}≠∅\{p : W'p\le q\}\neq\emptyset{p:W′p≤q}=∅ (Assumption 3 at the constant qqq). If (Y,y,y0)(Y,y,y_0)(Y,y,y0​) is feasible for the dual (12) at some x∈Rnx\in\mathbb R^nx∈Rn, that is, YYY is symmetric and h′Yh+y′h+y0≥U(Q(h,x))h'Yh+y'h+y_0\ge\mathbb U(\mathcal Q(h,x))h′Yh+y′h+y0​≥U(Q(h,x)) for all h∈Rrh\in\mathbb R^rh∈Rr, then

Y⪰0.Y\succeq 0 .Y⪰0.

This is the observation that the dual feasible set only contains positive semidefinite matrices, used before the separation problem (13).

Preamble
import Mathlib
import Definitions.Def_MomentDRO_Conf_Setting
import Definitions.Def_WorstCaseVaR_KnownMoments_Basic
import Definitions.Def_MinimaxSLP_RhsSDP_Model
Formal statement
namespace MinimaxSLP.RhsSDP

open MeasureTheory Matrix

/-- §3.1, p. 588: the dual matrix `Y` of every feasible point `(Y, y, y₀)` of (12) is positive
semidefinite. Stated under `α_k ≥ 0`, complete recourse (Assumption 2) and
`{π : W′π ≤ q} ≠ ∅` (Assumption 3 at the constant `q`). -/
theorem dual_Y_posSemidef {r d n K : ℕ} [NeZero K]
    (W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (q : Fin d → ℝ)
    (α β : Fin K → ℝ)
    (hα : ∀ k, 0 ≤ α k)
    (hA2 : ∀ z : Fin r → ℝ, ∃ w : Fin d → ℝ, 0 ≤ w ∧ W *ᵥ w = z)
    (hA3 : ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
    (x : Fin n → ℝ) (s : Matrix (Fin r) (Fin r) ℝ × (Fin r → ℝ) × ℝ)
    (hs : s ∈ dualFeasible12 W T q α β x) :
    s.1.PosSemidef := by sorry

end MinimaxSLP.RhsSDP
Source
Bertsimas, Doan, Natarajan & Teo, Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion, Math. Oper. Res. 35(3), 2010, p. 588, §3.1
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