Norm convergence of multiple ergodic averages for commuting transformations
Terence Tao

TL;DR
This paper proves the convergence of multiple ergodic averages for commuting transformations in a probability space, extending previous results to all cases without additional ergodicity assumptions using combinatorial and finitary methods.
Contribution
It establishes the convergence of multiple ergodic averages for any number of commuting transformations using a novel combinatorial and finitary approach.
Findings
Proves $L^2$ convergence for all $l o ext{number of transformations}$
Extends previous results without ergodicity assumptions
Uses combinatorial and hypergraph regularity inspired methods
Abstract
Let be commuting measure-preserving transformations on a probability space . We show that the multiple ergodic averages are convergent in as for all ; this was previously established for by Conze and Lesigne and for general assuming some additional ergodicity hypotheses on the maps and by Frantzikinakis and Kra (with the case of this result established earlier by Zhang). Our approach is combinatorial and finitary in nature, inspired by recent developments regarding the hypergraph regularity and removal lemmas, although we will not need the full strength of those lemmas. In particular, the case of our arguments are a finitary analogue of those of Conze and Lesigne.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Graph theory and applications
