Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 12, p. 16 — Obj_m(q)/Obj_∞(q) = r_max(q)·G_{m−1}(q)/G_m(q) = A_m(q)

Proved
SharedVehicleApprox.Pricing.lemma_12

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

availabilityclosed-queueing-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1shared-vehicle-systems

Let n≥1n\ge1n≥1, m≥1m\ge1m≥1, let qqq be a state-independent quantile matrix, IijI_{ij}Iij​ per-ride rewards with reward curves Rij(q)=q Iij(q)R_{ij}(q)=q\,I_{ij}(q)Rij​(q)=qIij​(q), and r∈Rnr\in\mathbb R^nr∈Rn traffic intensities with rj≥0r_j\ge0rj​≥0 for all jjj and rj>0r_j>0rj​>0 for some jjj. 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​ with Gm=∑x∈Sn,m∏jrjxjG_m=\sum_{x\in S_{n,m}}\prod_jr_j^{x_j}Gm​=∑x∈Sn,m​​∏j​rjxj​​. Then the objective of qqq in the mmm-unit system under π\piπ satisfies

Objm(q)=rmax⁡Gm−1Gm⋅Obj∞(q),max⁡iAi,m=rmax⁡Gm−1Gm,\mathrm{Obj}_m(q)=r_{\max}\frac{G_{m-1}}{G_m}\cdot\mathrm{Obj}_\infty(q),\qquad \max_iA_{i,m}=r_{\max}\frac{G_{m-1}}{G_m},Objm​(q)=rmax​Gm​Gm−1​​⋅Obj∞​(q),imax​Ai,m​=rmax​Gm​Gm−1​​,

where Obj∞(q)=∑i(ri/rmax⁡)∑jφijRij(qij)\mathrm{Obj}_\infty(q)=\sum_i(r_i/r_{\max})\sum_j\varphi_{ij}R_{ij}(q_{ij})Obj∞​(q)=∑i​(ri​/rmax​)∑j​φij​Rij​(qij​) and Ai,m=∑x∈Sn,mπ(x)1{xi>0}A_{i,m}=\sum_{x\in S_{n,m}}\pi(x)\mathbf 1\{x_i>0\}Ai,m​=∑x∈Sn,m​​π(x)1{xi​>0}. In the paper's notation, Objm(q)/Obj∞(q)=rmax⁡(q)Gm−1(q)/Gm(q)=Am(q)\mathrm{Obj}_m(q)/\mathrm{Obj}_\infty(q)=r_{\max}(q)G_{m-1}(q)/G_m(q)=A_m(q)Objm​(q)/Obj∞​(q)=rmax​(q)Gm−1​(q)/Gm​(q)=Am​(q).

Together with Lemma 14 this bounds the loss from finitely many units by the factor m/(m+n−1)m/(m+n-1)m/(m+n−1).

Differences from the source:

  • encoding: Obj_m(q)/Obj_∞(q) = r_max(q)·G_{m−1}(q)/G_m(q) → Obj_m(q) = (r_max G_{m−1}/G_m)·Obj_∞(q); reason: the multiplicative form needs no Obj_∞(q) ≠ 0 (the paper's remark on p. 17); it is equivalent whenever Obj_∞(q) ≠ 0
  • generalization: q a state-independent pricing policy, π its stationary law (4) with r = r(q) → any real matrix q and the product-form law (4) of any r ≥ 0 with a positive entry, not necessarily the traffic intensity of q; reason: by Theorem 2 the stationary law of q is (4) with r = r(q) ≥ 0, which has a positive entry; the identities hold for every such r
  • encoding: A_m(q) := max_i A_{i,m}(q) → Finset.sup' over Fin n of the availabilities, n ≥ 1, m ≥ 1; reason: the maximum over a nonempty node set; G_{m−1} needs m ≥ 1
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 12, p. 16: under the product-form law (4) with traffic intensities `r`, the objective
of the state-independent `q` in the `m`-unit system is `r_max · G_{m−1}/G_m` times its
infinite-unit objective, and `r_max · G_{m−1}/G_m` is the maximal availability `A_m(q)`. -/
theorem lemma_12 {n m : ℕ} [NeZero n] (hm : 1 ≤ m) (φ : Fin n → Fin n → ℝ)
    (I : Fin n → Fin n → ℝ → ℝ) (q : Fin n → Fin n → ℝ)
    (r : Fin n → ℝ) (hr : ∀ j, 0 ≤ r j) (hpos : ∃ j, 0 < r j) :
    obj n m φ I (toPolicy q) (productForm (fun j y => r j ^ y) m) =
        (rmax r * G r (m - 1) / G r m) * objInf φ I q r ∧
      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 := by sorry

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