Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 9 — availability in product-form networks: A_i,m = (Z_{m−1}/Z_m)·r_i when ρ_i(y) = r_i^y

Proved
SharedVehicleApprox.Pricing.lemma_3

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

availabilityclosed-queueing-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1product-form

Consider a product-form network with m≥1m\ge1m≥1 units, nnn nodes and functions ρj:N→R\rho_j:\mathbb N\to\mathbb Rρj​:N→R, whose law is

π(x)=1Zm∏j=1nρj(xj)(x∈Sn,m),Zm=∑x∈Sn,m∏j=1nρj(xj),\pi(x)=\frac1{Z_m}\prod_{j=1}^n\rho_j(x_j)\quad(x\in S_{n,m}),\qquad Z_m=\sum_{x\in S_{n,m}}\prod_{j=1}^n\rho_j(x_j),π(x)=Zm​1​j=1∏n​ρj​(xj​)(x∈Sn,m​),Zm​=x∈Sn,m​∑​j=1∏n​ρj​(xj​),

and π(x)=0\pi(x)=0π(x)=0 off Sn,mS_{n,m}Sn,m​. If node iii has ρi(y)=ri y\rho_i(y)=r_i^{\,y}ρi​(y)=riy​ for all yyy, then its availability 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} is

Ai,m=Zm−1Zm ri.A_{i,m}=\frac{Z_{m-1}}{Z_m}\,r_i.Ai,m​=Zm​Zm−1​​ri​.

With Theorem 2 this expresses the availabilities of a state-independent policy through the Gordon–Newell constants, Ai,m(q)=(Gm−1(q)/Gm(q)) ri(q)A_{i,m}(q)=(G_{m-1}(q)/G_m(q))\,r_i(q)Ai,m​(q)=(Gm−1​(q)/Gm​(q))ri​(q).

Formalization Note The law is productForm ρ m of the reused closed-network module; it divides by ZmZ_mZm​, and Lean's x/0=0x/0=0x/0=0 makes both sides 000 when Zm=0Z_m=0Zm​=0.

Differences from the source:

  • generalization: functions ρ_j : ℕ → ℝ_+ (nonnegative, p. 9) → arbitrary real functions ρ_j, Z_m possibly 0; reason: the identity holds for every real ρ_j (both sides are 0 when Z_m = 0), so it specializes to nonnegative ρ_j
  • encoding: a product-form network whose stationary distribution is π(x) = Z_m⁻¹ Π_j ρ_j(x_j) → π := productForm ρ m; reason: the lemma uses the network only through this law
  • encoding: m units, Z_{m−1} → hypothesis 1 ≤ m; reason: S_{n,m−1} and Z_{m−1} are defined only for m ≥ 1 (ℕ subtraction)
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 3, p. 9: in a product-form network with `m ≥ 1` units and functions `ρ_j`, if
`ρ_i(y) = r_i^y` then the availability of node `i` under the product-form law
`π(x) = Z_m⁻¹ ∏_j ρ_j(x_j)` is `A_i,m = (Z_{m−1}/Z_m) · r_i`. -/
theorem lemma_3 {n m : ℕ} (hm : 1 ≤ m) (ρ : Fin n → ℕ → ℝ) (i : Fin n) (r : ℝ)
    (hρ : ∀ y, ρ i y = r ^ y) :
    availability m (productForm ρ m) i = normConst ρ (m - 1) / normConst ρ m * r := 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), Lemma 3, Eq. (5)
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