Lemma 1 Item 2, p. 38 — n̲ is strictly increasing and a bijection of [0, ∞), so its inverse d̄(n) exists
ProvedAVRideHail.PureHV.lemma1_nMin_strictMono_bijOndensity-effectmonotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1ride-hailing
Let , and , and let be the minimal supply level. Then is strictly increasing on and maps bijectively onto :
Consequently it has an inverse on , the highest demand rate that a fleet of vehicles can serve.
The inverse is what translates a fleet size into served demand in the paper's analysis of autonomous-vehicle capacity.
Formalization Note "Has an inverse function" is stated as Set.BijOn of from onto , together with strict monotonicity on (the proof's "strictly increasing"). The case is included; there .
Preamble
import Mathlib import Definitions.Def_AVRideHail_PureHV_Model
Formal statement
namespace AVRideHail.PureHV
theorem lemma1_nMin_strictMono_bijOn (P : MarketParams) (ha : 0 < P.a) (hr0 : 0 ≤ P.r)
(hr1 : P.r < 1) (ht2 : 0 < P.t2) :
StrictMonoOn (nMin P) (Set.Ici 0) ∧ Set.BijOn (nMin P) (Set.Ici 0) (Set.Ici 0) := by sorry
end AVRideHail.PureHV
Source
Lian & van Ryzin, Capturing the Benefits of Autonomous Vehicles in Ride-Hailing: The Role of Market Configuration, SSRN 3716491 (version of 23 August 2023), p. 38, Lemma 1 Item 2; proof p. 39
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.