Abstract

A famous theorem of Szemerédi asserts that given any density 0 < δ ≤ 1 and any integer k ≥ 3, any set of integers with density δ will contain infinitely many proper arithmetic progressions of length k. For general k there are essentially four known proofs of this fact; Szemerédi’s original combinatorial proof using the Szemerédi regularity lemma and van der Waerden’s theorem, Furstenberg’s proof using ergodic theory, Gowers ’ proof using Fourier analysis and the inverse theory of additive combinatorics, and the more recent proofs of Gowers and Rödl-Skokan using a hypergraph regularity lemma. Of these four, the ergodic theory proof is arguably the shortest, but also the least elementary, requiring passage (via the Furstenberg correspondence principle) to an infinitary measure preserving system, and then decomposing a general ergodic system relative to a tower of compact extensions. Here we present a quantitative, self-contained version of this ergodic theory proof, and which is “elementary ” in the sense that it does not require the axiom of choice, the use of infinite sets or measures, or the use of the Fourier transform or inverse theorems from additive combinatorics. It also gives explicit (but extremely poor) quantitative bounds. 1

Citations

192	Recurrence in ergodic theory and combinatorial number theory - Furstenberg
172	Szemerédi’s regularity lemma and its applications in graph theory - Komlós, Simonovits - 1993
171	On sets of integers containing no k elements in arithmetic progression - Szemerédi - 1975
122	Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions - Furstenberg - 1977
112	Regular Partitions of Graphs - Szemerédi - 1976
111	The primes contain arbitrarily long arithmetic progressions - Green, Tao
107	A new proof of Szemerédi’s theorem - Gowers
104	On certain sets of integers - Roth - 1956
103	der Waerden, Beweis einer Baudetschen Vermutung, Nieuw - van - 1927
85	A new proof of Szemerédi’s theorem for arithmetic progressions of length four - Gowers - 1998
74	Hypergraph regularity and the multidimensional Szemerédi theorem - Gowers - 2007
71	Polynomial extensions of van der Waerden’s and Szemerédi’s theorems - Bergelson, Leibman - 1996
68	Triple systems with no six points carrying three triangles - Ruzsa, Szemeredi - 1978
62	On some sequences of integers - Erdős, Turán - 1936
60	Non conventional ergodic averages and nilmanifolds - Host, Kra - 2005
60	Regularity lemma for k-uniform hypergraphs - Rödl, Skokan
58	An ergodic Szemerédi Theorem for commuting transformations - Furstenberg, Katznelson - 1978
57	The counting lemma for regular k-uniform hypergraphs. Random Structures Algorithms - Nagle, Rödl, et al.
54	Lower bounds of tower type for Szemerédi’s uniformity lemma - Gowers - 1997
43	Primitive recursive bounds for van der Waerden numbers - Shelah - 1988
43	On sets of integers containing no four elements in arithmetic progression - Szemerédi - 1969
41	A density version of the Hales-Jewett theorem - Furstenberg, Katznelson - 1991
41	Integer sets containing no arithmetic progressions - Heath-Brown - 1987
41	Beweis einer Baudetschen Vermutung - Waerden - 1959
40	On certain sets of positive density - Varnavides - 1959
39	Universal characteristic factors and Furstenberg averages - Ziegler - 2007
33	Extremal problems on set systems, Random Structures Algorithms 20 - Frankl, Rödl - 2002
30	Applications of the regularity lemma for uniform hypergraphs, submitted - Rödl, Skokan
21	The ergodic theoretical proof of Szemerédi’s theorem - Furstenberg, Katznelson, et al. - 1982
19	An ergodic Szemerédi theorem for IPsystems and combinatorial theory - Furstenberg, Katznelson - 1985
16	The Gaussian primes contain arbitrarily shaped constellations - Tao
14	Set polynomials and a polynomial extension of the Hales-Jewett theorem - Bergelson, Leibman - 1999
14	Note on a question of Erdös and - Solymosi - 2004
11	Irregularities of sequences relative to arithmetic progressions - Roth - 1967
11	A mean ergodic theorem for 1/N ∑N n=1 f(T nx)g(T n2x), Convergence in ergodic theory and probability - Furstenberg, Weiss - 1993
10	Selected topics from the metric theory of dynamical systems - Rohlin - 1966
9	An inverse theorem for the Gowers U 3 (G) norm, preprint - Green, Tao
9	Combinatorial proofs of the polynomial Van der Waerden and the polynomial Hales-Jewett theorem - Walters
6	Pointwise convergence of ergodic averages along cubes, preprint - Assani
6	On triples in arithmetic progression, GAFA 9 - Bourgain - 1999
5	Aspects of uniformity in recurrence - Bergelson, Host, et al.
5	A Szemeredi-type theorem for sets of positive density - Bourgain
5	Density theorems and extremal hypergraph problems, preprint - Rödl, Schacht, et al.
5	Szemerédi’s regularity lemma revisited, preprint - Tao
4	The complexity of the collection of measure-distal transformations. Ergodic Theory Dynam - Beleznay, Foreman - 1996
4	A mean ergodic theorem for 1/N ∑N n=1 f(T n x)g(T n2 x), in Convergence in ergodic theory and probability - Furstenberg, Weiss - 1993
4	Note on a generalization of Roth’s theorem - Solymosi
2	Herbrand’s theorem and proof theory - Girard - 1982
1	Irregularities of sequences relative to arithemtic progressions - Roth - 1972
1	An information-theoretic proof of Szemerédi’s regularity lemma, unpublished - Tao