Lemma 4, p. 39 — π_{m,n−1}(n−1) > π_{m,n}(n) iff either side exceeds (ρ(n)−1)/ρ(n)
ProvedTeleDriving.ScarceFleet.lemma4loss-systemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingtele-driving
Under Assumptions 1–2 and the size restriction, write for the stationary probability that all drivers are busy in the system with vehicles and remote drivers. For every , the following are equivalent:
The lemma turns the comparison of the blocking probabilities of consecutive driver counts into a comparison with the explicit threshold , 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 the left side is (empty sum and product), as (2) also gives. The proof on the page assumes "", where can be negative; the lemma holds regardless (only 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.