Norm convergence of nilpotent ergodic averages (Q431653): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A rather general non-conventional ergodic theorem for averages of the form \[ \frac{1}{N}\sum_{n=1}^{N}\prod_{j=1}^{d}\left(T_1^{p_{1,j}(n)}\cdots T_{\ell}^{p_{\ell,j(n)}}\right) f_j, \] where \(T_1,\dots,T_{\ell}\) are measure-preserving transformations contained in a nilpotent group \(G\) and \(p_{i,j}\) are integer-valued polynomials, is obtained. Convergence in \(L^2\) is shown for any functions \(f_j\in L^{\infty}\). This subsumes many earlier results in the literature (a short survey is given in this paper) that bound \(d\), \(\ell\), the degrees of the polynomials, or the algebraic complexity of \(G\). The approach here is novel, and in particular does not follow the path of identifying a characteristic factor for the problem at hand. Instead, a decomposition is used into random and structured components, the latter being handled via an inductive argument. Ideas of \textit{W. T. Gowers} [Bull. Lond. Math. Soc. 42, No. 4, 573--606 (2010; Zbl 1233.05198)] are used here for the first time in an ergodic theory setting. A key step is to define the structured component using a new notion of \(L\)-reducible functions, and to find a suitable notion of complexity for the expressions arising that allows a reduction step. This approach precludes an explicit description of the \(L^2\) limit, but is a powerful result of wide scope, particularly in light of the example of \textit{V. Bergelson} and \textit{A. Leibman} [Invent. Math. 147, No. 2, 429--470 (2002; Zbl 1042.37001)] showing that \(\frac{1}{N}\sum_{n=1}^{N}T^nfS^ng\) need not converge if \(S,T\) generate a solvable group. | |||
Property / review text: A rather general non-conventional ergodic theorem for averages of the form \[ \frac{1}{N}\sum_{n=1}^{N}\prod_{j=1}^{d}\left(T_1^{p_{1,j}(n)}\cdots T_{\ell}^{p_{\ell,j(n)}}\right) f_j, \] where \(T_1,\dots,T_{\ell}\) are measure-preserving transformations contained in a nilpotent group \(G\) and \(p_{i,j}\) are integer-valued polynomials, is obtained. Convergence in \(L^2\) is shown for any functions \(f_j\in L^{\infty}\). This subsumes many earlier results in the literature (a short survey is given in this paper) that bound \(d\), \(\ell\), the degrees of the polynomials, or the algebraic complexity of \(G\). The approach here is novel, and in particular does not follow the path of identifying a characteristic factor for the problem at hand. Instead, a decomposition is used into random and structured components, the latter being handled via an inductive argument. Ideas of \textit{W. T. Gowers} [Bull. Lond. Math. Soc. 42, No. 4, 573--606 (2010; Zbl 1233.05198)] are used here for the first time in an ergodic theory setting. A key step is to define the structured component using a new notion of \(L\)-reducible functions, and to find a suitable notion of complexity for the expressions arising that allows a reduction step. This approach precludes an explicit description of the \(L^2\) limit, but is a powerful result of wide scope, particularly in light of the example of \textit{V. Bergelson} and \textit{A. Leibman} [Invent. Math. 147, No. 2, 429--470 (2002; Zbl 1042.37001)] showing that \(\frac{1}{N}\sum_{n=1}^{N}T^nfS^ng\) need not converge if \(S,T\) generate a solvable group. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Thomas B. Ward / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 37A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11L15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 28D05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 37A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 37A25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6051280 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ergodic theorem | |||
Property / zbMATH Keywords: ergodic theorem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nilpotent group | |||
Property / zbMATH Keywords: nilpotent group / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial ergodic theorem | |||
Property / zbMATH Keywords: polynomial ergodic theorem / rank | |||
Normal rank |
Revision as of 23:02, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Norm convergence of nilpotent ergodic averages |
scientific article |
Statements
Norm convergence of nilpotent ergodic averages (English)
0 references
29 June 2012
0 references
A rather general non-conventional ergodic theorem for averages of the form \[ \frac{1}{N}\sum_{n=1}^{N}\prod_{j=1}^{d}\left(T_1^{p_{1,j}(n)}\cdots T_{\ell}^{p_{\ell,j(n)}}\right) f_j, \] where \(T_1,\dots,T_{\ell}\) are measure-preserving transformations contained in a nilpotent group \(G\) and \(p_{i,j}\) are integer-valued polynomials, is obtained. Convergence in \(L^2\) is shown for any functions \(f_j\in L^{\infty}\). This subsumes many earlier results in the literature (a short survey is given in this paper) that bound \(d\), \(\ell\), the degrees of the polynomials, or the algebraic complexity of \(G\). The approach here is novel, and in particular does not follow the path of identifying a characteristic factor for the problem at hand. Instead, a decomposition is used into random and structured components, the latter being handled via an inductive argument. Ideas of \textit{W. T. Gowers} [Bull. Lond. Math. Soc. 42, No. 4, 573--606 (2010; Zbl 1233.05198)] are used here for the first time in an ergodic theory setting. A key step is to define the structured component using a new notion of \(L\)-reducible functions, and to find a suitable notion of complexity for the expressions arising that allows a reduction step. This approach precludes an explicit description of the \(L^2\) limit, but is a powerful result of wide scope, particularly in light of the example of \textit{V. Bergelson} and \textit{A. Leibman} [Invent. Math. 147, No. 2, 429--470 (2002; Zbl 1042.37001)] showing that \(\frac{1}{N}\sum_{n=1}^{N}T^nfS^ng\) need not converge if \(S,T\) generate a solvable group.
0 references
ergodic theorem
0 references
nilpotent group
0 references
polynomial ergodic theorem
0 references