Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6 — merge-and-split inequality

Proved
StableMSR.Recovery.merge_split_inequality

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

clusteringp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1perturbation-stabilitysum-of-radii

Let O\mathcal OO be the optimum of a γ\gammaγ-stable instance, with ε=γ−1>0\varepsilon=\gamma-1>0ε=γ−1>0. Let D1,…,DsD_1,\ldots,D_sD1​,…,Ds​ be distinct optimal clusters, s≥2s\ge2s≥2, and let C1,…,Cs−1C_1,\ldots,C_{s-1}C1​,…,Cs−1​ be distinct nonsingleton optimal clusters outside that family. Then

r ⁣(⋃j=1sDj)>∑j=1sr(Dj)+ε∑i=1s−1r(Ci).r\!\left(\bigcup_{j=1}^sD_j\right)>\sum_{j=1}^sr(D_j)+\varepsilon\sum_{i=1}^{s-1}r(C_i).r(j=1⋃s​Dj​)>j=1∑s​r(Dj​)+εi=1∑s−1​r(Ci​).

The inequality is strict and has no locality assumption on the cluster families. It links local merging costs to splitting savings elsewhere in the instance.

Differences from the source:

  • encoding: An arbitrary finite real metric space with fixed input order and unordered clusters → Points are Fin n; clusters and unordered partitions are finite sets; metric arrays are Mathlib metric distances; reason: Relabelling preserves every finite ordered instance, all distance values, and every unordered partition
  • encoding: Distinct indexed cluster families → Finite sets of clusters with disjointness and exact cardinality relations; reason: Only distinct clusters are used, and the inequalities and union are invariant under reindexing
Preamble
import Definitions.Def_StableMSR_Recovery_Geometry

set_option autoImplicit false
open scoped Classical
Formal statement
namespace StableMSR.Recovery

theorem merge_split_inequality {n : ℕ} (d : Point n → Point n → ℝ) (hd : IsMetricArray d)
    (k : ℕ) (hk : 1 ≤ k ∧ k ≤ n) (γ : ℝ) (hγ : 1 < γ)
    (O : Partition n) (hO : Stable d k γ O)
    (D F : Partition n) (hD : D ⊆ O) (hF : F ⊆ O)
    (hdisj : Disjoint D F) (hsize : 2 ≤ D.card) (hcount : F.card + 1 = D.card)
    (hnonsingleton : ∀ C ∈ F, 2 ≤ C.card) :
    cost d D + (γ - 1) * cost d F < radius d (D.biUnion id) := by sorry

end StableMSR.Recovery
Source
Shyam Ravichandran, Lev Reyzin, STOC 2027 submission #1010 (October 2026), Lemma 3.6, p. 6; PDF SHA256 8bb34b0b6d31458fe6fc0848c1fc82a6083f3e9ae672e748d24cf82d5289e53e
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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