A Schur colouring of with colours gives a cover of by sumfree sets
ProvedClassicalSchur.coveredBySumFree_of_schurColoringThis is one direction of the passage between Schur colourings and covers by sumfree sets.
Let , and let be a colouring with colours that is a Schur colouring of : there are no with and , the case included. A set is sumfree if for all , again with allowed. Then is covered by sumfree sets:
Together with the converse bridge ClassicalSchur.exists_schurColoring_of_coveredBySumFree, this lets the mission move between the colouring form SchurColoring, used by the frontier theorems, and the cover form CoveredBySumFree, used by the centred bound. For example, under the centred bound excludes a cover of by sumfree sets, and through this theorem it excludes a Schur colouring of that interval with colours.
Formalization Note. The conclusion is CoveredBySumFree (Set.Icc 1 N) n: there are sets of naturals, indexed by Fin n, each sumfree in , whose union contains . The sets need not be disjoint and need not lie in . The colouring is a function on all of , and only its values on are constrained. For there is no function , so the statement is vacuous there; for the interval is empty.
import Definitions.Def_ClassicalSchurBasic import Definitions.Def_ClassicalSchurColoring import Mathlib open ClassicalSchur open Finset
theorem ClassicalSchur.coveredBySumFree_of_schurColoring {n N : ℕ} {c : ℕ → Fin n}
(hc : SchurColoring N c) : CoveredBySumFree (Set.Icc 1 N) n := by sorry