Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, PDF p. 17 — for the instance ℐ of (19), z_Adapt(𝒰) ≤ 1

Proved
AffinePolicies.LargeGap.lemma_4

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

adaptive-optimizationaffine-policiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let δ>0\delta>0δ>0 and let mmm satisfy mδ>200m^\delta>200mδ>200 (condition (18)). For the instance I\mathcal II of (19) — c=0c=0c=0, d=ed=ed=e, A=0A=0A=0, BBB with unit diagonal and off-diagonal entries θ0=m−(1−δ)/2\theta_0=m^{-(1-\delta)/2}θ0​=m−(1−δ)/2, and U\mathcal UU the convex hull of 000, the unit vectors eje_jej​, e/me/\sqrt me/m​ and the vectors θ01S\theta_0\mathbf 1_Sθ0​1S​ with ∣S∣=⌈m1−δ⌉|S|=\lceil m^{1-\delta}\rceil∣S∣=⌈m1−δ⌉ — there is a feasible fully-adaptable solution (x,y)(x,y)(x,y) whose worst-case cost is at most 111; consequently

zAdapt(U)≤1.z_{\mathrm{Adapt}}(\mathcal U)\le 1 .zAdapt​(U)≤1.

This upper bound on the fully-adaptable optimum is one half of the large gap of Theorem 3.

Formalization Note The existence of a feasible solution of cost at most 111 is stated explicitly, so that the bound is not satisfied by the junk value of an empty infimum. The paper's own witness (y=by=by=b at 0,ej0,e_j0,ej​ and y=1mey=\frac1m ey=m1​e at the other generators) relies on m(1−δ)/2≥1m^{(1-\delta)/2}\ge 1m(1−δ)/2≥1, i.e. δ≤1\delta\le 1δ≤1; the statement is kept for every δ>0\delta>0δ>0, as on the page.

Preamble
import Mathlib
import Definitions.Def_AffinePolicies_LargeGap_Setting
Formal statement
namespace AffinePolicies.LargeGap

theorem lemma_4 (δ : ℝ) (hδ : 0 < δ) (m : ℕ) (hm : 200 < (m : ℝ) ^ δ) :
    (∃ (x : Fin m → ℝ) (y : (Fin m → ℝ) → Fin m → ℝ),
        AffinePolicies.Simplex.Feasible (A19 m) (B19 m δ) (U19 m δ) x y ∧ AffinePolicies.Simplex.CostLE (c19 m) (d19 m) (U19 m δ) x y 1) ∧
      AffinePolicies.Simplex.zAdapt (A19 m) (B19 m δ) (c19 m) (d19 m) (U19 m δ) ≤ 1 := by sorry

end AffinePolicies.LargeGap
Source
Bertsimas & Goyal, On the power and limitations of affine policies in two-stage adaptive optimization, Math. Program. Ser. A, DOI 10.1007/s10107-011-0444-4, Lemma 4, PDF p. 17
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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