Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. C.1, p. 40 — π_{m,m}(m) > π_{m,m−1}(m−1) if and only if Condition (5): λSL(m, m) > mµ(m, m)

Proved
TeleDriving.ScarceFleet.appC1_condition5_iff

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingservice-leveltele-driving

Under Assumptions 1–2 and the size restriction, the probability that all drivers are busy is larger with mmm drivers than with m−1m - 1m−1 drivers exactly when Condition (5) holds:

πm,m(m)>πm,m−1(m−1)  ⟺  λ SL(m,m)>m μ(m,m).\pi_{m,m}(m) > \pi_{m,m-1}(m-1) \iff \lambda\, SL(m,m) > m\,\mu(m,m).πm,m​(m)>πm,m−1​(m−1)⟺λSL(m,m)>mμ(m,m).

Condition (5) compares the average trip-completion rate λSL(m,m)\lambda SL(m,m)λSL(m,m) with the completion rate mμ(m,m)m\mu(m,m)mμ(m,m) when every vehicle is occupied. By the dichotomy of App. C.1 it decides which of the two shapes the service level has, which is how Theorem 1.A is proved.

Formalization Note m−1m - 1m−1 is natural-number subtraction; the standing hypotheses force m≥2m \ge 2m≥2 (Assumption 2 places a turning point strictly inside (1,m)(1, m)(1,m)). πm,m−1(m−1)\pi_{m,m-1}(m-1)πm,m−1​(m−1) is the blocking probability of the system with mmm vehicles and m−1m - 1m−1 drivers.

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

theorem appC1_condition5_iff (mu : ℕ → ℝ → ℝ) (s lam : ℝ) (mbar m : ℕ) (hA1 : Assumption1 mu s)
    (hA2 : Assumption2 mu mbar) (hsize : StandingSize mu s mbar m lam) :
    piMN mu lam m m m > piMN mu lam m (m - 1) (m - 1) ↔
      lam * SL mu lam m m > (m : ℝ) * mu m (m : ℝ) := by sorry

end TeleDriving.ScarceFleet
Source
Benjaafar, Wang & Yang, Human in The Loop Automation: Ride-Hailing with Remote (Tele-) Drivers, SSRN 4130757 (version of 1 June 2023), App. C.1, p. 40 (the display for SL(m, n+1) and the sentence after it)
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