Telescoping normalized simplex counts
ProvedWikipedia.SzemeredisTheorem.simplexCount_sub_eq_sum_mixedCorrelationadditive-combinatoricsgreen-tao-port-8822number-theory
Let be finite types indexed by and let be weighted simplex systems on them. The difference equals the sum over all distinguished coordinates of the mixed simplex correlations of at .
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_Simplex import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_SimplexTelescoping import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Data.Fintype.Card import Mathlib.Data.ZMod.Basic import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Edge-by-edge telescoping for weighted simplex counts The relative counting lemma compares two products by replacing one edge at a time. This file isolates that exact finite algebra. No boundedness is required: all analytic work is reduced to bounding one mixed correlation for each edge colour. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
theorem Wikipedia.SzemeredisTheorem.simplexCount_sub_eq_sum_mixedCorrelation
{k : ℕ} {V : Fin k → Type*}
[∀ i, Fintype (V i)]
(H G : WeightedSimplexSystem V) :
H.simplexCount - G.simplexCount =
∑ j : Fin k, mixedSimplexCorrelation H G j := by sorry
Source