Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact regional partition menus with only a local bound on large clusters

Proved
StableMSR.Recovery.RegionalSeeds.bounded_local_large_cluster_menus

by lreyzin · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclusteringdynamic-programmingformal-verification

For any window W, enumerate at most (h+1)n^(2(h+1)) feasible partition candidates. The family contains all nonempty intersections of the stable optimum with W as one candidate whenever at most h globally large clusters meet W, irrespective of how many lie outside. For aligned W that candidate is the true restricted partition. One distance pair encodes the small-component threshold and one center/farthest-witness pair encodes each intersecting large ball.

Preamble
import Definitions.Def_StableMSR_RegionalSeeds
import Definitions.Def_StableMSR_RegionalBallDP
open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries
open StableMSR.Recovery.BallCoverCatalog StableMSR.Recovery.CartesianBallRows StableMSR.Recovery.FewBallRows
open StableMSR.Recovery.RegionalBallDP
open scoped Classical
set_option autoImplicit false
set_option maxHeartbeats 2200000
set_option maxRecDepth 12000
Formal statement
theorem StableMSR.Recovery.RegionalSeeds.bounded_local_large_cluster_menus (x : World) (h : ℕ) (W : Cluster x.n) (hk : 1≤x.k) (hn : x.k<x.n)
    (dm : IsMetricArray x.dist) :
    (RegionalSeeds.traceMenu x h W).card≤(h+1)*rows x.n (h+1) ∧
    (∀P∈RegionalSeeds.traceMenu x h W,Feasible W P.card P) ∧
    ∀(e : ℝ),0<e → e<1 → ∀O,Stable x.dist x.k (1+e) O →
      (meeting (largeClusters x.dist O e) W).card≤h →
      RegionalSeeds.tracePartition O W∈RegionalSeeds.traceMenu x h W ∧
      (Aligned O W → restrictPartition O W∈RegionalSeeds.traceMenu x h W) := by
  sorry
Source
Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Algorithm 1, equation (2), and Appendix A.4–A.6. Real-distance oracle implementation and witness reconstruction for the Prove2Me recovery mission.

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