Proof of Theorem 6, p. ec6 — ∬_{R_i}√f_i = ∬_{R_i}√f/√(∬_{R_i}f) and ∬_{R_i}‖x − x₀‖f_i = ∬_{R_i}‖x − x₀‖f/∬_{R_i}f
ProvedCarlssonPartition.Equitable.normalization_identitiesintegral-identityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-partitioning
Let satisfy the standing assumptions, and let be a measurable subregion with conditional density . Then
These two identities convert Theorem 3 applied inside one district, which is written in the district's conditional density, back into integrals of the original density ; they are the third equality of the chain in the proof of Theorem 6.
Formalization Note. No positivity of is assumed: it is nonnegative because on , and when it is both sides of each identity are under Lean's convention .
Preamble
import Mathlib import Definitions.Def_CarlssonPartition_Equitable_Setting open Filter Topology MeasureTheory
Formal statement
namespace CarlssonPartition.Equitable
theorem normalization_identities (I : Instance) (hI : I.Standing)
(S : Set Plane) (hS : NullMeasurableSet S volume) (hSR : S ⊆ I.R) :
(∫ x in S, Real.sqrt (I.fSub S x)) = (∫ x in S, Real.sqrt (I.f x)) / Real.sqrt (I.pr S) ∧
(∫ x in S, ‖x - I.x0‖ * I.fSub S x) = (∫ x in S, ‖x - I.x0‖ * I.f x) / I.pr S := 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. ec6, proof of Theorem 6, paragraph after the first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.