for the number of Eliahou and Revuelta
ProvedClassicalSchur.erL_five_boundsadditive-combinatoricscombinatoricsramsey-theoryschur-degree-block-sumssum-free-sets
This theorem bounds from both sides.
Let be the least positive integer such that every sequence of positive integers with and average has block sums of Schur degree (Definition 5.1 of Eliahou and Revuelta). Then
The statement has two parts:
- the lower bound ;
- the upper bound .
At , Proposition 5.3 of the paper gives , where is the Schur number, and Conjecture 5.6 states . The lower bound shows that Conjecture 5.6 does not hold at .
Formalization Note The note gives the upper bound from the known bound . The Lean statement has the weaker bound , from the pigeonhole bound of the Ramsey bundle, because the bound is not formalized here. 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.