Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. D, pp. 36–37 — every feasible affine solution has x_j + q_{ℓj} ≥ 1 for ℓ ∈ J₁, j ∈ J₂

Proved
BudgetedAffine.NetworkGap.affine_cover_bound

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

affine-policieslot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Consider the family of lot-sizing instances (7.2) with m=2km=2km=2k nodes and k≥2k\ge 2k≥2, and let (x, y(h)=Ph+q)(x,\,y(h)=Ph+q)(x,y(h)=Ph+q) be any feasible affine solution. Then for every ℓ∈J1\ell\in J_1ℓ∈J1​ and every j∈J2j\in J_2j∈J2​,

xj+qℓj ≥ 1.x_j+q_{\ell j}\ \ge\ 1 .xj​+qℓj​ ≥ 1.

The bound comes from the scenario in which every node of J1J_1J1​ except ℓ\ellℓ and the single node jjj of J2J_2J2​ have unit demand; together with (D.3) it is the step that turns the rigidity of affine policies into a cost on J2J_2J2​.

Formalization Note The paper writes "for any j∈J1j\in J_1j∈J1​ and for any ℓ∈J2\ell\in J_2ℓ∈J2​"; the roles are swapped there (the scenario it uses has ℓ∈J1\ell\in J_1ℓ∈J1​, j∈J2j\in J_2j∈J2​, and qℓjq_{\ell j}qℓj​ is only defined for ℓ∈J1\ell\in J_1ℓ∈J1​, j∈J2j\in J_2j∈J2​). The statement uses ℓ∈J1\ell\in J_1ℓ∈J1​, j∈J2j\in J_2j∈J2​. The hypothesis k≥2k\ge 2k≥2 is added and necessary: for k=1k=1k=1 the feasible affine solution x=(1,0)x=(1,0)x=(1,0), y(h)=hJ2y(h)=h_{J_2}y(h)=hJ2​​ has xJ2+q=0<1x_{J_2}+q=0<1xJ2​​+q=0<1. Lean indices are 0-based.

Preamble
import Mathlib
import Definitions.Def_BudgetedAffine_NetworkGap_LotSizing
import Definitions.Def_BudgetedAffine_NetworkGap_Instance
Formal statement
namespace BudgetedAffine.NetworkGap

/-- App. D, pp. 36–37: for `k ≥ 2`, every feasible affine solution `(x, y(h) = P h + q)` of the
family (7.2) satisfies `x_j + q_{ℓj} ≥ 1` for every `ℓ ∈ J₁` and `j ∈ J₂`. -/
theorem affine_cover_bound (k : ℕ) (hk : 2 ≤ k) (x : Node k → ℝ)
    (P : Matrix (Arc k) (Node k) ℝ) (q : Arc k → ℝ)
    (hfeas : (lotSizingFamily k).Feasible x (LotSizing.affinePolicy P q)) :
    ∀ ℓ j : Fin k, 1 ≤ x (Sum.inr j) + q (ℓ, j) := by sorry

end BudgetedAffine.NetworkGap
Source
El Housni, Goyal, On the Optimality of Affine Policies for Budgeted Uncertainty Sets, arXiv:1807.00163v2, App. D, from "Now fix ℓ ∈ J1 and j ∈ J2" (p. 36) to "xj + qℓj ≥ 1" (p. 37)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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