Theorem 3.3, p. 590 — with random right-hand side and known dual extreme points, a distribution in 𝒫 attains Ẑ(x) = Ẑ_DD(x)
ProvedMinimaxSLP.RhsExtremal.theorem_3_3Consider the two-stage minimax stochastic linear program with random right-hand side and constant objective , with second-stage cost , disutility with , and moment class . Assume
- complete recourse: (Assumption 2);
- (Assumption 3 at the constant );
- is symmetric and (Assumption 4);
- are the extreme points of (Assumption 5).
Theorem 3.3. For an arbitrary , there exists an extremal distribution in that achieves the optimal value . Precisely, there is such that is integrable under every and
the value is the attained maximum of (16), and
The worst-case distribution is therefore a genuine member of the moment class, not only a limit, and it can be written down from an optimal solution of the semidefinite program (16) as a finite mixture of normal distributions.
Formalization Note As printed, Assumption 2 and Assumption 3 "for all " contradict each other when ; the §3 reading uses complete recourse and dual feasibility at the one constant . Assumption 1 ( bounded and nonempty) is not used and is omitted; is kept as printed. No strong-duality hypothesis is made: the proof does not need one. The maximality over is stated directly, so the claim does not depend on junk values of sSup.
import Mathlib import Definitions.Def_MomentDRO_Conf_Setting import Definitions.Def_MinimaxSLP_RhsExtremal_Model
namespace MinimaxSLP.RhsExtremal
open MeasureTheory Matrix
/-- Theorem 3.3, p. 590. Under Assumptions 2 (complete recourse), 3 (at the constant `q`),
4 and 5, and `α_k ≥ 0`, for an arbitrary `x ∈ MinimaxSLP.ObjSDP.X` there is a distribution `P ∈ 𝒫` that attains
the optimal value `Ẑ(x)`: `𝕌(𝒬(·, x))` is integrable under every `P′ ∈ 𝒫` and
`E_{P′}[𝕌(𝒬(h̃, x))] ≤ E_P[𝕌(𝒬(h̃, x))]`; moreover `E_P[𝕌(𝒬(h̃, x))]` is the attained maximum
of (16), and `E_P[𝕌(𝒬(h̃, x))] = Ẑ(x) = Ẑ_DD(x)`. -/
theorem theorem_3_3 {m₁ n r d K N : ℕ} [NeZero K]
(A : Matrix (Fin m₁) (Fin n) ℝ) (b : Fin m₁ → ℝ)
(W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (q : Fin d → ℝ)
(α β : Fin K → ℝ) (μ : Fin r → ℝ) (Q : Matrix (Fin r) (Fin r) ℝ)
(ps : Fin N → Fin r → ℝ)
(hα : ∀ k, 0 ≤ α k)
(hA2 : ∀ z : Fin r → ℝ, ∃ w : Fin d → ℝ, 0 ≤ w ∧ W *ᵥ w = z)
(hA3 : ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
(hQ : Q.IsSymm) (hA4 : (Q - Matrix.vecMulVec μ μ).PosDef)
(hA5 : Set.range ps = Set.extremePoints ℝ {π : Fin r → ℝ | Wᵀ *ᵥ π ≤ q})
(x : Fin n → ℝ) (hx : x ∈ MinimaxSLP.ObjSDP.X A b) :
∃ P ∈ MinimaxSLP.ObjSDP.momentClass μ Q,
(∀ P' ∈ MinimaxSLP.ObjSDP.momentClass μ Q,
Integrable (fun h => MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x)) P' ∧
∫ h, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x) ∂P' ≤ ∫ h, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x) ∂P) ∧
IsGreatest (obj16 T α β ps x '' feasible16 K N μ Q)
(∫ h, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x) ∂P) ∧
MinimaxSLP.RhsSDP.Zhat W T q α β μ Q x = ∫ h, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x) ∂P ∧
ZhatDD T α β ps μ Q x = ∫ h, MinimaxSLP.ObjSDP.disutility α β (MinimaxSLP.RhsSDP.Qval W T q h x) ∂P := by sorry
end MinimaxSLP.RhsExtremal
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.