Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A cubic binary certificate bound for both MSR perturbation conventions

Proved
StableMSR.Recovery.Supplement.cubic_instability_certificate

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

clusteringcomputational-complexityoptimization

Let a binary string www decode to a valid rational finite metric, a feasible specified partition, and rational γ≥1\gamma\ge1γ≥1. The partition is unstable precisely when the mission's checker accepts a certificate of at most 64(∣w∣+1)364(|w|+1)^364(∣w∣+1)3 bits. The constant and exponent are uniform over both perturbation conventions and over γ\gammaγ. The certificate encodes the rational table and an integer label for each point of the competing partition. This quantitative form of the certificate-size assertion in Lemma C.3 counts the bits of the published canonical encoding.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_Languages

set_option autoImplicit false
Formal statement
namespace StableMSR.Recovery.Supplement

theorem cubic_instability_certificate (metric : Bool) (w : Bits) (γ : ℚ) (S : SpecifiedInput)
    (hd : decodeInstabilityInput w = some (γ,S)) (hγ : 1 ≤ γ) (hS : S.Valid) :
    ¬ ConventionStable metric S.input.dist S.input.k γ S.partition ↔
      ∃ y : Bits, y.length ≤ 64 * (w.length + 1)^3 ∧ instabilityCheck metric (w,y) = true := by sorry

end StableMSR.Recovery.Supplement
Source
Shyam Ravichandran and Lev Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix C, Lemma C.3, pp. 25–26 (bounded rational polyhedron and determinant argument). 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