Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Euclidean linear-in-k inverse-square-error boundary bound

Proved
TightCoreset2027.Euclidean.baseline_coreset_lower_bound

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

clusteringcomputational-geometrycoresets

For each fixed real z≥1z\ge1z≥1, there is a constant cz>0c_z>0cz​>0 such that, for every integer k≥1k\ge1k≥1 and every 0<ε<10<\varepsilon<10<ε<1, a finite dataset in some positive Euclidean dimension forces every strong subset coreset with arbitrary nonnegative weights to satisfy

∣S∣≥czkε−2.|S|\ge c_z k\varepsilon^{-2}.∣S∣≥cz​kε−2.

For errors below one half this is the subset, zero-offset specialization of CALSS22 Theorem11. The remaining error range is covered by the kkk-point argument used in §2.3 and §2.5 of the mission source. This boundary result supplies parameter regimes in which rounding prevents use of the multi-level construction.

Preamble
import Definitions.Def_TightCoreset2027_Euclidean_generalPowers
open scoped BigOperators
set_option autoImplicit false
Formal statement
namespace TightCoreset2027.Euclidean
 theorem baseline_coreset_lower_bound (z : ℝ) (hz : 1 ≤ z) :
    ∃ c : ℝ, 0 < c ∧ ∀ k : ℕ, 1 ≤ k → ∀ ε : ℝ, 0 < ε → ε < 1 →
      ∃ d : ℕ, 1 ≤ d ∧ ∃ X : Finset (Point d),
        ∀ (S : Finset (Point d)) (w : Point d → NNReal),
          IsStrongCoreset z ε k X S w →
            c * (k : ℝ) * Real.rpow ε (-2) ≤ (S.card : ℝ) := by sorry
end TightCoreset2027.Euclidean
Source
Cohen-Addad–Larsen–Saulpic–Schwiegelshohn, Towards Optimal Lower Bounds for k-median and k-means Coresets, arXiv:2202.12793, Theorem11 (Euclidean lower bound); https://cs.au.dk/~larsen/papers/CoreSetKMeans.pdf . Used by Hu–Huang–Li–Xu, STOC2027 submission879, §2.3 printed p.16 and §2.5 printed p.20, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/879.pdf

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