Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5), p. 8 — α(K)=K/(K+N−1+(λ/μ)(1−α(K−1)))\alpha(K)=K/(K+N-1+(\lambda/\mu)(1-\alpha(K-1)))α(K)=K/(K+N−1+(λ/μ)(1−α(K−1)))

Proved
VehicleSharePricing.Static.eq_5

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

mean-value-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing-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 write α(K)\alpha(K)α(K) for the availability at a location iii with KKK vehicles. Then for every K≥1K\ge 1K≥1,

α(K)=KK+N−1+∑(i,j)∈AΛijqijμij(1−α(K−1)).\alpha(K)=\frac{K}{K+N-1+\sum_{(i,j)\in\mathcal A}\dfrac{\Lambda_{ij}q_{ij}}{\mu_{ij}}\bigl(1-\alpha(K-1)\bigr)}.α(K)=K+N−1+∑(i,j)∈A​μij​Λij​qij​​(1−α(K−1))K​.

This recursion in the number of vehicles is the engine of Theorems 1 and 2: bounding α(K−1)\alpha(K-1)α(K−1) from below bounds α(K)\alpha(K)α(K) from below. The paper derives it from the random observer property (arrival theorem) and Little's law.

Formalization Note The availability is the product-form one of the definition file, with α(0)=0\alpha(0)=0α(0)=0 (no vehicle can be waiting). The statement holds at every location iii; the paper's α\alphaα is location-free by the equal-availability milestone. It 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

/-- Equation (5), p. 8 (Appendix, pp. 23–24): under a quantile policy `q` with balanced flows
that induces a strongly connected network, for every `K ≥ 1` and every location `i`,
`α(K) = K / (K + N − 1 + (∑_{(i,j)∈𝒜} Λ_ij q_ij / μ_ij)(1 − α(K − 1)))`. -/
theorem eq_5 {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 : ℕ) (hK : 1 ≤ K) (i : L) :
    availability P q r K i =
      (K : ℝ) / ((K : ℝ) + (Fintype.card L : ℝ) - 1 +
        workload P q * (1 - availability P q r (K - 1) 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), p. 8, Equation (5); Appendix, pp. 23–24, "Proof for Equation (5)"
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