Theorem 7 — compound Poisson demand: units in resupply are compound Poisson with parameter λτ̄
ProvedServiceParts.Palm.compound_palm_theoremConsider the backorder system with compound Poisson demand: customer orders arrive as a Poisson process with rate , the -th order asks for units with i.i.d. sizes , and all units of one order share one resupply time, drawn from a common distribution with density , distribution function and finite mean . Interarrival times, resupply times and order sizes are mutually independent, and the system is empty at time . Let be the number of units in resupply at time . Then for every
where is the probability that customers ask for units in total. In the book's form: for and , the compound Poisson distribution with mean , the mean order size.
With this is Palm's theorem.
Formalization Note "Steady state probability" is pinned, as for Theorem 6, to for the system empty at time . The distribution is identified through the pmf (3.22)–(3.23); the mean is the mean of that law (possibly when ) and is not stated separately.
import Mathlib import Definitions.Def_ServiceParts_Palm_ResupplySystem import Definitions.Def_ServiceParts_Palm_CompoundResupplySystem open MeasureTheory ProbabilityTheory Filter Topology
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.