Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10, p. 58 (corrected: R_2 > 0) — for w_1 = R_2τ + zq_{1→2}(τ) and z/R_2 in the window, r(u, 1, w, σ) > 0 for all u, σ_1; the window is nonempty

Proved
DriverSurge.IC.lemma_10

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

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

Fix a surge policy σ2\sigma_2σ2​ and a payment w2w_2w2​ integrable on it, with Q2=Q2(σ2)Q_2=Q_2(\sigma_2)Q2​=Q2​(σ2​), T2=T2(σ2)T_2=T_2(\sigma_2)T2​=T2​(σ2​) and R2=R2(w2,σ2)>0R_2=R_2(w_2,\sigma_2)>0R2​=R2​(w2​,σ2​)>0. Let Qˉ1\bar Q_1Qˉ​1​, Tˉ1\bar T_1Tˉ1​ be the values of Q1Q_1Q1​, T1T_1T1​ at σ1=(0,∞)\sigma_1=(0,\infty)σ1​=(0,∞), assume finite means, and let w1(τ)=mτ+z q1→2(τ)w_1(\tau)=m\tau+z\,q_{1\to2}(\tau)w1​(τ)=mτ+zq1→2​(τ) with m=R2m=R_2m=R2​. If

−T2λ1→2+Q2Q2(λ1→2Tˉ1−Qˉ1)+λ1→2(T2λ1→2+Q2)<zR2<1Qˉ1−λ1→2,-\frac{T_2\lambda_{1\to2}+Q_2}{Q_2(\lambda_{1\to2}\bar T_1-\bar Q_1)+\lambda_{1\to2}(T_2\lambda_{1\to2}+Q_2)}<\frac{z}{R_2}<\frac{1}{\bar Q_1-\lambda_{1\to2}},−Q2​(λ1→2​Tˉ1​−Qˉ​1​)+λ1→2​(T2​λ1→2​+Q2​)T2​λ1→2​+Q2​​<R2​z​<Qˉ​1​−λ1→2​1​,

then r(u,1,w,σ)>0r(u,1,w,\sigma)>0r(u,1,w,σ)>0 for every u>0u>0u>0 and every open σ1⊆(0,∞)\sigma_1\subseteq(0,\infty)σ1​⊆(0,∞); hence ∂R(w,σ)/∂u>0\partial R(w,\sigma)/\partial u>0∂R(w,σ)/∂u>0 wherever f1(u)>0f_1(u)>0f1​(u)>0. Furthermore the constraint set is feasible regardless of the primitives: the lower bound is strictly below the upper bound.

Lemma 10 makes accepting every non-surge trip optimal; with Lemma 9 it yields the incentive-compatible prices of Theorem 3, and the constant CCC is what its window imposes on R1/R2R_1/R_2R1​/R2​.

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. The denominators are positive: λ1→2Tˉ1−Qˉ1≥0\lambda_{1\to2}\bar T_1-\bar Q_1\ge0λ1→2​Tˉ1​−Qˉ​1​≥0 and Qˉ1>λ1→2\bar Q_1>\lambda_{1\to2}Qˉ​1​>λ1→2​ (Remark 4).

