Lift lemma: a sumfree -cover of gives a positive sequence of length with
ProvedClassicalSchur.lift_lemmaThis is Lemma 3 of the note: a lift from the finite abelian group to sequences of positive integers.
Let be natural numbers, let , and let . Suppose that are sumfree in ( for all , including ) and that every nonzero element of lies in at least one . Let be the lifted sequence of the Lift bundle, that is, the sequence of successive jumps of the grid . Let be the set of block sums of , and the Schur degree. Then
and in full the statement has four parts:
- has length ;
- every entry of is positive;
- ;
- for every with , the first entries of have sum .
The lemma turns a cover of by sets sumfree in into a sequence for the property of Definition 5.1 of Eliahou and Revuelta: with , part 4 bounds the average of every nonempty prefix of by , and part 3 bounds the Schur degree of its block sums. These are the facts behind the lower bound (Corollary 4 of the note).
Formalization Note The Lean statement differs from the note in three places. (1) The note assumes that the partition ; here they only need to cover the nonzero elements, a weaker hypothesis. (2) The note bounds the prefix sums by for ; part 4 gives their exact value, which implies that bound, and it includes . (3) Part 2 is implicit in the note, where is the jump sequence of a set. The hypothesis is also in the note: for the statement fails at , where is empty, and .
import Definitions.Def_ClassicalSchurBasic import Definitions.Def_ClassicalSchurLift import Mathlib open ClassicalSchur
theorem ClassicalSchur.lift_lemma {m₁ m₂ q M : ℕ} (hm₁ : 0 < m₁) (hm₂ : 0 < m₂) (hq : 0 < q)
(hM : 3 * m₁ - 2 ≤ M) (C : Fin q → Set (ZMod m₁ × ZMod m₂))
(hC : ∀ i, GroupSumFree (C i)) (hcov : ∀ g : ZMod m₁ × ZMod m₂, g ≠ 0 → ∃ i, g ∈ C i) :
(liftSeq m₁ m₂ M).length = m₁ * m₂ - 1 ∧ (∀ a ∈ liftSeq m₁ m₂ M, 0 < a) ∧
sdeg (blockSums (liftSeq m₁ m₂ M)) ≤ q ∧
∀ L ≤ m₁ * m₂ - 1, ((liftSeq m₁ m₂ M).take L).sum = L % m₁ + M * (L / m₁) := by sorryConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.