Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, (EC.4) — the instance (EC.4) of 𝒫 has optimal value 0

Proved
KAdaptability.ConstrGap.ec4_optimal_value_zero

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

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

Let Q∈NQ\in\mathbb NQ∈N and consider the instance (EC.4) of the two-stage robust binary program P\mathcal PP: no first-stage decision, Y={0,1}Q\mathcal Y=\{0,1\}^QY={0,1}Q, zero objective, second-stage constraints yq−ξq≤12y_q-\xi_q\le\frac12yq​−ξq​≤21​ and ξq−yq≤12\xi_q-y_q\le\frac12ξq​−yq​≤21​ (q=1,…,Qq=1,\dots,Qq=1,…,Q), and uncertainty set [0,1]Q[0,1]^Q[0,1]Q (augmented by ξQ+1=1\xi_{Q+1}=1ξQ+1​=1 to make the right-hand side linear). Then

opt⁡(EC.4)=sup⁡ξ∈[0,1]Q inf⁡y∈{0,1}Q{0:yq−ξq≤12, ξq−yq≤12, q=1,…,Q}=0.\operatorname{opt}(\text{EC.4})=\sup_{\xi\in[0,1]^Q}\ \inf_{y\in\{0,1\}^Q}\{0 : y_q-\xi_q\le\tfrac12,\ \xi_q-y_q\le\tfrac12,\ q=1,\dots,Q\}=0.opt(EC.4)=ξ∈[0,1]Qsup​ y∈{0,1}Qinf​{0:yq​−ξq​≤21​, ξq​−yq​≤21​, q=1,…,Q}=0.

In words: for every realization of the parameter some binary recourse decision is feasible, so the fully adaptive problem P\mathcal PP attains the value 000 of its objective. This is the first half of the proof of Theorem 4.

Formalization Note The value is the general optimal value opt⁡(P)\operatorname{opt}(\mathcal P)opt(P) of KAdaptability.ConstrGap.Values evaluated at the instance inst Q, computed in EReal; an infeasible second stage would contribute +∞+\infty+∞.

Preamble
import Mathlib
import Definitions.Def_KAdaptability_ConstrGap_Problem
import Definitions.Def_KAdaptability_ConstrGap_Values
import Definitions.Def_KAdaptability_ConstrGap_Instance

open Matrix
Formal statement
namespace KAdaptability.ConstrGap

/-- Proof of Theorem 4, p. ec5: the two-stage robust binary program (EC.4) — the instance
`inst nQ` of 𝒫 — has optimal value `0`. -/
theorem ec4_optimal_value_zero (nQ : ℕ) : (inst nQ).optP = 0 := by sorry

end KAdaptability.ConstrGap
Source
Hanasusanto, Kuhn, Wiesemann, K-Adaptability in Two-Stage Robust Binary Programming, preprint, Optimization Online 2014/03/4294 (revision of 2015-03-30), p. ec5 (PDF p. 39), Proof of Theorem 4, (EC.4)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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