Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The exponential is the only continuous memoryless distribution (p.21)

Proved
QueueingFundamentals.Foundations.memoryless_only_exponential

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

characterizationexponential-distributionmemorylessp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let TTT be a random variable with values in [0,∞)[0,\infty)[0,∞) almost surely, whose distribution is continuous (Pr⁡{T=a}=0\Pr\{T=a\}=0Pr{T=a}=0 for every real aaa). Suppose TTT has the memoryless property (1.17): 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​}.

Then there is λ>0\lambda>0λ>0 such that TTT is exponentially distributed with rate λ\lambdaλ, i.e. Pr⁡{T≤t}=1−e−λt\Pr\{T\le t\}=1-e^{-\lambda t}Pr{T≤t}=1−e−λt for t≥0t\ge0t≥0.

Together with (1.17) this characterizes the exponential distribution among continuous distributions on [0,∞)[0,\infty)[0,∞).

Formalization Note "Continuous distribution" is read as a continuous distribution function (no atoms). The conditional probability is Mathlib's cond, which is the zero measure when the conditioning event has probability zero; the hypothesis then forces that case not to occur.

Preamble
import Mathlib

open MeasureTheory ProbabilityTheory
Formal statement
namespace QueueingFundamentals.Foundations

/-- p.21: the exponential distribution is the only continuous distribution on `[0, ∞)` with the
memoryless property (1.17). -/
theorem memoryless_only_exponential {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    [IsProbabilityMeasure μ] (T : Ω → ℝ) (hTm : Measurable T)
    (hcont : ∀ a : ℝ, μ {ω | T ω = a} = 0) (hnonneg : μ {ω | T ω < 0} = 0)
    (hmem : ∀ t₀ t₁ : ℝ, 0 ≤ t₀ → t₀ ≤ t₁ →
      cond μ {ω | t₀ ≤ T ω} {ω | T ω ≤ t₁} = μ {ω | 0 ≤ T ω ∧ T ω ≤ t₁ - t₀}) :
    ∃ lam : ℝ, 0 < lam ∧ μ.map T = expMeasure lam := by sorry

end QueueingFundamentals.Foundations
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.21, characterization of the exponential distribution following Eq. (1.17) (unnumbered)
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