SearcharxivSearch

arXiv · 0710.4009

The congruence kernel of an arithmetic lattice in a rank one algebraic group over a local field

Abstract

Let k be a global field and let k_v be the completion of k with respect to v, a non-archimedean place of k. Let \mathbf{G} be a connected, simply-connected algebraic group over k, which is absolutely almost simple of k_v-rank 1. Let G=\mathbf{G}(k_v). Let Γbe an arithmetic lattice in G and let C=C(Γ) be its congruence kernel. Lubotzky has shown that C is infinite, confirming an earlier conjecture of Serre. Here we provide complete solution of the congruence subgroup problem for \Gamm$ by determining the structure of C. It is shown that C is a free profinite product, one of whose factors is \hat{F}_ω, the free profinite group on countably many generators. The most surprising conclusion from our results is that the structure of C depends only on the characteristic of k. The structure of C is already known for a number of special cases. Perhaps the most important of these is the (non-uniform) example Γ=SL_2(\mathcal{O}(S)), where \mathcal{O}(S) is the ring of S-integers in k, with S=\{v\}, which plays a central role in the theory of Drinfeld modules. The proof makes use of a decomposition theorem of Lubotzky, arising from the action of Γon the Bruhat-Tits tree associated with G.

Explore related subjects

Keep this discovery

BibTeXRIS

A. W. Mason, A. Premet, B. Sury, P. A. Zalesskii. 2007-10-22. The congruence kernel of an arithmetic lattice in a rank one algebraic group over a local field. https://arxiv.org/abs/0710.4009

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