Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(8), p. 95 — the IR constraints (6) imply the cumulative bounds (1 − Ω_j^out) f_j(t) ≤ f_0(t + j) ≤ (1 + A_j^out) f_j(t)

Proved
QFlexSC.ZeroInv.eq_8

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

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

Let f(t)=[f0(t),f1(t),… ]f(t) = [f_0(t), f_1(t), \dots]f(t)=[f0​(t),f1​(t),…] be the release schedules a flex node receives in periods t=0,1,…t = 0, 1, \dotst=0,1,…, and let the output QF parameters satisfy αqout≥0\alpha^{out}_q \ge 0αqout​≥0 and 0≤ωqout≤10 \le \omega^{out}_q \le 10≤ωqout​≤1 for q≥1q \ge 1q≥1. If every revision obeys the output Incremental Revision constraints (6),

(1−ωjout)fj(t)≤fj−1(t+1)≤(1+αjout)fj(t)(t≥0, j≥1),(1 - \omega^{out}_j) f_j(t) \le f_{j-1}(t+1) \le (1 + \alpha^{out}_j) f_j(t) \qquad (t \ge 0,\ j \ge 1),(1−ωjout​)fj​(t)≤fj−1​(t+1)≤(1+αjout​)fj​(t)(t≥0, j≥1),

then for all t≥0t \ge 0t≥0 and j≥0j \ge 0j≥0

(1−Ωjout) fj(t)≤f0(t+j)≤(1+Ajout) fj(t),(1 - \Omega^{out}_j)\, f_j(t) \le f_0(t+j) \le (1 + A^{out}_j)\, f_j(t),(1−Ωjout​)fj​(t)≤f0​(t+j)≤(1+Ajout​)fj​(t),

where 1−Ωjout=∏q=1j(1−ωqout)1 - \Omega^{out}_j = \prod_{q=1}^{j}(1 - \omega^{out}_q)1−Ωjout​=∏q=1j​(1−ωqout​) and 1+Ajout=∏q=1j(1+αqout)1 + A^{out}_j = \prod_{q=1}^{j}(1 + \alpha^{out}_q)1+Ajout​=∏q=1j​(1+αqout​).

These are the Cumulative Flexibility (CF) constraints: the current estimate fj(t)f_j(t)fj​(t) bounds the actual purchase f0(t+j)f_0(t+j)f0​(t+j) in period t+jt+jt+j. They convert the period-to-period revision rules into the bounds the MC policy plans against.

Formalization Note. The paper states (8) for j≥1j \ge 1j≥1; the case j=0j = 0j=0 is the trivial identity f0(t)≤f0(t)≤f0(t)f_0(t) \le f_0(t) \le f_0(t)f0​(t)≤f0​(t)≤f0​(t) and is included. No sign condition on fff is needed.

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

theorem eq_8 (P : QFParams) (f : ℕ → ℕ → ℝ)
    (hstd : ∀ q, 1 ≤ q → 0 ≤ P.αout q ∧ 0 ≤ P.ωout q ∧ P.ωout q ≤ 1)
    (hIR : IROut P f) :
    ∀ t j : ℕ, (1 - Ωcum P.ωout j) * f t j ≤ f (t + j) 0 ∧
      f (t + j) 0 ≤ (1 + Acum P.αout j) * f t j := by sorry

end QFlexSC.ZeroInv
Source
Tsay & Lovejoy, Quantity flexibility contracts and supply chain performance, MSOM 1(2) (1999), p. 95, (8)–(9)
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