Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3, p. 9 — a state-independent policy q yields a Gordon–Newell network with service rate Σ_j φ_ij q_ij and routing φ_ij q_ij/Σ_k φ_ik q_ik

Proved
SharedVehicleApprox.Pricing.gordon_newell_reduction

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

closed-queueing-networkgordon-newellp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1shared-vehicle-systems

Let φij≥0\varphi_{ij}\ge0φij​≥0 be arrival rates and q∈[0,1]n×nq\in[0,1]^{n\times n}q∈[0,1]n×n a state-independent quantile matrix with μi=∑jφijqij>0\mu_i=\sum_j\varphi_{ij}q_{ij}>0μi​=∑j​φij​qij​>0 at every node. Put Pij=φijqij/μiP_{ij}=\varphi_{ij}q_{ij}/\mu_iPij​=φij​qij​/μi​. Then the mmm-unit system run under qqq (rides from empty stations suppressed) is the Gordon–Newell (closed Jackson) network with single servers of rate μi\mu_iμi​ and routing matrix PPP:

  1. PPP is a routing matrix: Pij≥0P_{ij}\ge0Pij​≥0 and ∑jPij=1\sum_jP_{ij}=1∑j​Pij​=1;
  2. for every mmm, a law π\piπ is stationary for qqq in the mmm-unit system (balance equation (1)) if and only if it is a steady state of the closed network with mmm customers (flow-balance equations with rate μi1{xi>0}\mu_i\mathbf 1\{x_i>0\}μi​1{xi​>0} at node iii);
  3. rrr solves 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​ if and only if μiri=∑jμjPjirj\mu_ir_i=\sum_j\mu_jP_{ji}r_jμi​ri​=∑j​μj​Pji​rj​ for all iii;
  4. the support graph of qqq is strongly connected if and only if PPP is irreducible.

This is what lets the Gordon–Newell theorem (Theorem 2) be applied to state-independent pricing policies.

Differences from the source:

  • encoding: "we obtain a Gordon-Newell network with service rate Σ_j φ_ij q_ij and routing probabilities φ_ij q_ij / Σ_k φ_ik q_ik" → P is a routing matrix, and the stationary laws and traffic solutions of q coincide with the steady states and traffic solutions of the closed network (µ, P); reason: this is what "is a Gordon–Newell network" means for the objects the paper uses (stationary laws, traffic intensities), in the vocabulary of the reused closed-network definitions
  • encoding: service rate µ_i = Σ_j φ_ij q_ij (Definition 1, p. 8, requires µ_i > 0) → hypothesis 0 < Σ_j φ_ij q_ij for every i; reason: the routing probabilities φ_ij q_ij/µ_i are undefined at µ_i = 0, and Definition 1 requires µ_i > 0
  • generalization: the reduction sentence of p. 9 → additionally: the support graph of q is strongly connected iff P is irreducible; reason: the extra clause links the paper's irreducibility assumption (p. 7, App. A) to the hypothesis of Theorem 2; it only adds to the reduction
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

/-- §2.3, p. 9: a state-independent `q` run in the `m`-unit system is a Gordon–Newell network
with service rate `μ_i = ∑_j φ_ij q_ij` and routing probabilities `P_ij = φ_ij q_ij / μ_i`:
`P` is a routing matrix; the stationary laws of `toPolicy q` are exactly the steady states of
that closed network; the rate-form traffic equations are its traffic equations; and the support
graph of `q` is strongly connected iff `P` is irreducible. -/
theorem gordon_newell_reduction {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)
    (hmu : ∀ i, 0 < ∑ j, φ i j * q i j) :
    let mu : Fin n → ℝ := fun i => ∑ j, φ i j * q i j
    let P : Fin n → Fin n → ℝ := fun i j => φ i j * q i j / mu i
    IsRoutingMatrix P ∧
      (∀ (m : ℕ) (π : (Fin n → ℕ) → ℝ),
        IsStationary n m φ (toPolicy q) π ↔ IsClosedSteadyState mu P m π) ∧
      (∀ r : Fin n → ℝ, IsTraffic φ q r ↔ IsTrafficSolution mu P r) ∧
      (SupportConnected φ q ↔ IsIrreducible P) := by sorry

end SharedVehicleApprox.Pricing
Source
Banerjee, Freund & Lykouris, Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework, arXiv:1608.06819v4, p. 9 (PDF 10), §2.3 ("Recall that for an m-unit system with state-independent policy p …"); Definition 1, p. 8 (PDF 9)
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