Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Correctness of the hub reduction on every binary input under both perturbation conventions

Proved
StableMSR.Recovery.Supplement.HubReduction.correct

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

Fix a rational stability factor greater than one. A string is outside the exact MSR threshold language if and only if the explicit verification map produces a stable supplied partition. Equivalently, the recognition map produces an instance admitting a stable partition. Both equivalences hold for arbitrary symmetric perturbations and for metric perturbations, on every string. On valid inputs the maps encode the same rational instance, and the supplied labels give its unique original optimum with exactly one nonsingleton block. This theorem establishes correctness of the maps. Their polynomial bit running time is a separate assertion.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_HubReduction

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

theorem correct (γ : ℚ) (hγ : 1 < γ) :
    (∀ (w : Bits) (metric : Bool),
      (w ∉ MSRThreshold ↔ verificationMap γ w ∈ Verify metric γ) ∧
      (w ∉ MSRThreshold ↔ recognitionMap γ w ∈ Recognize metric γ)) ∧
    ∀ w T, decodeThreshold w = some T → T.Valid →
      ∃ S, decodeSpecified (verificationMap γ w) = some S ∧ S.Valid ∧
        recognitionMap γ w = encodeInput S.input ∧
        UniqueOptimal S.input.dist Finset.univ S.input.k S.partition ∧
        (S.partition.filter (fun C => 1 < C.card)).card = 1 := by sorry

end StableMSR.Recovery.Supplement.HubReduction
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Theorem 5.1 and Appendix C, Lemma C.1, Proposition C.2, and equation (5), pp. 24–25.

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