Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2, p. 57 — for w_i(u) = mu + zq_{i→j}(u), W_i = m(T_i − 1) + z(Q_i − λ_{i→j}) and uT_iT_j·r equals q_{i→j}(u)[…] + u[…]

Proved
DriverSurge.IC.remark_2

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

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

Let σ\sigmaσ be a policy with τ\tauτ FkF_kFk​-integrable on σk\sigma_kσk​ and wjw_jwj​ FjF_jFj​-integrable on σj\sigma_jσj​, and let the payment in state iii be

wi(u)=mu+z qi→j(u).w_i(u)=mu+z\,q_{i\to j}(u).wi​(u)=mu+zqi→j​(u).

Then

Wi=m(Ti−1)+z(Qi−λi→j),W_i=m(T_i-1)+z(Q_i-\lambda_{i\to j}),Wi​=m(Ti​−1)+z(Qi​−λi→j​),

and for every u>0u>0u>0

u TiTj r(u,i,w,σ)=qi→j(u)[(Rj−m)TjTi+mTj+zQjTi+zTjλi→j]+u[QiTj(m−Rj)+Qj(m−zQi+zλi→j)],u\,T_iT_j\,r(u,i,w,\sigma)=q_{i\to j}(u)\big[(R_j-m)T_jT_i+mT_j+zQ_jT_i+zT_j\lambda_{i\to j}\big]+u\big[Q_iT_j(m-R_j)+Q_j(m-zQ_i+z\lambda_{i\to j})\big],uTi​Tj​r(u,i,w,σ)=qi→j​(u)[(Rj​−m)Tj​Ti​+mTj​+zQj​Ti​+zTj​λi→j​]+u[Qi​Tj​(m−Rj​)+Qj​(m−zQi​+zλi→j​)],

so ∂R(w,σ)/∂u\partial R(w,\sigma)/\partial u∂R(w,σ)/∂u, which has the sign of rrr, has the sign of the right-hand side.

These two identities are the algebra behind the windows of Lemmas 9 and 10 and the targets of Theorem 3.

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: ∂R/∂u∝qi→j(u)[… ]+u[… ]\partial R/\partial u\propto q_{i\to j}(u)[\dots]+u[\dots]∂R/∂u∝qi→j​(u)[…]+u[…] → the exact identity uTiTj r=qi→j(u)[… ]+u[… ]uT_iT_j\,r=q_{i\to j}(u)[\dots]+u[\dots]uTi​Tj​r=qi→j​(u)[…]+u[…], together with the sign statement; reason: uTiTj>0uT_iT_j>0uTi​Tj​>0, so the identity implies the printed sign claim
  • encoding: TiT_iTi​, RjR_jRj​ with integrals implicitly finite → τ\tauτ FkF_kFk​-integrable on σk\sigma_kσk​ and wjw_jwj​ FjF_jFj​-integrable on σj\sigma_jσj​; reason: the quantities 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 identities hold for all trip-length laws and payments, so they specialize to the source
Preamble
import Mathlib
import Definitions.Def_DriverSurge_IC_Pricing
Formal statement
namespace DriverSurge.IC

open MeasureTheory Set

/-- Remark 2 (p. 57). Let `σ` be a policy with `τ` integrable on `σ_1`, `σ_2` and `w_j` integrable on
`σ_j`, and let `w_i(u) = mu + zq_{i→j}(u)`. Then `W_i = m(T_i − 1) + z(Q_i − λ_{i→j})`, and for `u > 0`
`u T_iT_j · r(u, i, w, σ) = q_{i→j}(u)[(R_j − m)T_jT_i + mT_j + zQ_jT_i + zT_jλ_{i→j}] + u[Q_iT_j(m − R_j) + Q_j(m − zQ_i + zλ_{i→j})]`,
so `∂/∂u R(w, σ)` (which has the sign of `r`) has the sign of the right-hand side. -/
theorem remark_2 (P : Primitives) (w : Fin 2 → ℝ → ℝ) (σ : Fin 2 → Set ℝ) (hσ : IsPolicy σ)
    (hτ : ∀ k, IntegrableOn (fun τ : ℝ => τ) (σ k) (P.F k)) (i : Fin 2)
    (hwj : IntegrableOn (w (other i)) (σ (other i)) (P.F (other i))) (m z : ℝ)
    (hwi : w i = fun u => m * u + z * q P i u) :
    Wn P i (w i) (σ i) = m * (Tn P i (σ i) - 1) + z * (Qn P i (σ i) - P.sw i) ∧
    ∀ u : ℝ, 0 < u →
      u * Tn P i (σ i) * Tn P (other i) (σ (other i)) * rFun P w σ i u =
          q P i u * ((stateRate P (other i) (w (other i)) (σ (other i)) - m) *
                Tn P (other i) (σ (other i)) * Tn P i (σ i) + m * Tn P (other i) (σ (other i)) +
              z * Qn P (other i) (σ (other i)) * Tn P i (σ i) +
              z * Tn P (other i) (σ (other i)) * P.sw i) +
            u * (Qn P i (σ i) * Tn P (other i) (σ (other i)) *
                (m - stateRate P (other i) (w (other i)) (σ (other i))) +
              Qn P (other i) (σ (other i)) * (m - z * Qn P i (σ i) + z * P.sw i)) ∧
      SignType.sign (rFun P w σ i u) =
        SignType.sign (q P i u * ((stateRate P (other i) (w (other i)) (σ (other i)) - m) *
                Tn P (other i) (σ (other i)) * Tn P i (σ i) + m * Tn P (other i) (σ (other i)) +
              z * Qn P (other i) (σ (other i)) * Tn P i (σ i) +
              z * Tn P (other i) (σ (other i)) * P.sw i) +
            u * (Qn P i (σ i) * Tn P (other i) (σ (other i)) *
                (m - stateRate P (other i) (w (other i)) (σ (other i))) +
              Qn P (other i) (σ (other i)) * (m - z * Qn P i (σ i) + z * P.sw i))) := by sorry

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