§2.1, p. 583 — weak duality for the moment problem (5) and its dual (6)
ProvedMinimaxSLP.ObjSDP.weak_dualityLet , , , and let with for all . Assume that for every (Assumption 3), and let have a nonempty recourse set . Then for every distribution in the moment class of (4) (mean , second-moment matrix ) and every feasible point of the dual (6),
Taking the supremum over and the infimum over gives .
This is the easy half of the duality between the moment problem and its semi-infinite dual; it bounds the worst-case expected disutility by any feasible dual objective.
Formalization Note The inequality is stated pointwise, between every element of the set of primal values and every element of the set of dual values, so that it does not depend on how sSup/sInf treat empty or unbounded sets. Integrability of under is part of what has to be proved, not a hypothesis.
import Mathlib import Definitions.Def_MomentDRO_Conf_Setting import Definitions.Def_MinimaxSLP_ObjSDP_Model open MeasureTheory Matrix
namespace MinimaxSLP.ObjSDP
/-- §2.1 (p. 583): weak duality `Z(x) ≤ Z_D(x)` between the moment problem (5) and its dual (6),
in pointwise form: for every distribution `P` in the moment class (4) and every feasible point
`(Y, y, y₀)` of (6), `E_P[𝕌(𝒬(q̃, x))] ≤ Q · Y + μ′y + y₀`. -/
theorem weak_duality {n r d K : ℕ} [NeZero K]
(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) ℝ)
(hA3 : ∀ q : Fin d → ℝ, ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
(x : Fin n → ℝ) (hrec : (recourseSet W T h x).Nonempty) :
∀ v ∈ primalValues W T h α β μ Q x, ∀ u ∈ dualValues6 W T h α β μ Q x, v ≤ u := by sorry
end MinimaxSLP.ObjSDP
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.