Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4 — if SP\mathcal{SP}SP is strictly feasible (2.9), (2.6) and (2.8) have the same optimal value

Proved
PrimalDualLDR.FixedRecourse.proposition_4

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Assume the standing assumptions of §2, and suppose that SP\mathcal{SP}SP is strictly feasible: there are ε>0\varepsilon > 0ε>0 and decision rules xˉ∈Lk,n2\bar x \in \mathcal L^2_{k,n}xˉ∈Lk,n2​, sˉ∈Lk,m2\bar s \in \mathcal L^2_{k,m}sˉ∈Lk,m2​ with

Axˉ(ξ)+sˉ(ξ)=b(ξ)andsˉ(ξ)≥εeP-a.s.,(2.9)A\bar x(\xi) + \bar s(\xi) = b(\xi)\quad\text{and}\quad \bar s(\xi) \ge \varepsilon e\qquad\mathbb P\text{-a.s.},\tag{2.9}Axˉ(ξ)+sˉ(ξ)=b(ξ)andsˉ(ξ)≥εeP-a.s.,(2.9)

where e∈Rme \in \mathbb R^me∈Rm is the all-ones vector. Then the optimal values of problem (2.6) and of the linear program (2.8),

min⁡X,S Tr⁡(MC⊤X)  s.t.  AX+S=B,  (W−he1⊤)MS⊤≥0,\min_{X,S}\ \operatorname{Tr}(MC^\top X)\ \ \text{s.t.}\ \ AX+S=B,\ \ (W-he_1^\top)MS^\top\ge0,X,Smin​ Tr(MC⊤X)  s.t.  AX+S=B,  (W−he1⊤​)MS⊤≥0,

coincide (as elements of [−∞,+∞][-\infty,+\infty][−∞,+∞]).

Without strict feasibility the two values only bracket each other through Proposition 3; strict feasibility removes the gap, and with the §2.4 reformulation this identifies the dual approximation SPl\mathcal{SP}^lSPl with a linear program.

Formalization Note Repaired statement: the formal statement adds the hypothesis W^≠0\widehat W \ne 0W=0 (some row i≥3i \ge 3i≥3 of WWW, 1-based, is nonzero), which the paper does not state. Without it the printed proposition is false: for k=1k = 1k=1, l=2l = 2l=2, W=(1,−1)⊤W = (1,-1)^\topW=(1,−1)⊤, h=(1,−1)⊤h = (1,-1)^\toph=(1,−1)⊤, P=δ1\mathbb P = \delta_1P=δ1​, n=m=1n = m = 1n=m=1, A=B=1A = B = 1A=B=1, C=−1C = -1C=−1, problem SP\mathcal{SP}SP is strictly feasible (xˉ=0\bar x = 0xˉ=0, sˉ(ξ)=ξ\bar s(\xi) = \xisˉ(ξ)=ξ), W−he1⊤=0W - he_1^\top = 0W−he1⊤​=0 so (2.8) has no sign constraint on SSS and value −∞-\infty−∞, while (2.6) forces S≥0S \ge 0S≥0 and has value −1-1−1. Under the standing assumptions W^≠0\widehat W \ne 0W=0 holds automatically when k≥2k \ge 2k≥2. Optimal values are infima in [−∞,+∞][-\infty, +\infty][−∞,+∞].

Preamble
import Mathlib
import Definitions.Def_PrimalDualLDR_FixedRecourse_Basic
import Definitions.Def_PrimalDualLDR_FixedRecourse_Setting
import Definitions.Def_PrimalDualLDR_FixedRecourse_Problems

open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.FixedRecourse

/-- Proposition 4 (p. 9): under the standing assumptions of §2, if `SP` is strictly feasible (2.9),
then the optimal values of (2.6) and (2.8) coincide.

Repair (trap 30): the hypothesis `hW` says `Ŵ ≠ 0` (some row `i ≥ 2` of `W` is nonzero; rows
`0`, `1` are `±e_1ᵀ`). The page omits it, and the printed statement is false without it: for
`k = 1`, `l = 2`, `W = (1, −1)ᵀ`, `h = (1, −1)`, `P = δ_1`, the matrix `W − h e_1ᵀ` is `0`, so
`𝒦 = ℝ` while `𝒦_P = [0, ∞)`; with `n = m = 1`, `A = B = 1`, `C = −1` (strictly feasible with
`x̄ = 0`, `s̄(ξ) = ξ`) the program (2.8) loses `S ≥ 0` and has value `−∞`, while (2.6) and `SP^l`
have value `−1`. Under the standing assumptions `Ŵ ≠ 0` is automatic when `k ≥ 2`. -/
theorem proposition_4 (σ : Setting) (hσ : σ.Standing)
    (hW : ∃ i : Fin σ.l, 2 ≤ i.val ∧ σ.W i ≠ 0) (hsf : σ.StrictlyFeasible) :
    σ.valLP26 = σ.valLP28 := by sorry

end PrimalDualLDR.FixedRecourse
Source
Kuhn, Wiesemann, Georghiou, Primal and dual linear decision rules in stochastic and robust optimization, Optimization Online 2009/02/2218, p. 9, Proposition 4, (2.9)
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