A Schur colouring of with six colours, so
ProvedClassicalSchur.schur_six_538combinatoricsschur-numbers
The integers have a colouring with six colours such that, for all positive integers and with , the integers , and do not all have one colour. The case is included. So is the union of six sum-free sets.
The Schur number is the largest such that is the union of sum-free sets. By this definition, the theorem gives . The formal statement does not define , so this last step is outside Lean.
In the formal statement the colouring is a function . Only its values on matter, and the statement does not require that each colour is used.
Formal statement
namespace ClassicalSchur theorem schur_six_538 : ∃ c : Nat → Fin 6, ∀ x y : Nat, 1 ≤ x → 1 ≤ y → x + y ≤ 538 → ¬ (c x = c y ∧ c y = c (x + y)) := by sorry end ClassicalSchur
Source
A. McKenna, "The sixth Schur number is at least 538", Zenodo preprint (2026), https://doi.org/10.5281/zenodo.23937655, Theorem 1. Also aiXiv 2611.00368, https://aixiv.online/abs/2611.00368. Lean source: https://github.com/mysticflounder/schur-538/blob/c3306693e01496162241bb7630ff2f19bd1482b7/lean/SchurSix538.lean (theorem schur_six_538).