Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 583 — strong duality Z(x)=ZD(x)Z(x)=Z_D(x)Z(x)=ZD​(x) between the moment problem (5) and its dual (6)

Proved
MinimaxSLP.ObjExtremal.strong_duality

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

dualitymoment-problemp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1strong-duality

Let x∈Xx\in Xx∈X, assume X(x)≠∅X(x)\neq\emptysetX(x)=∅, Assumption 3 ({p:W′p≤q}≠∅\{p : W'p\le q\}\neq\emptyset{p:W′p≤q}=∅ for all q∈Rdq\in\mathbb R^dq∈Rd), αk≥0\alpha_k\ge0αk​≥0 for all kkk, and Assumption 4: QQQ is symmetric and the covariance matrix Q−μμ′Q-\mu\mu'Q−μμ′ is positive definite. Then the moment problem

Z(x)=sup⁡P∈PEP[U(Q(q~,x))]Z(x)=\sup_{P\in\mathcal P}\mathbb E_P\big[\mathbb U(\mathcal Q(\tilde q,x))\big]Z(x)=P∈Psup​EP​[U(Q(q~​,x))]

and its dual (6),

ZD(x)=min⁡Y,y,y0 Q⋅Y+μ′y+y0s.t.q′Yq+q′y+y0≥U(Q(q,x))  ∀q∈Rd,Z_D(x)=\min_{Y,y,y_0}\ Q\cdot Y+\mu'y+y_0\quad\text{s.t.}\quad q'Yq+q'y+y_0\ge\mathbb U(\mathcal Q(q,x))\ \ \forall q\in\mathbb R^d,ZD​(x)=Y,y,y0​min​ Q⋅Y+μ′y+y0​s.t.q′Yq+q′y+y0​≥U(Q(q,x))  ∀q∈Rd,

have the same finite optimal value:

  1. the set of values EP[U(Q(q~,x))]\mathbb E_P[\mathbb U(\mathcal Q(\tilde q,x))]EP​[U(Q(q~​,x))], P∈PP\in\mathcal PP∈P, is nonempty and bounded above, with supremum Z(x)Z(x)Z(x);
  2. the set of objective values of feasible points of (6) is nonempty and bounded below, with infimum ZD(x)Z_D(x)ZD​(x);
  3. Z(x)=ZD(x)Z(x)=Z_D(x)Z(x)=ZD​(x).

The paper obtains this from the strong duality theory of the moment problem (Isii), the interior condition being Assumption 4. It is the step Z(x)=ZD(x)Z(x)=Z_D(x)Z(x)=ZD​(x) in the final chain of the proof of Theorem 2.2.

Formalization Note The interior condition "the moment vector lies in the interior of the set of feasible moment vectors" is read as Assumption 4. The printed min of (6) is read as an infimum; attainment is not claimed. The same statement appears in the companion mission on Theorem 2.1.

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

/-- §2.1 (p. 583): strong duality `Z(x) = Z_D(x)` between the moment problem (5) and its dual
(6), under Assumption 4 (`Q − μμ′ ≻ 0`, the interior condition). Both optimal values are genuine:
the primal values are bounded above with least upper bound `Z(x)`, the dual values bounded below
with greatest lower bound `Z_D(x)`. -/
theorem strong_duality {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) :
    IsLUB (MinimaxSLP.ObjSDP.primalValues W T h α β μ Q x) (MinimaxSLP.ObjSDP.Zx W T h α β μ Q x) ∧
    IsGLB (MinimaxSLP.ObjSDP.dualValues6 W T h α β μ Q x) (MinimaxSLP.ObjSDP.ZD W T h α β μ Q x) ∧
    MinimaxSLP.ObjSDP.Zx W T h α β μ Q x = MinimaxSLP.ObjSDP.ZD 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. 583, §2.1 (strong duality, citing Isii)
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