Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 13 — x⋆ = max{Σᵢ max{ξᵢ, 1 − ξᵢ} : Aξ ≤ b} is the unique optimal decision of (11)

Proved
SPHardness.IntFeas.xStar_optimal

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

integer-feasibilityoptimal-solutionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-recoursestochastic-programming

Let (A,b)(A,b)(A,b) be an instance of the Integer Feasibility Problem, so {y∈Rn:Ay≤b}⊆[0,1]n\{y\in\mathbb R^n:Ay\le b\}\subseteq[0,1]^n{y∈Rn:Ay≤b}⊆[0,1]n, and assume the polytope {ξ∈Rn:Aξ≤b}\{\xi\in\mathbb R^n : A\xi\le b\}{ξ∈Rn:Aξ≤b} is nonempty. Let

x⋆=max⁡{∑i=1nmax⁡{ξi,1−ξi}:Aξ≤b}.x^\star=\max\Big\{\sum_{i=1}^n\max\{\xi_i,1-\xi_i\} : A\xi\le b\Big\}.x⋆=max{i=1∑n​max{ξi​,1−ξi​}:Aξ≤b}.

Then

  1. a decision xxx is feasible for problem (11) if and only if x≥x⋆x\ge x^\starx≥x⋆;
  2. x⋆x^\starx⋆ attains the optimal value: x⋆+E[Q(x⋆,ξ~)]=f⋆x^\star+\mathbb E[Q(x^\star,\tilde\xi)]=f^\starx⋆+E[Q(x⋆,ξ~​)]=f⋆;
  3. x⋆x^\starx⋆ is the only feasible decision attaining f⋆f^\starf⋆.

The optimal decision of the stochastic program thus encodes the largest value of a separable function over the IFP polytope, which is how the program carries the combinatorial information of the instance.

Formalization Note. Feasibility of xxx in (11) is robust: the second stage must be feasible for every ξ∈[0,1]n\xi\in[0,1]^nξ∈[0,1]n. Under an almost-sure reading of feasibility the statement fails when the polytope is Lebesgue-null (every x≥0x\ge0x≥0 would then be feasible), so the robust reading is the one under which the page's claim holds. The page's ∑i=1m\sum_{i=1}^m∑i=1m​ is read as ∑i=1n\sum_{i=1}^n∑i=1n​. The nonemptiness of the polytope is the page's own assumption ("Assuming that {ξ∈Rn:Aξ≤b}≠∅\{\xi\in\mathbb R^n : A\xi\le b\}\ne\emptyset{ξ∈Rn:Aξ≤b}=∅").

Preamble
import Mathlib
import Definitions.Def_SPHardness_IntFeas_Model

open MeasureTheory
Formal statement
namespace SPHardness.IntFeas

theorem xStar_optimal {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℤ) (b : Fin m → ℤ)
    (hinst : IsIFPInstance A b) (hne : ∃ ξ : Fin n → ℝ, InPolytope A b ξ) :
    (∀ x, FirstStageFeasible A b x ↔ xStar A b ≤ x) ∧
    objective A b (xStar A b) = optValue A b ∧
    ∀ x, FirstStageFeasible A b x → objective A b x = optValue A b → x = xStar A b := by sorry

end SPHardness.IntFeas
Source
Hanasusanto, Kuhn & Wiesemann, A comment on "computational complexity of stochastic programming problems", Optimization Online preprint 2015/03/4825 (version of October 6, 2015), §3, proof of Theorem 4, p. 13
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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