Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. D, p. 37 — every feasible affine solution stocks ≥ m/2 − 1 on J₂, so z_Aff ≥ m/2 − 1

Proved
BudgetedAffine.NetworkGap.affine_lower_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. Every feasible affine solution (x, y(h)=Ph+q)(x,\,y(h)=Ph+q)(x,y(h)=Ph+q) satisfies

∑j∈J2xj ≥ m2−1=k−1,\sum_{j\in J_2}x_j\ \ge\ \frac m2-1=k-1,j∈J2​∑​xj​ ≥ 2m​−1=k−1,

and consequently every affine objective value ttt (a number with ∑icixi+∑ijdijyij(h)≤t\sum_i c_ix_i+\sum_{ij}d_{ij}y_{ij}(h)\le t∑i​ci​xi​+∑ij​dij​yij​(h)≤t for all h∈Uh\in\mathcal Uh∈U, for some feasible affine solution) satisfies t≥m/2−1t\ge m/2-1t≥m/2−1:

zAff(U) ≥ ∑j=1mcjxj=∑j∈J2xj ≥ m2−1.z_{Aff}(\mathcal U)\ \ge\ \sum_{j=1}^m c_jx_j=\sum_{j\in J_2}x_j\ \ge\ \frac m2-1 .zAff​(U) ≥ j=1∑m​cj​xj​=j∈J2​∑​xj​ ≥ 2m​−1.

This is the lower half of the affine value in Lemma 7.1.

Formalization Note The statement holds for every kkk (for k≤1k\le1k≤1 it reduces to x≥0x\ge0x≥0, resp. to the non-negativity of the cost), so no hypothesis on kkk is added. Lean indices are 0-based; m/2−1m/2-1m/2−1 is the real number k−1k-1k−1, never a natural-number subtraction.

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

/-- App. D, p. 37: every feasible affine solution `(x, y(h) = P h + q)` of the family (7.2)
stocks at least `m/2 − 1 = k − 1` units on `J₂`, and hence `k − 1` is a lower bound for
the objective value of every affine solution: `z_Aff(U) ≥ m/2 − 1`. -/
theorem affine_lower_bound (k : ℕ) :
    (∀ (x : Node k → ℝ) (P : Matrix (Arc k) (Node k) ℝ) (q : Arc k → ℝ),
        (lotSizingFamily k).Feasible x (LotSizing.affinePolicy P q) →
          (k : ℝ) - 1 ≤ ∑ j, x (Sum.inr j)) ∧
      (k : ℝ) - 1 ∈ lowerBounds (lotSizingFamily k).affineValues := 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 "Therefore, Σ_{j∈J2} xj + Σ_{j∈J2} qℓj ≥ m/2" to "zAff ≥ Σ cjxj = Σ_{j∈J2} xj ≥ m/2 − 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