Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A single input distance recovers stable clusters by paths of at most two edges

Proved
StableMSR.Recovery.common_radius_two_step_recovery

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

algorithmsclusteringcomputational-complexity

If the stability factor satisfies γ > 1 and (γ−1)² ≥ γ, two points belong to the same cluster exactly when they are joined by a path of two edges at a common threshold. The threshold is an actual input distance, and may be taken as the largest optimal radius. This holds for all k, including 1 and n.

Preamble
import Definitions.Def_StableMSR_Recovery_Geometry
open StableMSR.Recovery
Formal statement
theorem StableMSR.Recovery.common_radius_two_step_recovery {n : ℕ}
    (d : Point n → Point n → ℝ) (hd : IsMetricArray d) (k : ℕ) (hk : 1 ≤ k ∧ k ≤ n)
    (γ : ℝ) (hγ : 1 < γ) (hgap : γ ≤ (γ-1)^2) (O : Partition n) (hO : Stable d k γ O) :
    ∃ u v : Point n, ∀ x y : Point n,
      (∃ C ∈ O, x ∈ C ∧ y ∈ C) ↔ ∃ z : Point n, d x z ≤ d u v ∧ d z y ≤ d u v := by
  sorry
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Lemmas 3.2 and 3.3 (intercluster and optimal-center separation). The common threshold follows by combining the two estimates. https://arxiv.org/abs/2611.03547

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