Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix 1, proof of Proposition 2, p. 108 — under (d), r_0(t) ≤ f_0(t), so inventory is non-increasing

Proved
QFlexSC.ZeroInv.inventory_nonincreasing

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

inventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rolling-horizonsupply-chainsupply-contracts

Consider a flex node running the Minimum Commitment (MC) policy (21)–(23). Assume the standing conditions αqin,αqout≥0\alpha^{in}_q, \alpha^{out}_q \ge 0αqin​,αqout​≥0 and 0≤ωqin,ωqout≤10 \le \omega^{in}_q, \omega^{out}_q \le 10≤ωqin​,ωqout​≤1 (q≥1q \ge 1q≥1), that all release quantities are nonnegative, fj(t)≥0f_j(t) \ge 0fj​(t)≥0, that the release schedules obey the output IR constraints (6), and that the input profile dominates the output profile componentwise (condition (d) of Proposition 2):

Ajout≤AjinandΩjout≤Ωjin(j≥1).A^{out}_j \le A^{in}_j \quad\text{and}\quad \Omega^{out}_j \le \Omega^{in}_j \qquad (j \ge 1).Ajout​≤Ajin​andΩjout​≤Ωjin​(j≥1).

Let the run start from I(0)≥0I(0) \ge 0I(0)≥0 and the lot-for-lot schedule r(0)=f(0)r(0) = f(0)r(0)=f(0). Then for every t≥1t \ge 1t≥1

r0(t)≤f0(t)and henceI(t)=I(t−1)+r0(t)−f0(t)≤I(t−1).r_0(t) \le f_0(t) \qquad\text{and hence}\qquad I(t) = I(t-1) + r_0(t) - f_0(t) \le I(t-1).r0​(t)≤f0​(t)and henceI(t)=I(t−1)+r0​(t)−f0​(t)≤I(t−1).

Together with the coverage property I(t)≥0I(t) \ge 0I(t)≥0, this gives the first part of Proposition 2: inventory that starts at zero stays at zero.

Formalization Note. The paper derives r0(t)≤f0(t)r_0(t) \le f_0(t)r0​(t)≤f0​(t) from its formula (33), whose maximum over k≥0k \ge 0k≥0 reaches periods before the start of a run; here the claim is stated directly for a run started at period 000. Two hypotheses are added and disclosed: f≥0f \ge 0f≥0 (the paper's quantities are "measured in end-item equivalents"; the argument multiplies an inequality between flexibility ratios by fkf_kfk​), and the initial state r(0)=f(0)r(0) = f(0)r(0)=f(0), I(0)≥0I(0) \ge 0I(0)≥0 (the paper states no start; with r1(0)r_1(0)r1​(0) arbitrarily large, r0(1)≥(1−ω1in)r1(0)r_0(1) \ge (1-\omega^{in}_1) r_1(0)r0​(1)≥(1−ω1in​)r1​(0) exceeds f0(1)f_0(1)f0​(1)). Parameter index 000 is unused.

Preamble
import Mathlib
import Definitions.Def_QFlexSC_ZeroInv_Model
Formal statement
namespace QFlexSC.ZeroInv

theorem inventory_nonincreasing (P : QFParams) (f : ℕ → ℕ → ℝ) (I₀ : ℝ) (r₀ : ℕ → ℝ)
    (hstd : ∀ q, 1 ≤ q → 0 ≤ P.αin q ∧ 0 ≤ P.αout q ∧ 0 ≤ P.ωin q ∧ P.ωin q ≤ 1 ∧
      0 ≤ P.ωout q ∧ P.ωout q ≤ 1)
    (hf : ∀ t j, 0 ≤ f t j)
    (hIR : IROut P f)
    (hI₀ : 0 ≤ I₀)
    (hr₀ : r₀ = f 0)
    (hd : ∀ j, 1 ≤ j → Acum P.αout j ≤ Acum P.αin j ∧ Ωcum P.ωout j ≤ Ωcum P.ωin j) :
    ∀ t : ℕ, 1 ≤ t →
      sched P I₀ r₀ f t 0 ≤ f t 0 ∧ inv P I₀ r₀ f t ≤ inv P I₀ r₀ f (t - 1) := by sorry

end QFlexSC.ZeroInv
Source
Tsay & Lovejoy, Quantity flexibility contracts and supply chain performance, MSOM 1(2) (1999), p. 108, Appendix 1, proof of Proposition 2
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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