Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, pp. 7–8 — the ratio R(qs)/Rs(qs)R(q^s)/R_s(q^s)R(qs)/Rs​(qs) equals the common availability α\alphaα

Proved
VehicleSharePricing.Static.ratio_eq_availability

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingqueueing-networksvehicle-sharing

Let qqq be a quantile policy with balanced flows that induces a strongly connected network, let rrr be a positive solution of the traffic equations (9), and assume Rs(q)=∑(i,j)∈AΛijqijIij(qij)>0R_s(q)=\sum_{(i,j)\in\mathcal A}\Lambda_{ij}q_{ij}I_{ij}(q_{ij})>0Rs​(q)=∑(i,j)∈A​Λij​qij​Iij​(qij​)>0. Then for every number of vehicles KKK and every location iii,

R(q)Rs(q)=∑(i,j)∈AαiΛijqijIij(qij)∑(i,j)∈AΛijqijIij(qij)=αi(K).\frac{R(q)}{R_s(q)}=\frac{\sum_{(i,j)\in\mathcal A}\alpha_i\Lambda_{ij}q_{ij}I_{ij}(q_{ij})}{\sum_{(i,j)\in\mathcal A}\Lambda_{ij}q_{ij}I_{ij}(q_{ij})}=\alpha_i(K).Rs​(q)R(q)​=∑(i,j)∈A​Λij​qij​Iij​(qij​)∑(i,j)∈A​αi​Λij​qij​Iij​(qij​)​=αi​(K).

The static policy therefore earns exactly the fraction α\alphaα of the fluid value, which reduces every bound of the paper to a bound on the availability.

Formalization Note The hypothesis Rs(q)>0R_s(q)>0Rs​(q)>0 is added: without it the ratio is 0/00/00/0. The paper states this for qsq^sqs; the statement is posed for every balanced quantile policy inducing a strongly connected network, which includes qsq^sqs.

Preamble
import Mathlib
import Definitions.Def_VehicleSharePricing_Static_Model
import Definitions.Def_VehicleSharePricing_Static_Availability
Formal statement
namespace VehicleSharePricing.Static

/-- Proof of Theorem 1, pp. 7–8: under a quantile policy `q` with balanced flows that induces a
strongly connected network and has `R_s(q) > 0`, the ratio `R(q)/R_s(q)` equals the common
availability `α` (the availability at any location `i`). -/
theorem ratio_eq_availability {L : Type*} [Fintype L] [DecidableEq L] [Nonempty L]
    (P : Instance L) (q : L → L → ℝ) (hq : IsQuantile P q) (hbal : Balanced P q)
    (hconn : InducesStronglyConnected P q) (r : L → ℝ) (hr : IsTrafficSolution P q r)
    (hRs : 0 < Rs P q) (K : ℕ) (i : L) :
    R P q r K / Rs P q = availability P q r K i := by sorry

end VehicleSharePricing.Static
Source
Benjaafar & Shen, Pricing in On-Demand (and One-Way) Vehicle Sharing Networks, SSRN abstract 3998297 (version of 2023-01-10), pp. 7–8, proof of Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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