Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 11, p. 16 — for a balanced state-independent policy, Obj_∞(q) = Ôbj(q) (corrected: support of q strongly connected)

Proved
SharedVehicleApprox.Pricing.lemma_11

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

availabilityp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1pricingshared-vehicle-systems

Let φij≥0\varphi_{ij}\ge0φij​≥0 be arrival rates on n≥1n\ge1n≥1 nodes, 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 q∈[0,1]n×nq\in[0,1]^{n\times n}q∈[0,1]n×n a state-independent quantile matrix with balanced demand 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. For every positive solution rrr of the traffic equations of qqq, the infinite-unit objective equals the elevated objective:

Obj∞(q)=∑irimax⁡jrj∑jφijRij(qij)=∑i,jφijRij(qij)=Obj^(q).\mathrm{Obj}_\infty(q)=\sum_i\frac{r_i}{\max_jr_j}\sum_j\varphi_{ij}R_{ij}(q_{ij})=\sum_{i,j}\varphi_{ij}R_{ij}(q_{ij})=\widehat{\mathrm{Obj}}(q).Obj∞​(q)=i∑​maxj​rj​ri​​j∑​φij​Rij​(qij​)=i,j∑​φij​Rij​(qij​)=Obj​(q).

Applied to the relaxation optimum q~\tilde qq~​, this identifies the value of Algorithm 1 with the infinite-unit objective of its prices.

Differences from the source:

  • correction: no connectivity hypothesis → hypothesis SupportConnected φ q; reason: the printed statement is false without it: n = 2, φ ≡ 1, I ≡ 1, q = (1, 0, 0, 1) is balanced and r = (1, 2) solves its traffic equations, so Obj_∞(q) = 1/2 + 1 = 3/2 ≠ 2 = Ôbj(q); the paper's proof uses Lemma 10, which assumes irreducibility
  • generalization: r = r(q), the traffic intensities of 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: Obj_∞(q), the objective in the infinite-unit system → Σ_i (r_i/r_max) B_i(q) with B_i(q) = Σ_j φ_ij R_ij(q_ij); reason: this is the formula of the proof of Lemma 12 (p. 16), with the infinite-unit availabilities of Proposition 6
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 11, p. 16: for a state-independent `q` with strongly connected support satisfying
balanced demand, the infinite-unit objective equals the elevated objective:
`Obj_∞(q) = Ôbj(q)`. -/
theorem lemma_11 {n : ℕ} [NeZero n] (φ : Fin n → Fin n → ℝ) (hφ : ∀ i j, 0 ≤ φ i j)
    (I : Fin n → Fin n → ℝ → ℝ) (q : Fin n → Fin n → ℝ) (hq : ∀ i j, 0 ≤ q i j ∧ q i j ≤ 1)
    (hbal : IsBalanced φ q) (hconn : SupportConnected φ q)
    (r : Fin n → ℝ) (hr : ∀ i, 0 < r i) (htr : IsTraffic φ q r) :
    objInf φ I q r = elevObj φ I q := 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 11
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