Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

49≤L(5)≤6549 \le L(5) \le 6549≤L(5)≤65 for the number L(n)L(n)L(n) of Eliahou and Revuelta

Proved
ClassicalSchur.erL_five_bounds

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

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

This theorem bounds L(5)L(5)L(5) from both sides.

Let L(n)L(n)L(n) be the least positive integer LLL such that every sequence AAA of positive integers with ∣A∣=L|A| = L∣A∣=L and average μ(A)≤n\mu(A) \le nμ(A)≤n has block sums A^\hat AA^ of Schur degree sdeg⁡(A^)≥n\operatorname{sdeg}(\hat A) \ge nsdeg(A^)≥n (Definition 5.1 of Eliahou and Revuelta). Then

49≤L(5)≤65.49 \le L(5) \le 65 .49≤L(5)≤65.

The statement has two parts:

  1. the lower bound 49≤L(5)49 \le L(5)49≤L(5);
  2. the upper bound L(5)≤65L(5) \le 65L(5)≤65.

At n=5n = 5n=5, Proposition 5.3 of the paper gives L(5)≥S(4)+1=45L(5) \ge S(4) + 1 = 45L(5)≥S(4)+1=45, where S(4)=44S(4) = 44S(4)=44 is the Schur number, and Conjecture 5.6 states L(5)=45L(5) = 45L(5)=45. The lower bound 494949 shows that Conjecture 5.6 does not hold at n=5n = 5n=5.

Formalization Note The note gives the upper bound L(5)≤R4(3)−1≤61L(5) \le R_4(3) - 1 \le 61L(5)≤R4​(3)−1≤61 from the known bound R4(3)≤62R_4(3) \le 62R4​(3)≤62. The Lean statement has the weaker bound 656565, from the pigeonhole bound ρ(4)=66\rho(4) = 66ρ(4)=66 of the Ramsey bundle, because the bound R4(3)≤62R_4(3) \le 62R4​(3)≤62 is not formalized here. L(5)L(5)L(5) is erL 5 of the Basic bundle.

Preamble
import Definitions.Def_ClassicalSchurBasic
import Definitions.Def_ClassicalSchurRamsey
import Definitions.Def_ClassicalSchurValues
import Mathlib

open ClassicalSchur

Formal statement
theorem ClassicalSchur.erL_five_bounds : 49 ≤ erL 5 ∧ erL 5 ≤ 65 := 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, Proposition 5.3 and Conjecture 5.6, at n = 5 (the case n = 5 of Conjecture 5.6 is stated in §5.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, Theorem 1.2 (proof in §5) and §7 (the formal upper bound 65). Lean source: https://github.com/mysticflounder/schur-degree-block-sums/blob/v1.0.1/lean/ClassicalSchur/Values.lean#L103-L111 (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