Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2, p. 97 — under the MC policy, supply flexibility at least the customer's keeps inventory at zero; equal flexibilities give lot-for-lot

Proved
QFlexSC.ZeroInv.proposition_2

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 with input QF parameters (αqin,ωqin)(\alpha^{in}_q, \omega^{in}_q)(αqin​,ωqin​) and output QF parameters (αqout,ωqout)(\alpha^{out}_q, \omega^{out}_q)(αqout​,ωqout​), q≥1q \ge 1q≥1, satisfying the standing assumptions α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, with cumulative flexibilities 1+Aj=∏q=1j(1+αq)1 + A_j = \prod_{q=1}^{j}(1+\alpha_q)1+Aj​=∏q=1j​(1+αq​) and 1−Ωj=∏q=1j(1−ωq)1 - \Omega_j = \prod_{q=1}^{j}(1-\omega_q)1−Ωj​=∏q=1j​(1−ωq​). Suppose that

  1. (a) the release schedules f(t)f(t)f(t) received in periods t≥0t \ge 0t≥0 are nonnegative and their updates obey the output IR constraints (6);
  2. (b) the node uses the Minimum Commitment policy (21)–(23) in every period t≥1t \ge 1t≥1;
  3. (c) I(0)=0I(0) = 0I(0)=0, and the run starts lot-for-lot, r(0)=f(0)r(0) = f(0)r(0)=f(0);
  4. (d) (Ain,Ωin)≥(Aout,Ωout)(A^{in}, \Omega^{in}) \ge (A^{out}, \Omega^{out})(Ain,Ωin)≥(Aout,Ωout), i.e. Ajout≤AjinA^{out}_j \le A^{in}_jAjout​≤Ajin​ and Ωjout≤Ωjin\Omega^{out}_j \le \Omega^{in}_jΩjout​≤Ωjin​ for all j≥1j \ge 1j≥1.

Then the node holds no inventory:

I(t)=0for all t≥0.I(t) = 0 \qquad \text{for all } t \ge 0 .I(t)=0for all t≥0.

Moreover, in the special case (Ain,Ωin)=(Aout,Ωout)(A^{in}, \Omega^{in}) = (A^{out}, \Omega^{out})(Ain,Ωin)=(Aout,Ωout), provided ωqin<1\omega^{in}_q < 1ωqin​<1 for all q≥1q \ge 1q≥1, the node is a pure lot-for-lot conduit:

rj(t)=fj(t)for all j≥0, t≥1.r_j(t) = f_j(t) \qquad \text{for all } j \ge 0,\ t \ge 1 .rj​(t)=fj​(t)for all j≥0, t≥1.

The proposition makes precise the claim that inventory at a flex node results from a disparity between input and output flexibility: a node whose supply side is at least as flexible as its customer side can meet every obligation with zero stock, and with matched flexibility it transmits every schedule upstream unaltered.

Formalization Note. Three hypotheses are added to the page's statement and disclosed. (i) fj(t)≥0f_j(t) \ge 0fj​(t)≥0: the paper's quantities are "measured in end-item equivalents", and its proof multiplies an inequality between flexibility ratios by fkf_kfk​. (ii) The start r(0)=f(0)r(0) = f(0)r(0)=f(0): the paper names no initial schedule, and without a condition on it the claim fails (a large r1(0)r_1(0)r1​(0) forces r0(1)≥(1−ω1in)r1(0)>f0(1)r_0(1) \ge (1-\omega^{in}_1) r_1(0) > f_0(1)r0​(1)≥(1−ω1in​)r1​(0)>f0​(1)). (iii) ωqin<1\omega^{in}_q < 1ωqin​<1 in the equal case only: the paper's proof divides by 1−Ωjin1 - \Omega^{in}_j1−Ωjin​; with ω1in=ω1out=1\omega^{in}_1 = \omega^{out}_1 = 1ω1in​=ω1out​=1, ω2in=0\omega^{in}_2 = 0ω2in​=0, ω2out=1\omega^{out}_2 = 1ω2out​=1 (equal profiles Ωj=1\Omega_j = 1Ωj​=1), f2(0)=10f_2(0) = 10f2​(0)=10, f1(1)=5f_1(1) = 5f1​(1)=5, the MC policy gives r1(1)≥10≠f1(1)r_1(1) \ge 10 \ne f_1(1)r1​(1)≥10=f1​(1). Constraint (6) is stated with index j+1j+1j+1 in place of jjj; the parameter sequences' value at index 000 is unused; period 000 is the initial state and the policy acts from period 111 on.

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

theorem proposition_2 (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)
    (ha : IROut P f)
    (hc : I₀ = 0)
    (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 : ℕ, inv P I₀ r₀ f t = 0) ∧
      ((∀ j, 1 ≤ j → Acum P.αin j = Acum P.αout j ∧ Ωcum P.ωin j = Ωcum P.ωout j) →
        (∀ q, 1 ≤ q → P.ωin q < 1) →
        ∀ t : ℕ, 1 ≤ t → ∀ j : ℕ, sched P I₀ r₀ f t j = f t j) := by sorry

end QFlexSC.ZeroInv
Source
Tsay & Lovejoy, Quantity flexibility contracts and supply chain performance, MSOM 1(2) (1999), p. 97, Proposition 2 (proof: Appendix 1, pp. 108–109)
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