One Cauchy–Schwarz step pairs the head coordinate of a cut form
ProvedWikipedia.SzemeredisTheorem.coordinateCutForm_sq_le_paired_meanadditive-combinatoricsgreen-tao-port-8822number-theory
For a nonempty finite type , a real function of coordinates, and an absolutely bounded cut-test family ,
Here , and is the paired tail cut obtained by multiplying the two corresponding remaining deleted-coordinate factors.
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_Transference_BoxNorm import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutDiscrepancy 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 /-! # Finite box moments and generalized von Neumann This file packages the iterated Cauchy--Schwarz argument for a function on a finite product. A coordinate cut form pairs the function with one bounded factor for every deleted coordinate. Its `2 ^ n`-th power is bounded by the recursive `n`-dimensional box moment. The recursive definition duplicates one coordinate at a time. It is definitionally aligned with the Cauchy--Schwarz proof and is equivalent to the usual average of the product over all vertices of an `n`-cube. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
theorem Wikipedia.SzemeredisTheorem.coordinateCutForm_sq_le_paired_mean
{G : Type*} [Fintype G] [Nonempty G] {n : ℕ}
(F : (Fin (n + 1) → G) → ℝ)
(u : CutTestFamily G (n + 1))
(hu : IsAbsBoundedCutTest u) :
coordinateCutForm (n + 1) F u ^ 2 ≤
mean fun p : G × G =>
coordinateCutForm n
(pairedTupleFunction F p) (pairedTailCut u p) := by sorry
Source