Generalized convolution of constant-one cut tests
ProvedWikipedia.SzemeredisTheorem.generalizedConvolution_one_succadditive-combinatoricsgreen-tao-port-8822number-theory
Let be a finite abelian group, let be an integer, and let . Consider the family of cut tests on , each identically equal to . Their generalized convolution is also identically equal to :
This includes the boundary case .
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_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutDiscrepancy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_GeneralizedConvolution import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.BigOperators.Fin import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Fintype.Card import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Generalized convolutions on finite additive groups For positive arity, the generalized convolution is the normalized average of a weight over a fiber of the coordinate-sum map. At arity zero the sum map has only the value zero, so the fiber density is a scaled delta function. Keeping this scaling makes the pairing identity valid without an arity exception; the `[0,1]` range statement is correctly restricted to positive arity. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
@[simp]
theorem Wikipedia.SzemeredisTheorem.generalizedConvolution_one_succ
{G : Type*} [Fintype G] [AddCommGroup G]
(n : ℕ) (z : G) :
generalizedConvolution (n + 1)
(fun _ : Fin (n + 1) => fun _ : Fin n → G => (1 : ℝ)) z = 1 := by sorry
Source