SearcharxivSearch

arXiv · 1908.07812

Stationary characters on lattices of semisimple Lie groups

Abstract

We show that stationary characters on irreducible lattices $\Gamma < G$ of higher-rank connected semisimple Lie groups are conjugation invariant, that is, they are genuine characters. This result has several applications in representation theory, operator algebras, ergodic theory and topological dynamics. In particular, we show that for any such irreducible lattice $\Gamma < G$, the left regular representation $\lambda_\Gamma$ is weakly contained in any weakly mixing representation $\pi$. We prove that for any such irreducible lattice $\Gamma < G$, any uniformly recurrent subgroup (URS) of $\Gamma$ is finite, answering a question of Glasner-Weiss. We also obtain a new proof of Peterson's character rigidity result for irreducible lattices $\Gamma < G$. The main novelty of our paper is a structure theorem for stationary actions of lattices on von Neumann algebras.

Explore related subjects

Keep this discovery

BibTeXRIS

Rémi Boutonnet, Cyril Houdayer. 2019-08-21. Stationary characters on lattices of semisimple Lie groups. https://doi.org/10.1007/s10240-021-00122-8

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