Lemma 3 (first sentence), p. 37 — ρ(q) is strictly convex and 1/ρ(q) strictly concave on [1, m]
ProvedTeleDriving.AmpleFleet.lemma3_rho_strictConvexconvexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingtele-driving
Consider the ride-hailing loss model with vehicles, arrival rate and service rate satisfying Assumptions 1 and 2 and the size restriction , . Let . Then on
Convexity of is what makes the set where an interval, which in turn yields the three regimes of the model and the shape of the service level in the number of drivers.
Formalization Note The statement is about real in ; no differentiability of is assumed, although the paper's proof differentiates twice. The standing hypotheses are carried as in every statement of this paper; no regime is assumed.
Preamble
import Mathlib import Definitions.Def_TeleDriving_ScarceFleet_Model
Formal statement
namespace TeleDriving.AmpleFleet
theorem lemma3_rho_strictConvex (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) :
StrictConvexOn ℝ (Set.Icc (1 : ℝ) m) (TeleDriving.ScarceFleet.rho mu lam m) ∧
StrictConcaveOn ℝ (Set.Icc (1 : ℝ) m) (fun q => 1 / TeleDriving.ScarceFleet.rho mu lam m q) := 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. 37, Lemma 3 (first sentence)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.