Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1, p. 585 — for x ∈ X, ZDD(x)≥Z(x)Z_{DD}(x) \ge Z(x)ZDD​(x)≥Z(x): every P∈PP\in\mathcal PP∈P yields a feasible point of (9) with value EP[U(Q)]\mathbb E_P[\mathbb U(\mathcal Q)]EP​[U(Q)]

Proved
MinimaxSLP.ObjExtremal.lemma_2_1

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

dualitymoment-problemp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let x∈Xx\in Xx∈X and assume that X(x)≠∅X(x)\neq\emptysetX(x)=∅, that {p∈Rr:W′p≤q}≠∅\{p\in\mathbb R^r : W'p\le q\}\neq\emptyset{p∈Rr:W′p≤q}=∅ for every q∈Rdq\in\mathbb R^dq∈Rd (Assumption 3), that αk≥0\alpha_k\ge 0αk​≥0 for all kkk, and that QQQ is symmetric with Q−μμ′≻0Q-\mu\mu'\succ 0Q−μμ′≻0 (Assumption 4). Then:

  1. for every P∈PP\in\mathcal PP∈P the function q↦U(Q(q,x))q\mapsto\mathbb U(\mathcal Q(q,x))q↦U(Q(q,x)) is PPP-integrable, and there is a 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) whose objective value equals the expectation:
EP[U(Q(q~,x))]=∑k=1K(h−Tx)′pk+βkvk0;\mathbb E_P\big[\mathbb U(\mathcal Q(\tilde q,x))\big]=\sum_{k=1}^K (h-Tx)'p_k+\beta_k v_{k0};EP​[U(Q(q~​,x))]=k=1∑K​(h−Tx)′pk​+βk​vk0​;
  1. consequently
Z(x)=sup⁡P∈PEP[U(Q(q~,x))]≤ZDD(x).Z(x)=\sup_{P\in\mathcal P}\mathbb E_P\big[\mathbb U(\mathcal Q(\tilde q,x))\big]\le Z_{DD}(x).Z(x)=P∈Psup​EP​[U(Q(q~​,x))]≤ZDD​(x).

The feasible point of part 1 consists of the scaled conditional moments of q~\tilde qq~​ and of a dual-optimal solution of the second-stage problem on the event that the kkkth piece of U\mathbb UU attains the maximum (ties broken arbitrarily). This upper bound is one half of the identity Z(x)=ZDD(x)Z(x)=Z_{DD}(x)Z(x)=ZDD​(x) of Theorem 2.2.

Formalization Note Part 1 is the form in which the paper's proof establishes the lemma; part 2 is the printed statement. Integrability is stated explicitly because the Bochner integral of a non-integrable function is 000 in Lean.

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

/-- Lemma 2.1 (p. 585): for every `x ∈ MinimaxSLP.ObjSDP.X`, `Z_DD(x) ≥ Z(x)`. In the form the proof gives it:
every `P ∈ 𝒫` has an integrable `𝕌(𝒬(·, x))` and a feasible point of (9) (the scaled
conditional moments) whose objective value equals `E_P[𝕌(𝒬(q̃, x))]`; hence `Z(x) ≤ Z_DD(x)`. -/
theorem lemma_2_1 {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) :
    (∀ P ∈ MinimaxSLP.ObjSDP.momentClass μ Q,
      Integrable (fun q => MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.ObjSDP.Qval W T h q x)) P ∧
      ∃ s ∈ feasible9 W α μ Q, ∫ q, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.ObjSDP.Qval W T h q x) ∂P = obj9 T h β x s) ∧
    MinimaxSLP.ObjSDP.Zx W T h α β μ Q x ≤ ZDD W T h α β μ Q 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. 585, Lemma 2.1 and its proof
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