Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p. 271 — the R-box step, corrected: value(box) ≤ value_R(box) for all R, value(ext) ≤ value(box), value(ext) = inf_R value_R(ext)

Proved
FlexCommitRO.BoxExt.value_sandwich

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

min-maxp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsupply-chain

Let an instance of the RSFC model be given, together with demand bounds dtmin⁡≤dtmax⁡d_t^{\min} \le d_t^{\max}dtmin​≤dtmax​, t=1,…,Tt = 1,\dots,Tt=1,…,T. Write Ubox=∏t[dtmin⁡,dtmax⁡]\mathcal U_{\text{box}} = \prod_t [d_t^{\min}, d_t^{\max}]Ubox​=∏t​[dtmin​,dtmax​] and Uext=∏t{dtmin⁡,dtmax⁡}\mathcal U_{\text{ext}} = \prod_t \{d_t^{\min}, d_t^{\max}\}Uext​=∏t​{dtmin​,dtmax​}, value⁡\operatorname{value}value for the optimal value of the min-max RSFC problem (5)–(6) and value⁡R\operatorname{value}_RvalueR​ for the same problem with every decision bounded by RRR in absolute value. Then:

  1. value⁡(Ubox)≤value⁡R(Ubox)\operatorname{value}(\mathcal U_{\text{box}}) \le \operatorname{value}_R(\mathcal U_{\text{box}})value(Ubox​)≤valueR​(Ubox​) for every R∈RR \in \mathbb RR∈R;
  2. value⁡(Uext)≤value⁡(Ubox)\operatorname{value}(\mathcal U_{\text{ext}}) \le \operatorname{value}(\mathcal U_{\text{box}})value(Uext​)≤value(Ubox​);
value⁡(Uext)=inf⁡R∈Rvalue⁡R(Uext).\operatorname{value}(\mathcal U_{\text{ext}}) = \inf_{R \in \mathbb R} \operatorname{value}_R(\mathcal U_{\text{ext}}).value(Uext​)=R∈Rinf​valueR​(Uext​).

Together with the boxed equality, these give value⁡(Ubox)=value⁡(Uext)\operatorname{value}(\mathcal U_{\text{box}}) = \operatorname{value}(\mathcal U_{\text{ext}})value(Ubox​)=value(Uext​).

Formalization Note The page argues that "for an RRR large enough this restriction does not affect the optimal value". As printed this is false when the optimal value is −∞-\infty−∞, which the paper's sign-free data allow (e.g. T=1T=1T=1, β1+=−1\beta_1^+ = -1β1+​=−1, β1−=1\beta_1^- = 1β1−​=1, α1±=0\alpha_1^\pm = 0α1±​=0, L1=U1=0L_1 = U_1 = 0L1​=U1​=0: then z1=w0−w1z_1 = w_0 - w_1z1​=w0​−w1​ is unbounded below while every boxed value is finite). The statement is the corrected form, which holds for all data and is what the argument needs.

Preamble
import Mathlib
import Definitions.Def_FlexCommitRO_BoxExt_Setting
Formal statement
namespace FlexCommitRO.BoxExt

theorem value_sandwich {T : ℕ} (D : RSFCData T) (dmin dmax : Fin T → ℝ)
    (hle : ∀ t, dmin t ≤ dmax t) :
    (∀ R : ℝ, value D (fun t => Set.Icc (dmin t) (dmax t)) ≤
        valueR D (fun t => Set.Icc (dmin t) (dmax t)) R) ∧
      value D (fun t => ({dmin t, dmax t} : Set ℝ)) ≤ value D (fun t => Set.Icc (dmin t) (dmax t)) ∧
      value D (fun t => ({dmin t, dmax t} : Set ℝ)) =
        ⨅ R : ℝ, valueR D (fun t => ({dmin t, dmax t} : Set ℝ)) R := by sorry

end FlexCommitRO.BoxExt
Source
Ben-Tal, Golany, Nemirovski & Vial, Retailer-supplier flexible commitments contracts: a robust optimization approach, MSOM 7(3) (2005), p. 271, Appendix, proof of Proposition 1 (continued), "for an R large enough this restriction does not affect the optimal value"
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