Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Correctness of the CNF reduction for exact partitions with in-cluster centers

Proved
StableMSR.Recovery.Supplement.SATMetric.instance_correct

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

algorithmsclusteringcomputational-complexity

Every formula produces a valid rational metric with a positive threshold, including formulas with no clauses or an empty clause. The optimum over exactly k disjoint nonempty clusters with in-cluster centers is at most the threshold if and only if F is satisfiable.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_SATMetric

set_option autoImplicit false
open StableMSR.Recovery StableMSR.Recovery.Supplement
Formal statement
namespace StableMSR.Recovery.Supplement.SATMetric

theorem instance_correct (F : PvsNP.CNF) :
    (instanceOf F).Valid ∧
    (optimumValue (instanceOf F).input.dist (instanceOf F).input.k ≤ ((instanceOf F).threshold : ℝ) ↔ PvsNP.Satisfiable F) := by sorry

end StableMSR.Recovery.Supplement.SATMetric
Source
Gibson, Kanade, Krohn, Pirwani, and Varadarajan, On Metric Clustering to Minimize the Sum of Radii, Algorithmica 57 (2010), Section 3, Theorem 2. https://www.cs.utsa.edu/~gibson/MetricKClustering.pdf . Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Appendix C, https://arxiv.org/abs/2611.03547 . The explicit table used here adapts the literal and private-point construction to unrestricted finite metrics.

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