Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 4, p. 57 — λ_{i→j}T_i − Q_i ≥ 0 and Q_i ≥ 0, both maximized at σ_i = (0, ∞)

Proved
DriverSurge.IC.remark_4

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

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

Let the trip-length laws have finite means. For each state iii and every open σi⊆(0,∞)\sigma_i\subseteq(0,\infty)σi​⊆(0,∞),

0≤λi→jTi(σi)−Qi(σi)≤λi→jTi((0,∞))−Qi((0,∞)),0≤Qi(σi)≤Qi((0,∞)).0\le\lambda_{i\to j}T_i(\sigma_i)-Q_i(\sigma_i)\le\lambda_{i\to j}T_i((0,\infty))-Q_i((0,\infty)),\qquad 0\le Q_i(\sigma_i)\le Q_i((0,\infty)).0≤λi→j​Ti​(σi​)−Qi​(σi​)≤λi→j​Ti​((0,∞))−Qi​((0,∞)),0≤Qi​(σi​)≤Qi​((0,∞)).

These bounds make the denominators in CCC and in the windows of Lemmas 9 and 10 positive.

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:

  • encoding: Ti((0,∞))T_i((0,\infty))Ti​((0,∞)) implicitly finite → finite means ∫τ dFi<∞\int\tau\,dF_i<\infty∫τdFi​<∞; reason: Ti((0,∞))T_i((0,\infty))Ti​((0,∞)) is undefined otherwise; 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 inequalities follow from 0≤qi→j(τ)≤λi→jτ0\le q_{i\to j}(\tau)\le\lambda_{i\to j}\tau0≤qi→j​(τ)≤λi→j​τ for every trip-length law, so they specialize to the source
Preamble
import Mathlib
import Definitions.Def_DriverSurge_IC_Pricing
Formal statement
namespace DriverSurge.IC

open MeasureTheory Set

/-- Remark 4 (p. 57). With finite mean trip lengths, for every open `s ⊆ (0, ∞)`:
`λ_{i→j}T_i(s) − Q_i(s) ≥ 0`, and it is maximized at `s = (0, ∞)`; `Q_i(s) ≥ 0`, and it is maximized at
`s = (0, ∞)`. -/
theorem remark_4 (P : Primitives) (hmean : FiniteMean P) (i : Fin 2) (s : Set ℝ)
    (hs : IsAdmissible s) :
    0 ≤ P.sw i * Tn P i s - Qn P i s ∧
    P.sw i * Tn P i s - Qn P i s ≤ P.sw i * Tn P i (Ioi 0) - Qn P i (Ioi 0) ∧
    0 ≤ Qn P i s ∧ Qn P i s ≤ Qn P i (Ioi 0) := by sorry

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