Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1 — discrete projections and a discrepancy bound

Proved
TightCoreset2027.Euclidean.discrete_projections_discrepancy

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

clusteringcomputational-geometrycoresetsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let L,q≥1L,q\ge1L,q≥1 be integers such that 2L>q+(q3)2^L>q+\binom q32L>q+(3q​). There exist distinct unit vectors x1,…,xq∈R2Lx_1,\ldots,x_q\in\mathbb R^{2L}x1​,…,xq​∈R2L and a nonempty finite set V⊆R2LV\subseteq\mathbb R^{2L}V⊆R2L with ∥v∥2=2\|v\|^2=2∥v∥2=2 for every v∈Vv\in Vv∈V. Every projection has a level ℓ(s;v)∈{0,…,L}\ell(s;v)\in\{0,\ldots,L\}ℓ(s;v)∈{0,…,L} satisfying ⟨xs,v⟩=1−2ℓ(s;v)/L\langle x_s,v\rangle=1-2\ell(s;v)/L⟨xs​,v⟩=1−2ℓ(s;v)/L. For every integer t≥1t\ge1t≥1 and every fixed coefficient family A(r)∈RqA^{(r)}\in\mathbb R^qA(r)∈Rq,

max⁡v∈V∑r=1t∣∑s=1qAs(r)(−1)ℓ(s;v)∣≥13∑r=1t∥A(r)∥2.\max_{v\in V}\sum_{r=1}^t\left|\sum_{s=1}^q A_s^{(r)}(-1)^{\ell(s;v)}\right|\ge\frac1{\sqrt3}\sum_{r=1}^t\|A^{(r)}\|_2.v∈Vmax​r=1∑t​​s=1∑q​As(r)​(−1)ℓ(s;v)​≥3​1​r=1∑t​∥A(r)∥2​.

The vectors and directions are chosen before the coefficient family. This supplies both the finite projection grid and the common direction required by the error estimate.

Differences from the source:

  • encoding: distinct vectors, a finite direction set, and the induced level index → a raw ProjectionFamily satisfying all clauses of ProjectionSpecification; reason: the index is stored with its defining equality; positivity of L makes the grid injective
  • encoding: a lower bound on the maximum over V → there exists a direction in V attaining at least the displayed bound; reason: V is finite and nonempty, so the two statements are equivalent
  • encoding: indices starting at 1 and levels from 0 through L → Fin q, Fin t and Fin (L+1); reason: bijections preserve every vector, coefficient family, norm and sum
Preamble
import Definitions.Def_TightCoreset2027_Euclidean_projectionModel
set_option autoImplicit false
Formal statement
namespace TightCoreset2027.Euclidean

theorem discrete_projections_discrepancy (L q : ℕ) (hL : 1 ≤ L) (hq : 1 ≤ q)
    (hcode : q + Nat.choose q 3 < 2 ^ L) :
    ∃ G : ProjectionFamily L q, ProjectionSpecification G := by sorry

end TightCoreset2027.Euclidean
Source
Junqiu Hu, Lingxiao Huang, Jian Li, Baoduo Xu, STOC 2027 submission #879 (October 2026), Lemma 2.1, Eq. (3)–(4), printed p. 10 / PDF p. 12; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/879.pdf
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 9, 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