SearcharxivSearch

arXiv · 2507.20791

Profinite groups with complemented closed subgroups

Abstract

A group $G$ is said to be a $C$-group if every subgroup $H$ has a permutable complement, i.e. if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H \cap K=1$. In this paper, we study the profinite counterpart of this concept. We say that a profinite group $G$ is profinite-$C$ if every closed subgroup admits a closed permutable complement. We first give some equivalent variants of this condition and then we determine the structure of profinite-$C$ groups: they are the semidirect products $G=B\ltimes A$ of two closed subgroups $A=\text{Cr}_{i\in I} \, \langle a_i \rangle$ and $B=\text{Cr}_{j\in J} \, \langle b_j \rangle$ that are cartesian products of cyclic groups of prime order, and with every $\langle a_i \rangle$ normal in $G$. Finally, we show that a profinite-$C$ group is a $C$-group if and only if it is torsion and $|G:Z(G)\overline{G'}|<\infty$.

Explore related subjects

Keep this discovery

BibTeXRIS

Gustavo A. Fernández-Alcober, Giulia Sabatino. 2025-07-28. Profinite groups with complemented closed subgroups. https://arxiv.org/abs/2507.20791

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