Cauchy–Schwarz eliminates a bounded outer factor
ProvedWikipedia.SzemeredisTheorem.cauchySchwarz_eliminate_outer_factoradditive-combinatoricsgreen-tao-port-8822number-theory
Let be a nonempty finite type and a finite type. For real functions and with ,
No sign condition on or nonemptiness condition on is required.
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 Mathlib.Algebra.BigOperators.Expect import Mathlib.Data.Fintype.Card import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Finite Cauchy--Schwarz elimination This file records the normalized finite Cauchy--Schwarz step used in iterated linear-forms arguments. A bounded factor depending only on the outer variables can be removed after squaring, at the cost of duplicating the inner variable. -/ open Wikipedia.SzemeredisTheorem
Formal statement
theorem Wikipedia.SzemeredisTheorem.cauchySchwarz_eliminate_outer_factor
{X Y : Type*} [Fintype X] [Nonempty X] [Fintype Y]
(u : X → ℝ) (F : X → Y → ℝ)
(hu : ∀ x, |u x| ≤ 1) :
mean₂ (fun x y => u x * F x y) ^ 2 ≤
mean₂ (fun x => fun p : Y × Y =>
F x p.1 * F x p.2) := by sorry
Source