The native Cartesian words encode every integral scale, sweep index and tuple of repair balls
ProvedStableMSR.Recovery.WindowCSP.sweep_words_cover_all_indicesalgorithmsclusteringformal-verificationgraph-theory
Choose the radius endpoints, multiplier digits, grid index, h pairs of endpoints, and h zero-or-one activation markers independently in a Cartesian word. A separate multiplier flag encodes m=n. Activating exactly the first g balls makes all pointwise labels equal to the original repair signature, including the empty repair.
Preamble
import Definitions.Def_StableMSR_SweepWords import Definitions.Def_StableMSR_WindowCSP open StableMSR.Recovery.SweepWords 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.sweep_words_cover_all_indices (x : World) (e : ℚ) (h : ℕ) (two : 2≤ x.n) (width : x.k=SweepWords.slots h)
(pairs' : CartesianBallRows.pairs x) (p q : Point x.n) (m i g u : ℕ) (hm : m≤ x.n)
(hi : i< x.n) (hg : g≤ h) (hu : u< CartesianBallRows.rows x.n g) :
∃r< x.rows,rawR x r=x.dist p q ∧ ∀z : Point x.n,
wordKey x e h r z=repairKey x.dist (coarseKey x.dist (x.dist p q) ((m:ℝ)*x.dist p q)
((e:ℝ)*x.dist p q/4) i) g u z := 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.