Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.7) — the Pollaczek–Khintchine mean system size at departure points

Proved
QueueingFundamentals.MG1.mean_departure_size

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

m-g-1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1pollaczek-khintchinequeueing

Let λ>0\lambda > 0λ>0, let BBB be a service-time distribution on [0,∞)[0,\infty)[0,∞) with finite second moment and variance σB2\sigma_B^2σB2​, let ρ=λ E[S]<1\rho = \lambda\,\mathrm E[S] < 1ρ=λE[S]<1, and let π\piπ be the stationary distribution of the M/G/1 departure-point chain. Then the mean number left behind by a departure is finite and equals

L(D)=∑n=0∞n πn=ρ+ρ2+λ2σB22(1−ρ).L^{(D)} = \sum_{n=0}^{\infty} n\,\pi_n = \rho + \frac{\rho^2 + \lambda^2\sigma_B^2}{2(1-\rho)} .L(D)=n=0∑∞​nπn​=ρ+2(1−ρ)ρ2+λ2σB2​​.

This is the Pollaczek–Khintchine mean-value formula in departure-point form; with Wq=Lq/λW_q = L_q/\lambdaWq​=Lq​/λ and the equality of departure-point and time-average probabilities it is equivalent to (5.2).

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_MG1_embeddedChain
Formal statement
namespace QueueingFundamentals.MG1

open MeasureTheory

/-- Eq. (5.7), p.225: with `ρ = λ E[S] < 1` and a service distribution with finite second
moment and variance `σ_B²`, the stationary departure-point system size has finite mean
`L^{(D)} = ∑ n π_n = ρ + (ρ² + λ² σ_B²) / (2(1 - ρ))`. -/
theorem mean_departure_size (lam : ℝ) (hlam : 0 < lam) (B : Measure ℝ) [IsProbabilityMeasure B]
    (hB : B (Set.Iio 0) = 0)
    (hint : Integrable (fun t : ℝ => t) B) (hint2 : Integrable (fun t : ℝ => t ^ 2) B)
    (hρ : utilization lam B < 1)
    (π : ℕ → ℝ) (hπ : IsStationaryDist (transitionMatrix lam B) π) :
    HasSum (fun n : ℕ => (n : ℝ) * π n)
      (utilization lam B + (utilization lam B ^ 2 + lam ^ 2 * serviceVariance B) /
        (2 * (1 - utilization lam B))) := by sorry

end QueueingFundamentals.MG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.225, Eq. (5.7)
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