Proof of Theorem 6, pp. ec5–ec6 — under both equitable conditions each district's Theorem 3 leading term equals the fleet's
ProvedCarlssonPartition.Equitable.district_leadingLet the instance satisfy the standing assumptions and let be a partition of . Fix a district with that satisfies both equitable conditions
With , and , for every arrival rate ,
The left side is the leading-order delivery time that Theorem 3 (Bertsimas and van Ryzin) gives for one vehicle serving district ; the right side is the leading-order delivery time of the flexible fleet policy . The identity is the chain of equalities in the proof of Theorem 6.
Formalization Note. Both sides are the bvrLeading term of the mission's Setting, with on the left and on the right. It is an exact identity for every ; the paper's "" concerns the delivery time , which does not appear here. The hypothesis is what the definition of presupposes.
import Mathlib import Definitions.Def_CarlssonPartition_Equitable_Setting open Filter Topology MeasureTheory
namespace CarlssonPartition.Equitable
theorem district_leading (I : Instance) (hI : I.Standing)
(Rs : Fin I.m → Set Plane) (hP : I.IsPartition Rs) (i : Fin I.m)
(h1 : (∫ x in Rs i, Real.sqrt (I.f x)) = (1 / (I.m : ℝ)) * ∫ x in I.R, Real.sqrt (I.f x))
(h2 : (∫ x in Rs i, (I.sbar * I.v * (I.q : ℝ) + 2 * ‖x - I.x0‖) * I.f x)
= (1 / (I.m : ℝ)) * ∫ x in I.R, (I.sbar * I.v * (I.q : ℝ) + 2 * ‖x - I.x0‖) * I.f x)
(hpos : 0 < I.pr (Rs i)) (lam : ℝ) :
I.bvrLeading 1 (I.lamSub lam (Rs i)) (Rs i) (I.fSub (Rs i)) = I.bvrLeading I.m lam I.R I.f := by sorry
end CarlssonPartition.Equitable
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.