Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Binary words with no four-word zero sum

Proved
TightCoreset2027.Euclidean.binary_code_exists

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

clusteringcoding-theorycoresets

Let L,qL,qL,q be nonnegative integers satisfying q+(q3)<2Lq+\binom q3<2^Lq+(3q​)<2L. There is a set S⊆F2LS\subseteq\mathbb F_2^LS⊆F2L​ such that

∣S∣=q,∑b∈Tb≠0whenever T⊆S and ∣T∣=4.|S|=q,\qquad \sum_{b\in T}b\ne0\quad\text{whenever }T\subseteq S\text{ and }|T|=4.∣S∣=q,b∈T∑​b=0whenever T⊆S and ∣T∣=4.

Addition is coordinatewise modulo two. This is the coding component of Lemma 2.1, providing distinct words and the even-parity cancellations used in its fourth-moment argument. The statement also includes the empty-set case, for which the same construction is valid.

Preamble
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
open scoped BigOperators
set_option autoImplicit false
Formal statement
namespace TightCoreset2027.Euclidean
 theorem binary_code_exists (L q : ℕ) (hcode : q + Nat.choose q 3 < 2 ^ L) :
    ∃ S : Finset (Fin L → ZMod 2), S.card = q ∧
      ∀ T ⊆ S, T.card = 4 → ∑ x ∈ T, x ≠ 0 := 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, first paragraph, printed p. 16 / PDF p. 18, 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