Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A cover of Zm1×Zm2∖{0}\mathbb{Z}_{m_1} \times \mathbb{Z}_{m_2} \setminus \{0\}Zm1​​×Zm2​​∖{0} by qqq sets sumfree in the group lifts to a cover of A^\hat AA^ by qqq sumfree sets

Proved
ClassicalSchur.coveredBySumFree_liftSeq

by mysticflounder · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricscombinatoricsramsey-theoryschur-degree-block-sumssum-free-sets

This lemma transfers a cover of a finite abelian group by sumfree sets to a cover of a block-sum set of integers. It is the cover part of Lemma 3 of the note.

Let m1,m2≥1m_1, m_2 \ge 1m1​,m2​≥1 and qqq be natural numbers, let G=Zm1×Zm2G = \mathbb{Z}_{m_1} \times \mathbb{Z}_{m_2}G=Zm1​​×Zm2​​, and let M≥3m1−2M \ge 3m_1 - 2M≥3m1​−2. Let AAA be the lifted sequence of the Lift bundle, that is, the sequence of successive jumps of the grid X={u+Mj:0≤u≤m1−1, 0≤j≤m2−1}X = \{u + Mj : 0 \le u \le m_1 - 1,\ 0 \le j \le m_2 - 1\}X={u+Mj:0≤u≤m1​−1, 0≤j≤m2​−1}, and let A^\hat AA^ be its set of block sums. Suppose that C1,…,Cq⊆GC_1, \dots, C_q \subseteq GC1​,…,Cq​⊆G are sumfree in GGG (x+y∉Cix + y \notin C_ix+y∈/Ci​ for all x,y∈Cix, y \in C_ix,y∈Ci​, including x=yx = yx=y) and that every nonzero element of GGG lies in at least one CiC_iCi​. Then A^\hat AA^ is covered by qqq sumfree sets of natural numbers:

A^⊆C1′∪⋯∪Cq′for some sumfree sets C1′,…,Cq′⊆N.\hat A \subseteq C'_1 \cup \dots \cup C'_q \qquad \text{for some sumfree sets } C'_1, \dots, C'_q \subseteq \mathbb{N}.A^⊆C1′​∪⋯∪Cq′​for some sumfree sets C1′​,…,Cq′​⊆N.

This is the step from the group to the integers. It gives the Schur-degree bound sdeg⁡(A^)≤q\operatorname{sdeg}(\hat A) \le qsdeg(A^)≤q of the lift lemma, and it is used in the lower bound L(n)≥m1m2L(n) \ge m_1 m_2L(n)≥m1​m2​.

Formalization Note The note assumes that C1,…,CqC_1, \dots, C_qC1​,…,Cq​ partition G∖{0}G \setminus \{0\}G∖{0}; the Lean statement only asks that they cover the nonzero elements, which is a weaker hypothesis (a set that is sumfree in GGG cannot contain 000). The case q=0q = 0q=0 is allowed.

Preamble
import Definitions.Def_ClassicalSchurBasic
import Definitions.Def_ClassicalSchurLift
import Mathlib

open ClassicalSchur

Formal statement
theorem ClassicalSchur.coveredBySumFree_liftSeq {m₁ m₂ q M : ℕ} (hm₁ : 0 < m₁) (hm₂ : 0 < m₂)
    (hM : 3 * m₁ - 2 ≤ M) (C : Fin q → Set (ZMod m₁ × ZMod m₂))
    (hC : ∀ i, GroupSumFree (C i)) (hcov : ∀ g : ZMod m₁ × ZMod m₂, g ≠ 0 → ∃ i, g ∈ C i) :
    CoveredBySumFree (blockSums (liftSeq m₁ m₂ M)) q := by sorry
Source
A. McKenna, "The Schur degree of block sums: L(4) = 16 and L(5) ≥ 49", Zenodo (2026), https://doi.org/10.5281/zenodo.22987189, §4, Lemma 4.1 (the sumfree q-colouring of Â). Lean source: https://github.com/mysticflounder/schur-degree-block-sums/blob/v1.0.1/lean/ClassicalSchur/Lift.lean#L90-L172 (release v1.0.1, doi:10.5281/zenodo.22987688).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me