Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 6, ec5–ec6 — district leading term in μ₁ and μ₂

Proved
CarlssonPartition.Approx.district_leading

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

heavy-trafficp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-partitioningvehicle-routing

Let RiR_iRi​ be a district in a partition of the service region and suppose its demand share p(Ri)=∫Rifp(R_i)=\int_{R_i}fp(Ri​)=∫Ri​​f is positive. At arrival rate λ\lambdaλ, its conditional demand density is fi=f/p(Ri)f_i=f/p(R_i)fi​=f/p(Ri​) and its arrival rate is λi=λp(Ri)\lambda_i=\lambda p(R_i)λi​=λp(Ri​). Theorem 3's single-vehicle leading term then has the form

L(1,λi,Ri,fi)=β2λ(1−1/q)2μ1(Ri)22v2(1−λμ2(Ri)/(vq))2.L(1,\lambda_i,R_i,f_i)= \frac{\beta^2\lambda(1-1/q)^2\mu_1(R_i)^2} {2v^2(1-\lambda\mu_2(R_i)/(vq))^2}.L(1,λi​,Ri​,fi​)=2v2(1−λμ2​(Ri​)/(vq))2β2λ(1−1/q)2μ1​(Ri​)2​.

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 λi\lambda_iλi​ and fif_ifi​. Positive district demand is explicit because fif_ifi​ 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
  • 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me