Proof of Theorem 6, ec5–ec6 — district leading term in μ₁ and μ₂
ProvedCarlssonPartition.Approx.district_leadingheavy-trafficp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-partitioningvehicle-routing
Let be a district in a partition of the service region and suppose its demand share is positive. At arrival rate , its conditional demand density is and its arrival rate is . Theorem 3's single-vehicle leading term then has the form
This normalization identity connects the district data to the two measures used in the approximate partition estimates.
Formalization Note The district term is constructed from its own and . Positive district demand is explicit because divides by that share. A partition is understood up to null sets.
Preamble
import Mathlib import Definitions.Def_CarlssonPartition_Approx_Setting
Formal statement
namespace CarlssonPartition.Approx
theorem district_leading (I : Instance) (hI : I.Standing)
(Rs : Fin I.m → Set CarlssonPartition.Equitable.Plane) (hP : I.IsPartition Rs)
(i : Fin I.m) (hpr : 0 < I.pr (Rs i)) (lam : ℝ) :
I.bvrLeading 1 (I.lamSub lam (Rs i)) (Rs i) (I.fSub (Rs i)) =
I.beta ^ 2 * lam * (1 - 1 / (I.q : ℝ)) ^ 2 * I.mu1 (Rs i) ^ 2 /
(2 * I.v ^ 2 * (1 - lam * I.mu2 (Rs i) / (I.v * (I.q : ℝ))) ^ 2) := by sorry
end CarlssonPartition.Approx
Source
Carlsson, Liu, Salari and Yu, Provably Good Region Partitioning for On-Time Last-Mile Delivery, accepted manuscript (SSRN 3915544; published in Operations Research 72(1):91–109, 2024, doi:10.1287/opre.2021.0588), proof of Theorem 6, pp. ec5–ec6 (PDF 42–43), first equality on ec6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.