Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(D.3), p. 36 — a feasible affine policy on arc (i, j) is the constant P_{(i,j),i} + q_{ij} = 0 off its own node

Proved
BudgetedAffine.NetworkGap.eq_D_3

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. Let (x, y(h)=Ph+q)(x,\,y(h)=Ph+q)(x,y(h)=Ph+q) be any feasible affine solution, where PPP has one row per arc (i,j)∈J1×J2(i,j)\in J_1\times J_2(i,j)∈J1​×J2​ and one column per node, so that

yij(h)=∑ℓ=1mP(i,j),ℓ hℓ+qij.y_{ij}(h)=\sum_{\ell=1}^m P_{(i,j),\ell}\,h_\ell+q_{ij}.yij​(h)=ℓ=1∑m​P(i,j),ℓ​hℓ​+qij​.

Then xi=1x_i=1xi​=1 for every i∈J1i\in J_1i∈J1​, and for every i∈J1i\in J_1i∈J1​ and j∈J2j\in J_2j∈J2​

P(i,j),i+qij=0andP(i,j),ℓ=0for every node ℓ≠i.(D.3)P_{(i,j),i}+q_{ij}=0\qquad\text{and}\qquad P_{(i,j),\ell}=0\quad\text{for every node }\ell\ne i. \tag{D.3}P(i,j),i​+qij​=0andP(i,j),ℓ​=0for every node ℓ=i.(D.3)

In words: no inventory can be shipped out of a J1J_1J1​ node whose own demand is 111, and an affine policy can only respect this on all such scenarios if the flow on arc (i,j)(i,j)(i,j) depends on hih_ihi​ alone and vanishes at hi=1h_i=1hi​=1. This rigidity is what forces affine policies to pay on J2J_2J2​.

Formalization Note The hypothesis k≥2k\ge 2k≥2 (m≥4m\ge 4m≥4) is added and necessary. For k=1k=1k=1 the only scenario with hi=1h_i=1hi​=1 is eie_iei​, and (D.3) fails: x=(1,12)x=(1,\tfrac12)x=(1,21​), y(h)=1−hJ1−12hJ2y(h)=1-h_{J_1}-\tfrac12h_{J_2}y(h)=1−hJ1​​−21​hJ2​​ is a feasible affine solution with P(1,1),J2=−12≠0P_{(1,1),J_2}=-\tfrac12\ne0P(1,1),J2​​=−21​=0. The paper's "xi=1x_i=1xi​=1 for all i∈J1i\in J_1i∈J1​" is derived from (D.2) at h=eih=e_ih=ei​ and the capacity xi≤1x_i\le1xi​≤1. Lean indices are 0-based; PPP has rows indexed by the arcs J1×J2J_1\times J_2J1​×J2​, the only arcs of finite distance.

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

/-- App. D, p. 36, (D.3): for `k ≥ 2` (`m ≥ 4`), every feasible affine solution
`(x, y(h) = P h + q)` of the family (7.2) has `x_i = 1` on `J₁`, and for every arc `(i, j)`
`P_{(i,j),i} + q_{ij} = 0` and `P_{(i,j),ℓ} = 0` for every node `ℓ ≠ i`. -/
theorem eq_D_3 (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)) :
    (∀ i, x (Sum.inl i) = 1) ∧
      ∀ i j, P (i, j) (Sum.inl i) + q (i, j) = 0 ∧
        ∀ v, v ≠ Sum.inl i → P (i, j) v = 0 := by sorry

end BudgetedAffine.NetworkGap
Source
El Housni, Goyal, On the Optimality of Affine Policies for Budgeted Uncertainty Sets, arXiv:1807.00163v2, App. D, eq. (D.3) and the paragraph before it, p. 36
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