Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — the fraction of abandoning customers tends to max⁡(0,1−1/ρ∞)\max(0,1-1/\rho_\infty)max(0,1−1/ρ∞​)

Proved
ErlangA.Abandonment.theorem_1

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

call-centerserlang-amany-server-asymptoticsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing

Consider a sequence of Erlang-A queues indexed by the number of agents N≥1N\ge1N≥1: the NNN-th system has arrival rate λN>0\lambda_N>0λN​>0, service rate μ>0\mu>0μ>0 (the same for all NNN) and patience rate θN>0\theta_N>0θN​>0, and its traffic intensity is

ρN=λNNμ.\rho_N=\frac{\lambda_N}{N\mu}.ρN​=NμλN​​.

Assume, as in §4 of the paper, that λN→∞\lambda_N\to\inftyλN​→∞ and θN→θ\theta_N\to\thetaθN​→θ with 0<θ<∞0<\theta<\infty0<θ<∞. Let PN{Ab}P_N\{Ab\}PN​{Ab} be the probability that a customer arriving to the NNN-th system in steady state abandons. If ρN→ρ∞\rho_N\to\rho_\inftyρN​→ρ∞​ for some 0≤ρ∞≤∞0\le\rho_\infty\le\infty0≤ρ∞​≤∞, then

lim⁡N→∞PN{Ab}={0,0≤ρ∞≤1,1−1ρ∞,ρ∞>1,\lim_{N\to\infty}P_N\{Ab\}=\begin{cases}0, & 0\le\rho_\infty\le1,\\[1mm] 1-\dfrac1{\rho_\infty}, & \rho_\infty>1,\end{cases}N→∞lim​PN​{Ab}=⎩⎨⎧​0,1−ρ∞​1​,​0≤ρ∞​≤1,ρ∞​>1,​

with 1−1/∞=11-1/\infty=11−1/∞=1.

Thus, to leading order, the fraction of abandoning callers does not depend on the patience distribution's rate: a critically loaded center (ρ∞=1\rho_\infty=1ρ∞​=1) already has vanishing abandonment, while an overloaded one sheds exactly the excess load.

Formalization Note The limit ρ∞∈[0,∞]\rho_\infty\in[0,\infty]ρ∞​∈[0,∞] is an extended nonnegative real, and ρN→ρ∞\rho_N\to\rho_\inftyρN​→ρ∞​ is convergence of ρN\rho_NρN​ in [0,∞][0,\infty][0,∞]; for ρ∞=∞\rho_\infty=\inftyρ∞​=∞ it means ρN→∞\rho_N\to\inftyρN​→∞. The value 1−1/ρ∞1-1/\rho_\infty1−1/ρ∞​ is computed in [0,∞][0,\infty][0,∞] and converted to a real number, which gives 111 at ρ∞=∞\rho_\infty=\inftyρ∞​=∞. The hypotheses λN→∞\lambda_N\to\inftyλN​→∞ and θN→θ∈(0,∞)\theta_N\to\theta\in(0,\infty)θN​→θ∈(0,∞) are the standing assumptions of §4 and are kept as the paper states them; positivity of λN\lambda_NλN​, θN\theta_NθN​ is imposed for N≥1N\ge1N≥1.

Preamble
import Mathlib
import Definitions.Def_ErlangA_Abandonment_Model
open Filter Topology
Formal statement
namespace ErlangA.Abandonment

/-- **Theorem 1**, p. 215. Standing assumptions of §4 (p. 215): `μ_N ≡ μ > 0`, `λ_N > 0` with
`λ_N → ∞`, `θ_N > 0` with `θ_N → θ ∈ (0, ∞)`. If `ρ_N = λ_N/(Nμ) → ρ_∞ ∈ [0, ∞]` (convergence
in `ℝ≥0∞`), then `P_N{Ab} → 0` when `ρ_∞ ≤ 1` and `P_N{Ab} → 1 − 1/ρ_∞` when `ρ_∞ > 1`
(with `1 − 1/∞ = 1`). -/
theorem theorem_1 (μ θ : ℝ) (lam θN : ℕ → ℝ) (hμ : 0 < μ)
    (hlam : ∀ N : ℕ, 1 ≤ N → 0 < lam N) (hlam_infty : Tendsto lam atTop atTop)
    (hθN : ∀ N : ℕ, 1 ≤ N → 0 < θN N) (hθ : 0 < θ) (hθlim : Tendsto θN atTop (𝓝 θ))
    (ρinf : ENNReal)
    (hρ : Tendsto (fun N : ℕ => ENNReal.ofReal (lam N / ((N : ℝ) * μ))) atTop (𝓝 ρinf)) :
    Tendsto (fun N : ℕ => probAbandon N (lam N) μ (θN N)) atTop
      (𝓝 (if ρinf ≤ 1 then 0 else (1 - ρinf⁻¹).toReal)) := by sorry

end ErlangA.Abandonment
Source
Garnett, Mandelbaum & Reiman, Designing a Call Center with Impatient Customers, M&SOM 4(3), 2002, p. 215, Theorem 1 (with the standing assumptions of §4, p. 215)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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