Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 12 — given N(t) = n, the demand epochs are order statistics of n i.i.d. draws from F = m(x)/m(t)

Proved
ServiceParts.NonstatPalm.arrival_times_order_statistics

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

nonstationaryorder-statisticsp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-process

Consider the single-location model with nonstationary Poisson demand of rate λ\lambdaλ, mean function mmm, and time-dependent resupply times. Fix ttt with m(t)>0m(t) > 0m(t)>0 and let FFF be the distribution function

F(x)={0,x<0,m(x)/m(t),0≤x<t,1,x≥t.F(x) = \begin{cases} 0, & x < 0,\\ m(x)/m(t), & 0 \le x < t,\\ 1, & x \ge t.\end{cases}F(x)=⎩⎨⎧​0,m(x)/m(t),1,​x<0,0≤x<t,x≥t.​

Let μ\muμ be the probability measure on R\mathbb RR with distribution function FFF, and let V1,…,VnV_1, \dots, V_nV1​,…,Vn​ be independent with law μ\muμ, with order statistics V(1)≤⋯≤V(n)V_{(1)} \le \cdots \le V_{(n)}V(1)​≤⋯≤V(n)​. Then, for every nnn and every measurable A⊆RnA \subseteq \mathbb R^nA⊆Rn,

P(N(t)=n, (T0,…,Tn−1)∈A)=P(N(t)=n) P((V(1),…,V(n))∈A).P\bigl(N(t) = n,\ (T_0, \dots, T_{n-1}) \in A\bigr) = P\bigl(N(t) = n\bigr)\, P\bigl((V_{(1)}, \dots, V_{(n)}) \in A\bigr).P(N(t)=n, (T0​,…,Tn−1​)∈A)=P(N(t)=n)P((V(1)​,…,V(n)​)∈A).

That is, conditionally on N(t)=nN(t) = nN(t)=n, the demand epochs in [0,t][0,t][0,t] have the same distribution as the order statistics of nnn independent random variables with distribution function FFF.

This is the nonstationary counterpart of the uniform order-statistics property of a Poisson process, and it is the step on which the proof of Theorem 13 rests.

Formalization Note The book writes F(x)F(x)F(x) only for x≥0x \ge 0x≥0; F(x)=0F(x) = 0F(x)=0 for x<0x < 0x<0 is added, since demands occur at nonnegative times. The hypothesis m(t)>0m(t) > 0m(t)>0 makes FFF well defined; when m(t)=0m(t) = 0m(t)=0 there are almost surely no demands in [0,t][0,t][0,t] and the book's FFF is 0/00/00/0. The measure μ\muμ is quantified universally over probability measures with distribution function FFF; there is exactly one. The order statistics are obtained by sorting the vector (V1,…,Vn)(V_1, \dots, V_n)(V1​,…,Vn​).

Preamble
import Mathlib
import Definitions.Def_ServiceParts_NonstatPalm_ResupplySystem

open MeasureTheory ProbabilityTheory
Formal statement
namespace ServiceParts.NonstatPalm

theorem arrival_times_order_statistics {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] {E : Type*} [MeasurableSpace E] (S : ResupplySystem Ω P E)
    {t : ℝ} (hm : 0 < S.meanFn t) (n : ℕ)
    (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ : ∀ x : ℝ, μ (Set.Iic x) = ENNReal.ofReal (S.arrivalCdf t x))
    {A : Set (Fin n → ℝ)} (hA : MeasurableSet A) :
    P ({ω | S.demandCount t ω = n} ∩ {ω | (fun i : Fin n => S.epoch (i : ℕ) ω) ∈ A}) =
      P {ω | S.demandCount t ω = n} *
        Measure.pi (fun _ : Fin n => μ) {x : Fin n → ℝ | x ∘ Tuple.sort x ∈ A} := by sorry

end ServiceParts.NonstatPalm
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, p. 216, Theorem 12
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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