Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — agent utilization below one: λ(1−P{Ab})<Nμ\lambda(1-P\{Ab\})<N\muλ(1−P{Ab})<Nμ

Proved
ErlangA.Abandonment.utilization_lt_one

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

erlang-ap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingutilization

Consider the Erlang-A queue with N≥1N\ge1N≥1 agents, arrival rate λ>0\lambda>0λ>0, service rate μ>0\mu>0μ>0 and patience rate θ>0\theta>0θ>0, and let P{Ab}P\{Ab\}P{Ab} be the steady-state probability that an arriving customer abandons. Then

λ(1−P{Ab})<Nμ.\lambda\bigl(1-P\{Ab\}\bigr)<N\mu .λ(1−P{Ab})<Nμ.

The left side is the rate at which work reaches the agents and the right side the maximal rate at which they can process it, so the inequality says that the agents' utilization is strictly below one. In the proof of Theorem 1 it yields the lower bound lim inf⁡NPN{Ab}≥1−1/ρ∞\liminf_N P_N\{Ab\}\ge 1-1/\rho_\inftyliminfN​PN​{Ab}≥1−1/ρ∞​.

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

/-- App. C, proof of Theorem 1, p. 223, first display: the agents utilization is below one,
`λ (1 − P{Ab}) < Nμ`. -/
theorem utilization_lt_one (N : ℕ) (hN : 1 ≤ N) (lam μ θ : ℝ)
    (hlam : 0 < lam) (hμ : 0 < μ) (hθ : 0 < θ) :
    lam * (1 - probAbandon N lam μ θ) < (N : ℝ) * μ := by sorry

end ErlangA.Abandonment
Source
Garnett, Mandelbaum & Reiman, Designing a Call Center with Impatient Customers, M&SOM 4(3), 2002, p. 223, Appendix C, proof of Theorem 1, first display
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