Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. D.1, p. 44 — with m_λ = ⌊αλs⌋, ρ(k) > 1/α for 1 ≤ k ≤ m_λ

Proved
TeleDriving.AsymLimited.appD1_rho_gt

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

loss-systemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingtele-driving

Let s>0s > 0s>0 be the expected trip time, α∈(0,1)\alpha \in (0,1)α∈(0,1), and let the service rate be (4), μ(m,q)=[s/m−q+1+s]−1\mu(m,q) = [s/\sqrt{m-q+1}+s]^{-1}μ(m,q)=[s/m−q+1​+s]−1, so that the load is ρ(q)=λq(sm−q+1+s)\rho(q) = \frac{\lambda}{q}\big(\frac{s}{\sqrt{m-q+1}}+s\big)ρ(q)=qλ​(m−q+1​s​+s) (display (13)). For every arrival rate λ>0\lambda > 0λ>0, with mλ=⌊αλs⌋m_\lambda = \lfloor \alpha\lambda s\rfloormλ​=⌊αλs⌋ vehicles,

ρ(k)>1αfor every integer 1≤k≤mλ.\rho(k) > \frac{1}{\alpha} \qquad \text{for every integer } 1 \le k \le m_\lambda.ρ(k)>α1​for every integer 1≤k≤mλ​.

In the supply-limited regime α<1\alpha < 1α<1, the load exceeds a=1/α>1a = 1/\alpha > 1a=1/α>1 uniformly over all occupancy levels; this geometric lower bound drives the comparison probability (19) and the vanishing of the low-occupancy mass in the proof of Theorem 2.A.

Formalization Note The statement holds for every λ>0\lambda > 0λ>0, not only eventually. When mλ=0m_\lambda = 0mλ​=0 the range of kkk is empty.

Preamble
import Mathlib
import Definitions.Def_TeleDriving_ScarceFleet_Model
Formal statement
namespace TeleDriving.AsymLimited

theorem appD1_rho_gt (s alpha : ℝ) (hs : 0 < s) (ha0 : 0 < alpha) (ha1 : alpha < 1) :
    ∀ lam : ℝ, 0 < lam → ∀ k : ℕ, k ∈ Finset.Icc 1 (TeleDriving.ScarceFleet.mLam alpha s lam) →
      1 / alpha < TeleDriving.ScarceFleet.rho (TeleDriving.ScarceFleet.muBesbes s) lam (TeleDriving.ScarceFleet.mLam alpha s lam) (k : ℝ) := by sorry

end TeleDriving.AsymLimited
Source
Benjaafar, Wang & Yang, Human in The Loop Automation: Ride-Hailing with Remote (Tele-) Drivers, SSRN 4130757 (version of 1 June 2023), App. D.1, p. 44 (using (13), p. 42)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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