key: cord-0046125-6wanod41
authors: Hoyrup, Mathieu; Kihara, Takayuki; Selivanov, Victor
title: Degrees of Non-computability of Homeomorphism Types of Polish Spaces
date: 2020-06-24
journal: Beyond the Horizon of Computability
DOI: 10.1007/978-3-030-51466-2_16
sha: 27eb92be2d14b28da9d9a47b8e8e9bab4e2d8aa0
doc_id: 46125
cord_uid: 6wanod41

There are continuum many homeomorphism types of Polish spaces. In particular, there is a Polish space which is not homeomorphic to any computably presented Polish space. We examine the details of degrees of non-computability of presenting homeomorphic copies of Polish spaces.

How difficult is it to describe an explicit presentation of an abstract mathematical structure? In computable structure theory, there are a large number of works on degrees of non-computability of presenting isomorphism types (known as degree spectra) of algebraic structures such as groups, rings, fields, linear orders, lattices, Boolean algebras, and so on, cf. [1, 5, 6, 8] . In this article, we deal with its topological analogue, i.e., degrees of non-computability of presenting homeomorphism types of certain topological spaces, and mainly focus on presentations of Polish spaces (i.e., completely metrizable separable spaces). We present some of the results obtained in Hoyrup-Kihara-Selivanov [9] on this topic.

The notion of a presentation plays a central role, not only in computable structure theory, but also in computable analysis [2, 3, 16] . In this area, one of the most crucial problems was how to present large mathematical objects (which possibly have the cardinality of the continuum) such as metric spaces, topological spaces and so on, and then researchers have obtained a number of reasonable answers to this question. In particular, the notion of a computable presentation of The second-named author was partially supported by JSPS KAKENHI Grant 19K03602, 15H03634, and the JSPS Core-to-Core Program (A. Advanced Research Networks). The third-named author was supported by the Russian Science Foundation project No 18-11-00028.

a Polish space has been introduced around 1950-60s, cf. [12] , and since then this notion has been widely studied in several areas including computable analysis [2, 14, 16] and descriptive set theory [13] .

In recent years, several researchers succeeded to obtain various results on Turing degrees of presentations of isometric isomorphism types of Polish metric spaces, separable Banach spaces, and so on, cf. [4, 10, 11] . However, most of works are devoted to metric structures, and there seem almost no works on presentations on homeomorphism types of Polish spaces. The investigation of Turing degrees of homeomorphism types of topological spaces (not necessarily Polish) was initiated in [15] . Some results were obtained for domains but the case of Polish spaces was apparently not investigated seriously so far.

Every Polish space is homeomorphic to the Cauchy completion of a metric on (an initial segment of) the natural numbers ω, so one may consider any distance function d : ω 2 → Q as a presentation of a Polish space. Then, observe that there are continuum many homeomorphism types of Polish spaces. In particular, by cardinality argument, there is a Polish space which is not homeomorphic to any computably presented Polish space. Surprisingly however, it was unanswered until very recently even whether the following holds:

The solution to Question 1 was very recently obtained by the authors of this article, and independently by Harrison-Trainor, Melnikov, and Ng [7] . One possible approach to solve this problem is using Stone duality between countable Boolean algebras and zero-dimensional compact metrizable spaces, but they also noticed that every low 4 -presented zero-dimensional compact metrizable space is homeomorphic to a computable one. This reveals certain limitations of Stone duality techniques. Our next step is to develop new techniques other than Stone duality. More explicitly, the next question is the following: Question 2. Does there exist a low 4 -presented Polish space which is not homeomorphic to a computably presented one?

One of the main results in Hoyrup-Kihara-Selivanov [9] is that there exists a 0 -computable low 3 infinite dimensional compact metrizable space which is not homeomorphic to a computable one. This solves Question 2. Indeed, Hoyrup-Kihara-Selivanov [9] showed more general results by considering two types of presentations:

A Polish presentation (or simply a presentation) of a Polish space X is a distance function d on ω whose Cauchy completion is homeomorphic to X . If X is moreover compact, then by a compact presentation of X we mean a presentation of X equipped with an enumeration of (codes of) all finite rational open covers of X , where a rational open set is a finite union of rational open balls. For readers who are familiar with the abstract theory of modern computable analysis (cf. [2] ), we note that a Polish (compact, resp.) presentation of X is just a name of a homeomorphic copy of X in the space of overt (compact overt, resp.) subsets of Hilbert cube [0, 1] ω .

For any Turing degree d and natural number n > 0, there exists a compact metrizable space Z d,n such that for any Turing degree x, d ≤ x (2n−1) ⇐⇒ Z d,n has an x-computable compact presentation.

For any Turing degree d and natural number n > 0, there exists a compact metrizable space P d,n such that for any Turing degree x, d ≤ x (2n) ⇐⇒ P d,n has an x-computable compact presentation.

d ≤ x (2n+1) ⇐⇒ P d,n has an x-computable P olish presentation.

). There exists a Polish space which is 0 -computably presentable, but not computably presentable.

Indeed, for any n > 0, there exists a compact metrizable space X such that

x is high 2n ⇐⇒ X has an x-computable compact presentation. x is high 2n+1 ⇐⇒ X has an x-computable P olish presentation.

). There is a compact Polish space X which has a computable presentation, but has no presentation which makes X computably compact.

Another important question is whether the homeomorphism type of a Polish space can have an easiest presentation.

Hoyrup-Kihara-Selivanov [9] partially answered Question 3 in negative. More precisely, we show the cone-avoidance theorem for compact Polish spaces, which states that, for any non-c.e. set A ⊆ ω, every compact Polish space has a presentation that does not enumerate A.

Some other side results in [9] are:

). There exists a compact metrizable space X which has a computably compact presentation, but its nth Cantor-Bendixson derivative X n has no 0 (2n−1) -computably compact presentation. Indeed, there exists a compact metrizable space X such that the following are equivalent for any Turing degree x:

1. X has an x-computable compact presentation 2. The nth derivative X n has an x (2n) -computable compact presentation Theorem 4 ([9]). There exists a computably presentable compact metrizable space whose perfect kernel is not computably presentable.

Similarly, there exists a computably compact, computably presented, compact metrizable space whose perfect kernel is compact, but has no presentation which makes it computably compact.

Our key idea is using dimension (more explicitly, high-dimensional holes, i.e., a cycle which is not a boundary) to code a given Turing degree. 

Computable Structures and the Hyperarithmetical Hierarchy

Handbook of Computability and Complexity in Analysis

A tutorial on computable analysis

Analytic computable structure theory and L p spaces

Studies in Logic and the Foundations of Mathematics

Turing's Legacy: Developments from Turing's Ideas in Logic

Computability up to homeomorphism

Degree spectra and computable dimensions in algebraic structures

Degree spectra of Polish spaces

The isometry degree of a computable copy of p1

Recursive metric spaces

Descriptive Set Theory, Mathematical Surveys and Monographs

Computability in Analysis and Physics

On degree spectra of topological spaces

Texts in Theoretical Computer Science