Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1, p. 720 — conditional tail and mean under the utilization equation

Proved
WhittEfficiency.MMs.proposition_3_1

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

conditional-waitmmcp2o-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​). Let WWW be the FCFS waiting time of an arriving customer, ρ=λ/s\rho=\lambda/sρ=λ/s, and suppose the utilization equation (1−ρ)s=γ(1-\rho)\sqrt{s}=\gamma(1−ρ)s​=γ holds. A positive wait has positive probability, and for every x≥0x\geq0x≥0,

P(W>x∣W>0)=e−γs x,E[W∣W>0]=1γs.\mathbb P(W>x\mid W>0)=e^{-\gamma\sqrt{s}\,x},\qquad \mathbb E[W\mid W>0]=\frac1{\gamma\sqrt{s}}.P(W>x∣W>0)=e−γs​x,E[W∣W>0]=γs​1​.

These formulas give both the conditional tail and conditional mean of the delay under the paper's utilization scaling.

Formalization Note The stationary birth–death law uses unit service rate, and the waiting-time law is the Erlang mixture in WhittEfficiency.MMs.WaitLaw. The printed (16) omits xxx in the exponent and the printed (17) has 2\sqrt22​ in place of s\sqrt{s}s​; both are corrected here using the preceding and following text on pp. 719–720. The positive-delay conclusion guards the conditional probabilities and means against division by zero.

Preamble
import Mathlib
import Definitions.Def_WhittEfficiency_MMs_WaitLaw

open MeasureTheory ProbabilityTheory
Formal statement
namespace WhittEfficiency.MMs

/-- Whitt (1992), Proposition 3.1, p. 720, (16)–(17), with the printed omissions
corrected: the exponent in (16) includes `x`, and the denominator in (17) is `γ√s`. -/
theorem proposition_3_1
    (s : ℕ) (hs : 1 ≤ s) (lam : ℝ) (hlam : 0 < lam) (hρ : lam < s)
    (p : ℕ → ℝ)
    (hp : QueueingFundamentals.BirthDeath.IsSteadyState
      (fun _ => lam) (QueueingFundamentals.BirthDeath.mmcDeath 1 s) p)
    (γ : ℝ) (h1 : (1 - lam / (s : ℝ)) * Real.sqrt s = γ) :
    0 < (waitLaw s p).real (Set.Ioi (0 : ℝ)) ∧
      (∀ x : ℝ, 0 ≤ x →
        (waitLaw s p).real (Set.Ioi x) /
          (waitLaw s p).real (Set.Ioi (0 : ℝ)) =
            Real.exp (-(γ * Real.sqrt s * x))) ∧
      (∫ w in Set.Ioi (0 : ℝ), w ∂(waitLaw s p)) /
        (waitLaw s p).real (Set.Ioi (0 : ℝ)) = 1 / (γ * Real.sqrt s) := by sorry

end WhittEfficiency.MMs
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 720, Proposition 3.1, (16)–(17), with (1) p. 708 and (3) p. 710; 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