Remark 4, p. 57 — λ_{i→j}T_i − Q_i ≥ 0 and Q_i ≥ 0, both maximized at σ_i = (0, ∞)
ProvedDriverSurge.IC.remark_4p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1surge-pricing
Let the trip-length laws have finite means. For each state and every open ,
These bounds make the denominators in 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 .
Differences from the source:
- encoding: implicitly finite → finite means ; reason: is undefined otherwise; only undefined cases are excluded
- generalization: D.3.1's standing assumptions (p. 56): has a bounded density, and state 2 dominates state 1 ( with for all ) → not assumed; reason: the inequalities follow from 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.