SearcharxivSearch

arXiv · 1207.5888

Ergodic theorems for affine actions of amenable groups on Hilbert space

Abstract

We prove a new weak mean ergodic theorem (Theorem A) for 1-cocycles associated to weakly mixing representations of amenable groups. Let $G$ be a finitely generated, discrete, amenable group $G$ which admits a controlled Folner sequence. We use Theorem A to deduce that any affine action $G\ca^T \Cal H$ on Hilbert space with weakly mixing linear part admits a sequence of almost fixed points (Theorem B). Specializing to the case that $G$ is a finitely generated group of polynomial growth, we show that convex combinations of averages of the associated 1-cocycle over $n$-balls provide a sequence of almost fixed points for the action $G\ca^T \Cal H$ (Corollary C). This affirms a weak form of a conjecture of Shalom independently of Gromov's theorem on the virtual nilpotency of groups of polynomial growth. As a consequence, we are able to give a new, elementary, ergodic-theoretical proof of Gromov's theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Ionut Chifan, Thomas Sinclair. 2012-08-03. Ergodic theorems for affine actions of amenable groups on Hilbert space. https://arxiv.org/abs/1207.5888

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR