Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 Item 2, p. 38 — n̲ is strictly increasing and a bijection of [0, ∞), so its inverse d̄(n) exists

Proved
AVRideHail.PureHV.lemma1_nMin_strictMono_bijOn

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

density-effectmonotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1ride-hailing

Let a>0a > 0a>0, 0≤r<10 \le r < 10≤r<1 and t2>0t_2 > 0t2​>0, and let n‾(d)=a~ d1r+1+t2d\underline{n}(d) = \tilde a\, d^{\frac{1}{r+1}} + t_2 dn​(d)=a~dr+11​+t2​d be the minimal supply level. Then n‾\underline{n}n​ is strictly increasing on [0,∞)[0,\infty)[0,∞) and maps [0,∞)[0,\infty)[0,∞) bijectively onto [0,∞)[0,\infty)[0,∞):

n‾:[0,∞)→[0,∞) is a strictly increasing bijection.\underline{n} : [0,\infty) \to [0,\infty) \text{ is a strictly increasing bijection.}n​:[0,∞)→[0,∞) is a strictly increasing bijection.

Consequently it has an inverse dˉ(n)\bar d(n)dˉ(n) on [0,∞)[0,\infty)[0,∞), the highest demand rate that a fleet of nnn vehicles can serve.

The inverse dˉ\bar ddˉ 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 n‾\underline{n}n​ from [0,∞)[0,\infty)[0,∞) onto [0,∞)[0,\infty)[0,∞), together with strict monotonicity on [0,∞)[0,\infty)[0,∞) (the proof's "strictly increasing"). The case r=0r = 0r=0 is included; there n‾(d)=(a+t2)d\underline{n}(d) = (a + t_2) dn​(d)=(a+t2​)d.

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
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me