Computably locally compact groups and their closed subgroups
Given a computably locally compact Polish space M, we show that its 1-point compactification [Formula: see text] is computably compact. Then, for a computably locally compact group G, we show that the Chabauty space [Formula: see text] of closed subgroups of G has a canonical effectively-closed (i.e., [Formula: see text]) presentation as a subspace of the hyperspace [Formula: see text] of closed sets of [Formula: see text]. We construct a computable discrete abelian group H such that [Formula: see text] is not computably closed in [Formula: see text]; in fact, the only computable points of [Formula: see text] are the trivial group and H itself, while [Formula: see text] is uncountable. In the case that a computably locally compact group G is also totally disconnected, we provide a further algorithmic characterization of [Formula: see text] 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 [Formula: see text] is arithmetical.
Authors
- Alexander Melnikov (ORCID: https://orcid.org/0000-0001-8781-7432)
- André Nies (ORCID: https://orcid.org/0000-0002-0666-5180)
Institutions
- University of Auckland (NZ)
- Victoria University of Wellington (NZ)
Publication Details
- Journal
- International Journal of Algebra and Computation
- Published
- 2025-10-10
- DOI
- https://doi.org/10.1142/s0218196725500432
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00