SearcharxivSearch

arXiv · 1705.09096

Virtual retraction and Howson's theorem in pro-$p$ groups

Abstract

We show that for every finitely generated closed subgroup $K$ of a non-solvable Demushkin group $G$, there exists an open subgroup $U$ of $G$ containing $K$, and a continuous homomorphism $\tau \colon U \to K$ satisfying $\tau(k) = k$ for every $k \in K$. We prove that the intersection of a pair of finitely generated closed subgroups of a Demushkin group is finitely generated (giving an explicit bound on the number of generators). Furthermore, we show that these properties of Demushkin groups are preserved under free pro-$p$ products, and deduce that Howson's theorem holds for the Sylow subgroups of the absolute Galois group of a number field. Finally, we confirm two conjectures of Ribes, thus classifying the finitely generated pro-$p$ M. Hall groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Mark Shusterman, Pavel Zalesskii. 2017-05-25. Virtual retraction and Howson's theorem in pro-$p$ groups. https://arxiv.org/abs/1705.09096

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