Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, p. 15 — the elevated objective of the relaxation optimum q̃ bounds the objective of every state-dependent policy: Ôbj(q̃) ≥ Opt_m

Proved
SharedVehicleApprox.Pricing.lemma_9

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

convex-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1pricingshared-vehicle-systems

Let φij≥0\varphi_{ij}\ge0φij​≥0 be arrival rates and IijI_{ij}Iij​ per-ride rewards whose reward curves Rij(q)=q Iij(q)R_{ij}(q)=q\,I_{ij}(q)Rij​(q)=qIij​(q) are concave on [0,1][0,1][0,1]. Let q~\tilde qq~​ be an optimal solution of the elevated flow relaxation program (Algorithm 1):

max⁡q ∑i,jφijRij(qij)s.t.∑kφkiqki=∑jφijqij  ∀i,qij∈[0,1].\max_q\ \sum_{i,j}\varphi_{ij}R_{ij}(q_{ij})\quad\text{s.t.}\quad \sum_k\varphi_{ki}q_{ki}=\sum_j\varphi_{ij}q_{ij}\ \ \forall i,\qquad q_{ij}\in[0,1].qmax​ i,j∑​φij​Rij​(qij​)s.t.k∑​φki​qki​=j∑​φij​qij​  ∀i,qij​∈[0,1].

Then for every state-dependent quantile policy qqq of the mmm-unit system and every stationary law π\piπ of it,

Objm(q)=∑x∈Sn,mπ(x)∑i,jφijRij(qij(x)) ≤ Obj^(q~)=∑i,jφijRij(q~ij),\mathrm{Obj}_m(q)=\sum_{x\in S_{n,m}}\pi(x)\sum_{i,j}\varphi_{ij}R_{ij}(q_{ij}(x))\ \le\ \widehat{\mathrm{Obj}}(\tilde q)=\sum_{i,j}\varphi_{ij}R_{ij}(\tilde q_{ij}),Objm​(q)=x∈Sn,m​∑​π(x)i,j∑​φij​Rij​(qij​(x)) ≤ Obj​(q~​)=i,j∑​φij​Rij​(q~​ij​),

that is, Obj^(q~)≥Optm\widehat{\mathrm{Obj}}(\tilde q)\ge\mathrm{Opt}_mObj​(q~​)≥Optm​.

This is the first step of the approximation framework: the convex relaxation upper-bounds the optimal state-dependent policy.

Differences from the source:

  • encoding: Opt_m, the objective of the optimal state-dependent policy → the bound is stated against every state-dependent policy q (IsPolicy) and every stationary law π of it; reason: a bound against every (policy, law) pair is exactly a bound against their supremum, with no sSup and no attainment needed; p. 7 measures upper bounds against the best-possible steady-state distribution
  • encoding: π is the steady-state distribution of the policy, treated as unique (p. 7) → π is any probability vector on S_{n,m}, zero off S_{n,m}, satisfying the balance equation (1) at every state; reason: p. 7: "our upper bounds are all with respect to the best-possible steady-state distribution"; (1) is the paper's characterization of stationarity, and Mathlib has no continuous-time Markov chains
  • generalization: per-ride rewards I_ij(p_ij) of prices, with value distributions F_ij and I_ij(q) := I_ij(F_ij^{-1}(1 − q)) (pp. 6–8) → arbitrary real functions I_ij of the quantile q ∈ [0, 1], with R_ij(q) := q · I_ij(q); no F_ij; reason: every I_ij induced by value distributions is such a function, so the statement specializes to the paper's; the density and F_ij(0) < 1 assumptions of p. 6 only make the price–quantile map a bijection
  • encoding: the pricing policy q̃ returned by the elevated flow relaxation program → any q̃ with IsRelaxOptimal φ I q̃ (feasible and maximizing Ôbj over the feasible set); reason: Algorithm 1 returns an optimal solution; the statement holds for each one, and existence is neither claimed nor needed
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 9, p. 15: for concave reward curves, the elevated objective of an optimal solution `q̃`
of the elevated flow relaxation program (Algorithm 1) bounds the objective of every
state-dependent policy `q` under every stationary law `π` of it: `Ôbj(q̃) ≥ Opt_m`. -/
theorem lemma_9 {n m : ℕ} (φ : Fin n → Fin n → ℝ) (hφ : ∀ i j, 0 ≤ φ i j)
    (I : Fin n → Fin n → ℝ → ℝ)
    (hR : ∀ i j, ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (rewardCurve I i j))
    (qt : Fin n → Fin n → ℝ) (hopt : IsRelaxOptimal φ I qt)
    (q : (Fin n → ℕ) → Fin n → Fin n → ℝ) (π : (Fin n → ℕ) → ℝ)
    (hq : IsPolicy n m q) (hπ : IsStationary n m φ q π) :
    obj n m φ I q π ≤ elevObj φ I qt := by sorry

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