Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — PN{Ab}≤PN{Bl}P_N\{Ab\}\le P_N\{Bl\}PN​{Ab}≤PN​{Bl} for every 0<θ<∞0<\theta<\infty0<θ<∞

Proved
ErlangA.Abandonment.probAbandon_le_erlang

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

erlang-aerlang-bp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing

For N≥1N\ge1N≥1 agents, arrival rate λ>0\lambda>0λ>0, service rate μ>0\mu>0μ>0 and any patience rate 0<θ<∞0<\theta<\infty0<θ<∞, the steady-state abandonment probability of the Erlang-A queue is at most Erlang's blocking probability of the loss system with the same NNN, λ\lambdaλ, μ\muμ:

PN{Ab}≤PN{Bl}=E(λ/μ,N).P_N\{Ab\}\le P_N\{Bl\}=E(\lambda/\mu,N).PN​{Ab}≤PN​{Bl}=E(λ/μ,N).

This is the comparison that turns asymptotics of Erlang's formula into the upper bound of Theorem 1.

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

/-- p. 223: `P_N{Ab} ≤ P_N{Bl}` for every patience rate `0 < θ < ∞`. -/
theorem probAbandon_le_erlang (N : ℕ) (hN : 1 ≤ N) (lam μ θ : ℝ)
    (hlam : 0 < lam) (hμ : 0 < μ) (hθ : 0 < θ) :
    probAbandon N lam μ θ ≤ KellyStochasticNetworks.erlang (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
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