Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 36 — weak duality for the inner LP (C-17) against the dual (4b), (4d)

Proved
DDMomentDRO.Type1.weak_duality_C17

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

distributionally-robustlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-duality

Fix a stage of the Bellman equation (2) under the Type 1 ambiguity set PD1(x)\mathcal P^{D_1}(x)PD1​(x) of (3) (with p≥0p\ge0p≥0, as in (C-17f)), and a state xxx. Let p∈PD1(x)p\in\mathcal P^{D_1}(x)p∈PD1​(x), and let α,β∈Rm\alpha,\beta\in\mathbb R^mα,β∈Rm, γ‾,γˉ∈RK\underline\gamma,\bar\gamma\in\mathbb R^Kγ​,γˉ​∈RK be nonnegative with

(−α+β)Tf(ξk)−γ‾k+γˉk ≥ Qt+1(x,ξk)for every k∈[K].(-\alpha+\beta)^{\mathsf T} f(\xi^k)-\underline\gamma_k+\bar\gamma_k\ \ge\ Q_{t+1}(x,\xi^k)\qquad\text{for every }k\in[K].(−α+β)Tf(ξk)−γ​k​+γˉ​k​ ≥ Qt+1​(x,ξk)for every k∈[K].

Then

∑k=1Kpk Qt+1(x,ξk) ≤ −αTl(x)+βTu(x)−γ‾Tp‾(x)+γˉTpˉ(x).\sum_{k=1}^K p_k\,Q_{t+1}(x,\xi^k)\ \le\ -\alpha^{\mathsf T}l(x)+\beta^{\mathsf T}u(x)-\underline\gamma^{\mathsf T}\underline p(x)+\bar\gamma^{\mathsf T}\bar p(x).k=1∑K​pk​Qt+1​(x,ξk) ≤ −αTl(x)+βTu(x)−γ​Tp​(x)+γˉ​Tpˉ​(x).

This is the weak half of the LP duality between the inner maximization (C-17) of (2) and the dual whose constraints are (4b), (4d): every dual feasible point bounds the worst-case expectation from above.

Formalization Note The stage set SSS and the binary-state hypothesis are carried as standing binders of the mission; the statement does not depend on them.

Preamble
import Mathlib
import Definitions.Def_DDMomentDRO_Type1_Setting
Formal statement
namespace DDMomentDRO.Type1

open Matrix

/-- Weak duality for the inner LP (C-17) of the Bellman equation (2) under the Type 1 set (3):
for a state `x`, every `p` in the ambiguity set and every dual point `(α, β, γ̲, γ̄)` satisfying
(4b), (4d) at `x`, `∑ₖ pₖ Q_{t+1}(x, ξᵏ) ≤ −αᵀl(x) + βᵀu(x) − γ̲ᵀp̲(x) + γ̄ᵀp̄(x)`. -/
theorem weak_duality_C17 {I J K m : ℕ}
    (S : Set ((Fin I → ℝ) × (Fin I → Fin J → ℝ)))
    (hbin : ∀ p ∈ S, ∀ i, p.1 i = 0 ∨ p.1 i = 1)
    (Qn : (Fin I → ℝ) → Fin K → ℝ) (ξ : Fin K → Fin J → ℝ) (e : Fin m → Fin J → ℕ)
    (l u : (Fin I → ℝ) → Fin m → ℝ) (pl pu : (Fin I → ℝ) → Fin K → ℝ)
    (x : Fin I → ℝ) (p : Fin K → ℝ) (hp : p ∈ amb1 ξ e l u pl pu x)
    (α β : Fin m → ℝ) (γl γu : Fin K → ℝ) (hdual : DualFeas1 Qn ξ e x α β γl γu) :
    ∑ k, p k * Qn x k ≤ -(α ⬝ᵥ l x) + β ⬝ᵥ u x - γl ⬝ᵥ pl x + γu ⬝ᵥ pu x := by sorry

end DDMomentDRO.Type1
Source
Yu & Shen, Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets, arXiv:2002.12518v3, p. 36, proof of Theorem 1, (C-17)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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