Differences from the source:

  • correction: R2=R2(w2,σ2)R_2=R_2(w_2,\sigma_2)R2​=R2​(w2​,σ2​) for an arbitrary σ2\sigma_2σ2​ and w2w_2w2​, of any sign; the window divides by R2R_2R2​ → R2>0R_2>0R2​>0 assumed; reason: for R2<0R_2<0R2​<0 the lemma fails: z=0z=0z=0 lies in the window (its lower end is negative, its upper end positive) and Remark 2 gives uT1T2 r(u,1,w,σ)=R2 (q1→2(u)T2+uQ2)<0uT_1T_2\,r(u,1,w,\sigma)=R_2\,(q_{1\to2}(u)T_2+uQ_2)<0uT1​T2​r(u,1,w,σ)=R2​(q1→2​(u)T2​+uQ2​)<0 for every u>0u>0u>0 and every σ1\sigma_1σ1​; e.g. all rates 111, F1=F2=Exp(1)F_1=F_2=\mathrm{Exp}(1)F1​=F2​=Exp(1), w2(τ)=1−τ2w_2(\tau)=1-\tau^2w2​(τ)=1−τ2, σ2=(0,∞)\sigma_2=(0,\infty)σ2​=(0,∞) (so R2=−1/2R_2=-1/2R2​=−1/2) and w1(τ)=R2τw_1(\tau)=R_2\tauw1​(τ)=R2​τ, where state 2 dominates state 1 because R1≤0R_1\le0R1​≤0 for every σ1\sigma_1σ1​ while R2(w2,(0,1))>0R_2(w_2,(0,1))>0R2​(w2​,(0,1))>0; at R2=0R_2=0R2​=0 the quotient z/R2z/R_2z/R2​ is undefined (Lean's z/0=0z/0=0z/0=0 would be junk)
  • reading: "∂/∂uR(w,σ)>0\partial/\partial u R(w,\sigma)>0∂/∂uR(w,σ)>0, for all uuu" → r(u,i,w,σ)>0r(u,i,w,\sigma)>0r(u,i,w,σ)>0 for every u>0u>0u>0; reason: D.3.1 fixes ∝\propto∝ as "same sign except where f(u)=0f(u)=0f(u)=0"; the proof (p. 65) establishes positivity of the ∝\propto∝ expression
  • reading: "the constraint set is feasible" → the lower end of the window is strictly below the upper end; reason: the meaning in the proof of Lemma 9, mirrored
  • encoding: Tˉ1\bar T_1Tˉ1​ implicitly finite → finite means; w2w_2w2​ F2F_2F2​-integrable on σ2\sigma_2σ2​; reason: Tˉ1\bar T_1Tˉ1​, R2R_2R2​ are 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 proof (p. 66) is algebra on rrr and does not use them (the lemma held on every one of 300 random primitives × 30 random σ1\sigma_1σ1​, checks/lemma9_10_check.py), so it specializes to the source
Preamble
import Mathlib
import Definitions.Def_DriverSurge_IC_Pricing
Formal statement
namespace DriverSurge.IC

open MeasureTheory Set

/-- Lemma 10 (p. 58). Fix a surge policy `s₂` (state 2 = Lean `1`) and a payment `w_2` integrable on it,
with `Q_2 = Q_2(s₂)`, `T_2 = T_2(s₂)` and `R_2 = R_2(w_2, s₂) > 0`; let `Q̄_1`, `T̄_1` be the non-surge
values at `(0, ∞)`, and `w_1(τ) = mτ + zq_{1→2}(τ)` with `m = R_2`. If
`−(T_2λ_{1→2} + Q_2) / [Q_2(λ_{1→2}T̄_1 − Q̄_1) + λ_{1→2}(T_2λ_{1→2} + Q_2)] < z/R_2 < 1/(Q̄_1 − λ_{1→2})`,
then `r(u, 1, w, {s₁, s₂}) > 0` for every `u > 0` and every open `s₁ ⊆ (0, ∞)` (so `∂/∂u R(w, σ) > 0` in
the `∝` sense of D.3.1). Moreover the lower bound is below the upper bound (the constraint set is
feasible). -/
theorem lemma_10 (P : Primitives) (hmean : FiniteMean P) (w : Fin 2 → ℝ → ℝ) (s₂ : Set ℝ)
    (hs₂ : IsAdmissible s₂) (hw1 : IntegrableOn (w 1) s₂ (P.F 1)) (z : ℝ)
    (hR : 0 < stateRate P 1 (w 1) s₂)
    (hw0 : w 0 = fun τ => stateRate P 1 (w 1) s₂ * τ + z * q P 0 τ) :
    (-(Tn P 1 s₂ * P.sw 0 + Qn P 1 s₂) /
          (Qn P 1 s₂ * (P.sw 0 * Tn P 0 (Ioi 0) - Qn P 0 (Ioi 0)) +
            P.sw 0 * (Tn P 1 s₂ * P.sw 0 + Qn P 1 s₂)) <
        z / stateRate P 1 (w 1) s₂ →
      z / stateRate P 1 (w 1) s₂ < 1 / (Qn P 0 (Ioi 0) - P.sw 0) →
      ∀ s₁ : Set ℝ, IsAdmissible s₁ → ∀ u : ℝ, 0 < u → 0 < rFun P w ![s₁, s₂] 0 u) ∧
    -(Tn P 1 s₂ * P.sw 0 + Qn P 1 s₂) /
          (Qn P 1 s₂ * (P.sw 0 * Tn P 0 (Ioi 0) - Qn P 0 (Ioi 0)) +
            P.sw 0 * (Tn P 1 s₂ * P.sw 0 + Qn P 1 s₂)) <
      1 / (Qn P 0 (Ioi 0) - P.sw 0) := by sorry

end DriverSurge.IC
Source
Garg, Nazerzadeh, Driver Surge Pricing, arXiv:1905.07544v4, p. 58, Lemma 10 (proof pp. 66–67)
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