Computability of semicomputable manifolds in computable topological spaces
Zvonko
Iljazović
and
Igor Sušić
Abstract.
We study computable topological spaces and semicomputable and
computable sets in these spaces. In particular, we investigate
conditions under which semicomputable sets are computable. We
prove that a semicomputable compact manifold M is computable if
its boundary ∂M is computable. We also show how this
result combined with certain construction which compactifies a
semicomputable set leads to the conclusion that some noncompact
semicomputable manifolds in computable metric spaces are
computable.
1. Introduction
A real number is computable if it can be effectively approximated
by a rational number with arbitrary precision [22]. A tuple (x1,…,xn)∈Rn is computable if x1,…,xn are computable numbers. A compact subset of
Rn is computable if it can be effectively
approximated by a finite set of points with rational coordinates
with arbitrary precision [3]. Each nonempty computable
subset of Rn contains computable points, moreover
they are dense in it.
Suppose f:Rn→R is a computable
function (in the sense of [19, 24]) such that the set f−1({0}) is compact. Does f−1({0}) have to be a computable
set?
It is known that there exists a computable function
f:R→R which has zero-points and all
of them lie in [0,1], but none of them is computable
[20]. So f−1({0}) is a nonempty compact set
which contains no computable point. In particular f−1({0})
is not computable, in fact we might say it is “far away from
being computable”.
Hence for a function f:Rn→R
such that f−1({0}) is a compact set the implication
[TABLE]
does not hold in general. The question is are there any additional
assumptions under which (1) holds. It turns out that
such assumptions exist and that certain topological properties of
the set f−1({0}) play an important role in this sense.
But before explaining what are these topological properties, we
will give another view to implication (1).
A compact subset S of
Rn is semicomputable if we can effectively
enumerate all rational open sets which cover S. It turns out
that a compact subset S of Rn is semicomputable
if and only if S=f−1({0}) for some computable function
f:Rn→R. Therefore closely
related to the question under which conditions (1)
holds is the question under which conditions for S⊆Rn the following implication holds:
[TABLE]
That (2) does not hold in general we conclude from the
fact that (1) does not hold in general. However
(2) does hold under some topological conditions on
S.
In order to see what is the role of topology in view of
(2), let us first observe the simple case when S is
a line segment in R. In [17] it is given an
example of a number γ∈R such that [γ,1] is a semicomputable, but not a computable subset of
R.
On the other hand, if a and b are
computable numbers such that a<b, then [a,b] is a computable
set. So (2) does not hold in general if S is a line
segment in R, but it does hold under additional
assumption that the endpoints of S are computable.
The line segments and the arcs are the same in R, but
in higher-dimensional Euclidean spaces the arcs are much more
general than the line segments. In view of the previous fact the
following question arises: does (2) holds if S is an
arc in Rn with computable endpoints?
The answer to this question is not obvious. That the answer is
affirmative follows from the more general result of Miller
[17]: every semicomputable topological sphere in
Rn is computable and every semicomputable cell in
Rn with computable boundary sphere is computable.
Miller’s pioneer work regarding conditions under which
(2) holds shows that topology has an important role in
view of these conditions.
That these results hold in a larger class of computable metric
spaces were shown in [9]. The more general result was
later proved in [10]: (2) holds if S is a
compact manifold with computable boundary (see also [13]).
Topological properties can force a semicomputable set S to be
computable not just when S is locally Euclidean. Chainable and
circularly chainable continua are generalizations of arcs and
topological circles and it is proved that (2) holds if
S is a continuum chainable from a to b, where a and b
are computable points, or S is a circularly chainable continuum
which is not chainable [8, 12]. Certain results when the complement of S is disconnected can be found in [8, 11].
The notions of semicomputable and computable set can be
generalized to noncompact sets and it turns out that
(2) does not hold in general if S is a (noncompact)
1-manifold with computable boundary [4]. However, it
is proved that (2) holds if S is a 1-manifold with
computable boundary under additional condition that S has
finitely many connected components. Certain conditions under which
(2) holds if S is the graph of a function can be
found in [1].
On the other hand, Kihara constructed in [15], as the
answer to a question in [16], an example of
a nonempty semicomputable compact set in the plane which is simply
connected (in fact, it is contractible) and which does not contain
any computable point. There also exists a semicomputable set of a
positive measure without a computable point [21].
In Euclidean space a set is semicomputable if and only if it is
co-computably enumerable. That a set S⊆Rn
is co-computably enumerable (co-c.e.) means that its complement
Rn∖S can be effectively covered by open
balls. For example the famous Mandelbrot set is co-c.e. (see
[7]).
In this paper we put the investigation of conditions under which
(2) holds into the more general ambient space:
computable topological space. The notion of a computable
topological space is not new, for example see [26, 25]. We
will use the notion of a computable topological space which corresponds to the notion of a SCT2 space from [25] and we will investigate some of its aspects. We will
see how to each computable metric space can be naturally
associated a computable topological space and how the notions of a
semicomputable and a computable set can be easily extend to
computable topological spaces.
The central part of this paper will be the proof of the main
result, i.e. the proof of the fact that (2) holds in
any computable topological space if S is a compact manifold with
computable boundary. This will be a generalization of the result
from [10]. Although we will rely on certain ideas from
[10], the main challenge will be to adopt ideas and
techniques from [10], which depend on the metric d
in a computable metric space (X,d,α), to an ambient in
which we do not have any metric. For example, the notion that a
set S is computable up to a set T, which means that for each
k∈N we can effectively find finitely many points
x0,…,xn such that each point of S is
2−k-close to some xi and each xi is
2−k-close to some point of T, was essential in
[10] and it is not obvious how to transfer it in a
nonmetric setting. Another example is the notion of the formal
diameter of a set in a computable metric space which is a
computable analogue of the diameter of a set in a metric space and
which clearly does not make sense in a (computable) topological
space.
The generalization of the result for manifolds from
[10] to computable topological spaces does not only
show that a metric in this context is not really important, but it
also provides a possible tool for dealing with the problem of
computability of a semicomputable noncompact set S in a
computable metric space (X,d,α). Namely, using a
construction similar to the one-point compactification, we can
assign to (X,d,α) a computable topological space T in
such a way that, under this construction, S maps to a compact
set S′ in T and such that the computability of S′ in T
implies the computability of S in (X,d,α). We will see
how this gives that a semicomputable set in a computable metric
space homeomorphic to Rn (for some n) must be
computable.
It should be mentioned that the uniform version of the result from [10]
does not hold in general: there exists a
sequence (Si) of topological circles in R2
such that Si is uniformly semi-computable, but
not uniformly computable (Example 7 in [8]).
Here is how the paper is organized. In Section 2 we state some basic definitions and facts. In Section 3 we study the notion of a computable topological space and in Section 4 we examine effective separations of compact sets in computable topological spaces. In Section 5 we introduce the notion of local computable enumerability of a set as a preparation for Sections 6 and 7 in which we prove our main result: a semicomputable manifold in a computable topological space is computable if its boundary is semicomputable. In Section 8 we reduce the problem of computability of noncompact semicomputable sets in a computable metric space to the problem of computability of compact semicomputable sets in a computable topological space.
2. Computable metric spaces and preliminaries
In this section we give some basic facts about computable metric
spaces and some other preliminary facts. See [19, 24, 22, 23, 3, 2, 8].
2.1. Computable functions Nk→R
Let k∈N, k≥1. A function f:Nk→Q is said to be computable if there
exists computable (i.e. recursive) functions f0,f1,f2:Nk→N such that
[TABLE]
for each x∈Nk. A function f:Nk→R is said to be computable if there
exists a computable function F:Nk+1→Q such that
[TABLE]
for each x∈Nk and each i∈N. Of course, a function
Nk→Rn or Nk→Qn, where n∈N, n≥1,
will be called computable if its component functions are
computable.
Some elementary properties of computable functions Nk→R are stated in the following proposition.
Proposition 2.1**.**
- (i)
If f,g:Nk→R are
computable, then f+g,f−g,f⋅g:Nk→R are computable.
2. (ii)
If f:Nk→R and
F:Nk+1→R are functions such
that F is computable and ∣f(x)−F(x,i)∣<2−i for each x∈Nk and i∈N, then f is computable.
3. (iii)
If f,g:Nk→R are
computable functions, then the set {x∈Nk∣f(x)>g(x)} is computably enumerable. ∎
2.2. Computable metric spaces
A triple (X,d,α) is said to be a computable metric
space if (X,d) is a metric space and α=(αi)
is a sequence whose range is dense in (X,d) and such that the
function N2→R,
[TABLE]
is computable (see [1, 2, 23, 14]). For example, if
n≥1 and d is the Euclidean metric on Rn,
then for any computable function α:N→Rn whose range is dense in Rn we have
that (Rn,d,α) is a computable metric space.
(Such a function α certainly exists: we can take a
computable surjection α:N→Qn.)
Let us recall the notion of the Hausdorff distance. If (X,d) is
a metric space and S and T nonempty compact sets in this
space, we define their Hausdorff distance dH(S,T)
by
[TABLE]
where S≈εT means that for each x∈S there exists y∈T such that d(x,y)<ε and for
each y∈T there exists x∈S such that d(y,x)<ε.
Let (X,d,α) be a computable metric space and x∈X.
Then for each k∈N there exists i∈N
such that d(x,αi)<2−k. We say that x is a
computable point in (X,d,α) if there exists a
computable function f:N→N such that
[TABLE]
for each k∈N.
Suppose now S is a nonempty compact set in (X,d). Then the
density of α implies that for each k∈N there
exists a nonempty finite subset A of {αi∣i∈N} such that dH(S,A)<2−k. This fact naturally
leads to a definition of a computable (compact) set.
First, we will fix some effective enumeration of all nonempty finite subsets of N. To do this, we will use the following notion.
Let k,n∈N, k,n≥1, and Φ:Nk→P(Nn), where
P(Nn) denotes the power set of
Nn. We say that Φ is computably finite
valued (c.f.v.) if
[TABLE]
is a computable subset of
Nk+n and there exists a computable function φ:Nk→N such that Φ(x)⊆{0,…,φ(x)}n for each x∈Nk.
From now on, let N→P(N),
[TABLE]
be some fixed c.f.v. function whose image is the set of all nonempty finite subsets of N (such a function certainly exists). Hence, ([j])j∈N is an effective enumeration of all nonempty finite subsets of N.
Let (X,d,α) be a computable metric space. For j∈N we define
[TABLE]
Let S be a compact set in (X,d). We say that S is a
computable set in (X,d,α) if S=∅ or
there exists a computable function f:N→N such that
[TABLE]
for
each k∈N. It is not hard to conclude that this
definition does not depend on the choice of the function ([j])j∈N (see Proposition 2.3).
If (X,d,α) is a computable metric space, i∈N
and r a positive rational number, then we say that B(αi,r) is a rational open ball in (X,d,α).
Here, for x∈X and r>0, we denote by B(x,r) the open ball
of radius r centered at x, i.e. B(x,r)={y∈X∣d(x,y)<r}. A finite union of rational open balls will be called
a rational open set in (X,d,α).
Let q:N→Q be some fixed computable
function whose image is the set of all positive rational numbers
and let τ1,τ2:N→N be
some fixed computable functions such that {(τ1(i),τ2(i))∣i∈N}=N2.
Let (X,d,α) be a computable metric space. Let (λi)i∈N be the sequence of points in X defined
by λi=ατ1(i) and let (ρi)i∈N be the sequence of rational numbers defined
by ρi=qτ2(i). For i∈N we define
[TABLE]
Note that {Ii∣i∈N} is the family of all open rational balls in
(X,d,α). For j∈N we define
[TABLE]
Clearly {Ji∣i∈N} is the family of all
rational open sets in (X,d,α).
A closed set S in (X,d) is said to be computably
enumerable (c.e.) in (X,d,α) if the set {i∈N∣Ii∩S=∅} is c.e. A compact
set S in (X,d) is said to be semicomputable in
(X,d,α) if the set {j∈N∣S⊆Jj} is c.e. It is not hard to see that these definitions do not
depend on the choice of the functions q, τ1, τ2 and ([j])j∈N.
We have the following characterization of a computable set
(Proposition 2.6 in [10]):
[TABLE]
Let (X,d,α) be a computable metric space and x∈X. If
x is a computable point in (X,d,α), then there exists a
computable function f:N→N such that
(3) holds. Since for all a,b,c∈X we have
∣d(a,c)−d(b,c)∣≤d(a,b), for all i,k∈N we have
[TABLE]
and it follows from Proposition 2.1(ii)
that the function N→R, i↦d(x,αi) is computable. Thus the function
N→R, i↦d(x,λi)
is also computable. For i∈N we have
[TABLE]
and
Proposition 2.1(iii) implies that the set {i∈N∣x∈Ii} is c.e.
Conversely, if the set {i∈N∣x∈Ii} is
c.e., then the set Ω={(k,i)∈N2∣x∈Ii and ρi<2−k} is also c.e. and since for each
k∈N there exists i∈N such that
(k,i)∈Ω, there exists
a computable function f:N→N such
that (k,f(k))∈Ω for each k∈N. So
d(x,λf(k))<2−k for each k∈N and it
follows that x is a computable point. We have the following
conclusion:
[TABLE]
Let (X,d,α) be a computable metric space and let S⊆X. We say that S is a co-computably enumerable (co-c.e.) set in (X,d,α) if there exists a c.e. set A⊆N such that
[TABLE]
We say that S is a computable closed set if S is both c.e. and co-c.e.
Each computable set is a computable closed set [10]. Conversely, a computable closed set need not be computable even if it is compact. However, if (X,d,α) has the effective covering property (for the definition see [2]) and compact closed balls, then for compact sets the notions “computable” and “computable closed” coincide (Proposition 3.6 in [4]).
This in particular holds in the previously described computable metric space (Rn,d,α).
2.3. Formal properties
Let (X,d) be a metric space, x,y∈X and r,s>0. If
d(x,y)≥r+s, then B(x,r)∩B(y,s)=∅. Conversely,
if B(x,r)∩B(y,s)=∅, then inequality d(x,y)≥r+s holds if (X,d) is Euclidean space, but it does not hold in
general (for example, if d is the discrete metric).
Nevertheless, we will use this inequality (actually, the strong
inequality) to introduce certain relation of formal disjointness
between rational open balls Ii and Ij (actually
between the numbers i and j) in a computable metric space.
Similarly, if d(x,y)+s≤r, then B(y,s)⊆B(x,r), but
the converse of this statement does not hold in general. Although
this inequality does not characterize the fact that
B(y,s)⊆B(x,r), it will be useful for us in computable
metric spaces to introduce certain notion of formal inclusion.
Let (X,d,α) be a computable metric space.
Let i,j∈N. (Recall the definition
(5).) We say that Ii and Ij are
formally disjoint and write Ii⋄Ij if
[TABLE]
We say
that Ii is formally contained in Ij and write
Ii⊆FIj if
[TABLE]
The main properties of these two relations are stated in the next
proposition.
Proposition 2.2**.**
Let (X,d,α) be a computable metric space. Then the sets
[TABLE]
are
c.e. Furthermore, the following
holds:
- (1)
if i,j∈N are such that Ii⋄Ij,
then Ii∩Ij=∅;
2. (2)
if i,j∈N are such that Ii⊆FIj, then Ii⊆Ij;
3. (3)
if x,y∈X are such that x=y, then there exist
i,j∈N such that x∈Ii, y∈Ij and
Ii⋄Ij;
4. (4)
if i,j∈N and x∈Ii∩Ij, then
there exists k∈N such that x∈Ik, Ik⊆FIi and Ik⊆FIj; moreover,
if A⊆{αi∣i∈N} is a dense
set in (X,d), k can be chosen so that λk∈A;
5. (5)
if i,j∈N are such that Ii⋄Ij,
then Ij⋄Ii;
6. (6)
if i,j,k∈N are
such that Ii⊆FIj and Ij⊆FIk, then Ii⊆FIk;
7. (7)
if i,j,k∈N are such that Ik⊆FIi and
Ii⋄Ij, then Ik⋄Ij.
Proof.
It follows from the definition of Ii⋄Ij and Ii⊆FIj
and Proposition 2.1 that the sets in (8) are c.e. Furthermore,
claims (1) and (2) obviously hold.
Let us prove (3). Suppose x,y∈X, x=y. Let r=4d(x,y). Choose k∈N so that qk<r
and
u, v∈N so that
[TABLE]
There exist i, j∈N such that (u,k)=\big{(}\tau_{1}(i),\tau_{2}(i)\big{)} and (v,k)=\big{(}\tau_{1}(j),\tau_{2}(j)\big{)} and therefore (αu,qk)=(λi,ρi) and (αv,qk)=(λj,ρj). So
[TABLE]
We claim that Ii⋄Ij. Suppose the opposite. Then
d(λi,λj)≤ρi+ρj, i.e. d(αu,αv)≤2qk. We have
[TABLE]
i.e. d(x,y)<d(x,y), a contradiction. Hence
Ii⋄Ij.
Let us prove (4). Suppose i,j∈N and x∈Ii∩Ij. Then d(x,λi)<ρi and d(x,λj)<ρj. Choose v∈N such that
[TABLE]
Choose u∈N so that d(x,αu)<qv and
αu∈A.
Let k∈N be such that (αu,qv)=(λk,ρk). Then x∈Ik. Furthermore,
[TABLE]
Hence Ik⊆FIi. In the same way we get Ik⊆FIj.
Claim (5) is obvious. It is straightforward to check that (6)
holds.
We now prove (7). Suppose Ik⊆FIi and Ii⋄Ij. Since Ik⊆FIi, we have
[TABLE]
We also have ρi+ρj<d(λi,λj)≤d(λi,λk)+d(λk,λj), so ρi+ρj<d(λi,λk)+d(λk,λj) and therefore
[TABLE]
It follows from (9) and (10) that ρk<−ρj+d(λk,λj), hence Ik⋄Ij.
∎
2.4. Final remarks
The following properties of c.f.v. functions will be useful.
Proposition 2.3**.**
- (1)
If Φ,Ψ:Nk→P(Nn) are c.f.v. functions, then the
function Nk→P(Nn), x↦Φ(x)∪Ψ(x) is c.f.v.
2. (2)
If Φ:Nk→P(Nn) and Ψ:Nk→P(Nl) are c.f.v. functions,
then the function Nk→P(Nn+l), x↦Φ(x)×Ψ(x) is c.f.v.
3. (3)
If Φ,Ψ:Nk→P(Nn) are c.f.v. functions, then the sets
{x∈Nk∣Φ(x)=Ψ(x)} and {x∈Nk∣Φ(x)⊆Ψ(x)} are computable.
4. (4)
Let Φ:Nk→P(Nn) and Ψ:Nn→P(Nm) be c.f.v. functions. Let Λ:Nk→P(Nm) be
defined by
[TABLE]
x∈Nk. Then Λ is a c.f.v. function.
5. (5)
Let Φ:Nk→P(Nn) be c.f.v*.** and let T⊆Nn be c.e. Then the set S={x∈Nk∣Φ(x)⊆T} is c.e. ∎*
Let σ:N2→N
and η:N→N be some fixed computable
functions with the following property: {(σ(j,0),…,σ(j,η(j)))∣j∈N} is the set of all
finite nonempty sequences in N. We use the following
notation: (j)i instead of σ(j,i) and j
instead of η(j). Hence
[TABLE]
is the set of all
finite nonempty sequences in N.
It follows from Proposition 2.3(4) that the function N→P(N),
j↦{(j)i∣0≤i≤j} is c.f.v. Clearly, the image of this function is the set of all nonempty finite subsets of N. This means that we can take this function as an effective enumeration introduced by (4) and it will suitable for us to do so. Therefore, we assume that
[TABLE]
for each j∈N.
3. Computable topological spaces
Proposition 2.2 is a motivation for the next
definition.
Let (X,T) be a topological space and let (Ii) be
a sequences in T such that {Ii∣i∈N} is a basis for the topology T. A triple
(X,T,(Ii)) is said to be a computable
topological space (see the definition of a SCT2 space in [25]) if there exist c.e. subsets C and
D of N2 with the following properties:
- (1)
if i,j∈N are such that (i,j)∈D,
then Ii∩Ij=∅;
2. (2)
if i,j∈N are such that (i,j)∈C,
then Ii⊆Ij;
3. (3)
if x,y∈X are such that x=y, then there exist
i,j∈N such that x∈Ii, y∈Ij and
(i,j)∈D;
4. (4)
if i,j∈N and x∈Ii∩Ij, then
there exists k∈N such that x∈Ik, (k,i)∈C and (k,j)∈C.
In this case we say that C and D are
characteristic relations for (X,T,(Ii)).
Note the following: if (X,T,(Ii)) is a computable
topological space, then (X,T) is a second countable
Hausdorff space.
Let (X,d,α) be a computable metric space. Let
Td denote the topology induced by d, i.e. the
set of all open sets in (X,d). Let, for i∈N, the
set Ii be defined by (5) (for fixed functions q,
τ1 and τ2). Then {Ii∣i∈N} is a basis for the topology Td and by
Proposition 2.2 (X,Td,(Ii)) is a computable topological space; characteristic relations
are {(i,j)∈N2∣Ii⊆FIj}
and {(i,j)∈N2∣Ii⋄Ij}. We
say that (X,Td,(Ii)) is the computable
topological space associated to (X,d,α).
Let (X,T,(Ii)) be a computable topological space.
Let x∈X. We say that x is a computable point in
(X,T,(Ii)) if the set {i∈N∣x∈Ii} is c.e.
A closed set S in (X,T) is said to be
computably enumerable in (X,T,(Ii)) if
{i∈N∣Ii∩S=∅} is a c.e. set.
If (X,T,(Ii)) is a computable topological space,
then for j∈N we define Jj by
[TABLE]
Let (X,T,(Ii)) be a computable topological space
and let S be a compact set in (X,T). We say that S
is a semicomputable set in (X,T,(Ii)) if
{j∈N∣S⊆Jj} is a c.e. set. We say
that S is a computable set in (X,T,(Ii)) if S is computably enumerable and semicomputable in
(X,T,(Ii)). These definitions are easily seen to
be independent on the choice of the function ([j])j∈N.
Proposition 3.1**.**
Let (X,d,α) be a computable metric space and let
(X,Td,(Ii)) be the associated computable
topological space. Let x∈X and S⊆X. The the
following equivalences hold:
- (i)
x* computable point in (X,d,α)
⇔ x computable point in
(X,Td,(Ii));*
2. (ii)
S* c.e. set in (X,d,α) ⇔ S
c.e. set in (X,Td,(Ii));*
3. (iii)
S* semicomputable set in (X,d,α)
⇔ S semicomputable set in
(X,Td,(Ii));*
4. (iii)
S* computable set in (X,d,α)
⇔ S computable set in (X,Td,(Ii)).*
Proof.
This follows from (7) and
(6).
∎
In this paper we prove that in any computable topological space
(X,T,(Ii)) the implication
[TABLE]
holds if S is,
as a subspace of (X,T), a manifold whose boundary is
computable. By Proposition 3.1 this is a generalization
of the result from [10] for semicomputable manifolds in
computable metric spaces.
Regarding the definition of a computable topological space, the
natural question is this: if (X,T,(Ii)) is a
computable topological space, do there exist d and α
such that (X,d,α) is a computable metric space whose
associated computable topological space is (X,T,(Ii))? In the following example we get that the answer is negative:
(X,T) need not be metrizable, moreover it need not be
even regular (recall that (X,T) is always second
countable Hausdorff). The example is motivated by a classical
example of a Hausdorff space which is not regular (see
[5]).
Example 3.2**.**
Let c∈R∖Q be a computable number.
Let β:N→Q be a computable
surjection and let γ:N→R be
defined by γ(i)=c+β(i). Then γ is a
computable function.
Let α:N→R be defined by
[TABLE]
Then α is a computable function and {αi∣i∈N}=Q∪(c+Q).
Let X=Q∪(c+Q) and let d be the
Euclidean metric on X. Then (X,d,α) is a computable
metric space. Let the sequences (λi), (ρi)
and (Ii) for this computable metric space be defined in the
standard way. For i∈N we define
[TABLE]
Let D={(i,j)∈N2∣Ii⋄Ij}. Then D is
a c.e. set and (i,j)∈D clearly implies Bi∩Bj=∅.
Suppose x,y∈X are such that x=y. Then there exists
i,j∈N such that x∈Bi, y∈Bj and
(i,j)∈D. Namely, choose a positive rational number
r such that 2r<d(x,y) and choose i,j∈N such that
(x,r)=(λi,ρi) and (y,r)=(λj,ρj). Then i and j are the desired numbers.
Let
[TABLE]
In general, if f,g:Nk→Q are computable functions, then the set {x∈Nk∣f(x)=g(x)} is computable. Therefore the sets
{(i,j)∈N2∣βi=βj} and
{(i,j)∈N2∣γi=γj} are
computable and it follows that the set {(i,j)∈N2∣αi=αj} is computable.
The set {i∈N∣αi∈Q} is
also computable and since λi=ατ1(i)
for each i∈N we conclude that C is a
c.e. set.
If (i,j)∈C, then obviously Bi⊆Bj.
Suppose now that i,j∈N and x∈Bi∩Bj.
We claim that there exists k∈N such that x∈Bk, (k,i)∈C and (k,j)∈C. We have two
cases.
- Case 1
: x=λi or x=λj.
Then x∈Q and x∈Ii∩Ij. By
Proposition 2.2(4) there exists k∈N such that x∈Ik, Ik⊆FIi,
Ik⊆FIj and λk∈Q. It
follows x∈Bk, (k,i)∈C and (k,j)∈C.
2. Case 2
: x=λi=λj. Choose a positive
rational number r such that r<ρi and r<ρj.
Let k∈N be such that (x,r)=(λk,ρk). Then Ik⊆FIi and Ik⊆FIj and we conclude that x∈Bk, (k,i)∈C and (k,j)∈C.
In particular, we have the following conclusion: if i,j∈N and x∈Bi∩Bj, then there exists k∈N such that x∈Bk, Bk⊆Bi and
Bk⊆Bj. This, together with the obvious fact
that X=⋃i∈NBi, implies that there
exists a (unique) topology T on X such that {Bi∣i∈N} is a basis for T.
Then the triple (X,T,(Ii)) is a computable
topological space: its characteristic relations are C
and D.
We claim that the topological space (X,T) is not
regular. We have that Q is the union of all Bi
such that λi∈Q. Therefore Q∈T and therefore c+Q is a closed set in
(X,T). Clearly 0∈/c+Q.
Suppose (X,T) is regular. Then there exist disjoint
sets U,V∈T such that 0∈U and c+Q⊆V. It follows that there exists i∈N such
that 0∈Bi⊆U. Hence 0∈Ii∩Q⊆U. So there exists an open interval K in
R such that
[TABLE]
Choose x∈Q such that
c+x∈K. Since c+x∈V, there exists j∈N such
that c+x∈Bj⊆V and we conclude that there exists
an open interval L in R such that c+x∈L and
L∩Q⊆V. This and (12) imply (K∩L)∩Q=∅. But this is impossible since
c+x∈K∩L: if two open intervals have a common point, then
they have a common rational point.
So (X,T) is not regular.
Suppose (X,T,(Ii)) is a computable topological
space and C and D are its characteristic
relations such that, beside the properties (1)–(4) from the
definition of characteristic relations, the following additional
properties hold:
- (5)
if i,j∈N are such that (i,j)∈D, then (j,i)∈D;
2. (6)
(i,i)∈C for each i∈N and
if i,j,k∈N are such that (i,j)∈C and
(j,k)∈C, then (i,k)∈C;
3. (7)
if i,j,k∈N are such that (k,i)∈C and (i,j)∈D, then (k,j)∈D.
Then we say that C and D are
proper characteristic relations for
(X,T,(Ii)).
Every computable topological space has proper characteristic
relations. This is the contents of the following proposition.
Proposition 3.3**.**
Let (X,T,(Ii)) be a computable topological space.
Then there exist proper characteristic relations for
(X,T,(Ii)).
Proof.
We first show that there exist characteristic relations for
(X,T,(Ii)) which satisfy properties (5) and (6)
above.
Let C and D be characteristic relations
for (X,T,(Ii)). We define
[TABLE]
and we define C′ as the set of all
(i,j)∈N2 for which there exist n∈N
and a0,…,an∈N such that i=a0 ,
j=an and (al,al+1)∈C for each l<n.
Clearly, D′ is c.e. On the other hand, the set
[TABLE]
is c.e. (recall the notation from Subsection 2.4) by
Proposition 2.3(5) since Ω={a∈N∣Φ(a)⊆C}, where Φ:N→P(N2) is the c.f.v. function defined by
Φ(a)={((a)l,(a)l+1)∣l<a}
(Proposition 2.3(4)). We have
[TABLE]
and therefore
C′ is c.e.
If i,j∈N are such that (i,j)∈D′, then
clearly Ii∩Ij=∅ and if (i,j)∈C′, then Ii⊆Ij. Since
D⊆D′ and C⊆C′, properties (3) and (4) from the definition of
characteristic relations are also satisfied for C′ and
D′. Hence these are characteristic relations for
(X,T,(Ii)). It is immediate from their definitions
that D′ is symmetric and C′ is reflexive
and transitive, so properties (5) and (6) above are satisfied.
Suppose now that we have characteristic relations C
and D for (X,T,(Ii)) which satisfy (5)
and (6). We define
[TABLE]
It is
easy to check that C and D′ are proper
characteristic relations for (X,T,(Ii)).
∎
4. Effective separation of compact sets
In this section
let (X,T,(Ii)) be some fixed computable
topological space and let C and D be its
proper characteristic relations.
Lemma 4.1**.**
Suppose n∈N, i0,…,in∈N
and x∈Ii0∩⋯∩Iin. Then there exists
k∈N such that x∈Ik and (k,i0),…,(k,in)∈C.
Proof.
Using reflexivity and transitivity of C and property
(4) from the definition of a computable topological space, this
follows easily by induction.
∎
Let i,a∈N. We say that Ii is
C-contained in Ja and write Ii⊆CJa if there exists j∈[a] such
that (i,j)∈C. Obviously Ii⊆CJa implies Ii⊆Ja.
Let a,b∈N. We say that Ja is
C-contained in Jb and write Ja⊆CJb if Ii⊆CJb for each i∈[a]. If Ja⊆CJb, then clearly Ja⊆Jb. Note
also that Ja⊆CJa for each a∈N.
Proposition 4.2**.**
Suppose K is a nonempty compact set in (X,T) and
a,b∈N are such that K⊆Ja∩Jb.
Then there exists c∈N such that K⊆Jc,
Jc⊆CJa and Jc⊆CJb.
Proof.
Let x∈K. Then there exists i∈[a] and j∈[b] such
that x∈Ii∩Ij. By definition of computable
topological space, there exists k∈N such that x∈Ik and (k,i),(k,j)∈C.
So for each x∈K there exists kx∈N such that
x∈Ikx, Ikx⊆CJa and
Ikx⊆CJb. Since {Ikx∣x∈K} is an open cover of K, there exists n∈N
and x0,…,xn∈K such that
[TABLE]
Choose c∈N such
that [c]={kx0,…,kxn}. Then K⊆Jc, Jc⊆CJa and Jc⊆CJb.
∎
If a,b,c∈N are such that Ja⊆CJb and Jb⊆CJc,
then the transitivity of C easily gives
Ja⊆CJc. Using this, we get the
following consequence of Proposition 4.2.
Corollary 4.3**.**
Let K be a nonempty compact set in (X,T), n∈N and a0,…,an∈N such that
K⊆Ja0∩⋯∩Jan. Then there
exists c∈N such that K⊆Jc and
Jc⊆CJa0, …, Jc⊆CJan.
Let i,a∈N. We say that Ii and Ja are
D-disjoint and write Ii⋄DJa if (i,j)∈D for each j∈[a]. Note that Ii⋄DJa implies
Ii∩Ja=∅.
Lemma 4.4**.**
Suppose K is a nonempty compact set in (X,T) and
x∈X∖K. Then there exist i,a∈N such
that x∈Ii, K⊆Ja and Ii⋄DJa.
Proof.
Let y∈K. Since x=y, by definition of computable
topological space there exist iy,jy∈N such
that x∈Iiy, y∈Ijy and (iy,jy)∈D. We have that {Ijy∣y∈K} is an open
cover of K and therefore there exist n∈N and
y0,…,yn∈K such that
[TABLE]
On the other hand, x∈Iiy0∩⋯∩Iiyn and by Lemma
4.1 there exists k∈N such that x∈Ik and (k,iy0),…,(k,iyn)∈C.
Since (iy0,jy0),…,(iyn,jyn)∈C, by property (7) from the definition of proper
characteristic relations we have
[TABLE]
Choose a∈N so that [a]={jy0,…,jyn}. Then K⊆Ja by (13) and
Ik⋄DJa by (14). Since
x∈Ik, this proves the lemma.
∎
Let a,b∈N. We say that Ja and Jb are
D-disjoint and write
Ja⋄DJb if (i,j)∈D for
all i∈[a] and j∈[b]. Clearly,
Ja⋄DJb if and only if Ii⋄DJb for each i∈[a]. Note that
Ja⋄DJb implies Ja∩Jb=∅.
The following Lemma is a consequence of property (7) from the
definition of proper characteristic relations.
Lemma 4.5**.**
Let i,a,b,c,d∈N.
- (i)
If Ii⋄DJa and
Jb⊆CJa, then Ii⋄DJb;
2. (ii)
If Jc⋄DJa and
Jb⊆CJa, then Jc⋄DJb.
3. (iii)
If Jc⋄DJa,
Jb⊆CJa and Jd⊆CJc then Jd⋄DJb.
Lemma 4.6**.**
Let K and L be nonempty disjoint compact sets in
(X,T). Then there exists a,b∈N such that
K⊆Ja, L⊆Jb and Ja⋄DJb.
Proof.
Let x∈K. By Lemma 4.4 there exist
ix,cx∈N such that x∈Iix,
L⊆Jcx and
Iix⋄DJcx. Compactness of K
implies that there exist x0,…,xn∈K such that
[TABLE]
We have
L⊆Jcx0∩⋯∩Jcxn and by
Corollary 4.3 there exists b∈N such
that L⊆Jb and Jb⊆CJcx0, …, Jb⊆CJcxn. We have Iix0⋄DJcx0, …, Iixn⋄DJcxn and Lemma 4.5(i)
implies that
[TABLE]
If we choose a∈N such that [a]={ix0,…,ixn}, then
we have K⊆Ja, L⊆Jb and
Ja⋄DJb.
∎
Theorem 4.7**.**
Let F be a finite family of nonempty compact sets in
(X,T). Let A be a finite subset of N.
Then for each K∈F we can select iK∈N so that the following hold:
- (i)
K⊆JiK* for each K∈F;*
2. (ii)
if K,L∈F are such that K∩L=∅, then JiK⋄DJiL;
3. (iii)
if K∈F and a∈A are such that
K⊆Ja, then JiK⊆CJa.
Proof.
Let us first notice that each compact set in
(X,T) is contained in some Jj.
Let K,L∈F. By Lemma 4.6 there exist
u(K,L),v(K,L)∈N such that K⊆Ju(K,L), L⊆Jv(K,L) and such that
[TABLE]
Let K∈F. Observe the numbers u(K,L) and
v(L,K), where L∈F, and the numbers a∈A
such that K⊆Ja. There are only finitely many such
numbers and so by Corollary 4.3 there exists
iK∈N such that K⊆JiK and
JiK⊆CJu(K,L) for each L∈F, JiK⊆CJv(L,K) for
each L∈F and JiK⊆CJa for each a∈A such that K⊆Ja.
Then the numbers iK, K∈F, are the required
numbers. Properties (i) and (iii) clearly hold and if K,L∈F are such that K∩L=∅, then from
JiK⊆CJu(K,L),
JiL⊆CJv(K,L) and
(15) we get
JiK⋄DJiL (Lemma
4.5(iii)).
∎
Proposition 4.8**.**
Let
[TABLE]
[TABLE]
*Then Ω1, Ω2,
Γ1 and Γ2 are c.e. sets.
*
Proof.
Let i,a∈N. We have
[TABLE]
The set {(j,a)∈N2∣j∈[a]} is computable and so Ω1 is c.e.
The function Φ:N2→P(N2) defined by Φ(a,b)=[a]×{b} is c.f.v. by Proposition 2.3(2). For all a,b∈N we have
[TABLE]
and it
follows from Proposition 2.3(5) that Ω2 is c.e.
In a similar way we get that Γ1 and Γ2 are
c.e.
∎
5. Local computable enumerability
Let (X,T,(Ii)) be a computable topological space and
let A and S be subsets of X such that A⊆S. We
say that A is computably enumerable up to S in
(X,T,(Ii)) if there exists a c.e. subset Ω of
N such that for each i∈N the following
implications hold:
[TABLE]
[TABLE]
Note the following: if S is a closed set in (X,T),
then S is c.e. in (X,T,(Ii)) if and only if S
is c.e. up to S in (X,T,(Ii)).
Proposition 5.1**.**
Let (X,T,(Ii)) be a computable topological space and
let A0,…,An, S0,…,Sn be subsets of
X such that Ai is c.e. up to Si for each i∈{0,…,n}. Then A0∪⋯∪An is c.e. up
to S0∪⋯∪Sn. In particular, if A0,…An are c.e. up to a set S, then A0∪⋯∪An is c.e. up to S.
Proof.
Let Ω0,…,Ωn be c.e. subsets of
N such that for each j∈{0,…,n} and each
i∈N the following implications hold:
[TABLE]
Then for
each i∈N we have
[TABLE]
and
[TABLE]
The set Ω0∪⋯∪Ωn is c.e. and the claim follows.
∎
Let (X,T,(Ii)) be a computable topological space and
S⊆X. Let x∈S.
We say that S is computably enumerable at
x in (X,T,(Ii))
if there exists a neighborhood N of x in S
such that N is c.e. up to S. We say that S is
locally computably enumerable in (X,T,(Ii))
if S is c.e. at x for each x∈S.
Each c.e. set in (X,T,(Ii)) is clearly locally
c.e.
Proposition 5.2**.**
Let (X,T,(Ii)) be a computable topological space and
let S be a locally c.e. set in (X,T,(Ii)) such
that S is compact in (X,T). Then S is c.e. in
(X,T,(Ii)).
Proof.
For each x∈S let Nx be a neighborhood of x in S such
that Nx is c.e. up to S. The sets Nx, x∈S, are
not necessarily open in S, but their interiors (in S) form an
open cover of S and since S is compact, there exist x0,…,xn∈S such that
[TABLE]
Each of the sets Nx0, …, Nxn is c.e. up to
S and it follows from Proposition 5.1 and
(16) that S is c.e. up to S. So S is
c.e. (it is closed since it is compact and (X,T) is
Hausdorff).
∎
6. Semicomputable manifolds
In this section let n∈N∖{0} be fixed.
For i∈{1,…,n} let
[TABLE]
We will use the
following nontrivial topological fact (see Theorem 5.1 in
[10], Corollary 3.2 in [9] and Theorem
1.8.1 in [6]).
Theorem 6.1**.**
Suppose U1,…,Un and V1,…,Vn are open
subsets of Rn such that
[TABLE]
for each i∈{1,…,n}. Then
[TABLE]
Lemma 6.2**.**
Let (X,T,(Ii)) be a computable topological space
and S a semicomputable set in this space.
- (i)
Let m∈N. The set S∖Jm is
semicomputable in (X,T,(Ii)).
2. (ii)
Let k∈N∖{0}. The set
{(j1,…,jk)∈Nk∣S⊆Jj1∪⋯∪Jjk} is c.e.
Proof.
Claim (i) can be proved in the same way as Lemma 3.3 in
[10]. For (ii), it is enough to prove that there exists
a computable function φ:Nk→N such that Jj1∪⋯∪Jjk=Jφ(j1,…,jk) for all j1,…,jk∈N. For this, it is enough to prove that there
exists a computable function φ:N2→N such that Ja∪Jb=Jφ(a,b) for all
a,b∈N. The function N2→P(N), (a,b)↦[a]∪[b] is c.f.v. (Proposition 2.3(1)) and for all
a,b∈N there exists c∈N such that
[a]∪[b]=[c]. The set {(a,b,c)∈N3∣[a]∪[b]=[c]} is computable (Proposition 2.3(3)) and
therefore for all a,b∈N we can effectively find
c∈N such that [a]∪[b]=[c].
∎
In this paper we seek for conditions under which a semicomputable
set is computable. Equivalently, we seek for conditions under
which a semicomputable set is c.e. The next theorem is one of the
main results of the paper. It gives a sufficient condition that a
semicomputable set is c.e. at some point.
Theorem 6.3**.**
Let (X,T,(Ii)) be a computable topological space, let
S be a semicomputable set in this space and let x∈S.
Suppose that there exists a neighborhood of x in S which is
homeomorphic to some Rn. Then S is c.e. at x.
Proof.
Let N be a neighborhood of x in S which is homeomorphic to
Rn. We may assume that N is open in S (as in
the proof of Theorem 5.6 in [10]). Let
f:Rn→N be a homeomorphism. We may also
assume that f(0)=x.
For a,b∈R we will denote by ⟨a,b⟩
the open interval {x∈R∣a<x<b}. The set
f(⟨−4,4⟩n) is open in N and
therefore it is open in S. It follows that S∖f(⟨−4,4⟩n) is compact (it is closed in the
compact set S). This set is clearly disjoint with the compact
set f([−2,2])n and Lemma 4.6 implies that there
exists m0∈N such that
[TABLE]
Let S′=S∖Jm0. By Lemma 6.2(i) S′
is semicomputable in (X,T,(Ii)) and we have
[TABLE]
Let i∈{1,…,n}. The sets Ai, Bi, Ci and
Di (defined at the begin of this section) are clearly compact
in Rn and we have Ai∩Di=∅,
Bi∩Ci=∅. Therefore f(Ai), f(Bi),
f(Ci) and f(Di) are compact in (X,T) and
f(Ai)∩f(Di)=∅, f(Bi)∩f(Ci)=∅. By Lemma 4.6 there exist di, ci∈N such that
[TABLE]
[TABLE]
Choose a computable function φ:N→N such that Ii=Jφ(i) for each i∈N (such a function certainly exists).
Let us assume that l∈N is such that
[TABLE]
Then there exists v∈[−1,1]n, v=(v1,…,vn), such
that f(v)∈Il and so v∈f−1(Il). Since
f−1(Il) is open in Rn, there exists
ϵ>0 such that
[TABLE]
We may assume ϵ<1. Let E=[v1−ϵ,v1+ϵ]×…×[vn−ϵ,vn+ϵ].
By (20) we have
f(E)⊆Il, i.e.
[TABLE]
For i∈{1,…,n} let
[TABLE]
[TABLE]
Note that
[TABLE]
for each i∈{1,…,n}. Furthermore
[TABLE]
and so
[TABLE]
For each i∈{1,…,n} we have A~i∩B~i=∅, thus
[TABLE]
By (22) for each i∈{1,…,n} we have f(A~i)⊆f(Ci) and f(B~i)⊆f(Di) which,
together with (18) and (19), gives
[TABLE]
The sets f(A~1),…,f(A~n),f(B~1),…,f(B~n),f(E) are nonempty and compact in (X,T). By Theorem 4.7,
(24), (25) and (21) there
exist numbers a1,…,an,b1,…,bn,e∈N such that for each i∈{1,…,n}
[TABLE]
[TABLE]
It follows from (17) and (23) that
[TABLE]
We have proved the following: if l∈N is such that
Il∩f([−1,1]n)=∅, then there exist a1,…,an,b1,…,bn,e∈N such that
- (1)
Jai⊆CJci for each i∈{1,…,n};
2. (2)
Jbi⊆CJdi for each i∈{1,…,n};
3. (3)
Je⊆CJφ(l)
4. (4)
Jai⋄DJbi for each i∈{1,…,n}
5. (5)
S′⊆Ja1∪Jb1∪…∪Jan∪Jbn∪Je.
Let Γ be the set of all (l,a1,…,an,b1,…,bn,e)∈N2n+2 such that (1) - (5) hold.
Furthermore, let Ω be the set of all l∈N for
which there exist a1,…,an,b1,…,bn,e∈N such that
[TABLE]
Note that for each l∈N we have the
following implication
[TABLE]
Using Proposition 4.8 and Lemma 6.2(2) we
easily conclude that Γ is a c.e. set as the intersection
of finitely many c.e. sets. It follows that Ω is also
c.e.
We now prove the following: if l∈Ω, then Il∩S=∅.
Suppose l∈Ω. Then there exist a1,…,an,b1,…,bn,e∈N such that
(l,a1,…,an,b1,…,bn,e)∈Γ.
So, for the numbers l,a1,…,an,b1,…,bn,e
statements (1)–(5) hold.
Since f([−2,2]n)⊆S′, by (5) we have
[TABLE]
and it follows
[TABLE]
Let i∈{1,…,n}. It follows from (1) and
(18) that Jai∩f(Bi)=∅ and therefore
[TABLE]
Similarly, from (2) and (19) we get
[TABLE]
By (4) we have
[TABLE]
The sets f−1(Ja1),…,f−1(Jan),f−1(Jb1),…,f−1(Jbn) are open in R. It follows from
(27), (28),
(29) and Theorem 6.1 that
[TABLE]
This and (26) give
[TABLE]
So f([−2,2]n)∩Je=∅ and (3) implies
f([−2,2]n)∩Jφ(l)=∅. Hence Il∩f([−2,2]n)=∅ and therefore Il∩S=∅.
We have proved that for each l∈N the following
implications hold:
- i)
Il∩f([−1,1]n)=∅⇒l∈Ω
2. ii)
l∈Ω⇒Il∩S=∅.
Since f([−1,1]n) is a neighborhood of x u S, this proves
the theorem.
∎
Let n∈N∖{0}. A
topological space X is said to be an n–manifold if
each point x∈X has a neighborhood in X which is
homeomorphic to Rn.
Theorem 6.4**.**
Let (X,T,(Ii)) be a computable topological space and
let S be a semicomputable set in this space which is, as a
subspace (X,T), a manifold. Then S is a computable
set in (X,T,(Ii)).
Proof.
By Theorem 6.3 S is locally c.e. By Proposition
5.2 S is c.e. So S is computable.
∎
7. Semicomputable manifolds with computable boundaries
For n∈N∖{0} let
[TABLE]
and
[TABLE]
A
topological space X is said to be an
n–manifold with boundary if for each x∈X there
exists a neighborhood N of x in X such that one of the
following holds:
- (1)
N is homeomorphic to Rn;
2. (2)
there
exists a homeomorphism f:Hn→N such that x∈f(BdHn).
If X is an n–manifold with boundary, we define ∂X
to be the set of all x∈X such that x has a neighborhood
N with property (2). We say that ∂X is the
boundary of the manifold X.
Each manifold is clearly a manifold with boundary. Conversely, if
X is a manifold with boundary and ∂X=∅, then
X is a manifold.
It can be shown (see [18]) that if a point x in a
topological space X has a neighborhood which satisfies (1), then
it cannot have a neighborhood which satisfies (2). So a manifold
with boundary X is a manifold if and only if ∂X=∅.
In order to prove that a semicomputable manifold S with
computable boundary is computable, we will need Theorem
6.3, but we will also need an analogue of this
theorem which deals with points from ∂S (Theorem
7.2). First, we have a lemma.
Lemma 7.1**.**
Let n∈N∖{0}. For i∈{1,…,n} let
[TABLE]
For i∈{1,…,n−1} let
[TABLE]
and let
[TABLE]
Then there exist no open subsets U1,…,Un,V1,…,Vn of Hn such that
[TABLE]
for each i∈{1,…,n} and such that
[TABLE]
Proof.
Suppose the opposite, i.e. suppose that there exist sets
U1,…,Un,V1,…,Vn with the above properties.
Let f:R→[0,∞⟩ be defined by
[TABLE]
Let γ:Rn→Hn be defined by
[TABLE]
Since f is continuous, γ is also continuous. We
have
[TABLE]
From this and (31) it follows
[TABLE]
By (30) for each i∈{1,…,n} we have
[TABLE]
For i∈{1,…,n} let
[TABLE]
Let i∈{1,…,n}. We have
[TABLE]
Since Ui∩Bi=∅, we have Ui∩γ(B~i)=∅ and consequently
[TABLE]
Also Vi∩Ai=∅ implies
[TABLE]
Since γ is continuous, the sets γ−1(U1),…,γ−1(Un),γ−1(V1),…,γ−1(Vn) are open in Rn.
This, together with (32), (33), (34) and (35) contradicts Theorem
6.1.
∎
Theorem 7.2**.**
Let (X,T,(Ii)) be a
computable topological space. Let S and T be semicomputable
sets in this space such that T⊆S and let x∈S.
Let us suppose that there exists a neighborhood N of x in S
and a homeomorphism f:Hn→N (for some n∈N) such that
[TABLE]
Then S is c.e. at x.
Proof.
It is known that each open ball in Hn (with respect to
the Euclidean metric on Hn) centered at a point in
BdHn is homeomorphic to Hn. Therefore,
we may assume that N is an open neighborhood of x in S.
We may also assume that x=f(0,…,0).
As in the proof of Theorem 6.3 we conclude that the
set S∖f(⟨−4,4⟩n−1×[0,4⟩) is compact in (X,T). The set f([−2,2]n−1×[0,2]) is also compact in (X,T). These two
sets are disjoint and Lemma 4.6 implies that there
exists m0∈N such that
[TABLE]
Let
[TABLE]
[TABLE]
By Lemma 6.2(i) the sets S′ and T′ are
semicomputable. We have
[TABLE]
For i∈{1,…,n−1} let
[TABLE]
and let
[TABLE]
These sets are clearly compact in Hn. Therefore,
the sets f(Ai), f(Bi), f(Ci), f(Di), for i∈{1,…,n−1}, and f(Cn) and f(Bn) are compact in (X,T). Moreover, for each i∈{1,…,n−1} we
have f(Ai)∩f(Di)=∅ and f(Bi)∩f(Ci)=∅. Also f(Bn)∩f(Cn)=∅.
By Lemma 4.6 for each i∈{1,…,n−1}
there exist di, ci∈N such that
[TABLE]
[TABLE]
and there exists cn∈N such that
[TABLE]
Let φ:N→N be a computable
function such that Ii=Jφ(i) for each i∈N.
Suppose l∈N is such that
[TABLE]
Then
[TABLE]
and since f−1(Il) is
open in Hn we may choose v∈[−1,1]n−1×[0,1], v=(v1,…,vn), such that vn>0 and v∈f−1(Il). The fact that f−1(Il) is open
implies that there exists ϵ>0 such that ϵ<vn
and
[TABLE]
Let
[TABLE]
So E⊆f−1(Il) and f(E)⊆Il.
For i∈{1,…,n} let
[TABLE]
For each i∈{1,…,n−1} we have
[TABLE]
Furthermore, we have
[TABLE]
and so
[TABLE]
For each i∈{1,…,n} we have f(A~i)∩f(B~i)=∅ since A~i∩B~i=∅.
Let i∈{1,…,n−1}. It follows from (42) that f(A~i)⊆f(Ci) and
f(B~i)⊆f(Di) and so (38) and (39) imply
[TABLE]
By (42) we have f(A~n)⊆f(Cn) and from (40) we get
f(A~n)⊆Jcn.
We have
[TABLE]
Hence
[TABLE]
Let
[TABLE]
Since An⊆BdHn, we have
[TABLE]
So f(An)⊆T. Furthermore f(An)∩Jm0=∅ by (36).
Therefore f(An)⊆T∖Jm0, i.e.
[TABLE]
In particular, T′ is a nonempty set. It follows from (44) and Lemma 4.6 that there exist
dn,t∈N such that f(B~n)⊆Jdn, T′⊆Jt and such that
Jdn⋄DJt.
The sets A~1,…,A~n,B~1,…,B~n,E are nonempty and compact in Hn.
Consequently, the sets f(A~1),…,f(A~n),f(B~1),…,f(B~n),f(E) are
nonempty and compact in (X,T). Since f(E)⊆Il, we have f(E)⊆Jφ(l).
By Theorem 4.7 there exist a1,…,an,b1,…,bn,e∈N such that for each i∈{1,…,n} the following holds:
[TABLE]
Since Jbn⊆CJdn and
Jdn⋄DJt, we have
Jbn⋄DJt.
It follows from (37) and (43) that
[TABLE]
hence
[TABLE]
Let us summarize. If l∈N is such (41)
holds, then there exist a1,…,an, b1,…,bn,
e, t∈N such that
-
Jai⊆CJci\mboxforeachi∈{1,…,n}
2. 2)
Jbi⊆CJdi\mboxforeachi∈{1,…,n−1}
3. 3)
Je⊆CJφ(l)
4. 4)
Jai⋄DJbi\mboxforeachi∈{1,…,n}
5. 5)
T′⊆Jt
6. 6)
Jbn⋄DJt
7. 7)
S′⊆Ja1∪Jb1∪…∪Jan∪Jbn∪Je.
Let Γ be the set of all (l,a1,…,an,b1,…,bn,e,t)∈N2n+3 such that 1) - 7) hold.
Furthermore, let Ω be the set of all l∈N for
which there exist a1,…,an, b1,…,bn, e, t∈N such that (l,a1,…,an, b1,…,bn,
e, t)∈Γ. We have proved the following:
[TABLE]
Suppose now that l∈Ω. Let us prove that
[TABLE]
Since l∈Ω, there exist a1,…,an, b1,…,bn, e, t∈N such that (l,a1,…,an, b1,…,bn, e, t)∈Γ. So, for the
numbers l,a1,…,an, b1,…,bn, e, t the
statements 1) - 7) hold. By (37) and
7) we have
[TABLE]
and it follows
[TABLE]
Let i∈{1,…,n}. Then Jai⊆Jci by
- and it follows from (38) and
(40) that Jai∩f(Bi)=∅. Therefore
[TABLE]
Let i∈{1,…,n−1}. It follows from 2) and (39) that Jbi∩f(Ai)=∅ which
gives
[TABLE]
By (45), 5) and 6) we have Jbn∩f(An)=∅. Thus
[TABLE]
Statement 4) implies that
[TABLE]
for each i∈{1,…,n}. The sets
f−1(Ja1),…,f−1(Jan),f−1(Jb1),…,f−1(Jbn) are
clearly open in Hn. From (48), (49), (50) and Lemma 7.1 we conclude that
[TABLE]
From this and (47) we get
[TABLE]
Hence Je∩f([−2,2]n−1×[0,2])=∅
which, together with 3) and Jφ(l)=Il, gives
[TABLE]
This clearly implies (46).
We have proved that for each l∈N the following
implications hold:
- i)
Il∩f([−1,1]n−1×[0,1])=∅⇒l∈Ω
2. ii)
l∈Ω⇒Il∩S=∅.
It is easy to conclude that Ω is a c.e. set. So, by i)
and ii), the set f([−1,1]n−1×[0,1]) is c.e. up to
S. Clearly f([−1,1]n−1×[0,1]) is a neighborhood of
x in S. Hence S is c.e. at x.
∎
The following theorem is a generalization of Theorem
6.4.
Theorem 7.3**.**
Let (X,T,(Ii)) be a
computable topological space, let n∈N∖{0} and let S be a semicomputable set in (X,T,(Ii))
which has the following property: S is, as a subspace of
(X,T), an n–manifold with boundary and ∂S
is a semicomputable set in (X,T,(Ii)). Then S is
a computable set.
Proof.
Since S is compact, it suffices to prove that S is locally
c.e.
Let x∈S. Then one of the following holds:
-
There exists a neighborhood of x in S which is
homeomorphic to Rn.
2. 2)
There exists a
neighborhood N of x in S and a homeomorphism f:Hn→N such that
x∈f(BdHn).
If 1) holds, then S is c.e. at x by Theorem 6.3.
Suppose that 2) holds. We may assume that N is an open
neighborhood of x. It is easy to conclude (see the proof of
Theorem 6.1 in [10]) that
[TABLE]
Now Theorem 7.2 implies that S is c.e. at
x.
So S is locally c.e. and the claim of the theorem follows.
∎
8. Compactification and semicomputability
If (X,d) is a metric space, for x∈X and r>0 by
B^(x,r) we denote the closed ball in (X,d) of radius r
centered in x, i.e. B^(x,r)={y∈X∣d(y,x)≤r}.
Let (X,d,α) be a computable metric space. If p∈N and r is a positive rational number, then we say
that B^(αp,r) is a rational closed ball
in (X,d,α). For i∈N we define
[TABLE]
(recall the definition
(5)). Then {I^i∣i∈N} is the
family of all rational closed balls in (X,d,α).
Semicomputable (compact) sets in a computable metric space can be
characterized in the following way (see Proposition 3.1 in
[4]).
Proposition 8.1**.**
Let (X,d,α) be a computable metric space and let S be a
compact set in (X,d). Then S is semicomputable in (X,d,α) if and only if S∩B is a compact set for each closed ball
B in (X,d) and the set {(i,j)∈N2∣I^i∩S⊆Jj} is c.e.
Using this proposition, we extend the notion of a semicomputable
set in a computable metric space to noncompact sets.
Let (X,d,α) be a computable metric space and let S be a
subset of X (possibly noncompact). We say that S is
semicomputable in (X,d,α) if the following holds
(see the definition of a semi-c.c.b. set in [4]):
- (i)
S∩B is a compact set for each closed ball B in
(X,d);
2. (ii)
the set {(i,j)∈N2∣I^i∩S⊆Jj} is c.e.
For a compact set S this definition, by Proposition
8.1, coincides with the earlier definition of a
semicomputable set.
Condition (i) easily implies that each semicomputable set is
closed.
In view of equivalence (6) we extend the
notion of a computable set. If (X,d,α) is a computable
metric space and S⊆X, then we say that S is
computable if S is c.e. and semicomputable.
As before, we have that each computable set is a computable closed set (recall the definition of a computable closed set from Section 2).
In computable metric spaces which have the effective covering property and compact closed balls, the notions “computable set” and “computable closed set” coincide [4].
Now it makes sense to ask does the implication
[TABLE]
hold for
noncompact manifolds S (in a computable metric space)? In
general, the answer is negative. It is not hard to construct a
semicomputable 1-manifold in R2 which is not
computable (see [4]). On the other hand, if S is a
1-manifold such that S has finitely many connected components,
then (51) holds [4].
A general idea how to deal with the case when S is noncompact
could be to apply certain construction which changes the ambient
space and which turns S into a compact set (keeping the
semicomputability of S). This construction, which is similar to
a compactification of a space, leads to a new ambient space which
is not a metric space, but a topological space and this is where
the concept of a computable topological space will be applied.
Let us recall the notion of a one-point compactification. Suppose
(X,T) is a topological space and Y=X∪{∞},
where ∞∈/X. Let
[TABLE]
Then (Y,S) is a compact topological space called a
one-point compactification of (X,T).
Following the idea from this definition, we are going to use the
following construction. Suppose (X,d,α) is a computable
metric space and Y=X∪{∞}, where ∞∈/X.
Let
[TABLE]
It is straightforward to check that (Y,S) is a
topological space and that (X,Td) is a subspace of
(Y,S). For i∈N let
[TABLE]
We say that the triple (Y,S,(Bi)i∈N) is a pseudocompactification of the
computable metric space (X,d,α).
We claim that (Y,S,(Bi)i∈N) is a
computable topological space. First, we have the following lemma.
Lemma 8.2**.**
Let (X,d,α)
be a computable metric space.
- (i)
Let x∈X and i∈N be such that x∈/I^i. Then there exists j∈N such that
x∈Ij and Ij⋄Ii.
2. (ii)
Let i,j∈N. Then there exists k∈N such that
Ii⊆FIk and Ij⊆FIk.
Proof.
(i) Since x∈/I^i, we have ρi<d(x,λi). Choose a positive rational number r such that ρi+2r<d(x,λi) and choose k∈N so
that
[TABLE]
Then
[TABLE]
Indeed, if d(αk,λi)≤r+ρi, then
[TABLE]
a contradiction.
Choose l∈N so that (αk,r)=(λj,ρj). Then, by (53), we have x∈Ij
and, by (54), Ij⋄Ii.
(ii) For any n∈N we can find a positive rational
number r such that
[TABLE]
and then a number k∈N such that (αn,r)=(λk,ρk) is the desired number.
∎
Theorem 8.3**.**
Let (Y,S,(Bi)) be a pseudocompactification of a
computable metric space (X,d,α). Then
(Y,S,(Bi)) is a computable topological space.
Proof.
Let B={Bi∣i∈N}. We first show
that B is a basis for the topology S.
Clearly
[TABLE]
and it is immediate that B⊆S.
Now we check that for each V∈S and each x∈V
there exists B∈B such that x∈B⊆V. Let V∈S and x∈V. We have two
cases: V∈Td and V∈/Td.
If V∈Td, then there exists i∈N
such that
x∈Ii⊆V and clearly Ii∈B.
Suppose V∈/Td. Then V={∞}∪U,
where U is open in (X,d) and
X∖U is bounded in (X,d).
We have x∈{∞}∪U.
If x∈U, then there exists i∈N such that x∈Ii⊆U and so x∈Ii⊆V.
Suppose x=∞. Certainly, there exists i∈N
such that X∖U⊆I^i, which implies X∖I^i⊆U and we get
[TABLE]
Hence, there exists B∈B such that ∞∈B⊆V. We conclude that B is a basis for
S.
Let
[TABLE]
Let
[TABLE]
and
[TABLE]
We claim that C and D
are characteristic relations for (Y,S,(Bi)i∈N).
Using Proposition 2.2 we conclude that the sets
Γ1, …, Γ6 are c.e. So C and D
are c.e. We now verify properties (1)-(4) from
the definition of a computable topological space.
- (1)
Suppose i,j∈N are such that (i,j)∈D.
- Case 1
(i,j)∈Γ1. Then
I2i∩I2j=∅ and since Bi=I2i, Bj=I2j, we have
Bi∩Bj=∅.
2. Case 2
(i,j)∈Γ2. Then
I2i⊆I2j−1, which implies
I2i⊆I^2j−1 and therefore
I2i∩({∞}∪(X∖I^2j−1))=∅.
So Bi∩Bj=∅.
3. Case 3
(i,j)∈Γ3. In the same way we get Bi∩Bj=∅.
2. (2)
Suppose i,j∈N are such that (i,j)∈C.
- Case 1
(i,j)∈Γ4. Then
I2i⊆I2j and Bi⊆Bj.
2. Case 2
(i,j)∈Γ5. Then
I2i∩I^2j−1=∅ and so
I2i⊆(X∖I^2j−1)∪{∞}.
Hence, Bi⊆Bj.
3. Case 3
(i,j)∈Γ6. Then I^2j−1⊆I2i−1, which implies
I^2j−1⊆I^2i−1
and this gives X∖I^2i−1⊆X∖I^2j−1.
So Bi⊆Bj.
3. (3)
Suppose x,y∈X∪{∞}, x=y.
- Case 1
x,y∈X. Then there exist
i,j∈N such that x∈Ii, y∈Ij and such that
Ii⋄Ij. It follows x∈B2i, y∈B2j and (2i,2j)∈D.
2. Case 2
One of the points x and y is equal to
∞. We may assume y=∞. Then clearly x∈X.
Choose j∈N such that x∈Ij.
Then there exists i∈N such that x∈Ii and
Ii⊆FIj. It follows x∈B2i, ∞∈B2j+1
and (2i,2j+1)∈D.
4. (4)
Suppose i,j∈N and x∈Bi∩Bj.
- Case 1
i,j∈2N. Then x∈I2i∩I2j and
therefore there exists k∈N such that x∈Ik
and Ik⊆FI2i and Ik⊆FI2j.
So x∈B2k, (2k,i)∈C and (2k,j)∈C.
2. Case 2
i∈2N, j∈2N+1.
Then x∈I2i∩({∞}∪(X∖I^2j−1)).
It follows x∈I2i and x∈/I^2j−1.
By Lemma 8.2 there exists l∈N such that x∈Il and
Il⋄I2j−1.
We have x∈I2i∩Il and therefore there exists
k∈N such that x∈Ik, Ik⊆FI2i
and Ik⊆FIl. It follows Ik⋄I2j−1.
Hence we have x∈B2k, (2k,i)∈C and (2k,j)∈C.
3. Case 3
i∈2N+1, j∈2N. This is essentially Case 2.
4. Case 4
i,j∈2N+1. Then
[TABLE]
x∈X. We have
[TABLE]
By Lemma 8.2 there exist
i′,j′∈N such that x∈Ii′, Ii′⋄I2i−1,
x∈Ij′ and
Ij′⋄I2j−1.
We have x∈Ii′∩Ij′ and so there exists k∈N
such that x∈Ik, Ik⊆FIi′ and Ik⊆FIj′.
It follows Ik⋄I2i−1 and Ik⋄I2j−1.
We have x∈B2k,
(2k,i)∈C and (2k,j)∈C.
x=∞. By Lemma 8.2
there exists k∈N such that I2i−1⊆FIk
and I2j−1⊆FIk.
We have ∞∈B2k+1, (2k+1,i)∈C and
(2k+1,j)∈C.
We have proved that C and D are characteristic relations
for (Y,S,(Bi)i∈N). Hence
(Y,S,(Bi)i∈N) is a computable topological space.
∎
If a metric space (X,d) has compact closed balls, then (Y,S), where S is given by (52), is a one-point compactification of (X,Td). Moreover, we have the following proposition.
Proposition 8.4**.**
Let (X,d) be a metric space, let Y=X∪{∞}, where ∞∈/X, and let S be given by (52). Suppose K⊆X is such that K∩D is a compact
set in (X,d) for each closed ball D in (X,d). Then K∪{∞}, as a subspace of (Y,S), is a one-point compactification of K (where K is taken as a subspace of (X,Td)).
In particular, K∪{∞} is a compact set in (Y,S).
Proof.
Let V⊆K∪{∞}. By the definition of the subspace topology, V is open in K∪{∞} if and only if there exists an open set U in (X,d) such that
[TABLE]
Suppose U is open and X∖U is bounded in (X,d). Let W=K∩U. Then W is open in K and K∖W=K∖U is closed and bounded in K, which, together with the assumption of the proposition, gives that K∖W is compact in K.
Conversely, if W is an open set in K such that K∖W is compact in K, then W=K∩U, where U is open in (X,d). Since K is closed in (X,d) (which follows from the assumption of the proposition), the set U′=U∪(X∖K) is open in (X,d). We have W=K∩U′ and
[TABLE]
hence X∖U′ is bounded in (X,d).
Altogether, we have the following conclusion: V is open in K∪{∞} if and only if V is open in K or V=W∪{∞}, where W is open in K and K∖W compact in K.
∎
Let (X,d,α) be a computable metric space. For l∈N
we define
[TABLE]
Let i,l∈N. We write
[TABLE]
if there exists j∈[l] such that Ii⋄Ij.
Note: if Ii⋄Ll, then Ii∩Ll=∅.
Let u,l∈N. We write
[TABLE]
if Ii⋄Ll for each i∈[u].
Note: if Ju⋄Ll, then Ju∩Ll=∅.
The following proposition can be proved in the same fashion as Proposition
4.8.
Proposition 8.5**.**
Let (X,d,α) be a computable metric space.
Then the sets
[TABLE]
are c.e.
Lemma 8.6**.**
Let (X,d,α) be a computable metric space.
- (i)
Let l∈N and x∈X be such that x∈/Ll.
Then there exists i∈N such that x∈Ii
and Ii⋄Ll.
2. (ii)
Let l∈N and let K be a nonempty compact set in (X,d)
such that K∩Ll=∅.
Then there exists u∈N such that Ju⋄Ll and
K⊆Ju.
Proof.
(i) Since x∈/Ll, there exists j∈[l]
such that x∈/I^j.
By Lemma 8.2
there exists i∈N such that x∈Ii
a Ii⋄Ij and it follows
Ii⋄Ll.
(ii) Using (i) and the compactness of K we conclude that there exist
i0,…,in∈N such that
[TABLE]
and
Ii0⋄Ll,…, Iin⋄Ll. Now we take
u∈N such that [u]={i0,…,in}.
∎
Proposition 8.7**.**
Let (X,d,α) be a computable metric space
and let S be a semicomputable set in (X,d,α). Then the set
[TABLE]
is c.e.
Proof.
Let l,j∈N. We claim that
[TABLE]
if and only if
[TABLE]
(recall the notation from Subsection 2.4).
Let us suppose that (55) holds.
The set S∩I^(l)0 is closed since it is compact. Therefore
(S∩I^(l)0)∖Jj is closed and, as a subset of a compact
set S∩I^(l)0, it is also compact.
If x∈(S∩I^(l)0)∖Jj, then
x∈S and x∈/Jj, which, together with
(55),
implies x∈/Ll. This means that
((S∩I^(l)0)∖Jj)∩Ll=∅.
If (S∩I^(l)0)∖Jj=∅, then
obviously S∩I^(l)0⊆Jj.
Suppose (S∩I^(l)0)∖Jj=∅.
By Lemma 8.6
there exists u∈N such that Ju⋄Ll
and (S∩I^(l)0)∖Jj⊆Ju.
It follows S∩I^(l)0⊆Jj∪Ju.
Hence, (55) implies (56).
Suppose now that (56) holds.
If S∩I^(l)0⊆Jj,
then from Ll⊆I^(l)0 it follows
S∩Ll⊆Jj.
If there exists u∈N
such that Ju⋄Ll and
S∩I^(l)0⊆Jj∪Ju, then
we have Ju∩Ll=∅ and it follows
S∩Ll⊆Jj.
So the statements (55) and (56) are
equivalent. Using Lemma 6.2, Proposition 8.5 and
the fact that S is semicomputable it is easy to conclude that the set
of all (l,j)∈N2 for which (56) holds is
c.e. This proves the claim of the proposition.
∎
The main idea about psudocompactifications is to reduce the problem of computability of noncompact semicomputable sets in (X,d,α) to computability of (compact) semicomputable sets in (Y,S,(Bi)). Note the following: if the metric space (X,d) is bounded, each semicomputable set in (X,d,α) is compact. Therefore, the case when (X,d) is bounded is not interesting in view of pseudocompactifications.
Proposition 8.8**.**
Let (X,d,α) be a computable metric space and let (Y,S,(Bi))
be its pseudocompactification. Let K be a semicomputable set in (X,d,α). Suppose the metric space (X,d) is unbounded.
- (i)
If K is compact in (X,d), then K is semicomputable in (Y,S,(Bi)).
2. (ii)
If K is not compact in (X,d), then K∪{∞} is semicomputable in (Y,S,(Bi)).
Proof.
For j∈N let
[TABLE]
Let Φ,Ψ:N→P(N) be defined by
[TABLE]
These functions are clearly c.f.v.
Let j∈N. We have [j]=Φ(j)∪Ψ(j) and
[TABLE]
(ii) Suppose K is not compact in (X,d). We want to prove that K∪{∞} is semicomputable in (Y,S,(Bi)). By Proposition 8.4 K∪{∞} is compact in (Y,S), so it remains to prove that
the set
[TABLE]
is c.e.
Let j∈N. Using (57) we get
[TABLE]
In general, if A,B⊆X, then K⊆A∪(X∖B) if and only if K∩B⊆A. So
[TABLE]
It is easy to conclude that the function Ψ′:N→P(N) defined by
[TABLE]
is c.f.v. Since the set {(j,l)∈N2∣Ψ′(j)=[l]} is computable (Proposition 2.3(3)) and for each j∈N there exists l∈N such that Ψ′(j)=[l], there exists a computable function g:N→N such that Ψ′(j)=[g(j)] for each j∈N.
Let j∈N be such that Ψ(j)=∅. Then
[TABLE]
By (59) for each j∈N we have
[TABLE]
The metric space (X,d) is unbounded by the assumption of the proposition. It is easy to conclude that there exists a computable function γ:N→N such that
[TABLE]
for each i∈N.
As above, we conclude that there exists a computable function f:N→N such that
[TABLE]
for each j∈N such that Φ(j)=∅ and
[TABLE]
for each j∈N such that Φ(j)=∅. In the second case, since
Iγ((g(j))0)⋄I(g(j))0, we have Iγ((g(j))0)∩I^(g(j))0=∅ and consequently
[TABLE]
We claim that for each j∈N the following equivalence holds:
[TABLE]
Suppose j∈N is such that K∪{∞}⊆Cj. It follows from (60) that Ψ(j)=∅ and K∩Lg(j)⊆⋃i∈Φ(j)I2i.
If Φ(j)=∅, then, by (61), K∩Lg(j)⊆Jf(j). If Φ(j)=∅, then K∩Lg(j)=∅ and K∩Lg(j)⊆Jf(j).
In either case we have
[TABLE]
Conversely, suppose j∈N is such that (64) holds.
If Φ(j)=∅, then K∩Lg(j)⊆⋃i∈Φ(j)I2i and it follows from (60) that K∪{∞}⊆Cj.
If Φ(j)=∅, then, by (62), Lg(j)∩Jf(j)=∅ which, together with K∩Lg(j)⊆Jf(j), gives K∩Lg(j)=∅.
So K∩Lg(j)⊆⋃i∈Φ(j)I2i and (60) implies K∪{∞}⊆Cj.
So (63) holds.
It follows readily from Proposition 8.7 and (63) that the set (58) is c.e.
(i) Suppose K is compact in (X,d). Since (X,Td) is a subspace of (Y,S), we have that K is compact in (Y,S). To prove that the set
[TABLE]
is c.e., we proceed in a similar way as in (ii). First, for each j∈N we get
[TABLE]
where we take ⋂i∈Ψ(j)I^2i−1=X if Ψ(j)=∅. Since K is bounded in (X,d), there exists i0∈N such that K⊆I^i0. Let us take a computable function g:N→N such that
[TABLE]
for each j∈N such that Ψ(j)=∅ and
[TABLE]
for each j∈N such that Ψ(j)=∅. Then, for each j∈N,
[TABLE]
Now, in the same way as in (ii), we get that the set (65) is c.e. Thus K is semicomputable in (Y,S,(Bi)).
∎
Proposition 8.9**.**
Let (X,d,α) be a computable metric space and let (Y,S,(Bi))
be its pseudocompactification. Suppose K⊆X is such that K∪{∞} is a c.e. set in (Y,S,(Bi)). Then K is c.e. in (X,d,α).
Proof.
Since K∪{∞} is closed in (Y,S), (X,Td) is a subspace of (Y,S) and K=(K∪{∞})∩X, we have that K is closed in (X,d). The set
[TABLE]
is c.e. by the assumption of the proposition. Let f:N→N, f(i)=2i. For each i∈N we have
[TABLE]
Thus {i∈N∣Ii∩K=∅}=f−1(Γ) and the claim follows.
∎
As noted, the implication
[TABLE]
need not hold if K is a noncompact semicomputable manifold with boundary. We are going to prove that (66) holds in the special case when K is homeomorphic to Rn or Hn. Moreover, we will get that (66) holds if a sufficiently large part of K looks like Rn or Hn. More precisely, we will observe a manifold K for which there exists an open set U⊆K such that U is compact and such that K∖U is homeomorphic to Rn∖B(0,r) or Hn∖B(0,r), where r>0 and B(0,r) is an open ball in Rn with respect to the Euclidean metric. We may assume r=1 since Rn∖B(0,r)≅Rn∖B(0,1) and Hn∖B(0,r)≅Hn∖B(0,1) (we use X≅Y to denote that topological spaces X and Y are homeomorphic). Furthermore, it is not hard to conclude that Hn∖B(0,1)≅Hn.
For n≥1 let
[TABLE]
where ∥⋅∥ is the Euclidean norm on Rn.
If X is a topological space and A⊆X, by A we denote the closure of A in X.
Lemma 8.10**.**
Let n≥1 and let K be an n-manifold with boundary. Suppose that there exists an open set U⊆K such that U is compact and K∖U is homeomorphic to Rn∖B(0,1) or Hn. Then the following holds.
- (i)
A one-point compactification K∪{∞} of K is an n-manifold with boundary; if K∖U≅Rn∖B(0,1), the boundary of K∪{∞} is ∂K, and if K∖U≅Hn, the boundary of K∪{∞} is ∂K∪{∞}.
2. (ii)
If K∖U≅Rn∖B(0,1), then ∂K is compact. If K∖U≅Hn, then ∂K is not compact.
Proof.
(i)
In general, if X∪{∞} is a one-point compactification of a topological space X, then X is clearly an open subspace of X∪{∞}. Therefore, if x∈K and N a neighborhood of x in K, then N is a neighborhood of x in K∪{∞}. This means that we only have to prove that ∞ has a neighborhood in K∪{∞} which is homeomorphic either to Rn (if K∖U≅Rn∖B(0,1)) or Hn by a homeomorphism which maps ∞ to BdHn (if K∖U≅Hn).
Since U is compact, the set (K∖U)∪{∞} is open in K∪{∞} and obviously (K∖U)∪{∞}⊆(K∖U)∪{∞}. So (K∖U)∪{∞} is a neighborhood of ∞ in K∪{∞}.
It is easy to verify the following general fact: if Y is a closed subspace of a topological space X and Y∪{∞} and X∪{∞} are one-point compactifications of Y and X, then Y∪{∞} is a subspace of X∪{∞}.
Therefore, the compactification (K∖U)∪{∞} of K∖U is a subspace of K∪{∞}. Using the fact that (K∖U)∪{∞} is a neighborhood of ∞ in K∪{∞}, we conclude the following: if N is a neighborhood of ∞ in (K∖U)∪{∞}, then N is also a neighborhood of ∞ in K∪{∞}. So it suffices to find a neighborhood of ∞ in (K∖U)∪{∞} with desired properties.
Let us suppose that K∖U≅Rn∖B(0,1).
It suffices to prove that the point ∞ in the one-point compactification (Rn∖B(0,1))∪{∞} has a neighborhood homeomorphic to Rn. But, as above, (Rn∖B(0,1))∪{∞} is a subspace of Rn∪{∞} and (Rn∖B(0,1))∪{∞} is a neighborhood of ∞ in Rn∪{∞}. So it is enough to prove that ∞ has a neighborhood in in Rn∪{∞} which is homeomorphic to Rn. However, this is clear since Rn∪{∞} is homeomorphic to Sn and Sn is an n-manifold.
Let us suppose now that K∖U≅Hn.
Since Hn≅Hn∩B(0,1) by the homeomorphism x↦1+∥x∥x, we have
[TABLE]
So it is enough to prove that ∞ has a neighborhood in (B(0,1)∩Hn)∪{∞} which is homeomorphic to Hn by a homeomorphism which maps ∞ to BdHn.
Since the set B(0,1)∩Hn is closed in B(0,1), (B(0,1)∩Hn)∪{∞} is a subspace of B(0,1)∪{∞}. It is known that the function f:B(0,1)∪{∞}→Sn given by f(∞)=(−1,0,…,0), f(0)=(1,0,…,0) and
[TABLE]
for x∈B(0,1), x=0, x=(x1,…,xn), is a homeomorphism. This function induces a homeomorphism
[TABLE]
However,
[TABLE]
and Sn∩Hn+1, i.e. upper half-sphere, is an n-manifold with boundary, its boundary is Sn−1×{0}. We conclude that (B(0,1)∩Hn)∪{∞} is an n-manifold with boundary and ∞ belongs to its boundary, meaning that ∞ has a desired neighborhood in (B(0,1)∩Hn)∪{∞}.
(ii) Suppose f:Rn∖B(0,1)→K∖U is a homeomorphism. Then K∖U is Hausdorff and since the set f(Sn−1) is compact in K∖U, this set is closed in K∖U. But K∖U is closed in K, so f(Sn−1) is closed in K. It follows that the set
[TABLE]
is open in K. We have A⊆K∖U, so A is open in K∖U and it is therefore homeomorphic to the open subset f(A) of Rn∖B(0,1). It follows from the definition of A that f(A)⊆Rn∖B^(0,1) and, since the set Rn∖B^(0,1) is open in Rn, f(A) is open in Rn. Hence A is open subset of K which is homeomorphic to an open subset of Rn and it follows that each point of A has a neighborhood in K homeomorphic to Rn. So A∩∂K=∅, hence ∂K⊆U∪f(Sn−1). In general, the boundary of a manifold is a closed subset of the manifold. As a closed set contained in a compact set, ∂K is compact.
Suppose f:Hn→K∖U is a homeomorphism. Since (K∖U)∩U is compact, the preimage by f of this set is compact in Hn and we conclude that there exists r>0 such that f(Hn∖B^(0,r))⊆K∖U. It follows that the set f(Hn∖B^(0,r)) is open in K and, consequently,
[TABLE]
Suppose ∂K is compact. The set (K∖U)∩∂K is closed and contained in ∂K, hence it is compact. So f−1(∂K) is a compact set in Hn. But this contradicts (67). Thus ∂K is not compact.
∎
Theorem 8.11**.**
Let (X,d,α) be a computable metric space and let K be a semicomputable set in this space which is, as a subspace of (X,d), a manifold with boundary. Then the implication
[TABLE]
holds if there exists an open set U in K such that U is compact in K and K∖U is homeomorphic to Rn∖B(0,1) or Hn.
Proof.
We may assume that K is noncompact, otherwise the claim follows from Theorem 7.3 (or [10]). It follows that (X,d) is unbounded.
Suppose that ∂K is semicomputable in (X,d,α).
Let (Y,S,(Bi)) be a pseudocompactification of (X,d,α).
Let us suppose that K∖U≅Rn∖B(0,1) for some open set U in K such that U is compact. By Lemma 8.10(ii) the set ∂K is compact and, by Proposition 8.8(i), ∂K is semicomputable in (Y,S,(Bi)). By Proposition 8.8(ii), K∪{∞} is semicomputable in (Y,S,(Bi)) and, by Lemma 8.10(i) and Proposition 8.4, K∪{∞} is a manifold with boundary and its boundary is ∂K. It follows from Theorem 7.3 that K∪{∞} is c.e. in (Y,S,(Bi)). Proposition 8.9 now implies that K is c.e. in (X,d,α). Hence K is computable in (X,d,α).
Let us suppose that K∖U≅Hn for some open set U in K such that U is compact. Using Proposition 8.4, Lemma 8.10 and Proposition 8.8 we get the following conclusion:
K∪{∞} is a semicomputable manifold with boundary in (Y,S,(Bi)), it boundary is ∂K∪{∞} and ∂K∪{∞} is a semicomputable set in (Y,S,(Bi)).
Again, Theorem 7.3 and Proposition 8.9 imply that K is computable in (X,d,α).
∎
In particular, if K is a semicomputable set in (X,d,α) such that K≅Rn, then K is computable, and if K is a semicomputable set for which there exists a homeomorphism f:Hn→K such that f(BdHn) is a semicomputable set, then K is computable.
Example 8.12**.**
Let (X,d,α) be a computable metric space and let K be a semicomputable set in this space.
Suppose K≅S1×[0,∞⟩. Then K is a manifold with boundary and ∂K=f(S1×{0}), where f:S1×[0,∞⟩→K is a homeomorphism.
Suppose ∂K is semicomputable set. Then K is computable. This follows from Theorem 8.11 since S1×[0,∞⟩≅R2∖B(0,1): the function g:S1×[0,∞⟩→R2∖B(0,1), g(x,t)=(1+t)x, is a homeomorphism.
If we restrict g to the product of the upper half-circle S1∩H2 and [0,∞⟩, we get the conclusion that [0,1]×[0,∞⟩≅H2∖B(0,1), hence
[0,1]×[0,∞⟩≅H2.
Suppose K≅[0,1]×[0,∞⟩. Then K is a manifold with boundary and ∂K=f([0,1]×{0}∪{0,1}×[0,∞⟩), where f:[0,1]×[0,∞⟩→K is a homeomorphism. By Theorem 8.11, K is computable if ∂K is semicomputable.
9. Conclusion
Semicomputable sets in Euclidean spaces (and in other usual spaces) naturally arise and it is of interest to know under which conditions these sets are computable. It is known that topology plays a important role in the description of such conditions. In particular, a semicomputable set is computable if it is a compact topological manifold (whose boundary is semicomputable). In this paper we have shown that topology is actually involved in this matter at the basic level: the ambient space (Euclidean space or computable metric space) can be replaced by a computable topological space. Hence, to define necessary notions and to prove that semicomputable sets are computable under certain conditions, we do not need Euclidean space and we do not need even metric spaces: computable topological spaces are sufficient.
Furthermore, it has been shown how the introduced concepts and results can be used to conclude that certain noncompact sets in computable metric spaces are computable. We believe that the subject of this paper has a potential for further investigations and applications.