Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

ER Theorem 4.1 with the pigeonhole bound: ∣A∣≥ρ(k)−1|A| \ge \rho(k) - 1∣A∣≥ρ(k)−1 implies sdeg⁡(A^)≥k+1\operatorname{sdeg}(\hat A) \ge k + 1sdeg(A^)≥k+1

Proved
ClassicalSchur.le_sdeg_blockSums

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

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

This is Theorem 4.1 of Eliahou and Revuelta for sequences of natural numbers, with the pigeonhole bound ρ(k)\rho(k)ρ(k) in place of the Ramsey number Rk(3)R_k(3)Rk​(3).

Let k∈Nk \in \mathbb{N}k∈N, let ρ(0)=2\rho(0) = 2ρ(0)=2 and ρ(k+1)=(k+1)(ρ(k)−1)+2\rho(k+1) = (k+1)(\rho(k) - 1) + 2ρ(k+1)=(k+1)(ρ(k)−1)+2, and let AAA be a finite sequence of natural numbers with ρ(k)≤∣A∣+1\rho(k) \le |A| + 1ρ(k)≤∣A∣+1, that is, ∣A∣≥ρ(k)−1|A| \ge \rho(k) - 1∣A∣≥ρ(k)−1. Let A^\hat AA^ be the set of block sums of AAA, and let sdeg⁡(A^)\operatorname{sdeg}(\hat A)sdeg(A^) be the least n≥1n \ge 1n≥1 such that A^\hat AA^ is covered by nnn sumfree sets (∞\infty∞ if there is none). Then

sdeg⁡(A^)≥k+1.\operatorname{sdeg}(\hat A) \ge k + 1 .sdeg(A^)≥k+1.

At k=3k = 3k=3, where ρ(3)=17=R3(3)\rho(3) = 17 = R_3(3)ρ(3)=17=R3​(3), it gives, for sequences of natural numbers, the case of Corollary 4.2 of the paper that every sequence of length at least 161616 has sdeg⁡(A^)≥4\operatorname{sdeg}(\hat A) \ge 4sdeg(A^)≥4. It gives the property P4(16)P_4(16)P4​(16), and so the upper bound L(4)≤16L(4) \le 16L(4)≤16 of the goal. The lemma also shows that the set defining L(n)L(n)L(n) is nonempty for every n≥1n \ge 1n≥1, and it is the source of the upper bound L(k+1)≤ρ(k)−1L(k+1) \le \rho(k) - 1L(k+1)≤ρ(k)−1.

Formalization Note The paper states Theorem 4.1 for sequences in an arbitrary abelian group, with Rk(3)R_k(3)Rk​(3); the Lean statement is for sequences in N\mathbb{N}N (entries not required to be positive), with ρ(k)≥Rk(3)\rho(k) \ge R_k(3)ρ(k)≥Rk​(3) in place of Rk(3)R_k(3)Rk​(3). The inequality is taken in the extended naturals N∪{∞}\mathbb{N} \cup \{\infty\}N∪{∞}.

Preamble
import Definitions.Def_ClassicalSchurBasic
import Definitions.Def_ClassicalSchurRamsey
import Mathlib

open ClassicalSchur

Formal statement
theorem ClassicalSchur.le_sdeg_blockSums {k : ℕ} {A : List ℕ} (hA : ramseyBound k ≤ A.length + 1) :
    ((k + 1 : ℕ) : ℕ∞) ≤ sdeg (blockSums A) := by sorry
Source
S. Eliahou and M. P. Revuelta, "The Schur degree of additive sets", Discrete Math. 344(5) (2021) 112332, https://doi.org/10.1016/j.disc.2021.112332 (preprint arXiv:2006.01502), Theorem 4.1 (|A| ≥ R_n(3) − 1 implies sdeg(Â) ≥ n + 1) and Corollary 4.2. A. McKenna, "The Schur degree of block sums: L(4) = 16 and L(5) ≥ 49", Zenodo (2026), https://doi.org/10.5281/zenodo.22987189, §2 (Theorem 4.1 as quoted), §3 (proof of Theorem 1.1, the upper bound) and §7. Lean source: https://github.com/mysticflounder/schur-degree-block-sums/blob/v1.0.1/lean/ClassicalSchur/Ramsey.lean#L129-L133 (release v1.0.1, doi:10.5281/zenodo.22987688).
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mysticflounder · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me