Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 9.2 — rounded cumulative demand inequalities

Proved
PochetWolsey.Capacities.rounded_demand_valid

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.

Every binary feasible setup vector yyy satisfies

∑u=1tyu≥⌈d1tC⌉(1≤t≤n).\sum_{u=1}^t y_u\ge\left\lceil\frac{d_{1t}}C\right\rceil\qquad(1\le t\le n).u=1∑t​yu​≥⌈Cd1t​​⌉(1≤t≤n).

These inequalities express the integral number of capacity-sized production opportunities required by each prefix of the horizon.

Formalization Note Periods use zero-based Fin n coordinates; the prefix sum through a coordinate includes it. Integer ceilings are cast to real numbers for comparison.

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

/-- Proposition 9.2. The set in hfeas is (9.1)-(9.2), written out for auditing. -/
theorem rounded_demand_valid {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)
    (y : Fin n → ℝ) (hy : ∀ u, y u = 0 ∨ y u = 1)
    (hcover : ∀ t, (∑ u ∈ Finset.Iic t, d u) ≤ C * ∑ u ∈ Finset.Iic t, y u) :
    ∀ 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), Proposition 9.2
Read-back

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

The statement is parametrized by the following data and hypotheses:

  • 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​. The statement assumes further:

  • (hfeas) There exists some y′∈Rny' \in \mathbb{R}^ny′∈Rn such that every yu′∈{0,1}y'_u \in \{0, 1\}yu′​∈{0,1} and Dt≤C∑u≤tyu′D_t \le C \sum_{u \le t} y'_uDt​≤C∑u≤t​yu′​ for all ttt.
  • A specific vector y∈Rny \in \mathbb{R}^ny∈Rn satisfying:
    • every yu∈{0,1}y_u \in \{0, 1\}yu​∈{0,1};
    • Dt≤C YtD_t \le C\, Y_tDt​≤CYt​ for every ttt, where Yt=∑u≤tyuY_t = \sum_{u \le t} y_uYt​=∑u≤t​yu​.

Conclusion. For every period ttt,

⌈DtC⌉≤Yt,\left\lceil \frac{D_t}{C} \right\rceil \le Y_t ,⌈CDt​​⌉≤Yt​,

with the ceiling an integer compared as a real number.

Degenerate cases.

  • Hypothesis (hfeas) is implied by the hypotheses on yyy, since yyy itself is a witness.
  • Because n>0n > 0n>0 and C>0C > 0C>0, there is no empty period set and no division by zero.
  • The hypotheses are always jointly satisfiable. For example, the all-ones vector yyy works, because each du≤Cd_u \le Cdu​≤C. So the statement is not vacuous.
  • If all du=0d_u = 0du​=0, the conclusion is 0≤Yt0 \le Y_t0≤Yt​.
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