Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7, p. 28 — given capacity N, the optimal AV fleet in a scenario is min{N, n*_{HV,i}}

Proved
AVRideHail.MonopolyCapacity.proposition7_optimal_fleet

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

autonomous-vehiclesmonopolyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1ride-hailing

Consider a common-platform market with a>0a > 0a>0, 0<r<10 < r < 10<r<1, t2>0t_2 > 0t2​>0, V>0V > 0V>0, constant HV reservation earnings w0w_0w0​ (α=0\alpha = 0α=0), and AV costs cv,cf>0c_v, c_f > 0cv​,cf​>0 with cv+cf<w0c_v + c_f < w_0cv​+cf​<w0​ (Assumption 1). Fix a scenario with potential demand mass m>0m > 0m>0, a loose market (condition (33)), maximal stable pure-HV equilibrium demand d∗d^*d∗, and nHV∗=n‾(d∗)n^*_{HV} = \underline{n}(d^*)nHV∗​=n​(d∗). Given an AV capacity N≥0N \ge 0N≥0, the monopoly supplier chooses its fleet nAV∈[0,N]n_{AV} \in [0, N]nAV​∈[0,N] to maximize its total variable profit πC(nAV) nAV\pi^C(n_{AV})\, n_{AV}πC(nAV​)nAV​, where πC\pi^CπC is the per-AV profit (251). Then

nAV=min⁡{N,nHV∗}n_{AV} = \min\{N, n^*_{HV}\}nAV​=min{N,nHV∗​}

is the unique maximizer: if N<nHV∗N < n^*_{HV}N<nHV∗​ the supplier deploys its whole capacity, and if N≥nHV∗N \ge n^*_{HV}N≥nHV∗​ it deploys exactly nHV∗n^*_{HV}nHV∗​ AVs, the supply level that keeps HVs out of the market.

This solves the second stage of the monopoly's two-stage problem (5); the first-stage capacity choice is Proposition 8.

Formalization Note. The proposition's closing sentence (total fleet size and price equal those of the pure-HV market) is the content of Proposition 6, which the mission takes as the definition (251) of πC\pi^CπC; it is not restated. The case "(nHV∗−N)(n^*_{HV} - N)(nHV∗​−N) HVs join the market" is likewise part of Proposition 6's equilibrium and not restated.

Preamble
import Mathlib
import Definitions.Def_AVRideHail_MonopolyCapacity_Model
Formal statement
namespace AVRideHail.MonopolyCapacity

theorem proposition7_optimal_fleet (P : AVRideHail.PureHV.MarketParams) (ha : 0 < P.a) (hr0 : 0 < P.r)
    (hr1 : P.r < 1) (ht2 : 0 < P.t2) (hV : 0 < P.V) (halpha : P.alpha = 0)
    (cv cf : ℝ) (hcv : 0 < cv) (hcf : 0 < cf) (hA1 : cv + cf < P.w0)
    (m : ℝ) (hm : 0 < m) (hloose : AVRideHail.PureHV.LooseMarket P m)
    (dstar : ℝ) (hdstar : AVRideHail.PureHV.IsMaxStableEq P m dstar) (N : ℝ) (hN : 0 ≤ N) :
    IsMaxOn (fun n => piC P cv m dstar n * n) (Set.Icc 0 N) (min N (AVRideHail.PureHV.nMin P dstar)) ∧
      ∀ n ∈ Set.Icc 0 N,
        piC P cv m dstar n * n = piC P cv m dstar (min N (AVRideHail.PureHV.nMin P dstar)) * min N (AVRideHail.PureHV.nMin P dstar) →
          n = min N (AVRideHail.PureHV.nMin P dstar) := 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. 28, Proposition 7; proof App. E.1.2, pp. 84–85
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