Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.4: few large clusters or an enumerated dyadic scale

Proved
StableMSR.Recovery.clustering_scale_selection

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

clusteringperturbation-stabilitysum-of-radii

Let a finite metric space of nnn points be partitioned into k<nk<nk<n nonempty clusters, and let 0<ε<10<\varepsilon<10<ε<1. Write RRR for the largest cluster radius, b=εR/4b=\varepsilon R/4b=εR/4, TTT for the clusters of radius at least bbb, M=∑C∈Tr(C)M=\sum_{C\in T}r(C)M=∑C∈T​r(C), and ρ=εM/4\rho=\varepsilon M/4ρ=εM/4. With σ=512\sigma=512σ=512 and Nε=⌈16σ/ε2⌉N_\varepsilon=\lceil16\sigma/\varepsilon^2\rceilNε​=⌈16σ/ε2⌉, one of the following holds:

  1. ρ<σR\rho<\sigma Rρ<σR and ∣T∣≤Nε|T|\le N_\varepsilon∣T∣≤Nε​.
  2. There is an integer jjj with 9≤j≤⌈log⁡2n⌉9\le j\le\lceil\log_2 n\rceil9≤j≤⌈log2​n⌉ such that, for L=2jRL=2^jRL=2jR,
σR≤L≤ρ<2L,M/L<8/ε.\sigma R\le L\le\rho<2L,\qquad M/L<8/\varepsilon.σR≤L≤ρ<2L,M/L<8/ε.

This is the deterministic scale-selection portion of Lemma A.4. It identifies either the bounded enumeration branch or a scale in Algorithm 1's finite list. The probabilistic partition guarantee is a separate obligation. The numerical argument needs feasibility and metricity, but no optimality or stability assumption.

Preamble
import Definitions.Def_StableMSR_Recovery_Geometry
import Definitions.Def_StableMSR_Recovery_Parameters

set_option autoImplicit false
open scoped Classical
Formal statement
namespace StableMSR.Recovery

theorem clustering_scale_selection {n k : ℕ} (d : Point n → Point n → ℝ)
    (hd : IsMetricArray d) (O : Partition n) (hO : Feasible Finset.univ k O)
    (hkn : k < n) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1) :
    (densityScale d O ε < sigma * largestRadius d O ∧
      (largeClusters d O ε).card ≤ fewBound ε) ∨
    (∃ j : ℕ, 9 ≤ j ∧ j ≤ ⌈Real.logb 2 (n : ℝ)⌉₊ ∧
      sigma * largestRadius d O ≤ (2 : ℝ) ^ j * largestRadius d O ∧
      (2 : ℝ) ^ j * largestRadius d O ≤ densityScale d O ε ∧
      densityScale d O ε < 2 * ((2 : ℝ) ^ j * largestRadius d O) ∧
      largeMass d O ε / ((2 : ℝ) ^ j * largestRadius d O) < 8 / ε) := by sorry

end StableMSR.Recovery
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, https://arxiv.org/html/2611.03547v1, Lemma A.4, first two assertions and their proof; Table 2 for the exact constants.

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