Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 — compound Poisson demand: units in resupply are compound Poisson with parameter λτ̄

Proved
ServiceParts.Palm.compound_palm_theorem

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

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

Consider the (s−1,s)(s-1,s)(s−1,s) backorder system with compound Poisson demand: customer orders arrive as a Poisson process with rate λ>0\lambda > 0λ>0, the kkk-th order asks for Xk≥1X_k \ge 1Xk​≥1 units with i.i.d. sizes P[Xk=j]=ujP[X_k = j] = u_jP[Xk​=j]=uj​, and all units of one order share one resupply time, drawn from a common distribution with density ggg, distribution function GGG and finite mean τˉ\bar\tauτˉ. Interarrival times, resupply times and order sizes are mutually independent, and the system is empty at time 000. Let Y(t)Y(t)Y(t) be the number of units in resupply at time ttt. Then for every n≥0n \ge 0n≥0

lim⁡t→∞P[Y(t)=n]=∑j=0nun(j) e−λτˉ(λτˉ)jj!,\lim_{t\to\infty} P[Y(t) = n] = \sum_{j=0}^{n} u^{(j)}_n\, e^{-\lambda\bar\tau}\frac{(\lambda\bar\tau)^j}{j!},t→∞lim​P[Y(t)=n]=j=0∑n​un(j)​e−λτˉj!(λτˉ)j​,

where un(j)u^{(j)}_nun(j)​ is the probability that jjj customers ask for nnn units in total. In the book's form: P[X=n]=∑j≥1un(j)e−λτˉ(λτˉ)j/j!P[X = n] = \sum_{j\ge1} u^{(j)}_n e^{-\lambda\bar\tau}(\lambda\bar\tau)^j/j!P[X=n]=∑j≥1​un(j)​e−λτˉ(λτˉ)j/j! for n≥1n \ge 1n≥1 and P[X=0]=e−λτˉP[X = 0] = e^{-\lambda\bar\tau}P[X=0]=e−λτˉ, the compound Poisson distribution with mean λτˉuˉ\lambda\bar\tau\bar uλτˉuˉ, uˉ\bar uuˉ the mean order size.

With u1=1u_1 = 1u1​=1 this is Palm's theorem.

Formalization Note "Steady state probability" is pinned, as for Theorem 6, to lim⁡t→∞P[Y(t)=n]\lim_{t\to\infty}P[Y(t) = n]limt→∞​P[Y(t)=n] for the system empty at time 000. The distribution is identified through the pmf (3.22)–(3.23); the mean λτˉuˉ\lambda\bar\tau\bar uλτˉuˉ is the mean of that law (possibly +∞+\infty+∞ when uˉ=∞\bar u = \inftyuˉ=∞) and is not stated separately.

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 compound_palm_theorem {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] (S : CompoundResupplySystem Ω P) (n : ℕ) :
    Tendsto (fun t : ℝ => (P {ω | S.unitsInResupply t ω = n}).toReal) atTop
      (𝓝 (compoundPoissonPMF (S.rate * S.meanResupply) 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. 43-44, Theorem 7 (proof p. 44, Eqs. (3.22)-(3.23))
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