The explicit literal–private-point table is an integer metric
ProvedStableMSR.Recovery.Supplement.SATMetric.integer_metricalgorithmsclusteringcomputational-complexity
For every clause incidence pattern, the table separates points, is symmetric and satisfies every triangle inequality, including on unused variable or clause indices. This establishes the general-metric realization of the powers-of-two gadget.
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 integer_metric (H : ℕ → Bool → ℕ → Bool) (x y : Vertex) :
(D H x y = 0 ↔ x = y) ∧ D H x y = D H y x ∧ ∀ z, D H x z ≤ D H x y + D H y z := 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.