Eq. (1.17) — the memoryless property of the exponential distribution
ProvedQueueingFundamentals.Foundations.exp_memorylessexponential-distributionmemorylessp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing
Let be a random variable with the exponential distribution with rate . For all ,
In words: a customer who has already spent units of time in service has remaining service time distributed as a fresh service time. This is the Markovian property that makes the Poisson–exponential queueing models tractable.
Preamble
import Mathlib open MeasureTheory ProbabilityTheory
Formal statement
namespace QueueingFundamentals.Foundations
/-- Eq. (1.17) (pp.20–21): an exponentially distributed `T` is memoryless,
`Pr{T ≤ t_1 | T ≥ t_0} = Pr{0 ≤ T ≤ t_1 − t_0}` for `0 ≤ t_0 ≤ t_1`. -/
theorem exp_memoryless {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
[IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : Ω → ℝ) (hTm : Measurable T)
(hlaw : μ.map T = expMeasure lam) (t₀ t₁ : ℝ) (ht₀ : 0 ≤ t₀) (ht : t₀ ≤ t₁) :
cond μ {ω | t₀ ≤ T ω} {ω | T ω ≤ t₁} = μ {ω | 0 ≤ T ω ∧ T ω ≤ t₁ - t₀} := by sorry
end QueueingFundamentals.Foundations
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.20–21, Eq. (1.17)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.