Expanding a polynomial test combination inside a finite pairing
ProvedWikipedia.SzemeredisTheorem.finitePairing_polynomial_eval_finiteTestCombinationadditive-combinatoricsgreen-tao-port-8822number-theory
For finite types , real , polynomial , tests , and coefficients , the pairing of with evaluated on their finite test combination equals the sum over in the support of and maps of .
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_DenseModel import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_PolynomialApproximation import Mathlib.Algebra.BigOperators.Expect import Mathlib.Analysis.LocallyConvex.Separation import Mathlib.Data.Fintype.Card import Mathlib.Tactic import Mathlib.Topology.ContinuousMap.Weierstrass set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Polynomial approximation in the finite dense-model argument This file formalizes the polynomial part of the dense-model theorem. A normalized linear combination of `[0,1]`-valued tests takes values in `[-1,1]`. Weierstrass therefore approximates its positive part by a fixed real polynomial. Expanding that polynomial reduces correlation with the majorant to correlations with finite products of the original tests. The resulting estimates are quantitative and finite. In particular, the degree and coefficient loss of the approximating polynomial remain visible; no asymptotic assertion about a particular pseudorandom majorant is hidden here. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators Polynomial /-! ## Finite products and polynomial expansions -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.finitePairing_polynomial_eval_finiteTestCombination
{Ω τ : Type*} [Fintype Ω] [Fintype τ]
(f : Ω → ℝ) (p : ℝ[X])
(q : τ → Ω → ℝ) (c : τ → ℝ) :
finitePairing f
(fun x => p.eval (finiteTestCombination q c x)) =
∑ n ∈ p.support,
∑ s : Fin n → τ,
(p.coeff n * ∏ i, c (s i)) *
finitePairing f (testMonomial q s) := by sorry
Source