Lemma 4, p. 39 — π_{m,n−1}(n−1) > π_{m,n}(n) iff either side exceeds (ρ(n)−1)/ρ(n)
ProvedTeleDriving.AmpleFleet.lemma4loss-systemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingservice-leveltele-driving
In the ride-hailing loss model under Assumptions 1–2 and the size restriction, let be the stationary probability that all drivers are busy. For every ,
The lemma turns the comparison of consecutive blocking probabilities into a comparison with a threshold depending only on ; it drives every monotonicity argument for the service level in the number of drivers.
Formalization Note At the left side is (empty sum and product), as in (2). The two equivalences are stated as two conjuncts with a common left side.
Preamble
import Mathlib import Definitions.Def_TeleDriving_ScarceFleet_Model
Formal statement
namespace TeleDriving.AmpleFleet
theorem lemma4 (mu : ℕ → ℝ → ℝ) (s lam : ℝ) (mbar m : ℕ) (hA1 : TeleDriving.ScarceFleet.Assumption1 mu s)
(hA2 : TeleDriving.ScarceFleet.Assumption2 mu mbar) (hsize : TeleDriving.ScarceFleet.StandingSize mu s mbar m lam)
(n : ℕ) (hn1 : 1 ≤ n) (hnm : n ≤ m) :
(TeleDriving.ScarceFleet.piMN mu lam m (n - 1) (n - 1) > TeleDriving.ScarceFleet.piMN mu lam m n n ↔
TeleDriving.ScarceFleet.piMN mu lam m (n - 1) (n - 1) > (TeleDriving.ScarceFleet.rho mu lam m (n : ℝ) - 1) / TeleDriving.ScarceFleet.rho mu lam m (n : ℝ)) ∧
(TeleDriving.ScarceFleet.piMN mu lam m (n - 1) (n - 1) > TeleDriving.ScarceFleet.piMN mu lam m n n ↔
TeleDriving.ScarceFleet.piMN mu lam m n n > (TeleDriving.ScarceFleet.rho mu lam m (n : ℝ) - 1) / TeleDriving.ScarceFleet.rho mu lam m (n : ℝ)) := by sorry
end TeleDriving.AmpleFleet
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
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.