Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Algorithm 1, Branch A: bounded candidate enumeration and exact recovery

Proved
StableMSR.Recovery.few_large_cluster_recovery

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

clusteringperturbation-stabilitysum-of-radii

Let ddd be a finite metric on nnn points, let 1≤k<n1\le k<n1≤k<n, and fix 1<γ<21<\gamma<21<γ<2 and an integer B≥0B\ge0B≥0. Construct the Branch A output family by enumerating all input-distance radius guesses, all pairwise disjoint families of at most BBB candidate ball representations, and their global-component completions. This explicit family has at most

n2(n2+1)Bn^2(n^2+1)^Bn2(n2+1)B

outputs. Starting from any feasible exact-kkk partition, the feasibility-checked minimum-cost scan always returns a feasible exact-kkk partition.

If the instance has a γ\gammaγ-stable optimum O\mathcal OO with at most BBB clusters of radius at least (γ−1)R/4(\gamma-1)R/4(γ−1)R/4, where RRR is its largest radius, the scan returns exactly O\mathcal OO.

The theorem establishes correctness and the candidate-family size for the bounded-enumeration branch. The accompanying proof supplies an equivalent enumeration by length-BBB tuples of candidate representations and blanks, so the family need not be generated by scanning an unbounded powerset. The result is a finite-algorithm specification; the full interpreter runtime and the many-large-clusters branch remain separate obligations.

Preamble
import Definitions.Def_StableMSR_Recovery_FewBranch

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

theorem few_large_cluster_recovery {n : ℕ} (d : Point n → Point n → ℝ)
    (hd : IsMetricArray d) (k : ℕ) (hk : 1 ≤ k ∧ k ≤ n)
    (γ : ℝ) (hγ : 1 < γ ∧ γ < 2) (hkn : k < n) (budget : ℕ)
    (initial : Partition n) (hi : Feasible Finset.univ k initial) :
    (CandidateAux.fewOutputs d γ budget).card ≤ n ^ 2 * (n ^ 2 + 1) ^ budget ∧
      Feasible Finset.univ k
        (CandidateAux.select d k initial (CandidateAux.fewOutputs d γ budget).toList) ∧
      ∀ O : Partition n, Stable d k γ O →
        (largeClusters d O (γ - 1)).card ≤ budget →
        CandidateAux.select d k initial (CandidateAux.fewOutputs d γ budget).toList = O := by sorry

end StableMSR.Recovery
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, https://arxiv.org/html/2611.03547v1, Equation (1), Algorithm 1 Branch A, Lemma 3.8, and Appendix A.5. Uses the proved feasibility-checked global-component variant described in StableMSR_Recovery_FewBranch.

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