Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. ec6 — every ξ ∈ Ξ(ℓ) lies in Ξ_ε(ℓ) for all small ε, so Ξ_ε(ℓ) ≠ ∅

Proved
KAdaptability.EpsApprox.lemma_1_nonempty

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

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

Fix a decision (x,{yk}k∈K)∈X×YK(x,\{y^k\}_{k\in\mathcal K})\in\mathcal X\times\mathcal Y^K(x,{yk}k∈K​)∈X×YK and an index vector ℓ∈L={0,…,L}K\ell\in\mathcal L=\{0,\dots,L\}^Kℓ∈L={0,…,L}K, and let Ξ(ℓ)\Xi(\ell)Ξ(ℓ) and Ξε(ℓ)\Xi_\varepsilon(\ell)Ξε​(ℓ) be the exact and the approximate uncertainty sets of problems (6) and (6ε)(6_\varepsilon)(6ε​).

For every ξˉ∈Ξ(ℓ)\bar\xi\in\Xi(\ell)ξˉ​∈Ξ(ℓ) there is ε′>0\varepsilon'>0ε′>0 such that

ξˉ∈Ξε(ℓ)for all ε∈(0,ε′].\bar\xi\in\Xi_\varepsilon(\ell)\qquad\text{for all }\varepsilon\in(0,\varepsilon'].ξˉ​∈Ξε​(ℓ)for all ε∈(0,ε′].

In particular, if Ξ(ℓ)≠∅\Xi(\ell)\ne\emptysetΞ(ℓ)=∅, then Ξε(ℓ)≠∅\Xi_\varepsilon(\ell)\ne\emptysetΞε​(ℓ)=∅ for all sufficiently small ε>0\varepsilon>0ε>0. (The paper takes ε′=min⁡{[Tx+Wyk]ℓk−[Hξˉ]ℓk:k∈K, ℓk≠0}\varepsilon'=\min\{[Tx+Wy^k]_{\ell_k}-[H\bar\xi]_{\ell_k} : k\in\mathcal K,\ \ell_k\ne0\}ε′=min{[Tx+Wyk]ℓk​​−[Hξˉ​]ℓk​​:k∈K, ℓk​=0}; when no ℓk\ell_kℓk​ is nonzero, Ξε(ℓ)=Ξ(ℓ)\Xi_\varepsilon(\ell)=\Xi(\ell)Ξε​(ℓ)=Ξ(ℓ) for every ε\varepsilonε and any ε′>0\varepsilon'>0ε′>0 works.)

This is the first step of the proof of Lemma 1 and the reason the effective domains of (6) and (6ε)(6_\varepsilon)(6ε​) agree for small ε\varepsilonε.

Preamble
import Mathlib
import Definitions.Def_KAdaptability_EpsApprox_Approx
Formal statement
namespace KAdaptability.EpsApprox

open Problem

/-- **Proof of Lemma 1, first step** (p. ec6). Fix a decision `(x, {y^k}_{k∈𝒦}) ∈ 𝒳 × 𝒴^K` and
`ℓ ∈ ℒ`. Every `ξ ∈ Ξ(ℓ)` lies in `Ξ_ε(ℓ)` for all `ε ∈ (0, ε′]`, for some `ε′ > 0`; in particular
`Ξ_ε(ℓ) ≠ ∅` for all sufficiently small `ε > 0` whenever `Ξ(ℓ) ≠ ∅`. -/
theorem lemma_1_nonempty {N M L nQ R K : ℕ} (P : Problem N M L nQ R)
    (x : Fin N → ℝ) (y : Fin K → Fin M → ℝ) (hd : P.IsDecision x y)
    (ℓ : Fin K → Fin (L + 1)) :
    ∀ ξ ∈ P.XiL x y ℓ, ∃ ε' > 0, ∀ ε ∈ Set.Ioc (0 : ℝ) ε', ξ ∈ P.XiEps ε x y ℓ := by sorry

end KAdaptability.EpsApprox
Source
Hanasusanto, Kuhn, Wiesemann, K-Adaptability in Two-Stage Robust Binary Programming, preprint, Optimization Online 2014/03/4294 (revision of 2015-03-30), p. ec6 (PDF p. 40), proof of Lemma 1, first paragraph
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