SearcharxivSearch

arXiv · 2105.04125

Norm rigidity for arithmetic and profinite groups

Abstract

Let $A$ be a commutative ring, and assume every non-trivial ideal of $A$ has finite-index. We show that if ${\rm{SL}}_n(A)$ has bounded elementary generation then every conjugation-invariant norm on it is either discrete or precompact. If $G$ is any group satisfying this dichotomy we say that $G$ has the \emph{dichotomy property}. We relate the dichotomy property, as well as some natural variants of it, to other rigidity results in the theory of arithmetic and profinite groups such as the celebrated normal subgroup theorem of Margulis and the seminal work of Nikolov and Segal. As a consequence we derive constraints to the possible approximations of certain non residually finite central extensions of arithmetic groups, which we hope might have further applications in the study of sofic groups. In the last section we provide several open problems for further research.

Explore related subjects

Keep this discovery

BibTeXRIS

Leonid Polterovich, Yehuda Shalom, Zvi Shem-Tov. 2021-05-10. Norm rigidity for arithmetic and profinite groups. https://arxiv.org/abs/2105.04125

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