A simplex cover has at least as many slots as diagonal AP parameters
ProvedWikipedia.SzemeredisTheorem.card_diagonalAPParameter_le_deletionCountadditive-combinatoricsgreen-tao-port-8822number-theory
For a positive modulus , a natural , and a finite cyclic set , suppose a family of deleted coloured faces meets every labelled simplex of the -colour AP hypergraph of . Then
The left side counts the diagonal AP parameters: a member of together with the free simplex coordinates. No primality or coefficient-coprimality assumption 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_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_APRemoval import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_ConditionalAverage import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Energy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_FacePartition import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Removal import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Simplex import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Unweighted import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Szemeredi_Weighted 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 Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.Order.BigOperators.Expect import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Finset.Max import Mathlib.Data.Fintype.Card import Mathlib.Data.Int.Lemmas import Mathlib.Data.ZMod.Basic import Mathlib.Data.ZMod.Units import Mathlib.Order.Partition.Finpartition import Mathlib.RingTheory.Int.Basic import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # From partite simplex removal to dense arithmetic progressions For a finite set `A ⊆ ZMod N`, its arithmetic-progression hypergraph has one edge of colour `j` whenever the `j`th AP form belongs to `A`. The degenerate progressions of common difference zero give a large, edge-disjoint family of labelled simplices. Consequently every simplex cover has normalized deletion cost at least `mean (1_A) / k`. This is the elementary half of the standard deduction of dense Szemerédi from the partite simplex-removal lemma. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
theorem Wikipedia.SzemeredisTheorem.card_diagonalAPParameter_le_deletionCount
(r N : ℕ) [NeZero N] (A : Finset (ZMod N))
(deleted :
SimplexHypergraph.DeletionFamily
(fun _ : Fin (r + 2) => ZMod N))
(hcover :
(apSetHypergraph (r + 2) N A).IsSimplexCover deleted) :
Fintype.card (DiagonalAPParameter r N A) ≤
SimplexHypergraph.deletionCount deleted := by sorry
Source