Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — z⊤ξ≥0z^\top\xi\ge0z⊤ξ≥0 on Ξ\XiΞ iff some λ≥0\lambda\ge0λ≥0 has W⊤λ=zW^\top\lambda=zW⊤λ=z, h⊤λ≥0h^\top\lambda\ge0h⊤λ≥0

Proved
PrimalDualLDR.FixedRecourse.proposition_1

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let W∈Rl×kW \in \mathbb R^{l\times k}W∈Rl×k and h∈Rlh \in \mathbb R^lh∈Rl, and assume that the polyhedron Ξ={ξ∈Rk:Wξ≥h}\Xi = \{\xi \in \mathbb R^k : W\xi \ge h\}Ξ={ξ∈Rk:Wξ≥h} is nonempty. Then for every z∈Rkz \in \mathbb R^kz∈Rk the following statements are equivalent:

  1. z⊤ξ≥0z^\top\xi \ge 0z⊤ξ≥0 for all ξ∈Ξ\xi \in \Xiξ∈Ξ;
  2. there is λ∈Rl\lambda \in \mathbb R^lλ∈Rl with
λ≥0,W⊤λ=z,h⊤λ≥0.\lambda \ge 0,\qquad W^\top\lambda = z,\qquad h^\top\lambda \ge 0.λ≥0,W⊤λ=z,h⊤λ≥0.

This is the robust counterpart of a linear inequality over a polyhedral uncertainty set: a semi-infinite constraint indexed by ξ∈Ξ\xi \in \Xiξ∈Ξ is replaced by finitely many linear constraints in an auxiliary vector λ\lambdaλ. Applied to each row of SSS it turns SPu\mathcal{SP}^uSPu into the linear program (2.3), and it is also used to identify the cone K\mathcal KK in Proposition 3.

Formalization Note The statement is made for any W,hW, hW,h whose polyhedron is nonempty, not only for the support of the §2 setting: nonemptiness is the only property of Ξ\XiΞ the proposition uses (strong LP duality for a feasible primal).

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 1 (p. 5): for a nonempty polyhedron `Ξ = {ξ : Wξ ≥ h}` and any `z ∈ ℝ^k`,
`zᵀξ ≥ 0` for all `ξ ∈ Ξ` iff there is `λ ∈ ℝ^l` with `λ ≥ 0`, `Wᵀλ = z` and `hᵀλ ≥ 0`. -/
theorem proposition_1 {k l : ℕ} (W : Matrix (Fin l) (Fin k) ℝ) (h : Fin l → ℝ)
    (hne : (polyhedron W h).Nonempty) (z : Fin k → ℝ) :
    (∀ ξ ∈ polyhedron W h, 0 ≤ z ⬝ᵥ ξ) ↔
      ∃ lam : Fin l → ℝ, (∀ i, 0 ≤ lam i) ∧ Wᵀ.mulVec lam = z ∧ 0 ≤ h ⬝ᵥ lam := 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. 5, Proposition 1
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