Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bit-polynomial candidate labels for rational symmetric-stability recovery

Proved
StableMSR.Recovery.Supplement.BinaryRecovery.polynomial_candidate_labels

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

algorithmsclusteringcomputational-complexity

For each fixed rational stability factor greater than one, output labels in polynomial bit time and recover the partition on stable instances. This is the precise candidate-construction part of Proposition C.4. A.5 bounds the rational sizes of the particular deterministic algorithm. The statement does not require optimality or feasibility of the output on unstable inputs.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_BinaryRecovery
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.polynomial_candidate_labels
    (γ : ℚ) (hγ : 1 < γ) : ∃ f : Input → List ℕ, Poly f ∧ Recovers f γ := by
  sorry
Source
S. Ravichandran and L. Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Theorem 1.1, Appendix A.5 (bit complexity), and Proposition C.4. 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