Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9.3 — discrete constant-capacity lot-sizing hull

Proved
PochetWolsey.Capacities.discrete_hull

by Shuze Chen · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-hulllot-sizingp2o-gran-per-chapterp2o-plan-bookp2o-v1production-planning

Let n≥1n\ge1n≥1, C>0C>0C>0, and 0≤dt≤C0\le d_t\le C0≤dt​≤C for 1≤t≤n1\le t\le n1≤t≤n. Write d1t=∑u=1tdud_{1t}=\sum_{u=1}^t d_ud1t​=∑u=1t​du​, and assume the discrete lot-sizing feasible set XDLS−CCX^{\mathrm{DLS-CC}}XDLS−CC is nonempty.

Then the original binary covering set has the exact convex-hull description

conv⁡(XDLS−CC)={y∈[0,1]n:∑u=1tyu≥⌈d1tC⌉(1≤t≤n)}.\operatorname{conv}(X^{\mathrm{DLS-CC}})=\left\{y\in[0,1]^n:\sum_{u=1}^t y_u\ge\left\lceil\frac{d_{1t}}C\right\rceil\quad(1\le t\le n)\right\}.conv(XDLS−CC)={y∈[0,1]n:u=1∑t​yu​≥⌈Cd1t​​⌉(1≤t≤n)}.

Thus rounded prefix inequalities and the setup bounds describe the entire hull.

Formalization Note The left-hand set is written explicitly using C∑u=1tyu≥d1tC\sum_{u=1}^t y_u\ge d_{1t}C∑u=1t​yu​≥d1t​ and binary setups. The hull is the ordinary real convex hull, without a closure operation.

Preamble
import Mathlib
import Definitions.Def_PochetWolsey_Capacities_Model
Formal statement
namespace PochetWolsey.Capacities

/-- Theorem 9.3, with both sets expanded from their original constraints. -/
theorem discrete_hull {n : ℕ} (hn : 0 < n) (C : ℝ) (hC : 0 < C)
    (d : Fin n → ℝ) (hd : ∀ t, 0 ≤ d t ∧ d t ≤ C)
    (hfeas : ({y : Fin n → ℝ | (∀ u, y u = 0 ∨ y u = 1) ∧
      ∀ t, (∑ u ∈ Finset.Iic t, d u) ≤ C * ∑ u ∈ Finset.Iic t, y u} : Set _).Nonempty) :
    convexHull ℝ {y : Fin n → ℝ | (∀ u, y u = 0 ∨ y u = 1) ∧
      ∀ t, (∑ u ∈ Finset.Iic t, d u) ≤ C * ∑ u ∈ Finset.Iic t, y u} =
    {y : Fin n → ℝ | (∀ u, 0 ≤ y u ∧ y u ≤ 1) ∧
      ∀ t, (⌈(∑ u ∈ Finset.Iic t, d u) / C⌉ : ℤ) ≤
        (∑ u ∈ Finset.Iic t, y u)} := by sorry

end PochetWolsey.Capacities
Source
Pochet and Wolsey, Production Planning by Mixed Integer Programming, Springer 2006, DOI 10.1007/0-387-33477-7, p. 276 (PDF 289), Theorem 9.3
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

The statement is parametrized by:

  • n∈Nn \in \mathbb{N}n∈N with n>0n > 0n>0; periods are 0,…,n−10, \dots, n-10,…,n−1 in their usual order.
  • C∈RC \in \mathbb{R}C∈R with C>0C > 0C>0.
  • d∈Rnd \in \mathbb{R}^nd∈Rn with 0≤dt≤C0 \le d_t \le C0≤dt​≤C for every ttt.

Write Dt=∑u≤tduD_t = \sum_{u \le t} d_uDt​=∑u≤t​du​, and for y∈Rny \in \mathbb{R}^ny∈Rn write Yt=∑u≤tyuY_t = \sum_{u \le t} y_uYt​=∑u≤t​yu​. Define

X={ y∈Rn:yu∈{0,1} for all u,  Dt≤C Yt for all t }.X = \bigl\{\, y \in \mathbb{R}^n : y_u \in \{0, 1\} \text{ for all } u,\ \ D_t \le C\, Y_t \text{ for all } t \,\bigr\}.X={y∈Rn:yu​∈{0,1} for all u,  Dt​≤CYt​ for all t}.

The hypothesis is that XXX is nonempty.

Conclusion. The real convex hull of XXX in Rn\mathbb{R}^nRn equals

{ y∈Rn:0≤yu≤1 for all u,  ⌈DtC⌉≤Yt for all t },\left\{\, y \in \mathbb{R}^n : 0 \le y_u \le 1 \text{ for all } u,\ \ \left\lceil \frac{D_t}{C} \right\rceil \le Y_t \text{ for all } t \,\right\},{y∈Rn:0≤yu​≤1 for all u,  ⌈CDt​​⌉≤Yt​ for all t},

with each ceiling an integer compared as a real. This is a set equality, so it asserts both inclusions.

Degenerate cases.

  • The nonemptiness hypothesis follows from the bounds du≤Cd_u \le Cdu​≤C, because the all-ones vector lies in XXX. So the statement is not vacuous.
  • The cases n=0n = 0n=0 and C≤0C \le 0C≤0 are excluded.
  • If all du=0d_u = 0du​=0, every ceiling is 000 and the right-hand side is the whole cube [0,1]n[0,1]^n[0,1]n.
Human review
  • Endorsed by Community (Bot) · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 29, 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