Proof of Propositions 1 and 2, Online Appendix p. 1 — f has a unique zero a₁ ≈ 0.5689 on (0, T₁), with f < 0 before it and f > 0 after it
ProvedCourierDispatch.Exogenous.unique_rooton-demand-deliveryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1single-crossingthreshold
Let and let be the bracket of (A.1),
Then there is with
such that for and for . In particular is the unique zero of on .
This is the single-crossing fact behind both threshold propositions: dedicated delivery has the shorter wait exactly when .
Formalization Note The paper states for ; the bounds record that approximation and hold over the whole bracket. The paper's second positive root lies beyond both stability bounds and and is not stated.
Preamble
import Mathlib import Definitions.Def_CourierDispatch_Exogenous_Setting
Formal statement
namespace CourierDispatch.Exogenous
/-- Proof of Propositions 1 and 2, Online Appendix p. 1: on `(0, T₁) = (0, 3/4)` the bracket of (A.1)
has exactly one zero `a₁ ≈ 0.5689`, negative before it and positive after it. -/
theorem unique_root (CB : ℝ) (hCB : CBRange CB) :
∃ a₁ : ℝ, 0 < a₁ ∧ a₁ < TD ∧ 56 / 100 < a₁ ∧ a₁ < 58 / 100 ∧ fA CB a₁ = 0 ∧
(∀ a : ℝ, 0 < a → a < a₁ → fA CB a < 0) ∧
(∀ a : ℝ, a₁ < a → a < TD → 0 < fA CB a) := by sorry
end CourierDispatch.Exogenous
Source
Chen, Hu, Courier Dispatch in On-Demand Delivery, SSRN 3675063 (version of 2022-09-21), Online Appendix p. 1, proof of Propositions 1 and 2, after (A.2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.