Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6, p. 12 — infinite-unit availability of node i is r_i(q)/max_j r_j(q) (corrected: support of q strongly connected)

Proved
SharedVehicleApprox.Pricing.prop_6

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

asymptoticsavailabilityclosed-queueing-networkp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let φij≥0\varphi_{ij}\ge0φij​≥0 be arrival rates on n≥1n\ge1n≥1 nodes and q∈[0,1]n×nq\in[0,1]^{n\times n}q∈[0,1]n×n a state-independent quantile matrix whose support graph {(a,b):a≠b, φabqab>0}\{(a,b):a\ne b,\ \varphi_{ab}q_{ab}>0\}{(a,b):a=b, φab​qab​>0} is strongly connected. Let rrr be a positive solution of the traffic equations ∑jrjφjiqji=ri∑kφikqik\sum_jr_j\varphi_{ji}q_{ji}=r_i\sum_k\varphi_{ik}q_{ik}∑j​rj​φji​qji​=ri​∑k​φik​qik​ (it does not depend on mmm), and for every mmm let πm\pi_mπm​ be a stationary law of the mmm-unit system run under qqq. Then for every node iii

lim⁡m→∞Ai,m=rimax⁡jrj,Ai,m=∑x∈Sn,mπm(x)1{xi>0}.\lim_{m\to\infty}A_{i,m}=\frac{r_i}{\max_jr_j},\qquad A_{i,m}=\sum_{x\in S_{n,m}}\pi_m(x)\mathbf 1\{x_i>0\}.m→∞lim​Ai,m​=maxj​rj​ri​​,Ai,m​=x∈Sn,m​∑​πm​(x)1{xi​>0}.

These limits are the infinite-unit availabilities Ai,∞A_{i,\infty}Ai,∞​ used in Lemmas 10–12.

Differences from the source:

  • correction: no connectivity hypothesis; w(q) "the" invariant distribution of P(q) → hypothesis SupportConnected φ q; reason: the paper's standing irreducibility assumption (p. 7, App. A). Without it the statement is false: n = 2, φ ≡ 1, q = (1, 0, 0, 1); then P = I, w = (1/3, 2/3) is an invariant distribution, r = w/µ = (1/3, 2/3), and the stationary laws δ_{(m,0)} give A_{2,m} = 0 for every m, while r_2/max r = 1
  • generalization: r = r(q) = w(q)/µ(q) → any positive solution r of the rate-form traffic equations; reason: r(q) is such a solution (proof of Proposition 8, p. 14), so the statement specializes to it
  • encoding: "in the infinite-unit limit" with "the" steady-state distribution (4) → Tendsto as m → ∞ of the availability under any family of stationary laws π_m of toPolicy q; reason: p. 12: "as m → ∞"; under the connectivity hypothesis the stationary law is unique, and quantifying over all laws avoids assuming it
Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Networks_ClosedJackson
import Definitions.Def_SharedVehicleApprox_Pricing_Model

open Finset QueueingFundamentals.Networks Filter Topology
Formal statement
namespace SharedVehicleApprox.Pricing

/-- Proposition 6, p. 12: for a state-independent `q` with strongly connected support and a
positive solution `r` of its traffic equations, the availability of node `i` under the stationary
law of the `m`-unit system tends to `r_i / max_j r_j` as `m → ∞`. -/
theorem prop_6 {n : ℕ} [NeZero n] (φ : Fin n → Fin n → ℝ) (hφ : ∀ i j, 0 ≤ φ i j)
    (q : Fin n → Fin n → ℝ) (hq : ∀ i j, 0 ≤ q i j ∧ q i j ≤ 1) (hconn : SupportConnected φ q)
    (r : Fin n → ℝ) (hr : ∀ i, 0 < r i) (htr : IsTraffic φ q r)
    (πs : ℕ → (Fin n → ℕ) → ℝ) (hπs : ∀ m, IsStationary n m φ (toPolicy q) (πs m))
    (i : Fin n) :
    Tendsto (fun m => availability m (πs m) i) atTop (𝓝 (availInf r i)) := by sorry

end SharedVehicleApprox.Pricing
Source
Banerjee, Freund & Lykouris, Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework, arXiv:1608.06819v4, p. 12 (PDF 13), Proposition 6
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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