Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 7 (Appendix, p. 23) — balanced flows give equal availability at every location

Proved
VehicleSharePricing.Static.equal_availability

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-formqueueing-networksvehicle-sharing

Let qqq be a quantile policy (qij∈[0,1]q_{ij}\in[0,1]qij​∈[0,1] on A\mathcal AA) with balanced flows, ∑jΛijqij=∑jΛjiqji\sum_j\Lambda_{ij}q_{ij}=\sum_j\Lambda_{ji}q_{ji}∑j​Λij​qij​=∑j​Λji​qji​ for every location iii, which induces a strongly connected network, and let rrr be a positive solution of the traffic equations (9). Then for every number of vehicles KKK the product-form availability is the same at all locations:

αi(K)=αj(K)for all locations i,j.\alpha_i(K)=\alpha_j(K)\qquad\text{for all locations } i,j.αi​(K)=αj​(K)for all locations i,j.

The common value is the paper's α\alphaα (or α(K)\alpha(K)α(K)). It is what lets the reward rate R(q)R(q)R(q) of (3) factor as αRs(q)\alpha R_s(q)αRs​(q).

Formalization Note The paper asserts this for the optimal static policy qsq^sqs, and its Appendix proves it "when the network is balanced"; 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, p. 7, proved in the Appendix, p. 23: under a quantile policy `q` with
balanced flows that induces a strongly connected network, the availability `α_i` with `K`
vehicles is the same at every location. -/
theorem equal_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)
    (K : ℕ) (i j : L) :
    availability P q r K i = availability P q r K j := 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), p. 7, proof of Theorem 1; p. 23, Appendix, "Proof for α_i = α_j = α when the network is balanced"
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