Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cost of the supplied partition and canonical competitor after hub inflation

Proved
StableMSR.Recovery.Supplement.hub_inflation_costs

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

In the hub-and-dummy construction for Proposition C.2, let R0R_0R0​ be the original hub-to-source distance and let DDD be the source diameter. Write aaa for the minimum cost of an exact-kkk partition of the source and δ\deltaδ for the dummy-to-dummy distance. Assume 1≤k≤n1\le k\le n1≤k≤n and δ≥0\delta\ge 0δ≥0. For any s≥R0≥Ds\ge R_0\ge Ds≥R0​≥D, replace all hub-to-source distances by sss in both directions.

The supplied partition then has cost sss. The source-plus-hub cluster has eccentricity sss at every center, and each dummy singleton has radius zero. A distinct exact-(k+2)(k+2)(k+2) partition has cost δ+a\delta+aδ+a. It consists of an optimal exact-kkk source partition, the hub singleton, and all k+1k+1k+1 dummy points together. Each of those clusters uses only unchanged distances.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_Hub

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

theorem hub_inflation_costs {n k : ℕ} (d : Point n → Point n → ℝ) (γ τ s : ℝ)
    (hk : 1 ≤ k) (hkn : k ≤ n) (hd : IsMetricArray d)
    (hD : diameter d Finset.univ ≤ hubRadius d γ τ)
    (hs : hubRadius d γ τ ≤ s) (hδ : 0 ≤ dummyDistance d γ τ) :
    let dp := hubDistance d k γ τ
    let p := fun (x y : Point (n + k + 2)) =>
      if (x.val = n ∧ y.val < n) ∨ (y.val = n ∧ x.val < n) then s else dp x y
    cost p (suppliedPartition n k) = s ∧
      ∃ Q, Feasible Finset.univ (k + 2) Q ∧ Q ≠ suppliedPartition n k ∧
        cost p Q = dummyDistance d γ τ + optimumValue d k := by sorry

end StableMSR.Recovery.Supplement
Source
Shyam Ravichandran, Lev Reyzin, STOC 2027 submission #1010 (October 2026), Proposition C.2, p. 25; PDF SHA256 8bb34b0b6d31458fe6fc0848c1fc82a6083f3e9ae672e748d24cf82d5289e53e

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