Zero second differences make a finite integer sequence segment affine
ProvedWikipedia.SzemeredisTheorem.eq_affine_of_secondDifference_zeroadditive-combinatoricsgreen-tao-port-8822number-theory
Let and . If whenever , then for every ,
No lower bound on is needed.
Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/ import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_Count import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_ShortInterval import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Data.Fintype.Card import Mathlib.Data.Int.ModEq import Mathlib.Data.ZMod.Basic import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Unwrapping cyclic progressions in a short interval A progression obtained by transference lives in `ZMod N`. The prime weight is supported on an interval much shorter than a full residue system. In that situation the standard representatives have second difference zero over the integers, so they form an ordinary integer progression. -/ open Wikipedia.SzemeredisTheorem
Formal statement
theorem Wikipedia.SzemeredisTheorem.eq_affine_of_secondDifference_zero
(z : ℕ → ℤ) (k : ℕ)
(hsecond :
∀ j : ℕ, j + 2 < k →
z (j + 2) - 2 * z (j + 1) + z j = 0) :
∀ j : ℕ, j < k →
z j = z 0 + (j : ℤ) * (z 1 - z 0) := by sorry
Source