Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.17) — the memoryless property of the exponential distribution

Proved
QueueingFundamentals.Foundations.exp_memoryless

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

exponential-distributionmemorylessp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

Let TTT be a random variable with the exponential distribution with rate λ>0\lambda>0λ>0. For all 0≤t0≤t10\le t_0\le t_10≤t0​≤t1​,

Pr⁡{T≤t1∣T≥t0}=Pr⁡{0≤T≤t1−t0}.\Pr\{T\le t_1\mid T\ge t_0\}=\Pr\{0\le T\le t_1-t_0\}.Pr{T≤t1​∣T≥t0​}=Pr{0≤T≤t1​−t0​}.

In words: a customer who has already spent t0t_0t0​ 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
  • 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