Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 719 — conditional M/M/s waiting time is exponential

Proved
WhittEfficiency.MMs.sec_3_1_conditional_exponential

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

exponential-distributionmmcp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing

Let s≥1s\geq1s≥1 be an integer and consider a stable, steady-state M/M/sM/M/sM/M/s queue with arrival rate 0<λ<s0<\lambda<s0<λ<s, unit service rate at each server, and stationary probabilities (pn)(p_n)(pn​). Put ρ=λ/s\rho=\lambda/sρ=λ/s, and let WWW be the FCFS waiting time of an arriving customer. Then a positive wait has positive probability and

L(W∣W>0)=Exp⁡(s(1−ρ)).\mathcal L(W\mid W>0)=\operatorname{Exp}\bigl(s(1-\rho)\bigr).L(W∣W>0)=Exp(s(1−ρ)).

Thus the waiting time of a delayed customer has mean 1/[s(1−ρ)]1/[s(1-\rho)]1/[s(1−ρ)]. This identifies the conditional distribution needed for Proposition 3.1.

Formalization Note The waiting-time law is the Erlang mixture defined in WhittEfficiency.MMs.WaitLaw. The conclusion is equality of the restriction of that measure to (0,∞)(0,\infty)(0,∞) with its positive-wait mass times the exponential measure.

Preamble
import Mathlib
import Definitions.Def_WhittEfficiency_MMs_WaitLaw

open MeasureTheory ProbabilityTheory
Formal statement
namespace WhittEfficiency.MMs

/-- Whitt (1992), §3.1, p. 719: conditional on a positive wait, the M/M/s wait
is exponential with mean `1 / (s * (1 - ρ))`. -/
theorem sec_3_1_conditional_exponential
    (s : ℕ) (hs : 1 ≤ s) (lam : ℝ) (hlam : 0 < lam) (hρ : lam < s)
    (p : ℕ → ℝ)
    (hp : QueueingFundamentals.BirthDeath.IsSteadyState
      (fun _ => lam) (QueueingFundamentals.BirthDeath.mmcDeath 1 s) p) :
    0 < (waitLaw s p).real (Set.Ioi (0 : ℝ)) ∧
      (waitLaw s p).restrict (Set.Ioi (0 : ℝ)) =
        (waitLaw s p) (Set.Ioi (0 : ℝ)) •
          expMeasure ((s : ℝ) * (1 - lam / (s : ℝ))) := by sorry

end WhittEfficiency.MMs
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 719, §3.1, sentence immediately preceding Proposition 3.1; https://doi.org/10.1287/mnsc.38.5.708
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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