Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 57 — for w_i(τ) = mτ + a with m, a > 0, r(u, i, w, σ) is strictly quasi-convex in u whenever ∆_{ji} ≤ 0

Proved
DriverSurge.IC.lemma_7

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

affine-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quasi-convexitysurge-pricing

Let the payment in state iii be positive affine, wi(τ)=mτ+aw_i(\tau)=m\tau+awi​(τ)=mτ+a with m>0m>0m>0 and a>0a>0a>0. For every policy σ\sigmaσ (with wkw_kwk​ and τ\tauτ FkF_kFk​-integrable on σk\sigma_kσk​) such that

Δji=Rj(wj,σj)−Ri(wi,σi)≤0,\Delta_{ji}=R_j(w_j,\sigma_j)-R_i(w_i,\sigma_i)\le0,Δji​=Rj​(wj​,σj​)−Ri​(wi​,σi​)≤0,

the function u↦r(u,i,w,σ)u\mapsto r(u,i,w,\sigma)u↦r(u,i,w,σ) is strictly quasi-convex on (0,∞)(0,\infty)(0,∞): there is U∈[0,∞]U\in[0,\infty]U∈[0,∞] such that its derivative is strictly negative on (0,U)(0,U)(0,U) and strictly positive on (U,∞)(U,\infty)(U,∞).

With Lemma 5 this gives the surge-state policy form (0,t5)∪(t6,∞)(0,t_5)\cup(t_6,\infty)(0,t5​)∪(t6​,∞) under positive affine pricing.

Formalization Note Lean state 0 is the paper's non-surge state 1 and Lean state 1 the surge state 2; other i is the state j≠ij\ne ij=i.

Differences from the source:

  • reading: "strictly quasi-convex in uuu" → the definition of p. 63: the derivative in uuu is strictly negative on (0,U)(0,U)(0,U) and strictly positive on (U,∞)(U,\infty)(U,∞) for some U∈[0,∞]U\in[0,\infty]U∈[0,∞]; reason: the paper's own definition (proof of Lemma 7, p. 63), with the turning point allowed at 000 or ∞\infty∞
  • encoding: the formulas use ∫σkτ dFk\int_{\sigma_k}\tau\,dF_k∫σk​​τdFk​ and ∫σkwk dFk\int_{\sigma_k}w_k\,dF_k∫σk​​wk​dFk​ without saying they are finite → τ\tauτ and wkw_kwk​ are assumed FkF_kFk​-integrable on σk\sigma_kσk​; reason: the quantities TkT_kTk​, WkW_kWk​, RkR_kRk​ are undefined otherwise (Lean's integral would be the junk value 0); only undefined cases are excluded
  • generalization: D.3.1's standing assumptions (p. 56): FiF_iFi​ has a bounded density, and state 2 dominates state 1 (∃σ2\exists\sigma_2∃σ2​ with Δ(σ2,σ1)>0\Delta(\sigma_2,\sigma_1)>0Δ(σ2​,σ1​)>0 for all σ1\sigma_1σ1​) → not assumed; reason: the claim is a property of rrr as a function of uuu that holds for all trip-length laws and payments, so it specializes to the source
Preamble
import Mathlib
import Definitions.Def_DriverSurge_IC_Pricing
Formal statement
namespace DriverSurge.IC

open MeasureTheory Set

/-- Lemma 7 (p. 57). If `w_i(τ) = mτ + a` with `m, a > 0`, then for every policy `σ` (with `w_j` and `τ`
integrable on `σ_j`, `σ_i`) where `Δ_{ji} ≤ 0`, `r(u, i, w, σ)` is strictly quasi-convex in `u > 0` (its
derivative is strictly negative up to a point and strictly positive above it). -/
theorem lemma_7 (P : Primitives) (w : Fin 2 → ℝ → ℝ) (i : Fin 2) (m a : ℝ) (hm : 0 < m)
    (ha : 0 < a) (hwi : w i = fun τ => m * τ + a) (σ : Fin 2 → Set ℝ) (hσ : IsPolicy σ)
    (hw : ∀ k, IntegrableOn (w k) (σ k) (P.F k))
    (hτ : ∀ k, IntegrableOn (fun τ : ℝ => τ) (σ k) (P.F k))
    (hΔ : stateRate P (other i) (w (other i)) (σ (other i)) - stateRate P i (w i) (σ i) ≤ 0) :
    StrictQuasiconvexIoi (rFun P w σ i) := by sorry

end DriverSurge.IC
Source
Garg, Nazerzadeh, Driver Surge Pricing, arXiv:1905.07544v4, p. 57, Lemma 7 (proof p. 63)
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