Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Realizing a binary code as a joint-discrepancy projection family

Proved
TightCoreset2027.Euclidean.projection_family_of_binary_code

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

clusteringcoresetsdiscrepancy

Let L,q≥1L,q\ge1L,q≥1, and let S⊆F2LS\subseteq\mathbb F_2^LS⊆F2L​ consist of qqq distinct binary words with no four distinct words summing to zero. There are distinct unit vectors x1,…,xq∈R2Lx_1,\ldots,x_q\in\mathbb R^{2L}x1​,…,xq​∈R2L and a nonempty finite set VVV of vectors of squared norm two. For each sss and v∈Vv\in Vv∈V, an integer ℓ(s;v)∈{0,…,L}\ell(s;v)\in\{0,\ldots,L\}ℓ(s;v)∈{0,…,L} satisfies

⟨xs,v⟩=1−2ℓ(s;v)L.\langle x_s,v\rangle=1-\frac{2\ell(s;v)}L.⟨xs​,v⟩=1−L2ℓ(s;v)​.

For every t≥1t\ge1t≥1 and every A(1),…,A(t)∈RqA^{(1)},\ldots,A^{(t)}\in\mathbb R^qA(1),…,A(t)∈Rq, one common direction satisfies

∑r=1t∣∑s=1qAs(r)(−1)ℓ(s;v)∣≥13∑r=1t∥A(r)∥2.\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.r=1∑t​​s=1∑q​As(r)​(−1)ℓ(s;v)​≥3​1​r=1∑t​∥A(r)∥2​.

This is the geometric and moment component of Lemma 2.1 after its initial code selection. The family depends only on the supplied code, before the coefficients are chosen.

Preamble
import Definitions.Def_TightCoreset2027_Euclidean_projectionModel
open scoped BigOperators
set_option autoImplicit false
Formal statement
namespace TightCoreset2027.Euclidean
 theorem projection_family_of_binary_code (L q : ℕ) (hL : 1 ≤ L) (hq : 1 ≤ q)
    (S : Finset (Fin L → ZMod 2)) (hS : S.card = q)
    (hfour : ∀ T ⊆ S, T.card = 4 → ∑ x ∈ T, x ≠ 0) :
    ∃ G : ProjectionFamily L q, ProjectionSpecification G := by sorry
end TightCoreset2027.Euclidean
Source
Hu–Huang–Li–Xu, Tight Coreset Bounds for (k,z)-Clustering in Euclidean and Doubling Metrics, STOC 2027 submission #879, §2.4, proof of Lemma 2.1 after the greedy construction, Eqs. (15)–(16), printed pp. 16–18 / PDF pp. 18–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