Lemma 1 Item 2, p. 38 — n̲ is strictly increasing and a bijection of [0, ∞)
ProvedAVRideHail.MonopolyCapacity.lemma1_nMin_strictMono_bijOndensity-effectp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1ride-hailing
Let , and , and let be the minimal supply level of Lemma 1, with . Then is strictly increasing on and maps bijectively onto :
Consequently has an inverse on , the highest demand rate that a fleet of vehicles can serve.
This is the fact that makes the AV demand in the profit function (251) well defined.
Formalization Note. The statement is the same text, up to namespace, as the copy in the pure-HV mission of this series. At Lean's conventions give and , matching the paper's case.
Preamble
import Mathlib import Definitions.Def_AVRideHail_MonopolyCapacity_Model
Formal statement
namespace AVRideHail.MonopolyCapacity
theorem lemma1_nMin_strictMono_bijOn (P : AVRideHail.PureHV.MarketParams) (ha : 0 < P.a) (hr0 : 0 ≤ P.r)
(hr1 : P.r < 1) (ht2 : 0 < P.t2) :
StrictMonoOn (AVRideHail.PureHV.nMin P) (Set.Ici 0) ∧ Set.BijOn (AVRideHail.PureHV.nMin P) (Set.Ici 0) (Set.Ici 0) := by sorry
end AVRideHail.MonopolyCapacity
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
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.