SearcharxivSearch

arXiv · 2301.00476

Asymptotic Cohomology and Uniform Stability for Lattices in Semisimple Groups

Abstract

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on finite-dimensional Hilbert spaces equipped with submultiplicative norms. Namely, we show that for (most) high-rank lattices, every finite-dimensional unitary "almost-representation" of $\Gamma$ is a small deformation of a (true) unitary representation. This extends a result of Kazhdan (1983) for amenable groups and of Burger-Ozawa-Thom (2013) for SL(n,Z) (for n>2). Towards this goal, we first build an elaborate cohomological theory capturing the obstruction to such stability, and show that the vanishing of second cohomology implies uniform stability in this setting. This cohomology can be roughly thought of as an asymptotic version of bounded cohomology, and sheds light on a question raised in Monod (2006) about a possible connection between vanishing of second bounded cohomology and Ulam stability.

Explore related subjects

Keep this discovery

BibTeXRIS

Lev Glebsky, Alexander Lubotzky, Nicolas Monod, Bharatram Rangarajan. 2023-01-01. Asymptotic Cohomology and Uniform Stability for Lattices in Semisimple Groups. https://arxiv.org/abs/2301.00476

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