Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A small common denominator preserving bounded comparisons of coordinate sums

Proved
StableMSR.Recovery.Supplement.short_sum_rational_representative

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

clusteringcomputational-complexityoptimization

Let xxx be a real vector with ddd coordinates and let H≥1H\ge1H≥1 be an integer. There is a vector z/Dz/Dz/D with a single nonzero integer denominator, with ∣D∣|D|∣D∣ and every ∣zi∣|z_i|∣zi​∣ at most d!(H2)dd!(H^2)^dd!(H2)d, which satisfies every weak comparison q+∑i∈sxi≤∑j∈txjq+\sum_{i\in s}x_i\le\sum_{j\in t}x_jq+∑i∈s​xi​≤∑j∈t​xj​ satisfied by xxx whenever s,ts,ts,t are lists of total length at most HHH and the reduced numerator and denominator of qqq are bounded in magnitude by HHH. Repetitions are allowed. This formulation of the small rational point argument in Lemma C.3 permits simultaneous preservation of equalities, metric triangle inequalities, and comparisons of sums of cluster radii.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace StableMSR.Recovery.Supplement

theorem short_sum_rational_representative {ι : Type} [Fintype ι] (x : ι → ℝ) (H : ℕ) (hH : 1 ≤ H) :
    ∃ (D : ℤ) (z : ι → ℤ), D ≠ 0 ∧
      D.natAbs ≤ (Fintype.card ι).factorial * (H ^ 2) ^ Fintype.card ι ∧
      (∀ i, (z i).natAbs ≤ (Fintype.card ι).factorial * (H ^ 2) ^ Fintype.card ι) ∧
      ∀ (s t : List ι) (q : ℚ), s.length + t.length ≤ H →
        q.num.natAbs ≤ H → q.den ≤ H →
        (q : ℝ) + (s.map x).sum ≤ (t.map x).sum →
        (q : ℝ) + (s.map (fun i => ((z i : ℝ) / D))).sum ≤
          (t.map (fun i => ((z i : ℝ) / D))).sum := by sorry

end StableMSR.Recovery.Supplement
Source
Shyam Ravichandran and Lev Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix C, Lemma C.3, pp. 25–26 (bounded rational polyhedron and determinant argument). https://arxiv.org/abs/2611.03547

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