Prefix sums of the lifted sequence: the first entries sum to
ProvedClassicalSchur.liftSeq_take_sumadditive-combinatoricscombinatoricsramsey-theoryschur-degree-block-sumssum-free-sets
This lemma computes the prefix sums of the lifted sequence exactly.
Let , and be natural numbers, and let for . Let be the lifted sequence of the Lift bundle, with ; it is the sequence of jumps of the grid . Then for every with , the sum of the first entries of is
For both sides are .
The formula identifies the prefix sums of with the elements of the grid . It is the fourth part of the lift lemma, and it gives the bound on the prefix averages of that the lower bound needs.
Formalization Note "The first entries" is List.take L, and is truncated subtraction on . There is no hypothesis on ; for only is allowed.
Preamble
import Definitions.Def_ClassicalSchurLift import Mathlib open ClassicalSchur
Formal statement
theorem ClassicalSchur.liftSeq_take_sum {m₁ m₂ M : ℕ} (hm₁ : 0 < m₁) (hM : m₁ ≤ M) {L : ℕ}
(hL : L ≤ m₁ * m₂ - 1) : ((liftSeq m₁ m₂ M).take L).sum = liftPrefix m₁ M L := by sorrySource
A. McKenna, "The Schur degree of block sums: L(4) = 16 and L(5) ≥ 49", Zenodo (2026), https://doi.org/10.5281/zenodo.22987189, §4, proof of Lemma 4.1 (the first L entries of A have sum x_L). Lean source: https://github.com/mysticflounder/schur-degree-block-sums/blob/v1.0.1/lean/ClassicalSchur/Lift.lean#L64-L77 (release v1.0.1, doi:10.5281/zenodo.22987688).