Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4(i), p. 578 — the total cost increase of the one-more-unit policy

Proved
RoslingAssembly.Unbounded.thm4i_proof_total_cost_increase

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

assembly-systeminventorymultiechelonp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the assembly model under its standing hypotheses (a tree indexed so that Mi−1≤MiM_{i-1} \le M_iMi−1​≤Mi​; i.i.d. demands ξt≥0\xi_t \ge 0ξt​≥0 with a density and a finite positive mean; 0<α<10 < \alpha < 10<α<1; well-formed initial data x0x^0x0). Let iii be a non-end item, 2≤i≤N2 \le i \le N2≤i≤N, let δ≥0\delta \ge 0δ≥0, and let π\piπ be a measurable policy, feasible from x0x^0x0, whose cost (2) is a real number JJJ. Let Mm=max⁡k∈{i}∪B(i)MkM_m = \max_{k \in \{i\}\cup B(i)} M_kMm​=maxk∈{i}∪B(i)​Mk​. Then the policy πδ\pi^\deltaπδ that orders δ\deltaδ more units of every item k∈{i}∪B(i)k \in \{i\} \cup B(i)k∈{i}∪B(i) in period Mm−Mk+1M_m - M_k + 1Mm​−Mk​+1 and holds them forever has the real cost

J+δ αMm−Mi αli(hi+∑k∈B(i)hk α−(Ms(k)−Ms(i)))1−α.J + \delta\,\alpha^{M_m - M_i}\,\frac{\alpha^{l_i}\Big(h_i + \sum_{k \in B(i)} h_k\,\alpha^{-(M_{s(k)} - M_{s(i)})}\Big)}{1-\alpha}.J+δαMm​−Mi​1−ααli​(hi​+∑k∈B(i)​hk​α−(Ms(k)​−Ms(i)​))​.

The fraction is the paper's "total cost increase", capitalized to period Mm−Mi+1M_m - M_i + 1Mm​−Mi​+1; the factor αMm−Mi\alpha^{M_m - M_i}αMm​−Mi​ discounts it to period 1, where (2) is valued. Multiplying the condition of Theorem 4(i) by αMs(i)>0\alpha^{M_{s(i)}} > 0αMs(i)​>0 shows that the increase is negative exactly under that condition.

Formalization Note. The paper's argument is for one unit (δ=1\delta = 1δ=1); the cost is linear in δ\deltaδ. The statement is restricted to i≥2i \ge 2i≥2: for the end item i=1i = 1i=1 the extra units also change Y1tY_{1t}Y1t​ and hence the backlog term of (2), which the printed display does not account for. The goal theorem still covers i=1i = 1i=1. The cost is an extended real; the hypothesis that the cost of π\piπ is the real number JJJ excludes the ⊤−⊤\top - \top⊤−⊤ value.

Preamble
import Mathlib
import Definitions.Def_RoslingAssembly_Unbounded_Model
import Definitions.Def_RoslingAssembly_Unbounded_Perturb
Formal statement
namespace RoslingAssembly.Unbounded

open MeasureTheory

/-- Proof of Theorem 4(i), p. 578, "the total cost increase": for a non-end item `i ≥ 2` and a
measurable feasible policy `π` with real cost `J`, the policy with `δ ≥ 0` extra units of the
subsystem `{i} ∪ B(i)` has real cost
`J + δ α^{M_m − M_i} α^{l_i} (h_i + ∑_{k ∈ B(i)} h_k α^{−(M_{s(k)} − M_{s(i)})}) / (1 − α)`,
where `M_m = Mmax i`; the factor `α^{M_m − M_i}` discounts the paper's increase, capitalized to
period `M_m − M_i + 1`, back to period 1. -/
theorem thm4i_proof_total_cost_increase (S : Model) (x0 : ℕ → ℕ → ℝ)
    (hT : S.IsTree) (hI : S.IsIndexed) [IsProbabilityMeasure S.ν] (hD : S.DemandStanding)
    (hα0 : 0 < S.α) (hα1 : S.α < 1) (hx0 : S.WellFormed x0)
    (i : ℕ) (hi : i ∈ Finset.Icc 2 S.N) (δ : ℝ) (hδ : 0 ≤ δ)
    (π : RoslingAssembly.SeriesEquiv.Policy) (hπm : IsMeasurablePolicy π) (hπ : S.Feasible x0 π)
    (J : ℝ) (hJ : S.cost π = (J : EReal)) :
    S.cost (S.perturb π i δ) =
      ((J + δ * S.α ^ (S.Mmax i - S.M i) * S.α ^ S.l i *
          (S.h i + ∑ k ∈ S.B i,
            S.h k * S.α ^ (-((S.M (S.succ k) : ℤ) - (S.M (S.succ i) : ℤ)))) / (1 - S.α) : ℝ) :
        EReal) := by sorry

end RoslingAssembly.Unbounded
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Oper. Res. 37(4), 1989, p. 578, Appendix B, Proof of Theorem 4 (i), displays 'The additional cost of this policy ...' to 'So, the total cost increase is ... < 0'
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