Propositions 1 and 2, pp. 13–14 — with exogenous demand, dedicated has the shorter wait exactly when λr is below one threshold
ProvedCourierDispatch.Exogenous.propositions_1_2Let . There is a constant with such that for every service radius and every exogenous demand rate with (that is, ):
- if and only if ;
- if and only if ;
- for every inverse valuation c.d.f. , every potential-arrival parameter with , and every wait-cost rate , with
the dedicated revenue strictly exceeds the batch revenue iff , and the batch revenue strictly exceeds the dedicated one iff .
Here , , , and are the expected waits (5), (12). For the paper reports . Proposition 1 is the threshold in the demand rate at fixed radius, and Proposition 2 the threshold in the radius at fixed demand rate.
Formalization Note lam is . One constant serves all and , as in the paper's proof. The range is the stability range of dedicated delivery (batch is then stable as well); beyond it only batch is defined and the paper makes no comparison. The revenue clauses include the model's and from p. 8. is represented by an arbitrary function Q; its properties cancel from equal-demand revenue comparisons. ranges over the bracket instead of the paper's numerical value .
import Mathlib import Definitions.Def_CourierDispatch_Exogenous_Setting
namespace CourierDispatch.Exogenous
/-- Propositions 1 and 2, pp. 13–14, in their common form (Online Appendix p. 1): one constant
`a₁ ∈ (0, 3/4)` such that, for every radius `r > 0` and demand rate `λ > 0` with `λ r < 3/4`,
dedicated has the strictly shorter expected wait (and strictly higher revenue) iff `λ r < a₁`, and
batch does iff `λ r > a₁`. -/
theorem propositions_1_2 (CB : ℝ) (hCB : CBRange CB) :
∃ a₁ : ℝ, 0 < a₁ ∧ a₁ < TD ∧
∀ r lam : ℝ, 0 < r → 0 < lam → lam * r < TD →
(WD lam (muD r) CD < WB r lam (muB r) CB ↔ lam * r < a₁) ∧
(WB r lam (muB r) CB < WD lam (muD r) CD ↔ a₁ < lam * r) ∧
(∀ (Q : ℝ → ℝ) (Lam c : ℝ), 0 < Lam → lam ≤ Lam * r ^ 2 → 0 < c →
(V Q Lam r c lam (WB r lam (muB r) CB) < V Q Lam r c lam (WD lam (muD r) CD) ↔
lam * r < a₁) ∧
(V Q Lam r c lam (WD lam (muD r) CD) < V Q Lam r c lam (WB r lam (muB r) CB) ↔
a₁ < lam * r)) := by sorry
end CourierDispatch.Exogenous
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.