Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T1, T2, …, Td: ℤ ↷ (X, ∑, µ) ([6]), and so, via the Furstenberg correspondence principle introduced in [5], a new proof of the multi-dimensional Szemerédi Theorem. We bypass the careful manipulation of certain towers of factors of a probability-preserving system that underlies the Furstenberg-Katznelson analysis, instead modifying an approach recently developed in [1] to pass to a large extension of our original system in which this analysis greatly simplifies. The proof is then completed using an adaptation of arguments developed by Tao in [13] for his study of an infinitary analog of the hypergraph removal lemma. In a sense, this addresses the difficulty, highlighted by Tao, of establishing a direct connection between his infinitary, probabilistic approach to the hypergraph removal lemma and the infinitary, ergodic-theoretic approach to Szemerédi’s Theorem set in motion by Furstenberg [5].

[1]  W. T. Gowers,et al.  Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[2]  H. Furstenberg,et al.  An ergodic Szemerédi theorem for commuting transformations , 1978 .

[3]  Bryna Kra,et al.  Convergence of Conze–Lesigne averages , 2001, Ergodic Theory and Dynamical Systems.

[4]  Bryna Kra,et al.  Nonconventional ergodic averages and nilmanifolds , 2005 .

[5]  Tamar Ziegler,et al.  Universal characteristic factors and Furstenberg averages , 2004, math/0403212.

[6]  H. Furstenberg Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .

[7]  Tim Austin On the norm convergence of non-conventional ergodic averages , 2008, Ergodic Theory and Dynamical Systems.

[8]  B. Host Ergodic seminorms for commuting transformations and applications , 2008, 0811.3703.

[9]  Nikos Frantzikinakis,et al.  Convergence of multiple ergodic averages for some commuting transformations , 2004, Ergodic Theory and Dynamical Systems.

[10]  Q. Zhang On convergence of the averages $$\frac{1}{N}\sum\nolimits_{n = 1}^N {f_1 (R^n x)f_2 (S^n x)f_3 (T^n x)} $$ , 1996 .

[11]  Eli Glasner,et al.  Ergodic Theory via Joinings , 2003 .

[12]  Terence Tao,et al.  Norm convergence of multiple ergodic averages for commuting transformations , 2007, Ergodic Theory and Dynamical Systems.

[13]  V. Rödl,et al.  The counting lemma for regular k-uniform hypergraphs , 2006 .

[14]  Terence Tao,et al.  A Correspondence Principle between (hyper)graph Theory and Probability Theory, and the (hyper)graph Removal Lemma , 2006 .

[15]  J. Conze,et al.  Sur un théorème ergodique pour des mesures diagonales , 1988 .

[16]  Vojtech Rödl,et al.  The counting lemma for regular k‐uniform hypergraphs , 2006, Random Struct. Algorithms.