Hostname: page-component-89b8bd64d-z2ts4 Total loading time: 0 Render date: 2026-05-10T09:05:58.504Z Has data issue: false hasContentIssue false

On closure operations in the space of subgroups and applications

Published online by Cambridge University Press:  05 August 2025

DOMINIK FRANCOEUR
Affiliation:
Universidad Autónoma de Madrid , Departamento de Matematicas, 28049 Madrid, Spain (e-mail: dominik.francoeur@uam.es)
ADRIEN LE BOUDEC*
Affiliation:
CNRS, UMPA - ENS Lyon , 69364 Lyon, France
Rights & Permissions [Opens in a new window]

Abstract

We establish some interactions between uniformly recurrent subgroups (URSs) of a group G and cosets topologies $\tau _{\mathcal {N}}$ on G associated to a family $\mathcal {N}$ of normal subgroups of G. We show that when $\mathcal {N}$ consists of finite index subgroups of G, there is a natural closure operation $\mathcal {H} \mapsto \mathrm {cl}_{\mathcal {N}}(\mathcal {H})$ that associates to a URS $\mathcal {H}$ another URS $\mathrm {cl}_{\mathcal {N}}(\mathcal {H})$, called the $\tau _{\mathcal {N}}$-closure of $\mathcal {H}$. We give a characterization of the URSs $\mathcal {H}$ that are $\tau _{\mathcal {N}}$-closed in terms of stabilizer URSs. This has consequences on arbitrary URSs when G belongs to the class of groups for which every faithful minimal profinite action is topologically free. We also consider the largest amenable URS $\mathcal {A}_G$ and prove that for certain coset topologies on G, almost all subgroups $H \in \mathcal {A}_G$ have the same closure. For groups in which amenability is detected by a set of laws (a property that is variant of the Tits alternative), we deduce a criterion for $\mathcal {A}_G$ to be a singleton based on residual properties of G.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press