Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.3, p. 590 — 𝕌(𝒬(h, x)) = max over pairs (k, i) of α_k(h − Tx)′p_i + β_k

Proved
MinimaxSLP.RhsExtremal.disutility_Qval_eq_max_pairs

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Let W∈Rr×dW\in\mathbb R^{r\times d}W∈Rr×d, T∈Rr×nT\in\mathbb R^{r\times n}T∈Rr×n and q∈Rdq\in\mathbb R^dq∈Rd satisfy complete recourse, {Ww:w≥0}=Rr\{Ww : w\ge 0\}=\mathbb R^r{Ww:w≥0}=Rr (Assumption 2), and dual feasibility, {p∈Rr:W′p≤q}≠∅\{p\in\mathbb R^r : W'p\le q\}\neq\emptyset{p∈Rr:W′p≤q}=∅ (Assumption 3 at the constant qqq). Let p1,…,pNp_1,\dots,p_Np1​,…,pN​ be the extreme points of {p:W′p≤q}\{p : W'p\le q\}{p:W′p≤q} (Assumption 5), and let αk≥0\alpha_k\ge 0αk​≥0 for k=1,…,Kk=1,\dots,Kk=1,…,K. Then for every x∈Rnx\in\mathbb R^nx∈Rn and every h∈Rrh\in\mathbb R^rh∈Rr,

Q(h,x)=max⁡i=1,…,N(h−Tx)′pi,U(Q(h,x))=max⁡k=1,…,K(αkQ(h,x)+βk)=max⁡k=1,…,K, i=1,…,N(αk(h−Tx)′pi+βk),\mathcal Q(h,x)=\max_{i=1,\dots,N}(h-Tx)'p_i,\qquad \mathbb U(\mathcal Q(h,x))=\max_{k=1,\dots,K}(\alpha_k\mathcal Q(h,x)+\beta_k)=\max_{k=1,\dots,K,\ i=1,\dots,N}\big(\alpha_k(h-Tx)'p_i+\beta_k\big),Q(h,x)=i=1,…,Nmax​(h−Tx)′pi​,U(Q(h,x))=k=1,…,Kmax​(αk​Q(h,x)+βk​)=k=1,…,K, i=1,…,Nmax​(αk​(h−Tx)′pi​+βk​),

and both maxima are attained.

This identity turns the expected disutility into a maximum of finitely many affine functions of hhh, which is what makes the dual (16) and the extremal distribution possible.

Formalization Note Both maxima are stated as IsGreatest of the finite range, which also forces N≥1N\ge 1N≥1. Q(h,x)\mathcal Q(h,x)Q(h,x) is the real supremum of (h−Tx)′p(h-Tx)'p(h−Tx)′p over the dual polyhedron.

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 complete recourse (Assumption 2), dual feasibility at the
constant `q` (Assumption 3), Assumption 5 (`p_1, …, p_N` are the extreme points of
`{π : W′π ≤ q}`) and `α_k ≥ 0`, for every `h ∈ ℝʳ` the second-stage value is the largest of the
`(h − T x)′p_i`, and `𝕌(𝒬(h, x)) = max_{k, i} (α_k (h − T x)′p_i + β_k)`; both maxima are attained
(`IsGreatest` of the finite range). -/
theorem disutility_Qval_eq_max_pairs {r d n K N : ℕ} [NeZero K]
    (W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (q : Fin d → ℝ)
    (α β : Fin K → ℝ) (ps : Fin N → Fin r → ℝ)
    (hα : ∀ k, 0 ≤ α k)
    (hA2 : ∀ z : Fin r → ℝ, ∃ w : Fin d → ℝ, 0 ≤ w ∧ W *ᵥ w = z)
    (hA3 : ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
    (hA5 : Set.range ps = Set.extremePoints ℝ {π : Fin r → ℝ | Wᵀ *ᵥ π ≤ q})
    (x : Fin n → ℝ) (h : Fin r → ℝ) :
    IsGreatest (Set.range fun i : Fin N => (h - T *ᵥ x) ⬝ᵥ ps i) (MinimaxSLP.RhsSDP.Qval W T q h x) ∧
    IsGreatest (Set.range fun ki : Fin K × Fin N => α ki.1 * ((h - T *ᵥ x) ⬝ᵥ ps ki.2) + β ki.1)
      (MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x)) := 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 (first display); with p. 589, proof of Theorem 3.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