Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9 — delayed due dates: units in resupply for at least T are compound Poisson with parameter λτ̄α

Proved
ServiceParts.Palm.delayed_due_dates

by mikedeng1 · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

compound-poissoninventoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1palm-theorem

Consider the compound Poisson (s−1,s)(s-1,s)(s−1,s) backorder system of Theorem 7 (Poisson orders with rate λ>0\lambda > 0λ>0, i.i.d. order sizes with law uuu, one common resupply time per order with density ggg, distribution function G(t)=∫0tg(τ) dτG(t) = \int_0^t g(\tau)\,d\tauG(t)=∫0t​g(τ)dτ and finite mean τˉ\bar\tauτˉ, all mutually independent, empty at time 000). Fix a due-date delay T≥0T \ge 0T≥0 and let YT(t)Y_T(t)YT​(t) be the number of units in resupply at time ttt each of which has been in the resupply system for at least TTT time units. Put

α=1τˉ∫T∞[1−G(t)] dt.(3.35)\alpha = \frac1{\bar\tau}\int_T^\infty [1 - G(t)]\,dt. \tag{3.35}α=τˉ1​∫T∞​[1−G(t)]dt.(3.35)

Then for every n≥0n \ge 0n≥0

lim⁡t→∞P[YT(t)=n]=p(n∣λτˉα)=∑y=0n(λτˉα)ye−λτˉαy! un(y),\lim_{t\to\infty} P[Y_T(t) = n] = p(n \mid \lambda\bar\tau\alpha) = \sum_{y=0}^{n}\frac{(\lambda\bar\tau\alpha)^y e^{-\lambda\bar\tau\alpha}}{y!}\,u^{(y)}_n,t→∞lim​P[YT​(t)=n]=p(n∣λτˉα)=y=0∑n​y!(λτˉα)ye−λτˉα​un(y)​,

where un(y)u^{(y)}_nun(y)​ is the probability that yyy customers generate a total demand of nnn units.

For T=0T = 0T=0, α=1\alpha = 1α=1 and this is Theorem 7. When each demand must be met within TTT time units of its arrival rather than immediately, YTY_TYT​ counts the units whose demand is due, which is what the stock level has to cover.

Formalization Note "Steady state probability" is pinned to lim⁡t→∞\lim_{t\to\infty}limt→∞​ for the system empty at time 000. An order placed at TkT_kTk​ counts when Tk+T≤t<Tk+LkT_k + T \le t < T_k + L_kTk​+T≤t<Tk​+Lk​. The mean resupply time is positive (the resupply time has a density), so α\alphaα is well defined.

Preamble
import Mathlib
import Definitions.Def_ServiceParts_Palm_ResupplySystem
import Definitions.Def_ServiceParts_Palm_CompoundResupplySystem

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace ServiceParts.Palm

theorem delayed_due_dates {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] (S : CompoundResupplySystem Ω P) {T : ℝ} (hT : 0 ≤ T) (n : ℕ) :
    Tendsto (fun t : ℝ => (P {ω | S.agedUnitsInResupply T t ω = n}).toReal) atTop
      (𝓝 (compoundPoissonPMF
        (S.rate * S.meanResupply *
          ((1 / S.meanResupply) * ∫ u in Set.Ioi T, (1 - S.resupplyCdf u)))
        S.sizePMF n)) := by sorry

end ServiceParts.Palm
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, pp. 46-47, Theorem 9 (Eqs. (3.35)-(3.36))
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

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