SearcharxivSearch

arXiv · 2608.02193

Residual profiles and bounded generation in pro-$p$ completions of amalgamated products

Abstract

This paper completely classifies when the pro-$p$ completion of an amalgamated product has bounded generation, assuming its starting vertex groups are already boundedly generated. We first prove that the pro-$p$ completion of any abstract amalgam always naturally forms a proper pro-$p$ amalgam. Within this framework, we show that bounded generation is extremely rare. Specifically, the completed group is boundedly generated if and only if one of the vertex groups completely collapses into the edge group (meaning it has an index of 1), or in the highly specific case where $p=2$ and both vertex groups have an index of exactly 2 over the edge intersection.Additionally, we develop a new set of criteria to determine when the original vertex and edge groups map into the completion without collapsing. Finally, we provide a cautionary counterexample: for any given prime $p$, we construct an amalgam whose pro-$p$ completion is boundedly generated, but its full profinite completion is not. This demonstrates that possessing bounded generation at a single prime does not guarantee that the full profinite group will share this property.

Explore related subjects

Keep this discovery

BibTeXRIS

Dekui Peng, Jiang Yang. 2026-08-03. Residual profiles and bounded generation in pro-$p$ completions of amalgamated products. https://arxiv.org/abs/2608.02193

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