Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Property (ii) — PN{Ab}P_N\{Ab\}PN​{Ab} is increasing in the abandonment rate θ\thetaθ

Proved
ErlangA.Abandonment.probAbandon_monotone_patience

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

erlang-amonotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing

Fix N≥1N\ge1N≥1 agents, an arrival rate λ>0\lambda>0λ>0 and a service rate μ>0\mu>0μ>0, and let PN{Ab}(θ)P_N\{Ab\}(\theta)PN​{Ab}(θ) be the steady-state abandonment probability of the Erlang-A queue with patience rate θ\thetaθ. Then

0<θ1≤θ2 ⟹ PN{Ab}(θ1)≤PN{Ab}(θ2).0<\theta_1\le\theta_2\ \Longrightarrow\ P_N\{Ab\}(\theta_1)\le P_N\{Ab\}(\theta_2).0<θ1​≤θ2​ ⟹ PN​{Ab}(θ1​)≤PN​{Ab}(θ2​).

More impatient customers abandon more often. The paper quotes this property from Bhattacharya and Ephremides (1991) and uses it to compare the Erlang-A queue with the loss system obtained as θ→∞\theta\to\inftyθ→∞.

Formalization Note "Increasing" is read as nondecreasing; the proof of Theorem 1 uses only this.

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

/-- p. 223, property (ii): with `N`, `μ`, `λ` fixed, `P_N{Ab}` is (weakly) increasing in the
patience rate `θ > 0`. -/
theorem probAbandon_monotone_patience (N : ℕ) (hN : 1 ≤ N) (lam μ : ℝ)
    (hlam : 0 < lam) (hμ : 0 < μ) :
    MonotoneOn (fun θ : ℝ => probAbandon N lam μ θ) (Set.Ioi 0) := 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, property (ii) (from Bhattacharya and Ephremides 1991)
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