Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 (primal half) — the SDP (3.14) conservatively approximates 𝒮𝒫^u, and val 𝒮𝒫^u = val (3.14) for l = 1

Proved
PrimalDualLDR.RandomRecourse.theorem_2_primal

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

linear-decision-rulesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsemidefinite-programmingstochastic-programming

Let P\mathbb PP be a probability measure on Rk\mathbb R^kRk whose support is the quadratically constrained set

Ξ={ξ∈Rk: e1⊤ξ=1, ξ⊤Wℓξ≥0, ℓ=1,…,l}(3.11)\Xi=\big\{\xi\in\mathbb R^k:\ e_1^\top\xi=1,\ \xi^\top W_\ell\xi\ge0,\ \ell=1,\dots,l\big\}\qquad(3.11)Ξ={ξ∈Rk: e1⊤​ξ=1, ξ⊤Wℓ​ξ≥0, ℓ=1,…,l}(3.11)

with symmetric W1,…,WlW_1,\dots,W_lW1​,…,Wl​, and assume Ξ\XiΞ is nonempty, bounded and spans Rk\mathbb R^kRk. Consider the one-stage stochastic program SP\mathcal{SP}SP with costs c(ξ)=Cξc(\xi)=C\xic(ξ)=Cξ, right-hand side b(ξ)=Bξb(\xi)=B\xib(ξ)=Bξ and random recourse matrix A(ξ)A(\xi)A(ξ) with rows ξ⊤Aμ\xi^\top A_\muξ⊤Aμ​; its primal linear decision rule approximation SPu\mathcal{SP}^uSPu (decisions XξX\xiXξ, slacks ξ⊤Sμξ\xi^\top S_\mu\xiξ⊤Sμ​ξ); and the SDP (3.14), both with objective Tr⁡(MC⊤X)\operatorname{Tr}(MC^\top X)Tr(MC⊤X), M=E(ξξ⊤)M=\mathbb E(\xi\xi^\top)M=E(ξξ⊤). Then:

  1. (3.14) conservatively approximates SPu\mathcal{SP}^uSPu. Every (X,S,Λ)(X,S,\Lambda)(X,S,Λ) feasible in (3.14) yields (X,S)(X,S)(X,S) feasible in SPu\mathcal{SP}^uSPu with the same objective value; hence
val⁡SPu≤val⁡(3.14).\operatorname{val}\mathcal{SP}^u\le\operatorname{val}(3.14).valSPu≤val(3.14).
  1. Exactness for one quadratic constraint. If l=1l=1l=1 and SP\mathcal{SP}SP is strictly feasible, then SPu\mathcal{SP}^uSPu is equivalent to (3.14):
val⁡SPu=val⁡(3.14).\operatorname{val}\mathcal{SP}^u=\operatorname{val}(3.14).valSPu=val(3.14).

The result turns the semi-infinite program SPu\mathcal{SP}^uSPu, an upper bound on the stochastic program SP\mathcal{SP}SP, into a semidefinite program of size polynomial in k,l,m,nk,l,m,nk,l,m,n, whose value is an upper bound on SPu\mathcal{SP}^uSPu in general and equal to it when the support is cut out by a single quadratic inequality (an ellipsoid in the hyperplane e1⊤ξ=1e_1^\top\xi=1e1⊤​ξ=1).

Formalization Note This is the primal half of the paper's Theorem 2. The clauses "the SDP (3.18) progressively approximates SPl\mathcal{SP}^lSPl" and, for l=1l=1l=1, "SPl\mathcal{SP}^lSPl is equivalent to (3.18)" are false in this preprint (a strictly feasible instance with l=1l=1l=1 has val⁡(3.18)≈1.170>ln⁡3=val⁡SP≥val⁡SPl\operatorname{val}(3.18)\approx1.170>\ln3=\operatorname{val}\mathcal{SP}\ge\operatorname{val}\mathcal{SP}^lval(3.18)≈1.170>ln3=valSP≥valSPl) and are not stated; the claim that the SDP sizes are polynomial and efficiently solvable is informal and omitted. Optimal values are EReal infima (+∞+\infty+∞ if infeasible, −∞-\infty−∞ if unbounded). "Equivalent" is read as equality of optimal values. Strict feasibility of SP\mathcal{SP}SP is condition (2.9) of §2 with AAA replaced by A(ξ)A(\xi)A(ξ); it is kept in clause 2 as printed.

Preamble
import Mathlib
import Definitions.Def_PrimalDualLDR_RandomRecourse_Problems

open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.RandomRecourse

/-- **Kuhn, Wiesemann, Georghiou (preprint 2009), Theorem 2, p. 17 — primal half.** If `P` has a
quadratically constrained support `Ξ` of the type (3.11) (nonempty, bounded, spanning `ℝ^k`), then
(a) the SDP (3.14) conservatively approximates `𝒮𝒫^u`: every `(X, S, Λ)` feasible in (3.14)
gives `(X, S)` feasible in `𝒮𝒫^u` with the same objective `Tr(MCᵀX)`, hence
`val 𝒮𝒫^u ≤ val (3.14)`; and
(b) if `l = 1` and `𝒮𝒫` is strictly feasible, then `𝒮𝒫^u` is equivalent to (3.14):
`val 𝒮𝒫^u = val (3.14)`.

The clauses of Theorem 2 about the SDP (3.18) and `𝒮𝒫^l` are not stated (false in this
preprint); "polynomial size / efficiently solvable" is informal and omitted. -/
theorem theorem_2_primal (σ : Setting) (hσ : σ.Standing) :
    (∀ (X : Matrix (Fin σ.n) (Fin σ.k) ℝ) (S : Fin σ.m → Matrix (Fin σ.k) (Fin σ.k) ℝ)
        (Λ : Matrix (Fin σ.m) (Fin σ.l) ℝ), σ.Feas314 X S Λ → σ.FeasSPu X S) ∧
      σ.valSPu ≤ σ.valSDP314 ∧
      (σ.l = 1 → σ.StrictlyFeasible → σ.valSPu = σ.valSDP314) := 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. 17, Theorem 2 (clauses on (3.14) and SP^u)
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