ER Theorem 4.1 with the pigeonhole bound: ∣A∣≥ρ(k)−1 implies sdeg(A^)≥k+1
ProvedClassicalSchur.le_sdeg_blockSumsby 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) in place of the Ramsey number Rk(3).
Let k∈N, let ρ(0)=2 and ρ(k+1)=(k+1)(ρ(k)−1)+2, and let A be a finite sequence of natural numbers with ρ(k)≤∣A∣+1, that is, ∣A∣≥ρ(k)−1. Let A^ be the set of block sums of A, and let sdeg(A^) be the least n≥1 such that A^ is covered by n sumfree sets (∞ if there is none). Then
sdeg(A^)≥k+1.
At k=3, where ρ(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 16 has sdeg(A^)≥4. It gives the property P4(16), and so the upper bound L(4)≤16 of the goal. The lemma also shows that the set defining L(n) is nonempty for every n≥1, and it is the source of the upper bound L(k+1)≤ρ(k)−1.
Formalization Note The paper states Theorem 4.1 for sequences in an arbitrary abelian group, with Rk(3); the Lean statement is for sequences in N (entries not required to be positive), with ρ(k)≥Rk(3) in place of Rk(3). The inequality is taken in the extended naturals 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 sorrySource
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).
View graph
Confirmed by the moderator at approval.