A deleted tuple and its full coordinate sum determine the original tuple
ProvedWikipedia.SzemeredisTheorem.eq_of_deletedVectorToFinTuple_eq_of_sum_eqadditive-combinatoricsgreen-tao-port-8822number-theory
In any additive commutative group, two tuples of length are equal if their coordinate sums are equal and their canonical deleted-coordinate tuples are equal at the same omitted index. The formal statement permits two omitted indices supplied together with an equality between them. Finiteness of the group is not assumed.
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.eq_of_deletedVectorToFinTuple_eq_of_sum_eq
{G : Type*} [AddCommGroup G] {n : ℕ}
{x y : Fin (n + 1) → G}
{j l : Fin (n + 1)}
(hjl : j = l)
(hdeleted :
deletedVectorToFinTuple j (deleteCoordinate x j) =
deletedVectorToFinTuple l (deleteCoordinate y l))
(hsum : (∑ i, x i) = ∑ i, y i) :
x = y := by sorry
Source