Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa) (Q1775152): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:39, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa) |
scientific article |
Statements
Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa) (English)
0 references
4 May 2005
0 references
Let \((X,{\mathcal X},\mu, T)\) be a dynamical system (i.e., a measure preserving probability system, with \(T\) invertible). The Khintchine recurrence theorem states: If \(A\in{\mathcal X}\) with \(\mu(A)> 0\), then for every \(\varepsilon> 0\), \(\{n\in\mathbb{Z}: \mu(A\cap T^nA)>\mu(A)^2- \varepsilon\}\) is syndetic. A multiple recurrence theorem due to Furstenberg states: Let \((X,{\mathcal X},\mu, T)\) be a dynamical system, let \(A\in{\mathcal X}\) with \(\mu(A)> 0\) and let \(k\geq 1\). Then \[ \liminf_{N-M\to\infty}\,{1\over N- M} \sum^{N- 1}_{n= M} \mu(\cap T^n A\cap T^{2n} A\cap\cdots\cap T^{kn} A)> 0. \] (This \(\liminf\) was subsequently shown by the latter two authors [Ann. Math. (2) 161, No. 1, 397--488 (2005; Zbl 1077.37002)] to be a limit.) Both of these theorems can be regarded a generalizations of the Poincaré recurrence theorem, and the original aim of the authors was to give a simultaneous generalization of both theorems, to show that for such a dynamical system and for \(A\in{\mathcal X}\), \(\mu(A)> 0\) and \(\varepsilon> 0\), the set of \(n\in\mathbb Z\) such that \(\mu(A\cap T^nA\cap T^{2n}A\cap\dots\cap T^{kn}A)> \mu(A)^{k+1}- \varepsilon\) is syndetic. However, surprisingly, the authors are able to show that if \(T\) is ergodic, then this is true for \(k= 2\) and \(k= 3\), but false for \(k\geq 4\) (and also false in the non-ergodic cases of \(k= 2\) and \(k= 3\)). The case of \(k\geq 4\) uses a combinatorial result due to Ruzsa, which appears as an appendix.
0 references
Furstenberg recurrence theorem
0 references
Szemerédi theorem
0 references
multiple recurrence theorem
0 references