Short-interval cyclic representatives have zero integer second differences
ProvedWikipedia.SzemeredisTheorem.cyclicAPVal_secondDifference_eq_zeroadditive-combinatoricsgreen-tao-port-8822number-theory
Let and suppose the standard representatives of the first terms of a cyclic progression all lie in an integer interval with . For every with ,
as an integer equality. The cyclic difference may be zero.
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.cyclicAPVal_secondDifference_eq_zero {k N : ℕ} [NeZero N]
(a d : ZMod N) (L U : ℤ)
(hmem :
∀ i : ℕ, i < k →
L ≤ cyclicAPVal a d i ∧ cyclicAPVal a d i ≤ U)
(hwidth : 2 * (U - L) < (N : ℤ))
(j : ℕ) (hj : j + 2 < k) :
(cyclicAPVal a d (j + 2) : ℤ) -
2 * cyclicAPVal a d (j + 1) +
cyclicAPVal a d j = 0 := by sorry
Source