A dense set-count bound gives a bounded-weight AP bound
ProvedWikipedia.SzemeredisTheorem.weightedAPCount_of_denseAPCountadditive-combinatoricsgreen-tao-port-8822number-theory
Let , , and suppose the dense AP-count property in length holds at density with count bound . Every function with mean at least then satisfies .
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_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Szemeredi_Weighted 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 /-! # From dense sets to bounded dense weights The hypergraph-removal layer will first produce a quantitative progression count for dense finite sets. This file proves the standard thresholding step that upgrades such a theorem to functions `g : ZMod N → [0,1]`. -/ open Wikipedia.SzemeredisTheorem
Formal statement
theorem Wikipedia.SzemeredisTheorem.weightedAPCount_of_denseAPCount
{k N : ℕ} [NeZero N] {δ c : ℝ}
(hδ0 : 0 ≤ δ)
(hdense : HasDenseAPCount k N (δ / 2) c)
{g : ZMod N → ℝ}
(hg0 : ∀ x, 0 ≤ g x)
(hg1 : ∀ x, g x ≤ 1)
(hmean : δ ≤ mean g) :
(δ / 2) ^ k * c ≤ cyclicAPCount k N g := by sorry
Source