Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13, p. 17 — a weighted bipartite graph between S_{n,m} and S_{n,m−1}: weights on neighbours only, totals (m+n−1)/m and 1

Proved
SharedVehicleApprox.Pricing.lemma_13

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

closed-queueing-networkcombinatoricsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let m≥1m\ge1m≥1. Call y∈Sn,m−1y\in S_{n,m-1}y∈Sn,m−1​ a neighbour of x∈Sn,mx\in S_{n,m}x∈Sn,m​ if x=y+eix=y+e_ix=y+ei​ for some node iii. There are nonnegative weights ωxy\omega_{xy}ωxy​, x∈Sn,mx\in S_{n,m}x∈Sn,m​, y∈Sn,m−1y\in S_{n,m-1}y∈Sn,m−1​, such that

  1. ωxy≠0\omega_{xy}\ne0ωxy​=0 only if yyy is a neighbour of xxx;
  2. for every y∈Sn,m−1y\in S_{n,m-1}y∈Sn,m−1​, ∑x∈Sn,mωxy=m+n−1m\displaystyle\sum_{x\in S_{n,m}}\omega_{xy}=\frac{m+n-1}{m}x∈Sn,m​∑​ωxy​=mm+n−1​;
  3. for every x∈Sn,mx\in S_{n,m}x∈Sn,m​, ∑y∈Sn,m−1ωxy=1\displaystyle\sum_{y\in S_{n,m-1}}\omega_{xy}=1y∈Sn,m−1​∑​ωxy​=1.

This combinatorial fact drives the bound Gm≤rmax⁡m+n−1mGm−1G_m\le r_{\max}\frac{m+n-1}{m}G_{m-1}Gm​≤rmax​mm+n−1​Gm−1​ of Lemma 14.

Differences from the source:

  • reading: "weighted bipartite graph" → nonnegative weights ω_xy; reason: the construction's weights x_i/m are nonnegative and Lemma 14's inequality step needs ω ≥ 0; this is the stronger reading
  • reading: "y + e_i ∈ S_{n,m} ∀i ∈ {1, n}" → x = y + e_i for some i ∈ Fin n (every node); reason: {1, n} is a typo for [n] = {1, …, n}: the proof uses every i ∈ [n]
  • encoding: a graph on S_{n,m} ∪ S_{n,m−1} → a weight function ω on pairs (x, y), with 1 ≤ m; reason: a weighted bipartite graph is its weight function; S_{n,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 13, p. 17: for `m ≥ 1` there are nonnegative weights `ω_xy` on
`S_{n,m} × S_{n,m−1}`, nonzero only when `x = y + e_i` for some node `i`, whose total at every
`y ∈ S_{n,m−1}` is `(m+n−1)/m` and whose total at every `x ∈ S_{n,m}` is `1`. -/
theorem lemma_13 {n m : ℕ} (hm : 1 ≤ m) :
    ∃ ω : (Fin n → ℕ) → (Fin n → ℕ) → ℝ,
      (∀ x y, 0 ≤ ω x y) ∧
      (∀ x ∈ states n m, ∀ y ∈ states n (m - 1), ω x y ≠ 0 → ∃ i, x = y + Pi.single i 1) ∧
      (∀ y ∈ states n (m - 1), ∑ x ∈ states n m, ω x y = ((m : ℝ) + n - 1) / m) ∧
      (∀ x ∈ states n m, ∑ y ∈ states n (m - 1), ω x y = 1) := 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 13
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