Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

NP-hardness of the rational exact MSR threshold language

Proved
StableMSR.Recovery.Supplement.threshold_np_hard

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

Every language in NP has a polynomial-time many-one reduction to exact MSR threshold decision in the mission's binary encoding. The output language uses positive rational thresholds, rational finite metrics, exactly the requested number of nonempty blocks and centers drawn from their blocks. This is the source hardness result used in Appendix C.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_Languages

set_option autoImplicit false
Formal statement
namespace StableMSR.Recovery.Supplement

theorem threshold_np_hard :
    ∀ L ∈ PvsNP.NP, PvsNP.PReducible L MSRThreshold := by sorry

end StableMSR.Recovery.Supplement
Source
Gibson, Kanade, Krohn, Pirwani and Varadarajan, On Metric Clustering to Minimize the Sum of Radii, Algorithmica 57 (2010), 484–498, DOI 10.1007/s00453-009-9282-7, Section 3 of the author version. Ravichandran and Reyzin, arXiv:2611.03547, Appendix C, pp. 23–24, give the ball-to-partition correspondence.

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