Computably locally compact groups and their closed subgroups
Alexander G. Melnikov, Andre Nies

TL;DR
This paper explores the computability properties of locally compact groups and their closed subgroups, establishing new results on the effective structure of the Chabauty space and providing algorithmic characterizations.
Contribution
It introduces a computable framework for locally compact groups, analyzes the effective structure of their closed subgroups, and characterizes the Chabauty space in the totally disconnected case.
Findings
The 1-point compactification of a computably locally compact space is computably compact.
The Chabauty space of closed subgroups has a canonical effectively-closed presentation.
There exists a computably locally compact abelian group with a non-computably closed space of closed subgroups.
Abstract
Given a computably locally compact Polish space , we show that its 1-point compactification is computably compact. Then, for a computably locally compact group , we show that the Chabauty space of closed subgroups of has a canonical effectively-closed (i.e., ) presentation as a subspace of the hyperspace of closed sets of . We construct a computable discrete abelian group such that is not computably closed in ; in fact, the only computable points of are the trivial group and itself, while is uncountable. In the case that a computably locally compact group is also totally disconnected, we provide a further algorithmic characterization of in terms of the countable meet groupoid of introduced recently by the authors (arXiv:…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory
