Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5, p. ec5 — T = Σ_i P(x ∈ R_i)T_i, so T/T(π*) → 1 whenever every T_i/T(π*) → 1

Proved
CarlssonPartition.Equitable.total_expectation

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

heavy-trafficlaw-of-total-expectationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-partitioning

Let the instance satisfy the standing assumptions and let {R1,…,Rm}\{\mathscr R_1,\dots,\mathscr R_m\}{R1​,…,Rm​} be a partition of R\mathscr RR. Let T(π∗)T(\pi^*)T(π∗) and T1,…,TmT_1,\dots,T_mT1​,…,Tm​ be real functions of the arrival rate λ\lambdaλ such that, for every iii,

Ti(λ)T(π∗)(λ)→1as ρ+2λ∬R∥x−x0∥f(x) dxmvq→1−.\frac{T_i(\lambda)}{T(\pi^*)(\lambda)}\to1\qquad\text{as }\rho+\frac{2\lambda\iint_{\mathscr R}\|x-x_0\|f(x)\,dx}{mvq}\to1^-.T(π∗)(λ)Ti​(λ)​→1as ρ+mvq2λ∬R​∥x−x0​∥f(x)dx​→1−.

Then the overall expected delivery time given by the law of total expectation, T=∑i=1mP(x∈Ri) TiT=\sum_{i=1}^m\mathbb P(x\in\mathscr R_i)\,T_iT=∑i=1m​P(x∈Ri​)Ti​ with P(x∈Ri)=∬Rif(x) dx\mathbb P(x\in\mathscr R_i)=\iint_{\mathscr R_i}f(x)\,dxP(x∈Ri​)=∬Ri​​f(x)dx, satisfies

∑i=1mP(x∈Ri) Ti(λ)T(π∗)(λ)→1\frac{\sum_{i=1}^m\mathbb P(x\in\mathscr R_i)\,T_i(\lambda)}{T(\pi^*)(\lambda)}\to1T(π∗)(λ)∑i=1m​P(x∈Ri​)Ti​(λ)​→1

along the same heavy-traffic limit.

This is the final step of the proofs of Theorems 5 and 6: once each district is asymptotically as fast as π∗\pi^*π∗, so is the region partitioning policy as a whole.

Formalization Note. The content is that the district probabilities sum to ∬Rf=1\iint_{\mathscr R}f=1∬R​f=1 for a partition up to null sets, together with averaging of ratios under a probability vector.

Preamble
import Mathlib
import Definitions.Def_CarlssonPartition_Equitable_Setting

open Filter Topology MeasureTheory
Formal statement
namespace CarlssonPartition.Equitable

theorem total_expectation (I : Instance) (hI : I.Standing)
    (Rs : Fin I.m → Set Plane) (hP : I.IsPartition Rs)
    (Tstar : ℝ → ℝ) (T : Fin I.m → ℝ → ℝ)
    (hT : ∀ i, Tendsto (fun lam => T i lam / Tstar lam) (I.heavy I.m I.R I.f) (𝓝 1)) :
    Tendsto (fun lam => (∑ i, I.pr (Rs i) * T i lam) / Tstar lam) (I.heavy I.m I.R I.f) (𝓝 1) := by sorry

end CarlssonPartition.Equitable
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), p. ec5, proof of Theorem 5, display after 'Therefore, the expected delivery time to the whole service region is'
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me