Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 39 — π_{m,n−1}(n−1) > π_{m,n}(n) iff either side exceeds (ρ(n)−1)/ρ(n)

Proved
TeleDriving.ScarceFleet.lemma4

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

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

Under Assumptions 1–2 and the size restriction, write πm,n(n)\pi_{m,n}(n)πm,n​(n) for the stationary probability that all nnn drivers are busy in the system with mmm vehicles and nnn remote drivers. For every n∈{1,…,m}n \in \{1, \dots, m\}n∈{1,…,m}, the following are equivalent:

πm,n−1(n−1)>πm,n(n)  ⟺  πm,n−1(n−1)>ρ(n)−1ρ(n)  ⟺  πm,n(n)>ρ(n)−1ρ(n).\pi_{m,n-1}(n-1) > \pi_{m,n}(n) \iff \pi_{m,n-1}(n-1) > \frac{\rho(n)-1}{\rho(n)} \iff \pi_{m,n}(n) > \frac{\rho(n)-1}{\rho(n)}.πm,n−1​(n−1)>πm,n​(n)⟺πm,n−1​(n−1)>ρ(n)ρ(n)−1​⟺πm,n​(n)>ρ(n)ρ(n)−1​.

The lemma turns the comparison of the blocking probabilities of consecutive driver counts into a comparison with the explicit threshold 1−1/ρ(n)1 - 1/\rho(n)1−1/ρ(n), which is the recursion used in the proofs of Theorems 1.A–1.C.

Formalization Note The statement is the paper's pair of equivalences. At n=1n = 1n=1 the left side is πm,0(0)=1\pi_{m,0}(0) = 1πm,0​(0)=1 (empty sum and product), as (2) also gives. The proof on the page assumes "a,b,c,d>0a, b, c, d > 0a,b,c,d>0", where c=[ρ(n)−1]∏q<nρ(q)c = [\rho(n) - 1]\prod_{q<n}\rho(q)c=[ρ(n)−1]∏q<n​ρ(q) can be negative; the lemma holds regardless (only b,d>0b, d > 0b,d>0 is needed), and no such hypothesis is added.

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

theorem lemma4 (mu : ℕ → ℝ → ℝ) (s lam : ℝ) (mbar m : ℕ) (hA1 : Assumption1 mu s)
    (hA2 : Assumption2 mu mbar) (hsize : StandingSize mu s mbar m lam)
    (n : ℕ) (hn1 : 1 ≤ n) (hnm : n ≤ m) :
    (piMN mu lam m (n - 1) (n - 1) > piMN mu lam m n n ↔
        piMN mu lam m (n - 1) (n - 1) > (rho mu lam m (n : ℝ) - 1) / rho mu lam m (n : ℝ)) ∧
      (piMN mu lam m (n - 1) (n - 1) > piMN mu lam m n n ↔
        piMN mu lam m n n > (rho mu lam m (n : ℝ) - 1) / rho mu lam m (n : ℝ)) := 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), p. 39, Lemma 4; proof p. 39, (11)–(12)
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