SearcharxivSearch

arXiv · 1602.00403

Super-approximation, I: p-adic semisimple case

Abstract

Let $k$ be a number field, $Ω$ be a finite symmetric subset of $\mathbb{GL}_{n_0}(k)$, and $Γ=\langle Ω\rangle$. Let \[ C(Γ):=\{\mathfrak{p}\in V_f(k)|\hspace{1mm} Γ\text{is a bounded subgroup of} \mathbb{GL}_{n_0}(k_{\mathfrak{p}})\}, \] and $Γ_{\mathfrak{p}}$ be the closure of $Γ$ in $\mathbb{GL}_{n_0}(k_{\mathfrak{p}})$. Assuming that the Zariski-closure of $Γ$ is semisimple, we prove that the family of left translation actions $\{Γ\curvearrowright Γ_{\mathfrak{p}}\}_{\mathfrak{p}\in C(Γ)}$ has {\em uniform spectral gap}. As a corollary we get that the left translation action $Γ\curvearrowright G$ has {\em local spectral gap} if $Γ$ is a countable dense subgroup of a semisimple $p$-adic analytic group $G$ and Ad$(Γ)$ consists of matrices with algebraic entries in some $\mathbb{Q}_p$-basis of Lie$(G)$. This can be viewed as a (stronger) $p$-adic version of \cite[Theorem A]{BISG}, which enables us to give applications to the Banach-Ruziewicz problem and orbit equivalence rigidity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alireza Salehi Golsefidy. 2018-02-10. Super-approximation, I: p-adic semisimple case. https://doi.org/10.1093/imrn%2Frnw208

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