A count exceeding the diagonal bound has positive off-diagonal mass
ProvedWikipedia.SzemeredisTheorem.cyclicAPOffDiagMass_pos_of_countadditive-combinatoricsgreen-tao-port-8822number-theory
Let , , and on . If
then the unnormalized -term progression mass with nonzero common difference is strictly positive.
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_CountExtraction 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.ZMod.Basic import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Extracting an off-diagonal cyclic progression For extraction it is convenient to use unnormalized finite masses. In particular, summing over the filtered finset of nonzero differences avoids introducing a type of nonzero residues, which would be empty when `N = 1`, and avoids dividing by `N - 1`. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
theorem Wikipedia.SzemeredisTheorem.cyclicAPOffDiagMass_pos_of_count
{k N : ℕ} [NeZero N] {f : ZMod N → ℝ} {B : ℝ}
(hk : 1 ≤ k)
(hf0 : ∀ x, 0 ≤ f x)
(hfB : ∀ x, f x ≤ B)
(hcount :
B ^ (k - 1) * mean f <
(N : ℝ) * cyclicAPCount k N f) :
0 < cyclicAPOffDiagMass k N f := by sorry
Source