Proof of Proposition 3, ec13 — corrected lower district bound
ProvedCarlssonPartition.Approx.lower_boundheavy-trafficp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-partitioningvehicle-routing
Under the same standing model, equitability, positive stable arrival rate, nonnegative tolerance, and corrected , write for the full-region Theorem 3 leading term and for the single-vehicle term formed from district 's arrival rate and conditional density. Then every district obeys
Together with the upper estimate, this controls both directions of a district's departure from the benchmark.
Formalization Note The printed uses a maximum; the minimum is used here. ensures positive factors in the comparison. The statement concerns leading expressions at fixed .
Preamble
import Mathlib import Definitions.Def_CarlssonPartition_Approx_Setting
Formal statement
namespace CarlssonPartition.Approx
theorem lower_bound (I : Instance) (hI : I.Standing)
(Rs : Fin I.m → Set CarlssonPartition.Equitable.Plane) (hP : I.IsPartition Rs)
(lam ε : ℝ) (hlam : 0 < lam)
(hstab : I.workload I.m lam I.R I.f < 1)
(hε : 0 ≤ ε)
(h1 : ∀ i, |I.mu1 (Rs i) - (1 / (I.m : ℝ)) * I.mu1 I.R| ≤ ε)
(h2 : ∀ i, |I.mu2 (Rs i) - (1 / (I.m : ℝ)) * I.mu2 I.R| ≤ ε)
(hη : I.eta lam ε < 1) :
∀ i, I.bvrLeading I.m lam I.R I.f *
((1 - I.eta lam ε) / (1 + I.eta lam ε)) ^ 2 ≤
I.bvrLeading 1 (I.lamSub lam (Rs i)) (Rs i) (I.fSub (Rs i)) := 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 Proposition 3, p. ec13 (PDF 50), first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.