Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.3 — polynomial rational instability witnesses

Proved
StableMSR.Recovery.Supplement.rational_instability_witness

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

clusteringp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1perturbation-stability

For rational finite metric inputs and rational γ≥1\gamma\ge1γ≥1, under either perturbation convention a specified feasible exact-kkk partition is unstable exactly when it has a rational perturbation and a distinct feasible competitor of no greater perturbed cost, encoded by a polynomial-length certificate.

For a binary input www encoding γ\gammaγ, the metric table and the specified partition, there are absolute natural constants a>0,ba>0,ba>0,b such that

¬Stable⁡γc(I,O)  ⟺  ∃y: ∣y∣≤a(∣w∣+1)b  and Check⁡c(w,y)=1.\neg\operatorname{Stable}^{c}_{\gamma}(I,\mathcal O) \iff\exists y:\ |y|\le a(|w|+1)^b\ \text{ and }\operatorname{Check}^{c}(w,y)=1.¬Stableγc​(I,O)⟺∃y: ∣y∣≤a(∣w∣+1)b  and Checkc(w,y)=1.

For each convention ccc, the explicit checker runs in polynomial time in ∣w∣+∣y∣|w|+|y|∣w∣+∣y∣. It tests the decoded rational perturbation bounds, symmetry, competitor feasibility and distinctness, the cost inequality, and the triangle inequalities when needed. This includes γ=1\gamma=1γ=1 and supplies the certificate ingredient for coNP membership.

Differences from the source:

  • encoding: Finite ordered metric input and unordered exact-k partitions → Fin n points, real metric arrays, and finite sets of nonempty disjoint blocks; reason: Input-order relabelling preserves every source instance and partition; base published definitions are reused without extra conditions
  • encoding: Rational input and rational gamma >= 1; polynomial binary-length perturbation and competitor → The rational factor is a leading binary input field; a uniform positive prefactor and natural exponent bound the concrete certificate length; reason: The input length includes the factor as well as the rational table and labels; both perturbation conventions use the same literal certificate format
  • encoding: Can be verified in polynomial time → PvsNP.PolyTimeChecker for the concrete decoded perturbation-and-competitor checking relation; reason: This is the standard multi-stack Turing machine notion; no polynomial-time verification assumption is added
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_Languages

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

theorem rational_instability_witness :
    ∃ a b : ℕ, 0 < a ∧
      ∀ metric : Bool, PvsNP.PolyTimeChecker (instabilityCheck metric) ∧
        ∀ w γ S, decodeInstabilityInput w = some (γ,S) → 1 ≤ γ → S.Valid →
          (¬ ConventionStable metric S.input.dist S.input.k γ S.partition ↔
            ∃ y : Bits, y.length ≤ a * (w.length + 1) ^ b ∧
              instabilityCheck metric (w,y) = true) := by sorry

end StableMSR.Recovery.Supplement
Source
Shyam Ravichandran, Lev Reyzin, STOC 2027 submission #1010 (October 2026), Lemma C.3, p. 25; PDF SHA256 8bb34b0b6d31458fe6fc0848c1fc82a6083f3e9ae672e748d24cf82d5289e53e

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