Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact minimum-cost selection from a polynomial list of clustering candidates

Proved
StableMSR.Recovery.Supplement.BinaryRecovery.candidate_selection

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

algorithmsclusteringcomputational-complexity

Filtering for feasible label vectors and taking a minimum of the exact rational costs is polynomial. On a stable input, whenever the list contains a labeling of the stable optimum, the selected candidate encodes that same partition.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_CandidateSelection
import Definitions.Def_QuantumMaxCutFiniteNumericRuntime
open OAI.MetricKMedian.Binary.Automatic
open StableMSR.Recovery StableMSR.Recovery.Supplement StableMSR.Recovery.Supplement.BinaryRecovery
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.candidate_selection (F : Input → List (List ℕ)) (hp : Poly F) :
  Poly (fun a => select a (F a)) ∧ ∀ γ : ℚ, ContainsStable F γ → 1 ≤ γ → Recovers (fun a => select a (F a)) γ := by
  sorry
Source
S. Ravichandran and L. Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Section 3 and Appendix C.4. https://arxiv.org/abs/2611.03547 . The common-radius two-edge criterion is deduced from the published center and intercluster separation statements.

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