Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM II, p. 869 — setting Sⱼ = Sⱼ₋₁ + Tⱼ gives the cost of the model with operations j, j+1 coupled

Proved
SimpsonInv.Vertex.theorem_II

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

couplinginventorymodel-reductionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a model with nnn operations, n−1n - 1n−1 variables S1,…,Sn−1S_1, \dots, S_{n-1}S1​,…,Sn−1​, constants c,S0,Snc, S_0, S_nc,S0​,Sn​ and ri,Tir_i, T_iri​,Ti​ (1≤i≤n1 \le i \le n1≤i≤n), and cost

f(S1,…,Sn−1)=c+∑i=1nriSi−1−Si+Ti.f(S_1, \dots, S_{n-1}) = c + \sum_{i=1}^{n} r_i \sqrt{S_{i-1} - S_i + T_i}.f(S1​,…,Sn−1​)=c+i=1∑n​ri​Si−1​−Si​+Ti​​.

Fix jjj with 1≤j≤n−11 \le j \le n - 11≤j≤n−1 and suppose Sj=Sj−1+TjS_j = S_{j-1} + T_jSj​=Sj−1​+Tj​, i.e. the average inventory IjI_jIj​ is zero. Form the coupled model with n−1n - 1n−1 operations: inventory point IjI_jIj​ is removed, operations jjj and j+1j+1j+1 become one operation with processing time Tj+Tj+1T_j + T_{j+1}Tj​+Tj+1​, so

Ti′={Tii<j,Tj+Tj+1i=j,Ti+1i>j,ri′={rii<j,ri+1i≥j,T'_i = \begin{cases} T_i & i < j,\\ T_j + T_{j+1} & i = j,\\ T_{i+1} & i > j,\end{cases} \qquad r'_i = \begin{cases} r_i & i < j,\\ r_{i+1} & i \ge j,\end{cases}Ti′​=⎩⎨⎧​Ti​Tj​+Tj+1​Ti+1​​i<j,i=j,i>j,​ri′​={ri​ri+1​​i<j,i≥j,​

and its variables are (S1,…,Sj−1,Sj+1,…,Sn−1)(S_1, \dots, S_{j-1}, S_{j+1}, \dots, S_{n-1})(S1​,…,Sj−1​,Sj+1​,…,Sn−1​), with the same end constants S0,SnS_0, S_nS0​,Sn​. Then the original cost equals the coupled model's cost f′f'f′ (the same formula with n−1n - 1n−1 operations and data T′,r′T', r'T′,r′):

f(S1,…,Sn−1)=f′(S1,…,Sj−1,Sj+1,…,Sn−1).f(S_1, \dots, S_{n-1}) = f'(S_1, \dots, S_{j-1}, S_{j+1}, \dots, S_{n-1}).f(S1​,…,Sn−1​)=f′(S1​,…,Sj−1​,Sj+1​,…,Sn−1​).

The theorem says a vanishing inventory can be removed altogether without changing the cost; it is the reduction used for the second kind of face in the proof of LEMMA II.

Formalization Note Here the original model has m+1m + 1m+1 variables (Fin (m + 1) → ℝ), and Lean's j : Fin (m + 1) is the paper's index jjj = j + 1. Removing the variable is Fin.removeNth. No sign or domain hypothesis is needed (the page has none); the identity holds for every point satisfying Sj=Sj−1+TjS_j = S_{j-1} + T_jSj​=Sj−1​+Tj​.

Preamble
import Mathlib
import Definitions.Def_SimpsonInv_Vertex_Setting
Formal statement
namespace SimpsonInv.Vertex

theorem theorem_II {m : ℕ} (c S0 Sn : ℝ) (r T : ℕ → ℝ) (S : Fin (m + 1) → ℝ) (j : Fin (m + 1))
    (hj : S j = extVec S0 Sn S j.val + T (j.val + 1)) :
    cost c r T S0 Sn S =
      cost c (coupledR r (j.val + 1)) (coupledT T (j.val + 1)) S0 Sn (Fin.removeNth j S) := by sorry

end SimpsonInv.Vertex
Source
Simpson, In-Process Inventories, Operations Research 6 (1958), p. 869, THEOREM II
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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