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

From MaRDI portal
Revision as of 20:21, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma
scientific article

    Statements

    Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma (English)
    0 references
    10 March 2011
    0 references
    The author gives a new ergodic-theoretic proof of the multi-dimensional multiple recurrence theorem of \textit{H. Furstenberg} and \textit{Y. Katznelson}, [J. Anal. Math. 34, 275--291 (1978; Zbl 0426.28014)], which by Furstenberg's correspondence principle also implies the multidimensional Szemeredi theorem. More precisely, the main result of the paper under review is the following: Let \(T_1, \dots, T_d:~\mathbb{Z} \curvearrowright (X,\Sigma,\mu)\) denote commuting, probability-preserving actions, and assume that \(\mu(A)>0\) for some \(A \in \Sigma\). Then \[ \liminf_{N \to \infty} \frac{1}{N} \sum_{n=1}^N \mu \left( T_1^{-n}(A) \cap \dots \cap T_d^{-n}(A) \right) > 0. \] For the proof the author combines his method of ``pleasant'' and ``isotropized'' extensions from one of his earlier publications [see \textit{T. Austin}, Ergodic Theory Dyn. Syst. 30, No. 2, 321--338 (2010; Zbl 1206.37003)] and \textit{T. Tao}'s infinitary hypergraph removal method [J. Anal. Math. 103, 1--45 (2007; Zbl 1146.05038)] in a deliberate and interesting way.
    0 references
    ergodic theory
    0 references
    Szemeredi theorem
    0 references
    multiple recurrence
    0 references
    pleasant extensions
    0 references
    isotropized extensions
    0 references
    infinitary hypergraph removal method
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references