SearcharxivSearch

arXiv · 2407.19440

Computably locally compact groups and their closed subgroups

Abstract

Given a computably locally compact Polish space $M$, we show that its 1-point compactification $M^*$ is computably compact. Then, for a computably locally compact group $G$, we show that the Chabauty space $\mathcal S(G)$ of closed subgroups of $G$ has a canonical effectively-closed (i.e., $\Pi^0_1$) presentation as a subspace of the hyperspace $\mathcal K(G^*)$ of closed sets of $G^*$. We construct a computable discrete abelian group $H$ such that $\mathcal S(H)$ is not computably closed in $\mathcal K(H^*)$; in fact, the only computable points of $\mathcal S(H)$ are the trivial group and $H$ itself, while $\mathcal S(H)$ is uncountable. In the case that a computably locally compact group $G$ is also totally disconnected, we provide a further algorithmic characterization of $\mathcal S(G)$ in terms of the countable meet groupoid of $G$ introduced recently by the authors (arXiv: 2204.09878). We apply our results and techniques to show that the index set of the computable locally compact abelian groups that contain a closed subgroup isomorphic to $(\mathbb{R},+)$ is arithmetical.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander G. Melnikov, Andre Nies. 2024-07-28. Computably locally compact groups and their closed subgroups. https://arxiv.org/abs/2407.19440

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