Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.2, p. 586 — if W′p≤αvW'p\le\alpha vW′p≤αv with α≥0\alpha\ge0α≥0 then α Q(v,x)≥(h−Tx)′p\alpha\,\mathcal Q(v,x)\ge(h-Tx)'pαQ(v,x)≥(h−Tx)′p

Proved
MinimaxSLP.ObjExtremal.scaled_weak_duality

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

dualitylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let xxx be such that X(x)≠∅X(x)\neq\emptysetX(x)=∅, and assume Assumption 3. Let α≥0\alpha\ge 0α≥0, v∈Rdv\in\mathbb R^dv∈Rd and p∈Rrp\in\mathbb R^rp∈Rr with W′p≤αvW'p\le\alpha vW′p≤αv, i.e. ppp is a dual feasible solution of the second-stage problem Q(αv,x)\mathcal Q(\alpha v,x)Q(αv,x). Then

α Q(v,x) ≥ (h−Tx)′p.\alpha\,\mathcal Q(v,x)\ \ge\ (h-Tx)'p .αQ(v,x) ≥ (h−Tx)′p.

In the proof of Theorem 2.2 this is applied to each block (vk,pk)(v_k,p_k)(vk​,pk​) of an optimal solution of (9), whose constraint is W′pk≤αkvkW'p_k\le\alpha_k v_kW′pk​≤αk​vk​.

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. 586): if `p` is dual feasible for `𝒬(α v, x)`, i.e.
`W′p ≤ α v`, with `α ≥ 0`, then `α 𝒬(v, x) ≥ (h − T x)′p`. -/
theorem scaled_weak_duality {n r d : ℕ}
    (W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (h : Fin r → ℝ)
    (hA3 : ∀ q : Fin d → ℝ, ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
    (x : Fin n → ℝ) (hrec : (MinimaxSLP.ObjSDP.recourseSet W T h x).Nonempty)
    (a : ℝ) (ha : 0 ≤ a) (v : Fin d → ℝ) (π : Fin r → ℝ) (hπ : Wᵀ *ᵥ π ≤ a • v) :
    (h - T *ᵥ x) ⬝ᵥ π ≤ a * MinimaxSLP.ObjSDP.Qval W T h v x := 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. 586, proof of Theorem 2.2
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