Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unit-rate Poisson demand paths, WT(ℓ)W_T(\ell)WT​(ℓ) and the calibrated penalty αμ(η)\alpha_\mu(\eta)αμ​(η)

Definition
LostSalesRQ_poisson_process

by Ming Hu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-guaranteeinventorylost-salesoperations-research

A demand path is the sequence ξ=(ξ0,ξ1,… )\xi=(\xi_0,\xi_1,\dots)ξ=(ξ0​,ξ1​,…) of interarrival times of a rate-one Poisson process; under the canonical law the ξi\xi_iξi​ are independent exponential random variables with rate one. The (k+1)(k+1)(k+1)-st arrival occurs at Sk=ξ0+⋯+ξkS_k=\xi_0+\cdots+\xi_kSk​=ξ0​+⋯+ξk​ and N(s)=#{k:Sk≤s}N(s)=\#\{k:S_k\le s\}N(s)=#{k:Sk​≤s} counts arrivals in [0,s][0,s][0,s]. A path is regular when all ξi>0\xi_i>0ξi​>0 and Sk→∞S_k\to\inftySk​→∞.

For T≥0T\ge0T≥0 and 0≤ℓ≤10\le\ell\le10≤ℓ≤1 the expected largest excess of the line (1−ℓ)t(1-\ell)t(1−ℓ)t over demand on [0,T][0,T][0,T] is

WT(ℓ)=Esup⁡0≤t≤T{(1−ℓ)t−N(t)},W_T(\ell)=\mathbb E\sup_{0\le t\le T}\{(1-\ell)t-N(t)\},WT​(ℓ)=E0≤t≤Tsup​{(1−ℓ)t−N(t)},

and for η≥1\eta\ge1η≥1 the calibrated penalty (eq. (11)) is

αμ(η)=η[1+Esup⁡0≤t≤μ{(1−1/η)t−N(t)}]=η [1+Wμ(1/η)].\alpha_\mu(\eta)=\eta\Big[1+\mathbb E\sup_{0\le t\le\mu}\{(1-1/\eta)t-N(t)\}\Big]=\eta\,[1+W_\mu(1/\eta)].αμ​(η)=η[1+E0≤t≤μsup​{(1−1/η)t−N(t)}]=η[1+Wμ​(1/η)].

Proposition 2 identifies αμ(η)\alpha_\mu(\eta)αμ​(η) with Bμ(η)+Dμ(η)B_\mu(\eta)+D_\mu(\eta)Bμ​(η)+Dμ​(η), the penalty at which both lower-bound terms coincide.

Formalization Note The expectation is a Bochner integral of a bounded function of the path. Arrival counts use Set.ncard, which is finite on regular paths (a full-measure set).

Definition code
import Mathlib.Probability.ProductMeasure
import Mathlib.Probability.Distributions.Exponential

/-!
# The unit-rate Poisson demand process

A demand path is the sequence of interarrival times of a rate-one Poisson process; under
`interarrivalLaw` they are independent exponential random variables with rate one.
-/

namespace LostSalesRQ

open MeasureTheory ProbabilityTheory Filter Set

/-- A demand path: the sequence `ξ 0, ξ 1, …` of unit-rate interarrival times. -/
abbrev DemandPath := ℕ → ℝ

/-- The law of the interarrival times: independent exponential distributions with rate one. -/
noncomputable def interarrivalLaw : Measure DemandPath :=
  Measure.infinitePi (fun _ : ℕ => expMeasure 1)

/-- Epoch `ξ 0 + ⋯ + ξ k` of the `(k+1)`-st arrival of the unit-rate process. -/
def arrivalEpoch (ξ : DemandPath) (k : ℕ) : ℝ :=
  ∑ i ∈ Finset.range (k + 1), ξ i

/-- Number `N(s)` of unit-rate arrivals in `[0, s]`. -/
noncomputable def unitCount (ξ : DemandPath) (s : ℝ) : ℕ :=
  {k : ℕ | arrivalEpoch ξ k ≤ s}.ncard

/-- A demand path is regular when every interarrival time is positive and the arrival epochs
diverge. -/
def RegularPath (ξ : DemandPath) : Prop :=
  (∀ k, 0 < ξ k) ∧ Tendsto (arrivalEpoch ξ) atTop atTop

/-- Largest excess `sup_{0 ≤ t ≤ T} {f t - N(t)}` of the line `f t` over the arrival count. -/
noncomputable def maxExcess (T f : ℝ) (ξ : DemandPath) : ℝ :=
  sSup ((fun t : ℝ => f * t - (unitCount ξ t : ℝ)) '' Icc 0 T)

/-- `W_T(ℓ) = E sup_{0 ≤ t ≤ T} {(1 - ℓ) t - N(t)}` (Appendix D). -/
noncomputable def expectedMaxExcess (T ℓ : ℝ) : ℝ :=
  ∫ ξ, maxExcess T (1 - ℓ) ξ ∂interarrivalLaw

/-- Calibrated penalty `α_μ(η) = η [1 + E sup_{0 ≤ t ≤ μ} {(1 - 1/η) t - N(t)}]` (eq. (11)). -/
noncomputable def calibratedPenalty (μ η : ℝ) : ℝ :=
  η * (1 + expectedMaxExcess μ (1 / η))

end LostSalesRQ
Source
M. Hu, "A 1.932 Guarantee for (r,Q) Policies in Continuous-Review Lost-Sales Inventory Systems", arXiv:2610.34576, 2026; Section 4.3.2, eq. (11) (p. 13); Appendix D (p. A7).

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