Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 1, bullet 4, p. 57 (corrected: U ∈ [0, ∞]) — if ∆_{ji} < 0 and w_i(u)/u non-decreasing, r(u, i, w, σ) is strictly increasing, negative below U and positive above

Proved
DriverSurge.IC.remark_1_increasing

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

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

Let σ\sigmaσ be a policy with wkw_kwk​ and τ\tauτ FkF_kFk​-integrable on σk\sigma_kσk​. Fix a state iii with other state jjj, and suppose

Δji=Rj(wj,σj)−Ri(wi,σi)<0andu↦wi(u)/u is non-decreasing on (0,∞).\Delta_{ji}=R_j(w_j,\sigma_j)-R_i(w_i,\sigma_i)<0\quad\text{and}\quad u\mapsto w_i(u)/u\ \text{is non-decreasing on }(0,\infty).Δji​=Rj​(wj​,σj​)−Ri​(wi​,σi​)<0andu↦wi​(u)/u is non-decreasing on (0,∞).

Then r(u,i,w,σ)r(u,i,w,\sigma)r(u,i,w,σ) is strictly increasing in u∈(0,∞)u\in(0,\infty)u∈(0,∞), and there is U∈[0,∞]U\in[0,\infty]U∈[0,∞] such that r(u,i,w,σ)<0r(u,i,w,\sigma)<0r(u,i,w,σ)<0 for 0<u<U0<u<U0<u<U and r(u,i,w,σ)>0r(u,i,w,\sigma)>0r(u,i,w,σ)>0 for u>Uu>Uu>U. By Lemma 6, ∂R(w,σ)/∂u\partial R(w,\sigma)/\partial u∂R(w,σ)/∂u has the same sign wherever fi(u)>0f_i(u)>0fi​(u)>0.

This is the surge-state case: it says the surge-state policy rejects short trips, the form (t,∞)(t,\infty)(t,∞).

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:

  • correction: a sign change at U∈(0,∞)∪{∞}U\in(0,\infty)\cup\{\infty\}U∈(0,∞)∪{∞} → U∈[0,∞]U\in[0,\infty]U∈[0,∞]; reason: U=0U=0U=0 occurs, also under D.3.1's standing assumptions: with all rates 111, F1=F2F_1=F_2F1​=F2​ uniform on (0,1)(0,1)(0,1), i=2i=2i=2, w2(u)=uw_2(u)=uw2​(u)=u, w1≡0w_1\equiv0w1​≡0 (so state 2 dominates state 1), σ2=(0,∞)\sigma_2=(0,\infty)σ2​=(0,∞) and σ1=∅\sigma_1=\emptysetσ1​=∅, one has Δji=−1/3<0\Delta_{ji}=-1/3<0Δji​=−1/3<0 and r(u,i,w,σ)≥(Qi−λi→j(Ti−1)+λj→i)/Ti>0r(u,i,w,\sigma)\ge\big(Q_i-\lambda_{i\to j}(T_i-1)+\lambda_{j\to i}\big)/T_i>0r(u,i,w,σ)≥(Qi​−λi→j​(Ti​−1)+λj→i​)/Ti​>0 for all u>0u>0u>0 (here Ti=3/2T_i=3/2Ti​=3/2), so rrr is never negative
  • reading: "Thus, ∂R/∂u\partial R/\partial u∂R/∂u is negative up to … and positive thereafter" → the sign change stated for rrr; reason: D.3.1 defines ∝\propto∝ as "same sign except where f(u)=0f(u)=0f(u)=0", so the claim about ∂R/∂u\partial R/\partial u∂R/∂u is the claim about rrr (Lemma 6)
  • reading: "(i = 2 the surge state)" → stated for each state iii; reason: the parenthesis labels the typical case; the hypotheses are Δji<0\Delta_{ji}<0Δji​<0 and monotonicity of wi(u)/uw_i(u)/uwi​(u)/u
  • 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 an algebraic property of rrr 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

/-- Remark 1, bullet 4 (p. 57; corrected: the sign change of `r` is at some `U ∈ [0, ∞]`, not
`U ∈ (0, ∞]`). For a policy `σ` with `w_k` and `τ` integrable on `σ_k`: if `Δ_{ji} < 0` and `w_i(u)/u` is
non-decreasing on `(0, ∞)`, then `r(u, i, w, σ)` is strictly increasing in `u > 0`, and it is negative
below some `U ∈ [0, ∞]` and positive above it. -/
theorem remark_1_increasing (P : Primitives) (w : Fin 2 → ℝ → ℝ) (σ : Fin 2 → Set ℝ)
    (hσ : IsPolicy σ) (hw : ∀ k, IntegrableOn (w k) (σ k) (P.F k))
    (hτ : ∀ k, IntegrableOn (fun τ : ℝ => τ) (σ k) (P.F k)) (i : Fin 2)
    (hΔ : stateRate P (other i) (w (other i)) (σ (other i)) - stateRate P i (w i) (σ i) < 0)
    (hmono : MonotoneOn (fun u : ℝ => w i u / u) (Ioi 0)) :
    StrictMonoOn (rFun P w σ i) (Ioi 0) ∧
    ∃ U : EReal, 0 ≤ U ∧
      (∀ u : ℝ, 0 < u → (u : EReal) < U → rFun P w σ i u < 0) ∧
      (∀ u : ℝ, 0 < u → U < (u : EReal) → 0 < rFun P w σ i u) := by sorry

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