SearcharxivSearch

arXiv · 2301.05086

Sublinear Rigidity of Lattices in Semisimple Lie Groups

Abstract

Let $G$ be a real centre-free semisimple Lie group without compact factors. I prove that irreducible lattices in $G$ are rigid under two types of sublinear distortions. The first result is that the class of lattices in groups that do not admit $\mathbb{R}$-rank $1$ factors is $\textit{SBE complete}$: if $\Lambda$ is an abstract finitely generated group that is Sublinearly BiLipschitz Equivalent (SBE) to a lattice $\Gamma\leq G$, then $\Lambda$ can be homomorphically mapped into $G$ with finite kernel and image a lattice in $G$. For such $G$ this generalizes the well known quasi-isometric completeness of lattices. The second result concerns sublinear distortions within $G$ itself, and holds without any restriction on the rank of the factors: if $\Lambda\leq G$ is a discrete subgroup that $\textit{sublinearly covers}$ a lattice $\Gamma\leq G$, then $\Lambda$ is itself a lattice.

Explore related subjects

Keep this discovery

BibTeXRIS

Ido Grayevsky. 2023-01-12. Sublinear Rigidity of Lattices in Semisimple Lie Groups. https://arxiv.org/abs/2301.05086

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