Correctness of the hub reduction on every binary input under both perturbation conventions
ProvedStableMSR.Recovery.Supplement.HubReduction.correctFix 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.