Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

L(4)=16L(4) = 16L(4)=16 for the number L(n)L(n)L(n) of Eliahou and Revuelta

Proved
ClassicalSchur.erL_four

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

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

This is the goal of the mission: the exact value of L(4)L(4)L(4).

A set of natural numbers is sumfree if it contains no x,y,zx, y, zx,y,z with x+y=zx + y = zx+y=z (x=yx = yx=y allowed). For a finite sequence A=(a1,…,aN)A = (a_1, \dots, a_N)A=(a1​,…,aN​) of positive integers, let A^={ai+⋯+aj:1≤i≤j≤N}\hat A = \{a_i + \dots + a_j : 1 \le i \le j \le N\}A^={ai​+⋯+aj​:1≤i≤j≤N} be its set of block sums, μ(A)=(a1+⋯+aN)/N\mu(A) = (a_1 + \dots + a_N)/Nμ(A)=(a1​+⋯+aN​)/N its average, and sdeg⁡(A^)\operatorname{sdeg}(\hat A)sdeg(A^) the least n≥1n \ge 1n≥1 such that A^\hat AA^ is covered by nnn sumfree sets. For n≥2n \ge 2n≥2, Eliahou and Revuelta define L(n)L(n)L(n) as the least positive integer LLL such that every sequence AAA of positive integers with ∣A∣=L|A| = L∣A∣=L and μ(A)≤n\mu(A) \le nμ(A)≤n satisfies sdeg⁡(A^)≥n\operatorname{sdeg}(\hat A) \ge nsdeg(A^)≥n. Then

L(4)=16.L(4) = 16 .L(4)=16.

Eliahou and Revuelta prove S(n−1)+1≤L(n)≤Rn−1(3)−1S(n-1) + 1 \le L(n) \le R_{n-1}(3) - 1S(n−1)+1≤L(n)≤Rn−1​(3)−1 (Proposition 5.3), which gives 14≤L(4)≤1614 \le L(4) \le 1614≤L(4)≤16 from the Schur number S(3)=13S(3) = 13S(3)=13 and the Ramsey number R3(3)=17R_3(3) = 17R3​(3)=17. They conjecture L(n)=S(n−1)+1L(n) = S(n-1) + 1L(n)=S(n−1)+1 for all n≥2n \ge 2n≥2 (Conjecture 5.6), which at n=4n = 4n=4 states L(4)=14L(4) = 14L(4)=14. The value 161616 shows that Conjecture 5.6 does not hold at n=4n = 4n=4, and that at n=4n = 4n=4 the upper bound of Proposition 5.3 is attained.

Formalization Note L(4)L(4)L(4) is erL 4 of the Basic bundle, with the ambient set N\mathbb{N}N and the Schur degree in the extended naturals. The defining set is nonempty for n=4n = 4n=4, so erL 4 is its least element.

Preamble
import Definitions.Def_ClassicalSchurBasic
import Definitions.Def_ClassicalSchurRamsey
import Mathlib

open ClassicalSchur

Formal statement
theorem ClassicalSchur.erL_four : erL 4 = 16 := 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), Definition 5.1 (the number L(n)); §5.1 (Proposition 5.3 implies 14 ≤ L(4) ≤ 16, and the conjecture L(4) = 14) and Conjecture 5.6. A. McKenna, "The Schur degree of block sums: L(4) = 16 and L(5) ≥ 49", Zenodo (2026), https://doi.org/10.5281/zenodo.22987189, Theorem 1.1 (proof in §3). Lean source: https://github.com/mysticflounder/schur-degree-block-sums/blob/v1.0.1/lean/ClassicalSchur/Values.lean#L77-L82 (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