论文标题
可计算拓扑组
Computable topological groups
论文作者
论文摘要
我们研究了(Hausdorff,第二个计数)拓扑组可计算的含义。我们比较文献中的几个潜在定义。我们将这些概念与离散组和涂鸦组有效前置性的良好定义联系起来,并将这些结果与可计算拓扑的结果进行了比较。这些定义中的大多数可以通过反例隔开。值得注意的是,我们证明了两个这样的定义相当于本地紧凑的波兰和阿贝里安抛光群。更具体地说,我们证明,在这些广泛的组中,每个可计算的拓扑组都以左右不变的度量和可计算的密度点序列的右C.E。在局部紧凑的情况下,我们还表明,如果该组进一步有效地在局部紧凑,那么我们可以产生有效的左右不变度度量。
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective presentability for discrete and profinite groups, and compare these results with similar results in computable topology. Most of these definitions can be separated by counter-examples. Remarkably, we prove that two such definitions are equivalent for locally compact Polish and abelian Polish groups. More specifically, we prove that in these broad classes of groups, every computable topological group admits a right-c.e.~(upper semi-computable) presentation with a left-invariant metric, and a computable dense sequence of points. In the locally compact case, we also show that if the group is additionally effectively locally compact, then we can produce an effectively proper left-invariant metric.