Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.2 — exact stability threshold and metric tie

Proved
StableMSR.Recovery.Supplement.hub_stability_threshold

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

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

Use the rational hub/dummy construction of Appendix C with 1≤k≤∣Y∣1\le k\le |Y|1≤k≤∣Y∣, τ>0\tau>0τ>0, and γ>1\gamma>1γ>1. Put a=OPTk(Y)a=\mathrm{OPT}_k(Y)a=OPTk​(Y) and

λ∗=(δ+a)/R0=γ+(OPTk(Y)−τ)/R0.\lambda_*=(\delta+a)/R_0=\gamma+(\mathrm{OPT}_k(Y)-\tau)/R_0.λ∗​=(δ+a)/R0​=γ+(OPTk​(Y)−τ)/R0​.

For every real λ≥1\lambda\ge1λ≥1, under each perturbation convention,

O0 is λ-stable  ⟺  λ<λ∗.\mathcal O_0\text{ is }\lambda\text{-stable}\iff\lambda<\lambda_*.O0​ is λ-stable⟺λ<λ∗​.

There is also a metric λ∗\lambda_*λ∗​-perturbation for which O0\mathcal O_0O0​ is optimal and a distinct feasible exact-KKK partition has equal cost. Perturbed distances may be real and centers may change. This records both directions of the exact threshold and the boundary tie.

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: O_0 is lambda-stable exactly when 1 <= lambda < lambda*, and a metric tie at lambda* → The equivalences quantify over every real lambda >= 1, followed by an explicit metric perturbation and distinct equal-cost feasible competitor; reason: Lambda >= 1 is the domain of stability factors; the boundary witness is part of the conclusion, not an assumption
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_Hub

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

theorem hub_stability_threshold {n k : ℕ} (d : Point n → Point n → ℚ) (γ τ : ℚ)
    (hk : 1 ≤ k) (hkn : k ≤ n) (hd : IsMetricArray (fun x y => (d x y : ℝ)))
    (hγ : 1 < γ) (hτ : 0 < τ) :
    let dr := fun x y => (d x y : ℝ)
    let dp := hubDistance dr k γ τ
    let O₀ := suppliedPartition n k
    let ellStar := stabilityThreshold dr k γ τ
    ellStar = (γ : ℝ) + (optimumValue dr k - τ) / hubRadius dr γ τ ∧
    (∀ ell : ℝ, 1 ≤ ell →
      (Stable dp (k + 2) ell O₀ ↔ ell < ellStar) ∧ (StableMetric dp (k + 2) ell O₀ ↔ ell < ellStar)) ∧
    ∃ p : Point (n + k + 2) → Point (n + k + 2) → ℝ,
      MetricPerturbation dp ellStar p ∧ Optimal p Finset.univ (k + 2) O₀ ∧
      ∃ Q, Feasible Finset.univ (k + 2) Q ∧ Q ≠ O₀ ∧ cost p Q = cost p O₀ := by sorry

end StableMSR.Recovery.Supplement
Source
Shyam Ravichandran, Lev Reyzin, STOC 2027 submission #1010 (October 2026), Proposition C.2, 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