Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.3, p. 590 — every P ∈ 𝒫 gives a feasible point of (16) of equal value, so Ẑ(x) ≤ Ẑ_DD(x)

Proved
MinimaxSLP.RhsExtremal.Zhat_le_ZhatDD

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

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

Under Assumptions 2, 3 (at the constant qqq) and 5, and αk≥0\alpha_k\ge 0αk​≥0, fix x∈Rnx\in\mathbb R^nx∈Rn. For every distribution P∈PP\in\mathcal PP∈P (mean μ\muμ, second-moment matrix QQQ):

  1. h↦U(Q(h,x))h\mapsto\mathbb U(\mathcal Q(h,x))h↦U(Q(h,x)) is PPP-integrable;
  2. there is a feasible point (Vki,vki,vk0i)k,i(V_k^i,v_k^i,v_{k0}^i)_{k,i}(Vki​,vki​,vk0i​)k,i​ of (16) whose objective value equals EP[U(Q(h~,x))]\mathbb E_P[\mathbb U(\mathcal Q(\tilde h,x))]EP​[U(Q(h~,x))].

Moreover the objective of (16) is bounded above on its feasible set, and

Z^(x)=sup⁡P∈PEP[U(Q(h~,x))]≤Z^DD(x).\hat Z(x)=\sup_{P\in\mathcal P}\mathbb E_P\big[\mathbb U(\mathcal Q(\tilde h,x))\big]\le \hat Z_{DD}(x).Z^(x)=P∈Psup​EP​[U(Q(h~,x))]≤Z^DD​(x).

In the paper the feasible point is formed from the probabilities vk0iv_{k0}^ivk0i​ of the events "(k,i)(k,i)(k,i) attains max⁡l,j(αl(h~−Tx)′pj+βl)\max_{l,j}(\alpha_l(\tilde h-Tx)'p_j+\beta_l)maxl,j​(αl​(h~−Tx)′pj​+βl​)" and the corresponding conditional first and second moments of h~\tilde hh~. This is the upper half of the sandwich that proves Theorem 3.3.

Formalization Note The printed Z^(x)\hat Z(x)Z^(x) and Z^DD(x)\hat Z_{DD}(x)Z^DD​(x) are real sSups; the stronger per-distribution statement (items 1–2) and the bound on (16) make the inequality independent of junk values. Ties in the argmax are the prover's to break.

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: every `P ∈ 𝒫` makes `𝕌(𝒬(·, x))` integrable and yields a
feasible point of (16) whose objective value equals `E_P[𝕌(𝒬(h̃, x))]` (the conditional moments
of `h̃` on the cells where the pair `(k, i)` attains the maximum); the objective of (16) is
bounded above on its feasible set; hence `Ẑ(x) = sup_{P ∈ 𝒫} E_P[𝕌(𝒬(h̃, x))] ≤ Ẑ_DD(x)`. -/
theorem Zhat_le_ZhatDD {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 → ℝ) (μ : Fin r → ℝ) (Q : Matrix (Fin r) (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 → ℝ) :
    (∀ P ∈ MinimaxSLP.ObjSDP.momentClass μ Q,
      Integrable (fun h => MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x)) P ∧
      ∃ s ∈ feasible16 K N μ Q,
        obj16 T α β ps x s = ∫ h, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x) ∂P) ∧
    BddAbove (obj16 T α β ps x '' feasible16 K N μ Q) ∧
    MinimaxSLP.RhsSDP.Zhat W T q α β μ Q x ≤ ZhatDD T α β ps μ Q 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
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