Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 14, p. 17 — maximum availability in the m-unit system: A_m(q) = r_max·G_{m−1}/G_m ≥ m/(m+n−1)

Proved
SharedVehicleApprox.Pricing.lemma_14

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

approximation-ratioavailabilityclosed-queueing-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let n≥1n\ge1n≥1, m≥1m\ge1m≥1 and let r∈Rnr\in\mathbb R^nr∈Rn be a vector of traffic intensities, rj≥0r_j\ge0rj​≥0 with some rj>0r_j>0rj​>0. Write Gm=∑x∈Sn,m∏jrjxjG_m=\sum_{x\in S_{n,m}}\prod_jr_j^{x_j}Gm​=∑x∈Sn,m​​∏j​rjxj​​, rmax⁡=max⁡jrjr_{\max}=\max_jr_jrmax​=maxj​rj​, and let π\piπ be the product-form law (4), π(x)=Gm−1∏jrjxj\pi(x)=G_m^{-1}\prod_jr_j^{x_j}π(x)=Gm−1​∏j​rjxj​​ on Sn,mS_{n,m}Sn,m​. Then the maximal availability Am=max⁡iAi,mA_m=\max_iA_{i,m}Am​=maxi​Ai,m​ under π\piπ satisfies

Am=rmax⁡ Gm−1Gm ≥ mm+n−1.A_m=r_{\max}\,\frac{G_{m-1}}{G_m}\ \ge\ \frac{m}{m+n-1}.Am​=rmax​Gm​Gm−1​​ ≥ m+n−1m​.

This is the pullback step of the framework: by Lemma 12, AmA_mAm​ is the ratio of the mmm-unit to the infinite-unit objective, so the bound transfers infinite-unit guarantees to the mmm-unit system.

Differences from the source:

  • generalization: "for any state-independent pricing policy q", with r = r(q) = w(q)/µ(q) → any r with r_j ≥ 0 for all j and r_j > 0 for some j; reason: every traffic intensity vector r(q) (w an invariant distribution, µ_i > 0) is nonnegative with a positive entry, so the statement specializes to r(q)
  • encoding: A_m(q), the maximum availability of the m-unit system under q → max_i of the availabilities under productForm (r_j^y) m, the law (4); reason: by Theorem 2 the stationary law of q is (4) with r = r(q); the ratio is stated with m ≥ 1 since G_{m−1} needs 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

/-- Lemma 14, p. 17: for `m ≥ 1` and every nonnegative vector `r` of traffic intensities with
some positive entry, the maximal availability under the product-form law (4) is
`A_m = r_max · G_{m−1} / G_m`, and it is at least `m / (m + n − 1)`. -/
theorem lemma_14 {n m : ℕ} [NeZero n] (hm : 1 ≤ m) (r : Fin n → ℝ) (hr : ∀ j, 0 ≤ r j)
    (hpos : ∃ j, 0 < r j) :
    univ.sup' univ_nonempty (fun i => availability m (productForm (fun j y => r j ^ y) m) i) =
        rmax r * G r (m - 1) / G r m ∧
      (m : ℝ) / ((m : ℝ) + n - 1) ≤ rmax r * G r (m - 1) / G r m := by sorry

end SharedVehicleApprox.Pricing
Source
Banerjee, Freund & Lykouris, Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework, arXiv:1608.06819v4, p. 17 (PDF 18), Lemma 14; proof pp. 17–18 (PDF 18–19)
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