
TL;DR
This paper provides an ergodic theory proof of Tao's convergence theorem for multiple ergodic averages involving commuting transformations, using novel variations of the Furstenberg correspondence to translate combinatorial recurrence results.
Contribution
It introduces two new variations of the Furstenberg correspondence that facilitate ergodic proofs of convergence theorems for multiple averages.
Findings
Established ergodic proof of Tao's convergence theorem
Developed two new Furstenberg correspondence variations
Connected combinatorial recurrence with ergodic properties
Abstract
Tao has recently proved that if are commuting, invertible, measure-preserving transformations on a dynamical system then for any functions , the average converges in the norm. Tao's proof is unusual in that it translates the problem into a more complicated statement about the combinatorics of finite spaces by using the Furstenberg correspondence "backwards". In this paper, we give an ergodic proof of this theorem, essentially a translation of Tao's argument to the ergodic setting. In order to do this, we develop two new variations on the usual Furstenberg correspondence, both of which take recurrence-type statements in one dynamical system and give equivalent statements in a different dynamical system with desirable properties.
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.
