A deterministic real-distance grid yields diameter-L regions and a global epsilon-dependent split bound
ProvedStableMSR.Recovery.WindowCSP.explicit_real_sweep_has_few_splitsalgorithmsclusteringformal-verificationgraph-theory
Use canonical greedy nets inside threshold components, move every small-diameter fine component as a unit, and sweep a single radius over n grid points. A split forces a large optimal block and a nearby net center whose crossing interval has length at most six times the block radius. Local net packing and grid averaging bound the number of split blocks globally, and net coverage bounds the diameter of each signature class by L. The argument uses arbitrary real distances and gives an explicit deterministic label for every point.
Preamble
import Definitions.Def_StableMSR_ExplicitWindowScenes import Definitions.Def_StableMSR_WindowCSP open StableMSR.Recovery.WindowSweep StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries open StableMSR.Recovery.Supplement StableMSR.Recovery.RegionalSeeds StableMSR.Recovery.WindowCSP open StableMSR.Recovery.BallCoverCatalog StableMSR.Recovery.FewBallRows open scoped Classical set_option autoImplicit false set_option maxHeartbeats 2400000 set_option maxRecDepth 12000
Formal statement
theorem StableMSR.Recovery.WindowCSP.explicit_real_sweep_has_few_splits (ctx : World) (γ R L : ℝ) (gg : 1<γ) (gu : γ<2)
(hk : 1≤ ctx.k) (kn : ctx.k< ctx.n) (dm : IsMetricArray ctx.dist)
(O : Partition ctx.n) (ho : Stable ctx.dist ctx.k γ O) (hr : R=largestRadius ctx.dist O)
(rp : 0< R) (sl : sigma*R≤ L) (lu : L≤ densityScale ctx.dist O (γ-1))
(mass : largeMass ctx.dist O (γ-1)/L<8/(γ-1)) :
∃i< ctx.n,let key:=coarseKey ctx.dist R L ((γ-1)*R/4) i
(splitBy O key).card≤ coarseBudget (γ-1) ∧ ∀p q,key p=key q → ctx.dist p q≤ L := by
sorrySource
Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Lemmas 3.3, 3.8, 3.9(iii), 4.4, Proposition 4.2, Algorithm 1, and Appendix A.4–A.6. Alternative pairwise formulation using bounded-overlap window traces in the mission’s real-distance model.