Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6 — an S-lemma certificate S − Σ λ_ℓ W_ℓ ⪰ 0 implies ξᵀSξ ≥ 0 P-a.s.; the converse holds for l = 1

Proved
PrimalDualLDR.RandomRecourse.proposition_6

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizations-lemmasemidefinite-programming

Assume the standing assumptions of §3: Ξ={ξ: e1⊤ξ=1, ξ⊤Wℓξ≥0, ℓ=1,…,l}\Xi=\{\xi:\ e_1^\top\xi=1,\ \xi^\top W_\ell\xi\ge0,\ \ell=1,\dots,l\}Ξ={ξ: e1⊤​ξ=1, ξ⊤Wℓ​ξ≥0, ℓ=1,…,l} with symmetric W1,…,WlW_1,\dots,W_lW1​,…,Wl​ is the support of the probability measure P\mathbb PP, and it is nonempty, bounded and spans Rk\mathbb R^kRk. Fix a symmetric k×kk\times kk×k matrix SSS and consider

  1. (i) there is λ∈Rl\lambda\in\mathbb R^lλ∈Rl with λ≥0\lambda\ge0λ≥0 and S−∑ℓ=1lλℓWℓ⪰0S-\sum_{\ell=1}^l\lambda_\ell W_\ell\succeq0S−∑ℓ=1l​λℓ​Wℓ​⪰0;
  2. (ii) ξ⊤Sξ≥0\xi^\top S\xi\ge0ξ⊤Sξ≥0 P\mathbb PP-almost surely.

Then, for every lll, (i) implies (ii); and if l=1l=1l=1, (ii) implies (i):

(i)⟹(ii),l=1: (ii)⟹(i).\text{(i)}\Longrightarrow\text{(ii)},\qquad l=1:\ \text{(ii)}\Longrightarrow\text{(i)} .(i)⟹(ii),l=1: (ii)⟹(i).

Applied to each slack matrix SμS_\muSμ​, this replaces the semi-infinite inequality constraints of SPu\mathcal{SP}^uSPu by linear matrix inequalities; it is why (3.14) is a conservative approximation of SPu\mathcal{SP}^uSPu in general and an exact one when l=1l=1l=1.

Formalization Note (ii) is stated P\mathbb PP-almost surely, as printed. ⪰0\succeq0⪰0 is Mathlib's PosSemidef; λ≥0\lambda\ge0λ≥0 is componentwise.

Preamble
import Mathlib
import Definitions.Def_PrimalDualLDR_RandomRecourse_Setting

open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.RandomRecourse

/-- **Kuhn, Wiesemann, Georghiou (preprint 2009), Proposition 6, p. 12.** Under the standing
assumptions of §3, for a fixed symmetric `S ∈ 𝕊` consider
(i) `∃ λ ∈ ℝ^l, λ ≥ 0, S − Σ_ℓ λ_ℓ W_ℓ ⪰ 0`; (ii) `ξᵀSξ ≥ 0` `P`-almost surely.
For every `l`, (i) implies (ii); if `l = 1`, (ii) implies (i). -/
theorem proposition_6 (σ : Setting) (hσ : σ.Standing)
    (S : Matrix (Fin σ.k) (Fin σ.k) ℝ) (hS : S.IsSymm) :
    ((∃ lam : Fin σ.l → ℝ, (∀ ℓ, 0 ≤ lam ℓ) ∧ (S - ∑ ℓ : Fin σ.l, lam ℓ • σ.W ℓ).PosSemidef) →
        ∀ᵐ ξ ∂σ.P, 0 ≤ ξ ⬝ᵥ (S *ᵥ ξ)) ∧
      (σ.l = 1 → (∀ᵐ ξ ∂σ.P, 0 ≤ ξ ⬝ᵥ (S *ᵥ ξ)) →
        ∃ lam : Fin σ.l → ℝ, (∀ ℓ, 0 ≤ lam ℓ) ∧ (S - ∑ ℓ : Fin σ.l, lam ℓ • σ.W ℓ).PosSemidef) := by sorry

end PrimalDualLDR.RandomRecourse
Source
Kuhn, Wiesemann, Georghiou, Primal and dual linear decision rules in stochastic and robust optimization, Optimization Online 2009/02/2218, p. 12, Proposition 6
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