Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 1, bullet 3, p. 57 — q_{i→j}(u)/u is strictly decreasing in u

Proved
DriverSurge.IC.remark_1_q_div

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

monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1surge-pricing

For each state iii with other state jjj and positive switching rates,

u⟼qi→j(u)u=λi→jλi→j+λj→i⋅1−e−(λi→j+λj→i)uuu\longmapsto\frac{q_{i\to j}(u)}{u}=\frac{\lambda_{i\to j}}{\lambda_{i\to j}+\lambda_{j\to i}}\cdot\frac{1-e^{-(\lambda_{i\to j}+\lambda_{j\to i})u}}{u}u⟼uqi→j​(u)​=λi→j​+λj→i​λi→j​​⋅u1−e−(λi→j​+λj→i​)u​

is strictly decreasing on (0,∞)(0,\infty)(0,∞).

This monotonicity is what makes the first term of r(u,i,w,σ)r(u,i,w,\sigma)r(u,i,w,σ) monotone in uuu, and hence what fixes the direction of the sign change of ∂R/∂u\partial R/\partial u∂R/∂u in Remark 1's last two bullets.

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:

  • 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: qi→j(u)/uq_{i\to j}(u)/uqi→j​(u)/u depends only on λi→j,λj→i\lambda_{i\to j},\lambda_{j\to i}λi→j​,λj→i​, so the claim holds without them and specializes to the source
Preamble
import Mathlib
import Definitions.Def_DriverSurge_IC_Model
Formal statement
namespace DriverSurge.IC

open Set

/-- Remark 1, bullet 3 (p. 57): `q_{i→j}(u)/u` is strictly decreasing in `u > 0`. -/
theorem remark_1_q_div (P : Primitives) (i : Fin 2) :
    StrictAntiOn (fun u : ℝ => q P i u / u) (Ioi 0) := by sorry

end DriverSurge.IC
Source
Garg, Nazerzadeh, Driver Surge Pricing, arXiv:1905.07544v4, p. 57, Remark 1 (bullet 3)
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