A Roth theorem for amenable groups.

From MaRDI portal





Inspired by Furstenberg and generalizing his result for \(\mathbb{Z}\)-actions [see \textit{H. Furstenberg}, J. Anal. Math. 31, 204-256 (1977; Zbl 0347.28016); Recurrence in ergodic theory and combinatorial number theory (Princeton, 1981; Zbl 0459.28023)] the authors prove the following very beautiful mean ergodic theorem (ergodic Roth theorem) for two commuting measure preserving actions \(\{T_g\}\) and \(\{S_g\}\) of a countable amenable group \(G\) on a probability space \((X,A,\mu): \lim_{n\to \infty} {1\over|\Phi|} \sum_{g\in \varphi_n} \varphi (T_gx) \psi (S_gT_gx)\) exists in \(L^1(X,A,\mu)\) for any \(\varphi, \psi\in L^2 (X,A,\mu)\) and any Følner sequence for \(G\). Compare also \textit{J.-P. Conze} and \textit{E. Lesigne} [Bull. Soc. Math. France 112, 142-175 (1984; Zbl 0595.28018); C. R. Acad. Sci., Paris, Sér. I 306, 491-493 (1988; Zbl 0641.28010)] or \textit{H. Furstenberg} and \textit{B. Weiss} [V. Bergelson (ed.) et al., Convergence in ergodic theory and probability, Ohio State Univ. Math. Res. Inst. Publ. 5, 193-227 (1996; Zbl 0869.28010)]. They also present a full proof with many interesting aspects. As a consequence they obtain also combinatorial corollaries: If \(E\subseteq G\times G\) has positive upper density with respect to a left Følner sequence, then the set \[ \biggl\{ g\in G;\text{ there exists }(a,b)\in G\times G\text{ such that } \bigl\{(a,b), (ga,b),(ga,gb) \bigr\}\in E\biggr\} \] is both left and right syndetic in \(G\) (i.e. finitely many left resp. right translates cover \(G)\). This implies a theorem of \textit{T. C. Brown} and \textit{J. P. Buhler} [J. Comb. Theory, Ser. A 32, 20-34 (1982; Zbl 0476.51008)] and \textit{P. Frankl}, \textit{R. L. Graham} and \textit{V. Rödl} [J. Comb. Theory, Ser. A 45, 157-161 (1987; Zbl 0613.10043)] for abelian \(G\) but also somewhat surprisingly a theorem on topological recurrence for three commuting actions of a countable amenable group \(G\), a nonabelian generalization of van der Waerden's theorem for three commuting actions [see \textit{H. Furstenberg}, Recurrence in ergodic theory and combinatorial number theory (Princeton, 1991; see quotation above)] which fails for free groups even for two commuting actions [see \textit{V. Bergelson} and \textit{N. Hindman}, J. Lond. Math. Soc., II. Ser. 45, 385-403 (1992; Zbl 0761.05008)] which implies the following combinatorial result: Suppose that \(G\) is a countable amenable group, \(r\in\mathbb{N}\), and that \(G\times G\times G= \cup^r_{i=1} C_i\). Then the set \[ \bigl\{g\in G\text{: there exists } i,\;1\leq i\leq r,\text{ and } (a,b,c) \in G \times G\times G\text{ such that } \] \[ \{(a,b,c), (ga,b,c), (ga,gb,c),\;(ga,gb,gc)\}\subset C_i \bigr\} \] is both left and right syndetic in \(G\).




Cited in
(29)








This page was built for publication: A Roth theorem for amenable groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370682)