A linear-forms condition bounds powered cut correlations
ProvedWikipedia.SzemeredisTheorem.HasLinearFormsCondition.abs_cutCorrelation_pow_leadditive-combinatoricsgreen-tao-port-8822number-theory
Let and , let , and assume the -linear-forms condition with error . If is coprime to , every absolutely bounded arity- cut-test family 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_GreenTao_LinearForms_Condition import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Independence import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_BoxNorm import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_FaceMoments import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_StrongLinearForms import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_Count import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_APCorrespondence import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Simplex import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_APCut import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutDiscrepancy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutTransport import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_GeneralizedConvolution import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_SimplexTelescoping import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Order.BigOperators.Expect import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Algebra.Order.Chebyshev import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Fintype.Card import Mathlib.Data.Int.Lemmas import Mathlib.Data.ZMod.Basic import Mathlib.Data.ZMod.Units import Mathlib.RingTheory.Int.Basic import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Centered moments on one progression face The CFZ linear-forms condition controls every Boolean subproduct of the forms belonging to a fixed deleted coordinate. Inclusion--exclusion then bounds the product of all centered factors on that face. This is the linear-forms estimate that appears at the endpoint of the generalized von Neumann Cauchy--Schwarz argument. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
theorem Wikipedia.SzemeredisTheorem.HasLinearFormsCondition.abs_cutCorrelation_pow_le
{n N : ℕ} [NeZero N]
{ν : ZMod N → ℝ} {η : ℝ}
(h : HasLinearFormsCondition (n + 2) N ν η)
(hN : Nat.Coprime N (Nat.factorial (n + 1)))
(u : CutTestFamily (ZMod N) (n + 1))
(hu : IsAbsBoundedCutTest u) :
|cutCorrelation (n + 1) ν (fun _ => 1) u| ^
(2 ^ (n + 1)) ≤
(2 : ℝ) ^ (2 ^ (n + 1)) * η := by sorry
Source