The paper demonstrates that under the Continuum Hypothesis, there exists a compact Hausdorff space that is countable dense homogeneous but does not contain a Cantor set, contrasting previous results.
Contribution
It constructs a specific example of a compact Hausdorff space with these properties, showing a new independence result related to the Cantor set and countable dense homogeneity.
Findings
01
Existence of a compact Hausdorff space under CH with specified properties
02
Contrasts with previous results linking countable dense homogeneity and the Cantor set
03
Highlights the role of set-theoretic assumptions in topology
Abstract
It is shown that CH implies the existence of a compact Hausdorff space that is countable dense homogeneous, crowded and does not contain topological copies of the Cantor set. This contrasts with a previous result by the author which says that for any crowded Hausdorff space X of countable π-weight, if ωX is countable dense homogeneous, then X must contain a topological copy of the Cantor set.
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.
Full text
Countable dense homogeneity and the Cantor set
Rodrigo Hernández-Gutiérrez
Departamento de Matemáticas, Universidad Autónoma Metropolitana campus Iztapalapa, Av. San Rafael Atlixco 186, Col. Vicentina, Iztapalapa, 09340, Mexico city, Mexico
It is shown that CH implies the existence of a compact Hausdorff space that is countable dense homogeneous, crowded and does not contain topological copies of the Cantor set. This contrasts with a previous result by the author which says that for any crowded Hausdorff space X of countable π-weight, if ωX is countable dense homogeneous, then X must contain a topological copy of the Cantor set.
Key words and phrases:
Countable dense homogeneous, Cantor set, counterexample, compact space
2010 Mathematics Subject Classification:
54G20, 54D65, 54D30, 54B35
1. Introduction
All the spaces considered below are Hausdorff spaces.
A space X is countable dense homogeneous (CDH, henceforth) if X is separable and every time D,E⊂X are countable dense subsets, there is a homeomorphism h:X→X such that h[D]=E. Among examples of CDH spaces we have the Euclidean spaces, the Hilbert cube and the Cantor set. For updated surveys on CDH spaces, see sections 14, 15 and 16 of [2] and the more recent [9].
For some time there were no known ZFC examples of CDH spaces that are compact and non-metrizable. In [14] and [10] it was shown that κ2 is CDH if and only if κ<p and in [1] there is a CH construction of a compact CDH space of uncountable weight that is almost Luzin (that is, every nowhere dense subset is second countable). Finally, a compact CDH space of uncountable weight was constructed without further set-theoretical assumptions in [8].
However, the example in [8] is the only known example of a compact CDH space of uncountable weight in ZFC. Thus, it is desirable to find other examples of such spaces with different topological properties. For example, it is still unknown if there exist compact CDH spaces of uncountable weight that are either connected or of weight equal to exactly c in ZFC (see the open problems at the end of [8]).
In [7] the author showed that if X is a crowded space of countable π-weight such that ωX is CDH, then X contains a copy of the Cantor set. Notice that the Sorgenfrey line is an example of a crowded space of countable π-weight that is CDH but does not contain Cantor sets. However, it is easy to see that all known examples of infinite compact CDH spaces have topological copies of the Cantor set.
Shortly after the results of [8] and [7] were obtained, Michael Hrušák and I were having this same discussion and we considered the following problem.
1.1. Question
Does there exist a crowded, compact, Hausdorff space that is CDH and does not contain topological copies of the Cantor set?
Arhangel’skĭ and van Mill constructed their CH example from [1] using an inverse limit of Cantor sets of length ω1. So it is natural to try to mimic this technique to answer Question 1.1 under CH. The technical problem faced then is how to kill all possible Cantor sets in ω1 steps. Back in 2013, Hrušák gave such an argument, answering Question 1.1 in the affirmative, by using the guessing principle ♢.
Since that time, it was the intention of the author to answer Question 1.1 in the affirmative assuming only CH. This paper finally provides a complete argument:
1.2. Theorem
CH implies that there is a first countable, hereditarily separable and [math]-dimensional compact Hausdorff space of uncountable weight that is CDH but does not contain topological copies of the Cantor set.
In exchange of using ♢, the proof of Theorem 1.2 given here will require Lemma 3.2 below, which is a dynamical property of the group H(ω2) of autohomeomorphisms of the Cantor set.
The paper is organized as follows. Section 2 contains preliminaries. In Section 3 we give the proof of Theorem 1.2 assuming the truth of Lemma 3.2, the proof of which is long and will have to wait for Section 4. In Section 5 we give an unexpected application of Lemma 3.2 and some other related applications. Finally, in Section 6, we make some further remarks about Theorem 1.2.
2. Notation and preliminaries
If f:A→B is a function and C⊂B, f←[C] is the inverse image of C. For any set A, ∣A∣ denotes the cardinality of A. If A is a subset in a space X, intX(A), clX(A), bdX(A) denote the interior, closure, boundary, respectively, of A. A crowded space is one without isolated points.
A function f:X→Y between topological spaces is said to be irreducible if it is closed and for every closed A, f[A]=Y if and only if A=X. If X is a topological space, let CO(X) denote its set of clopen subsets, this is a Boolean algebra with the inclusion order.
We leave the proof of the following two easy facts to the reader.
2.1. Lemma
Let f:X→Y be a continuous and irreducible function between [math]-dimensional compact Hausdorff spaces. If y∈Y is such that f←(y)={x} then {f←[V]:V is clopen and y∈V} is a local base in x.
2.2. Lemma
Let X be an arbitrary space, Y be hereditarily separable and f:X→Y be a continuous and irreducible function such that f←(y) is finite for each y∈Y. Then X is also hereditarily separable.
Let X be any topological space. Then H(X) will denote the group of all autohomeomorphisms of X. The neutral element of H(X) is of course the identity function 1X:X→X. If X=ω2, the identity will be simply denoted by 1. Given S⊂H(X), ⟨⟨S⟩⟩ will denote the subgroup of H(X) generated by the set S. A set A⊂X is said to be invariant under some subgroup G⊂H(X) if h[A]=A for every h∈G.
Now, assume that X is a compact metric space with some fixed metric ρ. Then H(X) is a topological group with the topology of uniform convergence. Given f,g∈H(X), let ρ(f,g)=sup{ρ(f(x),g(x)):x∈X} and σρ(f,g)=max{ρ(f,g),ρ(f−1,g−1)}. Then σρ is a compatible complete metric for H(X). This discussion can be found in [12].
For any h∈H(X), the set of fixed points of h will be denoted by
[TABLE]
Notice that fix(h) is always closed. If G⊂H(X) is a subgroup, let
[TABLE]
We will call a subgroup G⊂H(X)cofinitary if fix(h) is finite for every h∈G∖{1X}. Cofinitary groups have been considered in the context of permutation groups of the natural numbers and almost disjoint families (see for example the surveys [3] and [11]).
We will assume the reader’s familiarity with inverse sequences and inverse limits (of length an arbitrary ordinal). See [4] or [5, 2.5] for introductions in the general setting.
We will write ⟨Xα,fαβ,λ⟩ for an inverse sequence of length the limit ordinal λ, where Xα are the base spaces and fαβ:Xβ→Xα are the bonding functions. The inverse limit will be written as lim←⟨Xα,fαβ,λ⟩=⟨X,πα⟩λ and consists on the limit space X and a projection πα:X→Xα for each α<λ. Concretely, in this situation the limit space may be constructed as
[TABLE]
and the projections are the corresponding restrictions of projections to the factor spaces of the product. An inverse sequence ⟨Xα,fαβ,λ⟩ is continuous if every time γ<λ is a limit ordinal, then ⟨Xγ,fαγ⟩γ=lim←⟨Xα,fαβ,γ⟩. The following result is well-known.
2.3. Lemma
Let λ be a limit ordinal and ⟨Xα,fαβ,λ⟩ be an inverse sequence with lim←⟨Xα,fαβ,λ⟩=⟨X,πα⟩λ.
(i)
The set {πα←[Uα]:α<λ,Uα open in Xα} is a base for the topology of X.
(ii)
If Y⊂X, then lim←⟨πα[Y],fαβ↾πβ[Y],λ⟩=⟨Y,πα↾Y⟩λ.
(iii)
If Xα is compact Hausdorff for each α<λ and A, B are closed subsets of X such that A∩B=∅, then there exists α<λ such that πα[A]∩πα[B]=∅.
(iv)
If for each α<λ, hα:Xα→Xα is a homeomorphism and hα∘fαβ=fαβ∘hβ for each α<β<λ, then there is a homeomorphism h:X→X such that hα∘πα=πα∘h for each α<λ.
The following well-known lemma implies that every Cantor set in a long inverse limit must appear in an intermediate step.
2.4. Lemma
Let ⟨Xα,παβ,ω1⟩ be an inverse sequence of second countable compact Hausdorff spaces with surjective bounding functions such that its inverse limit is second countable. Then there exists γ<ω1 such that whenever γ<α<ω1 then πγα is a homeomorphism.
Proof.
Let lim←⟨Xα,παβ,ω1⟩=⟨X,πα⟩ω1. By Lemma 2.3, there are {βn:n<ω}⊂ω1 and open sets Un⊂Xβn, for each n<ω, such that {πβn←[Un]:n<ω} is a base for the topology of X. Let γ=sup{βn:n<ω}<ω1, we next argue that this ordinal witnesses the property we want.
Let γ<α<ω1 and let us assume that πγα is not a homeomorphism. So there are x,y∈Xα with x=y and πγα(x)=πγα(y). Clearly the collection {(πβnα)←[Un]:n<ω} is a base for the topology of Xα so there is m<ω such that x∈(πβmα)←[Um] but y∈/(πβmα)←[Um]. However, (\pi_{\gamma}^{\alpha})^{\leftarrow}\big{[}(\pi_{\beta_{m}}^{\gamma})^{\leftarrow}[U_{m}]\big{]}=(\pi_{\beta_{m}}^{\alpha})^{\leftarrow}[U_{m}] contradicts the fact that πγα(x)=πγα(y). Then we have finished the proof.
∎
Theorem 1.2 will be proved using a continuous inverse limit construction of length ω1. Let us give an informal picture of how the argument proceeds by describing the construction of the spaces {Xα:α<ω1} used in the inverse system. The base space X0 is the Cantor set. In each successor step α+1<ω1, we will choose a Cantor set inside Xα and a point in this Cantor set and split it in two to construct Xα+1. We always choose different points to split so that at the end we have a ≤2-to-1 preimage of X0. By doing this, it follows that all Cantor sets in the limit can be found in intermediate stages and can be destroyed by splitting any of its points.
First, we will show to split a point in an specific Cantor set in each step. This is accomplished by the following result.
3.1. Lemma
Let G be a countable subgroup of H(ω2) and let N⊂ω2 be a countable set that is invariant under G. Let Y⊂ω2 be a closed crowded subspace and y∈Y∖(N∪fix(G)). Then there exists a continuous and irreducible function π:ω2→ω2 and a group monomorphism m:G→H(ω2) such that the following conditions hold.
(a)
For all x∈ω2, ∣π←(x)∣≤2.
(b)
If x∈N then π←(x) is a singleton.
(c)
The set {x∈ω2:∣π←(x)∣>1} is countable and equal to {h(y):h∈G}.
(d)
The set π←[Y] is crowded.
(e)
For every g∈G we have that π∘m(g)=g∘π.
Proof.
The set ω2∖{y} is the union of a pairwise disjoint family {Un:n<ω} of non-empty clopen subsets. By recursion it is easy to find an infinite M⊂ω such that for every h∈G such that h(y)∈Y both sets {n∈M:h[Un]∩Y=∅} and {n∈ω∖M:h[Un]∩Y=∅} are infinite. So define A={y}∪(⋃{Un:n∈M}), this is a regular closed set of ω2 the boundary of which is {y}. Let C be the smallest subalgebra of regular closed sets of ω2 containing CO(ω2)∪{A} and closed under all homeomorphisms from G.
Notice that C is countable and atomless so its Stone space X is homeomorphic to the Cantor set. By Stone’s duality the function π:X→ω2 defined by π(U)=⋂U is continuous and irreducible, since it is the dual of the dense inclusion of Boolean algebras CO(ω2)↪C.
Let E={h(y):h∈G}, this is a countable set disjoint from N. To prove conditions (a), (b) and (c) we have to analyze what are the preimages of points in ω2 under π. We will do this by describing bases of ultrafilters in C.
Let A(0)=A and A(1)={y}∪(⋃{Un:n∈ω∖M}), which is the complement of A in the algebra of regular closed sets of X. Let’s prove that following statement holds for all C∈C.
(∗)C If x∈bd(ω2)(C), there exists h∈G, U∈CO(ω2) and i∈2 such that x∈U∩h[A(i)]=U∩C and x=h(y).
Notice that (∗)C is true for all C∈CO(X)∪{A}. Considering all other elements of C can be obtained by Boolean operations and images under homeomorphisms of G, we shall prove that (∗)C holds for all C∈C in the following steps.
Step 1. If (∗)C then (∗)C′, where C′=cl(ω2)(ω2∖C) is the complement of C in the algebra of regular closed sets.
To prove Step 1, notice that the boundary of a regular closed set is the same as the boundary of its complement (in the algebra of regular closed sets). Let x∈bdX(C′), then x∈bdX(C) as well. Thus there are h∈G, U∈CO(ω2) and i∈2 with x=h(y) and x∈U∩h[A(i)]=U∩C. Notice that h[A(1−i)]={x}∪(ω2∖h[A(i)]) because homeomorphisms respect boundaries. Also, since the boundary of A consists on one point only, bd(ω2)(C)∩U={x}. From this considerations it easily follows that x∈U∩h[A(1−i)]=U∩C′.
Step 2. If (∗)C0 and (∗)C1 then (∗)C0∪C1.
For step 2, let x∈bd(ω2)(C0∪C1). First, it may be the case that x∈Cj∖C1−j for some j∈2. In this case, there exists h∈G, U∈CO(ω2) and i∈2 such that x∈U∩h[A(i)]=U∩Cj and x=h(y). By shrinking if necessary, we may assume that U∩Ci−j=∅. Then x∈U∩h[A(i)]=U∩(C0∪C1), which implies (∗)C0∪C1.
So assume that x∈C0∩C1. Then x∈bd(ω2)(Cj) for j∈2 (otherwise, it would be an interior point) so we have witnesses hj∈G, Uj∈CO(ω2) and i(j)∈2 such that x∈Uj∩h[A(i(j))]=Uj∩Cj and x=hj(y) for j∈2. Since x=h0(y)=h1(y), h0∘h1−1∈G has y as a fixed point. Then by our hypothesis, h0=h1.
Let V=U0∩U1, then V∩h[A(i(0)]=V∩C0 and V∩h[A(i(1)]=V∩C1. So there are two cases: i(0)=i(1) or i(0)+i(1)=1, let us see that the second case is impossible. If we had i(0)+i(1)=1, then since A(0)∪A(1)=ω2 we would have V=(V∩C0)∪(V∩C1). So x∈V⊂C0∪C1 and x would be an interior point of C0∪C1, a contradiction. Thus, we have i(0)=i(1).
From the discussion above it is then clear that x∈V∩h0[A(i(0))]=V∩(C0∪C1).
Step 3. If (∗)C and h∈G then (∗)h[C].
For step 3, assume that x∈bd(ω2)(h[C]). Since homeomorphisms preserve boundaries, h−1(x)∈bd(ω2)(C) so let h′∈G, U∈CO(ω2) and i∈2 such that h−1(x)∈U∩h′[A(i)]=U∩C and h−1(x)=h′(y). Let V=h[U]∈CO(ω2) and h′′=h∘h′∈G, by applying h on the previous equation we obtain x∈V∩h′′(A(i))=V∩h[C].
Thus, (∗)C is true for all C∈C.
Let U∈X and x=π(U). Using (∗)C it follows that U has a base of one of the following forms. If x∈E, then {U∩h[A(i)]:x∈U} is a base of U, where h is the unique element of G such that x=h(y) and i∈2. If x∈ω2∖E, then {U∈CO(ω2):x∈U} is a base of U. By fixing x, in the first case we see that there are exactly two choices of U, one for each i∈2; in the second case such U is unique. This completes the proof of (a), (b) and (c).
Next we prove (d). Let Z=Y∖E, this is a dense subset of Y because E is countable and Y is a Cantor set. Since π is one-to-one restricted to π←[ω2∖E] and closed, the restriction π↾π←[Z]:π←[Z]→Z is a homeomorphism. Thus, π←[Z] is crowded. So let x∈E∩Y, by the arguments of the previous paragraph there is h∈G such that {U∩h[A(i)]:x∈U} for i∈2 generate the elements of π←(x). By the choice of A above and the fact that Z is dense in Y, (U∩h[A(i)])∩Z=∅ for i∈2. Thus, if U∈π←(x) then every neighborhood of U intersects π←[Z]. This proves that π←[Y] is crowded.
We are now left to prove (e). Each homeomorphism h in G induces an isomorphism h^ of the Boolean algebra CO(ω2). Moreover, h^ is also an isomorphism of C by the definition of C. Thus, by Stone duality, h^ induces a homeomorphism m(h). The proof that π∘m(h)=h∘π is standard and we leave it to the reader.
∎
The hardest part in this argument is to do the splitting and at the same time ensuring that the limit space is CDH. Thus, we would also like to choose homeomorphisms that witness this and make sure that they are preserved in the limit. The precise statement of this is as follows.
3.2. Lemma
Let G be a countable subgroup of H(ω2) and D,E two countable dense subsets of ω2. If G is cofinitary, then there is H∈H(ω2) such that H[D]=E and ⟨⟨G∪{H}⟩⟩ is also cofinitary.
The proof of Lemma 3.2 is hard, mainly because the chosen homeomorphisms are required to form a cofinitary group. We need this because by Lemma 3.1, in each successor step we are to choose a point y∈Y not in fix(G), where G is the group of homeomorphisms chosen up to that step, so fix(G) shouldn’t be able to cover the Cantor set Y. We will leave the proof of this result for the next chapter and we will concentrate on the remaining of the proof.
The space we are looking for will be constructed as an inverse limit of a sequence ⟨Xα,ραβ,ω1⟩ where Xα=ω2 for each α<ω1.
Notice that an inverse system of Cantor sets of length a countable limit ordinal always gives the Cantor set as an inverse limit. Thus, we only need to specify the bonding functions ραα+1:Xα+1→Xα for α<ω1 by using Lemma 3.1. These functions will tell us how to split points in order to destroy the Cantor sets.
In each step α<ω1 we shall define a countable set Nα⊂Xα to keep track of which points are not to be split in former steps. We also need to know which Cantor set to destroy in each step, this will be done by choosing a Cantor set Fα⊂Xα for each α<ω1.
We will also need to construct a countable subgroup Gα⊂H(Xα) for each α<ω1 and a group monomorphism mαβ:Gα→Gβ for each α<β<ω1. Using this homeomorphisms we will prove that the limit is CDH.
We already know that every space in the sequence is a Cantor set, so for each α<ω1 let us give enumerations {D⟨α,β⟩:β<ω1} of all countable dense subsets of Xα and {Y⟨α,β⟩:β<ω1} of all Cantor sets contained in Xα. Let e:ω1→ω1×ω1 be a bijection such that if α<ω1 and e(α)=⟨β,γ⟩, then β≤α. Let D0=D(e(0))⊂X0.
Our construction will have the following properties:
(1)
N0=D0;
(2)
for each α<ω1 and h∈Gα, h[Nα]=Nα;
(3)
if α<β<ω1 then
(a)
ραβ is continuous and irreducible (thus, onto),
(b)
for each x∈Xα, ∣(ραβ)←(x)∣≤2,
(c)
{x∈Xα:∣(ραβ)←(x)∣=2} is countable, and
(d)
Nα⊂{x∈Xα:∣(ραβ)←(x)∣=1};
(4)
if α<ω1 and e(α)=⟨β,γ⟩, then there exists h∈Gα+1 such that
h[(ρβα+1)←[D(β,γ)]]=(ρ0α+1)←[D0];
(5)
if α<ω1 and e(α)=⟨β,γ⟩, then (ρβα+1)←[D(β,γ)]⊂Nα+1;
(6)
if α<β<ω1, then (ραβ)←[Nα]⊂Nβ;
(7)
if α<ω1, the group Gα is cofinitary;
(8)
if α<β<γ<ω1 then mαγ=mβγ∘mαβ; and
(9)
if α<ω1 and e(α)=⟨β,γ⟩ then
(a)
Fα is a Cantor set contained in Xα,
(b)
Fα⊂(ρβα)←[Y(β,γ)],
(c)
(ρβα)←[Y(β,γ)]∖Fα is countable,
(d)
(ραα+1)←[Fα] is crowded, and
(e)
there is x∈Fα such that ∣(ραα+1)←(x)∣=2.
Let us describe how to carry out this construction in step λ<ω1. For λ=0, define N0=D0 (which is property (1)) and G0={1}.
Now consider the case when λ is a limit ordinal. As mentioned before, the inverse limit of countably many Cantor sets is a Cantor set so there are continuous functions ραλ:Xλ→Xα for α<λ such that ⟨Xλ,ραλ⟩λ=lim←⟨Xα,ραβ,λ⟩. By (iii) in Lemma 2.3 it is easy to see that ραλ is irreducible for all α<λ.
Define Nλ=⋃{(ραλ)←[Nα]:α<λ}. By property (3d) it is easy to see that ∣(ραλ)←(x)∣=1 when α<λ and x∈Nα. Thus, Nλ is a countable set.
Using (iv) in Lemma 2.3, it is not hard to define group monomorphisms mαλ:Gα→H(Xλ) such that condition (8) holds for γ=λ. Then define Gλ=⋃{mαλ[Gα]:α<λ}, which is a group already (that is, we do not have to take the generated group) and clearly countable. To see that Gλ is cofinitary, let h∈Gλ. So there is α<λ and g∈Gα such that h=mαλ(g). If x∈fix({h}), then clearly ραλ(x)∈fix({g}). This means that fix({h})⊂(ραλ)←[fix({g})], which is clearly a finite set because preimages of points under ραλ are finite.
We will leave the verification of the rest of the properties for this step to the reader. Next we do the successor case, so assume that λ=η+1 and let e(η)=⟨α,β⟩.
In this step we would like to destroy Y(α,β), but this is a subset of Xα and we want to split a point in Xη. Notice that it is possible that (ραη)←[Y(α,β)] contains isolated points so we have to choose one that is not isolated. The set Z={x∈Y(α,β):∣(ραη)←(x)∣=1} is a cocountable subset of Y(α,β) by property (3) so it is crowded. Notice that the function ραλ↾(ραλ)←[Z]:(ραλ)←[Z]→Z is closed, one-to-one and continuous so it is a homeomorphism. Thus, (ραλ)←[Z] is crowded. Let Fη=clXη((ραλ)←[Z]), this is the Cantor set we will destroy. Notice that properties (9a), (9b) and (9c) hold for this choice.
Let y∈Xη∖(fix(Gη)∪Nβ), by Lemma 3.1 there exists an irreducible and continuous function ρηη+1:Xη+1→Xη and a group monomorphism mηη+1:Gη→H(Xη+1) with the properties listed in that lemma. Notice that we can now define ργη+1=ρηη+1∘ργη for all γ<η+1 and it is easy to see that properties in (3) hold for all these functions. Also, by the conditions in Lemma 3.1, we obtain properties (9d) and (9e).
Consider the sets D=(ρ0η+1)←[D0] and D′=(ραη+1)←[D(e(α))]. Both are countable sets by property (3c) and dense because the functions considered are irreducible. Moreover, ρ0η+1↾D′:D′→D0 is one-to-one. By Lemma 3.2, there exists h∈H(Xη+1) such that h[D]=D′ and ⟨⟨mηη+1[Gη]∪{h}⟩⟩ is cofinitary.
Define Gη+1=⟨⟨mηη+1[Gη]∪{h}⟩⟩. Let Nη+1 be the smallest set containing the set (ρηη+1)←[Nη∪{y}]∪D0 and closed under Gη+1, clearly we obtain a countable set. The rest of the properties in the construction can be easily checked.
So the space we are looking for is the inverse limit of the sequence we are constructing. To be precise, this space is
[TABLE]
where πα:X→Xα be the projection into the factor α<ω1. Clearly X is a compact Hausdorff space. To see that X has uncountable weight, use Lemma 2.4; however, this will also be clear once we prove that X contains no Cantor sets.
An important property of X that follows from properties (3) and (6) is the following
(∗) For every x∈X there exists an ordinal α(x)<ω1 such that if α(x)<β<ω1, then (πβ)←[πβ(x)]={x}
Informally, every point is split into two points in at most one step. In particular, π0 has fibers of cardinality at most 2 so by Lemma 2.2, X is hereditarily separable. To see that X is first countable in x∈X, consider the ordinal α(x) given in (∗). Using Lemma 2.1 it is possible to construct a countable base of X at x using the base of Xα(x) at πα(x).
Next, let us show that X is CDH. Notice that D=(π0)←[D0] is a countable dense subset of X and π0↾D:D→D0 is one-to-one. Let E be any other countable dense subset of X. By (∗), it is possible to find α<ω1 such that πα:E→πα[E] is one-to-one. Let β<ω1 be such that D(e(β))=πα[E]. By property (4) there is h∈H(Xβ+1) such that h[(ραβ+1)←[D(e(β))]]=(ρ0β+1)←[D0]. By using (iv) in Lemma 2.3, it is not hard to see that the homeomorphisms {mβ+1γ:β<γ} induce a homeomorphism H∈H(X) such that mβ+1γ(h)∘πγ=πγ∘H when β<γ<ω1. Then it easily follows that H[E]=D. Thus, X is CDH.
Finally, we prove that X contains no Cantor sets. Assume that this is not true and there is Y⊂X homeomorphic to ω2 and let Yα=πα[Y] for every α<ω1. So ⟨Y,πα↾Y⟩ω1=lim⟨Yα,(ραβ)↾Yα,ω1⟩ by (ii) in Lemma 2.3. By Lemma 2.4, there is λ<ω1 such that ρλα↾Yα:Yα→Yλ is a homeomorphism every time λ≤α<ω1.
Let β<ω1 be such that e(β)=⟨λ,γ⟩ and Yγ=Y(λ,γ). By property (9), Fβ is the biggest Cantor set contained in (ρλβ)←[Yλ] so Yβ⊂Fβ. Now take any open set V that intersects Fβ. By property (3c) there is x∈V∩Fβ such that the preimage of ρλβ(x) under ρλβ consists on x alone. By the fact that ρλβ↾Yβ:Yβ→Yλ is onto and ρλβ(x)∈Yλ, we necessarily have that x∈Yβ. This proves that Yβ is dense in Fβ so in fact Yβ=Fβ.
By property (9d), (ρββ+1)←[Yβ] is crowded. We proceed by an argument completely similar to the one in the previous paragraph. Since ρββ+1 is one-to-one in a cocountable set, and both (ρββ+1)←[Yβ] and Yβ+1 map to Yβ under ρββ+1, it can be easily proved that (ρββ+1)←[Yβ]=Yβ+1. But then property (9e) contradicts the straightforward fact that ρββ+1:Yβ+1→Yβ is a homeomorphism.
The contradiction we have arrived to shows that there are indeed no Cantor sets in X. This finishes the proof of the theorem.
∎
In this section, we will give a detailed proof of our Lemma 3.2 that helps extend cofinitary groups. We start with some general facts about groups of homeomorphisms.
4.1.
Let ⟨X,ρ⟩ be a compact metric space, A⊂X a closed subset and f∈H(X). Assume that A∩fix(f)=∅. Then there exists ϵ>0 such that if g∈H(X) and σρ(f,g)<ϵ, then A∩fix(g)=∅.
In what follows below, X=ω2, ρ will the metric defined by ρ(x,y)=1/(1+min{n<ω:x(n)=y(n)}) for x=y and we will denote σ=σρ for this fixed metric ρ. We are choosing this metric so that open balls B(x,ϵ)={y∈ω2:ρ(x,y)<ϵ}, where x∈ω2 and ϵ>0, are clopen. We will use the following consequence of fact 4.1.
4.2.
Let U and V be clopen subsets of ω2 and f∈H(ω2) such that f[U]=V. Then there is ϵ>0 such that if g∈H(ω2) is such that σ(f,g)<ϵ, then g[U]=V.
In order to prove Lemma 3.2 we will construct the homeomorphism H in ω steps. We shall define a Cauchy sequence of homeomorphisms {hn:n<ω}⊂H(ω2) which will converge to the homeomorphism H we want. That is,
(a)
if m<n<ω, σ(hn,hm)<2m1,
In each step, we will make two promises.
As it is usual in the construction of CDH spaces, we will promise a definition of H restricted to some finite subset of D. Let D={di:i<ω} and E={ei:i<ω} be enumerations. Thus, in step n<ω of the construction we will define two finite sets Dn∈[D]<ω and En∈[E]<ω, and a bijection φn:Dn→En. Then, we will have the following conditions:
(b)
for all n<ω, {di:i<n}⊂D2n and {ei:i<n}⊂E2n+1,
(c)
φm⊂φn, if m<n<ω, and
(d)
φn⊂hn, if n<ω.
The other promise we make in a step is that some element of ⟨⟨G∪{H}⟩⟩ will only have finitely many fixed points. Thus, we need to enumerate the elements of ⟨⟨G∪{H}⟩⟩ in advance.
Let h^ be a symbol. We will need to consider the free group generated by G and h^, which is denoted by G[h^] and consists of all non-empty, finite reduced words from the alphabet (G∖{1})∪{h^,h^−1}. Here reduced means cancelling h^ and h^−1 every time that they are found adjacent. We recall that given any alphabet, there always exists an empty word (different from the empty set), defined to be of length [math]. For our convenience, we will use the empty word in some parts below but we do not include it in the set G[h^].
Thus, G[h^] can be defined in the following recursive way. First, all elements of (G∖{1})∪{h^,h^−1} are words of length 1. Assume that f^ is a word of length n<ω and f^=α^β^, where α^ is a word of length 1 and β^ may be the empty word. If α^=h^, then h^−1f^ is a word of length n+1. If α^=h^−1, then h^f^ is a word of length n+1. Finally, if α^∈{h^,h^−1} and g∈G, then gf^ is a word of length n+1.
Given a word f^ of length n<ω, sometimes we will truncate f^ to a certain length. If 1≤m≤n, we will define f^m∈G[h^] to be the word of length m such that f^=α^f^m is a reduced expresion. Also, f^0 will be defined to be the empty word.
Consider f^∈G[h^] and h∈H(ω2). Then f^[h] will denote the evaluation defined in the obvious way, namely, replace each occurrence of h^ with h and each occurrence of h^−1 with h−1 and evaluate the composition. If f^ is the empty word, then f^[h] denotes the identity map. We highlight the following observation.
4.3.
For every fixed f^, the map h↦f^[h] is continuous in the topology of H(ω2).
If ψ is any bijection, we can also define f^[ψ] in a similar way. Notice that in this general case, f^[ψ] might be the empty function.
We need another important observation. Let f,g∈H(ω2). Then fix(f)=g[fix(g−1∘f∘g)]. This implies that f will have finitely many fixed points if and only if g−1∘f∘g has finitely many fixed points. Thus, it is not necessary to consider all words of G[h^], since it will be enough to check only some in order to obtain a cofinitary generated group.
First, we will define when a word f^∈/G is short. It is easier to define that f^ is not short if f^=β^−1α^β^ in its reduced form, for some word β^ of length 1. We will also say that f^∈G[h^]∖G is nice if it is short and f^=α^h^ in its reduced form. The distinction between short and nice will be important. Consider the following operations:
(i)
If f^=β^−1α^β^ for some word β of length 1, replace f^ with α^.
2. (ii)
If f^=g1α^g0 for g0,g1∈G and g0=g1−1, replace f^ with (g0∘g1)α^.
3. (iii)
If f^=gα^h^−1 for some g∈G, replace f^ with h^−1gα^.
4. (iv)
If f^=h^−1α^g for some g∈G, replace f^ with its inverse f^−1=g−1α^−1h^.
5. (v)
If f^=α^h^, do nothing.
Let us know describe an algorithm to simplify words. Start with f^∈G[h^]∖G. First, do (i) as long as it is possible. Since (i) shortens a word’s length by 2, this has to stop. After we stop, we have arrived to a short word, which satisfies the hypothesis of one of (ii) to (v). Do the corresponding operation. If we are in the hypothesis of (ii), after completing the operation once we will fall into the hypothesis of (iii) or (v). Applying operation (iii) finitely many times leads us to the hypothesis of (iv) and operation (iv) should take us to the hypothesis of (v).
Given a word f^∈G[h^]∖G, the above algorithm allows us to find a nice word g^ with the property that for any h∈H(ω2), fix(f^[h]) is finite if and only if fix(g^[h]) is finite. In this case, we will say that g^ is a nice word equivalent to f^. If we only apply operation (i) as long as it is possible, then we will say that g^ is a short word equivalent to f^.
We are ready to give an enumeration of all words that will ultimately represent all elements of ⟨⟨G∪{H}⟩⟩∖G. Let λ:ω→(G[h^]∖G)×ω be an enumeration of all pairs ⟨f^,n⟩, where f^ is a non-empty, reduced, nice word. We will assume that the following property holds:
(∗) Let λ(i)=⟨f^,m⟩ and λ(j)=⟨g^,n⟩ with m≤n. Assume that there are reduced words f′^ and α^, β^ (which may be empty) with g^=α^f′^β^ such that f^ is a nice word equivalent to f′^. Then i≤j.
Notice that λ(0)=⟨h^,0⟩ necessarily.
Given a word f^∈G[h^] we will decide the finite set of fixed points of the evaluation f^[H] in some step of the recursion. The homeomorphisms hn will change in every step of the recursion so we have a chance to avoid fixed points by modifying them carefully. However, the functions φn will fix the value of H at some points from early stages. Here is where some fixed points will be unavoidable. Assume we are in step n<ω of the construction and λ(n)=⟨f^,i⟩. Then the unavoidable fixed points we are talking about are exactly the fixed points of f^[φn], of which there are finitely many (since φn is finite).
(e)
Let n<ω and f^∈G[h^] such that there is m≤n with λ(m)=⟨f^,0⟩. Then fix(f^[φm])=fix(f^[φn]).
(f)
Let m≤n<ω and λ(m)=⟨f^,i⟩. Then fix(f^[hn]) is a subset of the clopen set ⋃{B(x,i+11):x∈fix(f^[φm])}.
Condition (e) says that all fixed points of f^ will be decided in the step where it appears for the first time. Condition (f) is added in order to control fixed points. According to 4.1 and 4.3, condition (f) implies that fix(f^[H]) equals the finite set fix(f^[φn]), where λ(n)=⟨f^,0⟩.
The last part of our induction hypothesis will be a condition that implies that Hn has no fixed points for any n<ω.
(g)
Let n<ω and 1≤ℓ<ω. Then fix(h^ℓ[φn])=∅.
Strictly speaking, condition (g) is not necessary for our purposes. However, it will help us prove the inductive step.
We have listed all conditions we need for the recursion so next we will describe a step. For n=0, take D0=E0=φ0=∅ and h0 any homeomorphism with no fixed points but h02=1.
So now assume that k<ω and we have defined hj, Dj, Ej and φj for j≤k, satisfying conditions (a) to (f). In step k+1 we have to define hk+1. What we will do is start with hk and modify its definition in order to obtain hk+1. This modification will be ϵ-close to hk for some proper ϵ>0.
Claim 1**.**
There is ϵ>0 such that if σ(hk,hk+1)<ϵ, then (a) for n=k+1 and (f) for n=k+1, m≤k hold.
First, for (a), let m<k+1<ω. We know that σ(hm,hk)<2m1, so ϵ must be smaller than 2m1−σ(hm,hk) so that σ(hm,hk+1)≤σ(hm,hk)+σ(hk,hk+1)<σ(hm,hk)+ϵ<2m1.
Now, we turn to (f), where n=k+1, m≤k. Let λ(m)=⟨g^,j⟩ and let U be the complement of ⋃{B(x,i+11):x∈fix(f^[φm])}. Since U is clopen and g^[hk] has no fixed points in U, by 4.1 above, there is δ<0 such that if h∈H(ω2) with σ(g^[hk],h)<δ, then fix(h)∩U=∅. By 4.3, there is δ′>0 such that if σ(hk,h)<δ′, then σ(g^[hk],g^[h])<δ. Thus, we have to take ϵ<δ′.
Since the conditions above are only finitely many, we can indeed choose such an ϵ>0 and Claim 1 is proved.
∎
Here we remark that (f) for m=n=k+1 is harder and its proof is part of the work below.
Next, we will define Dk+1, Ek+1 and φk+1. There are two cases, depending on the parity of k. We will assume that k+1 is even, the other case can be dealt in an equivalent way. So let d be the element D∖Dk with the least subscript and define Dk+1=Dk∪{d}. It is enough to select e∈E such that Ek+1=Ek∪{e} and φk+1=φk∪{⟨d,e⟩}, so that condition (b) holds. However, it is possible that some choices of e might violate condition (e). Luckily, the set of elements of E we have to avoid is finite.
Claim 2**.**
There is a countable dense set F⊂E∖(Dk∪Ek) such that if we choose e∈F and define φk+1=φk∪{⟨d,e⟩}, then condition (b) holds for k+1=2n and condition (e) holds for n=k+1.
Let Gk+1 be the set of all elements g∈G such that there is m≤k+1, f^, α^,β^ words such that λ(m)=⟨f^,i⟩ for some i<ω and either f^=α^gβ^ or f^=α^g−1β^ is a reduced word. Notice that Gk+1 is finite. Then, define
[TABLE]
Clearly, E∖F is finite so F is countable dense. It also follows that F⊂E∖(Dk∪Ek). In order to prove Claim 2, let e∈F and define ψ=φk∪{⟨d,e⟩}.
We only have to prove that given f^, where λ(m)=⟨f^,0⟩ for some m≤k, fix(f^[φm])=fix(f^[ψ]). Let ℓ be the length of f^. By induction, fix(f^[φm])=fix(f^[φk]) so we only need to prove that fix(f^[φk])=fix(f^[ψ]). Notice that since φk⊂ψ, then fix(f^[φk])⊂fix(f^[ψ]) . Recall that since f^ is nice, f^1=h^ so fix(f^[ψ])⊂Dk∪{d}.
Let x∈fix(f^[ψ])∖fix(f^[φk]). Then necessarily f^[φk] is not defined at x. Let t be the first 1≤j≤ℓ such that f^j[φk] is not defined at x. Let f^t=α^f^t−1 be such that α^ is of length 1 and f^t−1 is of length t−1. Also, for every 1≤j≤ℓ, let xj=f^j[ψ](x). Notice that for 1≤j<t, xj=f^j[φk](x).
Notice that α^ cannot be a member of G. To see this, notice that since f^t−1[φk] is defined at x, α^ is not defined at xt−1. The only way this can happen is when α^∈{h^,h^−1}. If α^=h^, then φk is not defined at xt−1 but ψ is; the only way this is possible is if xt−1=d and xt=e. By a similar reasoning, if α^=h^−1, then xt−1=e and xt=d.
Case 1: xt−1=d, xt=e and α^=h^
If t=ℓ, f^t=f^ so f^[ψ](x)=e. Since e∈/Dk∪{d}, x=e and we obtain a contradiction. Thus, t<ℓ must hold.
Let β^ be a word of length 1 such that f^t+1=β^f^t. If β^∈G, then by the definition of F, f^t+1[ψ](x)=β^[ψ](xt)=β^(xt)=∈/Dk∪{d}∪Ek. Then there are two possibilities next:
•
If ℓ=t+1, then x is not a fixed point of f^[ψ]=f^t+1[ψ], which is a contradiction.
•
If t+1<ℓ, let γ^ be a word of length 1 with f^t+2=γ^f^t+1. Necessarily, γ^∈{h^,h^−1} so γ^[ψ] is not defined in xt+1. So f^[ψ] is not defined in x, which is a contradiction.
The only other possibility is that β^=h^ (otherwise, α and β cancel). Since e∈/Dk∪{d} by the definition of F, then β^[ψ] is not defined in e. So f^[ψ] is undefined at x, which is a contradiction.
Case 2: xt−1=e, xt=d and α^=h^−1
First, notice that t=1. Otherwise, f^t−1[ψ] is the identity function and e=xt−1=f^t−1[ψ](d)=d, which contradicts the definition of F. So there exists a word β^ of length 1 with f^t−1=β^f^t−2.
Clearly, β^ cannot be equal to h^ because otherwise, α^ and β^ cancel. Moreover, β^ cannot be equal to h^−1 either. Indeed, e=f^t−1[φk](x)=[φk−1∘(f^t−2[φk])](x)=φk−1(f^t−2[ψ](x)) implies that φk is defined at e, which contradicts the definition of F.
So β^ is in G. Now, let us argue that xt−2∈Dk∪Ek, which will be a contradiction by the definition of F and the fact that β^[φk](xt−2)=e. If t−2=0 and f^t−2 is the empty word, then clearly xt−2=x∈Dk. Otherwise, let γ^ be a word of length 1 with f^t−2=γ^f^t−3. Then γ^∈{h^,h^−1} and γ^[φm]∈{φm,φm−1} so clearly xt−2∈Dk∪Ek. Thus, in this case we also get a contradiction.
Thus, since we obtain a contradiction in all cases considered, we conclude that fix(f^[φk])=fix(f^[ψ]) and Claim 2 is proved.
∎
We promised to define Dk+1, Ek+1 and φk+1 before the statement of Claim 2, and we are ready since we only have to choose e∈F. Since F is dense, we just choose any e∈F such that ρ(e,hk(d))<ϵ/2 for ϵ>0 given in Claim 1. Define Ek+1=Ek∪{e} and φk+1=φk∪{⟨d,e⟩} so that by Claim 2, conditions (b), (c) and (e) hold.
At this point we have to look at condition (g). We will simply show how the definition of F implies (g) for n=k+1 and all 1≤ℓ<ω. So assume that 1≤ℓ<ω and there is x∈fix(h^ℓ[φk+1]), we will reach a contradiction. Let x0=x and xj=(φk+1)j(x) for 1≤j≤ℓ. Notice that {xj:j≤ℓ}⊂Dk+1. First, assume that d∈{xj:j≤ℓ}. Let t be the first 1≤j≤ℓ such that xj=d. Since x0=xℓ, t<ℓ. Thus, xt+1=e. However, by the definition of F, e is not in Dk+1, the domain of φk+1. This is impossible since any xj with j≤ℓ is in the domain of φk+1. It follows that {xj:j≤ℓ}⊂Dk. But this implies that x∈fix(h^ℓ[φk]), which contradicts our inductive hypothesis (g) for n=k. Thus, (g) follows for n=k+1.
The next step is to construct hk+1 itself. We will start with hk and in a finite sequence of steps, construct homeomorphisms hk+1=η0,η1,…,ηa such that σ(ηj,ηj+1)<δj for some appropriate δj. The last homeomorphism constructed will be ηa=hk+1. The only condition that we need on that sequence of δj is that their sum is <ϵ so that the hypothesis of Claim 1 holds. We will not worry about the exact value of a because we can take ηj=1/2j+1 for each j.
The first modification we need is a homeomorphism η∈H(ω2) with σ(hk,η)<ϵ/2, and φk+1⊂η. Since we chose e∈F such that ρ(e,hk(d))<ϵ/2, it is possible to modify hk in a small neighborhood of d that does not intersect Dk.
Next, we need is to modify η to a homeomorphism η′ in order that (f) holds for m=n=k+1. This is the hardest part of the proof. Further, we need that φk+1⊂η′ so we cannot modify η at points of Dk. In fact, we prove the following claim, where we bound the set of fixed points of f^[η′] for every f that we have considered so far.
Claim 3**.**
Let η∈H(ω2) and δ>0 be such that φk+1⊂η, σ(η,hk)<ϵ. Also, let f^ be such that λ(m)=⟨f^,i⟩ for some m≤k+1 and i<ω. Then, if U is a clopen set of ω2 such that U∩fix(f^[φk+1])=∅, there is η′∈H(ω2) such that φk+1⊂η′, σ(η,η′)<δ and U∩fix(f^[η′])=∅.
We work by induction on m. The case m=0 immediately holds from the definition of h0 and condition (g). So assume that m>0 and thus, f^ has length ℓ≥2.
Step 1: Let δ′>0. If x∈Dk+1∖fix(f^[φk+1]), then there is η′∈H(ω2) such that φk+1⊂η′, σ(η,η′)<δ′ and x∈/fix(f^[η′]).
We only need to prove Step 1 for a fixed such x∈Dk+1∖fix(f^[φk+1]), since there are finitely many points in Dk+1∖fix(f^[φk+1]) and we can appeal to 4.2. That x∈/fix(f^[φk+1]) means one of two things. If f^[φk+1] is defined at x and f^[φk+1](x)=x, we just let η′=η. Otherwise, f^[φk+1] is undefined at x, we will assume that this is the case.
So define x0=x and xj=f^j[η](x) for j≤ℓ. Since f^1=h^, f^1[φk+1]=φk+1 is defined at all points of Dk+1. Thus, there exists t which is the minimal j<ℓ such that f^j+1[φk+1] is undefined at x. Notice that xj=f^j[φk+1](x) for j≤t. Let α^ be the word such that f^t+1=α^f^t. Then α^∈/G since otherwise f^t+1 would be defined at x. There are two cases: α^ is either equal to h^ or equal to h^−1.
In order to avoid that x is a fixed point of f^, we will proceed as follows: we will either change the definition of η in a small neighborhood of xt, if α^=h^; or change the definition of η−1 in a small neighborhood of xt, if α^=h^−1. This is possible since xt∈/Dk+1 if α^=h^ and xt∈/Ek+1 if α^=h^−1. However, first we need to make sure that by changing this definition, we do not loose control of the definition of η or η−1 on neighborhoods of points of the form xj with j>t.
We will assume that α^=h^. The other case can be treated in an analogous way. Let β^∈G[h^] be such that f^=β^f^t. Notice that β^ has length ℓ−t>0. Let
[TABLE]
Given j∈A, it easily follows that β^j is nice and xt∈/fix(β^j[φk+1]) since xt is not defined at φk+1. By condition (∗) in the definition of λ and our inductive hypothesis, it is easy to argue that there is η0∈H(ω2) such that φk+1⊂η0, σ(η,η0)<δ′/3 and xt∈/fix(β^j[η0]) for all j∈A.
Next, consider the set
[TABLE]
We would like to obtain a homeomorphism η′′∈H(ω2) such that φk+1⊂η′′, σ(η0,η′′)<δ′/3 and xt∈/fix(β^j[η′′]) for all j∈B. However, this will not be as easy as in the case for j∈A, where it followed by the induction hypothesis in a straightforward manner.
We will use induction on the elements of B. So let j∈B and inductively assume that for some 0<δ′′<δ′/3 there is η1∈H(ω2) such that φk+1⊂η1, σ(η0,η1)<δ′′ and xt∈/fix(β^i[η1]) for all i∈A and all i∈B with i<j (if any). Notice that even though β^j is not short, we can write β^j=h^−1μ^−1γ^μ^h^ where γ^ is a short word (and μ^ may be of length [math]).
Choose a clopen set W with the following properties:
(1)
xt∈W,
(2)
W and η1[W] both have diameter <δ′′,
(3)
W does not intersect Dk+1, and
(4)
if i∈A or i∈B and i is at most the length of μ^h^, then (μ^h^)i[η1](xt)∈/W.
The set fix(γ^[φk+1]) is finite so there is a∈η1[W] such that b=μ^[η1](a)∈/fix(γ^[φk+1]). Then it is elementary to construct η2∈H(ω2) such that η2↾ω2∖W=η1↾ω2∖W and η2(xt)=a. Clearly, σ(η1,η2)<δ′′ and φk+1⊂η2 by properties (2) and (3). Moreover, by property (4) it follows that b=μ^[η2](a), which implies that μ^h^[η2](xt)∈/fix(γ^[φk+1]).
The word γ^ might not be nice, but it is equivalent to a nice word γ^′ by means of the simplification algorithm given above, after applying some instances of operations (ii), (iii) and (iv). Thus, the sets fix(γ^[φk+1]) and fix(γ^′[φk+1]) are related by this algorithm. By property (∗) of the definition of λ, we may apply our inductive hypothesis for γ^′ in any clopen set missing fix(γ^′[φk+1]).
From these considerations, it is not hard to argue that there exists η3∈H(ω2) with φk+1⊂η3, σ(η2,η3)<δ′′ and μ^h^[η3](xt)∈/fix(γ^[η3]). This easily implies that xt∈/fix(β^j[η3]). Notice that by choosing δ′′ small enough according to 4.2 and 4.3, we obtain that xt∈/fix(β^i[η3]) for all i∈A and all i∈B with i≤j.
Thus, after this procedure, it is possible to obtain η′′ as desired. Namely, φk+1⊂η′′, σ(η,η′′)<2δ′/3 and xt∈/fix(β^j[η′′]) for all j∈A∪B. We are ready to construct η′. Similarly as before, choose a clopen set W with the following properties:
(1)
xt∈W,
(2)
W and η′′[W] both have diameter <δ′/3,
(3)
W does not intersect Dk+1, and
(4)
if i∈A∪B, then β^j[η′′](xt)∈/W.
Let ν^ be such that β^=ν^h^. Choose a∈η′′[W] be any point such that ν^[η′′](a)=x. Then consider η′∈H(ω2) such that η′↾ω2∖W=η′′↾ω2∖W and η′(xt)=a. Clearly, (2) and (3) imply that σ(η′,η′′)<δ′/3 and φk+1⊂η′. Then, σ(η′,η)<δ′. By (4), ν^[η′](a)=ν^[η′′](a) so β^[η′](xt)=x. Moreover, f^t[η′]=f^t[φk+1] so f^t[η′](x)=xt. So we obtain that f^[η′](x)=x.
This finishes the proof of Step 1. As mentioned before, by 4.2 and 4.3 we may assume that x∈/fix(f^[η′]) in fact holds for all x∈Dk+1∖fix(f^[φk+1]). In order to simplify notation, from now on we will assume that the original homeomorphism η satisfies the statement of Step 1.
Next, for each x∈Dk+1∖fix(f^[φk+1]), let Ux be a clopen set such that x∈Ux and f^[η][Ux]∩Ux=∅. Define V=U∖⋃{Ux:x∈Dk+1∖fix(f^[φk+1])} and consider the following set:
[TABLE]
Notice that for all j∈A, f^j is nice and V∩fix(f^j[φk+1])=∅. Thus, by our inductive hypothesis we may assume that V∩fix(f^j[η′])=∅ for all j∈A. Consider now the set
[TABLE]
Just like in the proof of Step 1, we cannot get rid of fixed points of f^j[η′] where j∈B so easily and we need to do some extra work.
Let j∈B. Write
[TABLE]
where γj is short. Also, let Vj=f^j[η][V] and let ℓj be the length of μjh^.
Step 2: Let δ′>0. There is η′∈H(ω2) with φk+1⊂η′, σ(η,η′)<δ′; and a clopen set Z⊂V such that, given j∈B and y∈fix(γj[φk+1])∩Vℓj, then y∈(μjh^)[η′][Z] and Z∩fix(f^[η′])=∅.
Denote
[TABLE]
and for each j∈B, let
[TABLE]
The set Z will be constructed by a recursive procedure on j∈B. Let us describe our inductive hypothesis next.
We will assume that there is η0∈H(ω2) such that φk+1⊂η0, σ(η,η0)<δ′′ for some appropriate δ′′>0. Given i∈B with i<j and y∈fix(γi[φk+1])∩Vℓi, we shall assume that there are clopen sets Wi,y0, Wi,y1 with the following properties, for π=η0:
(1)π
y∈(μih^)[π][Wi,y0],
2. (2)π
Wi,y1=f^i[π][Wi,y0], and
3. (3)π
if i′∈(A∪B)∖{i}, then (Wi,y0∪Wi,y1)∩f^i′[π][Wi,y0]=∅.
The advantage of properties (1)π, (2)π and (3)π is that they are open. That is, since (1)η0, (2)η0 and (3)η0 hold, if η′′ is close enough to η0, then (1)η′′, (2)η′′ and (3)η′′ also hold. Thus, in this step we only need to worry about points in fix(γj[φk+1])∩Vℓj as long as we do small modifications.
In what follows, we will assume that fix(γj[φk+1])∩Vℓj consists of only one point y0. It is not hard to extend this argument to the case when fix(γj[φk+1])∩Vℓj is finite of arbitrary cardinality. Let x0 be the point of V with (μjh^)[η0](x0)=y0.
Notice that f^j[η0](x0)=x0. Notice that (μih^)(x0)∈/S<j because (3)η0 implies that there are no fixed points of f^j[η0] in the clopen sets Wi,y0 with i∈B and i<j. Let W be a clopen set containing x0 and for each i∈B, i≤j, let Wi=μih^[η0][W]; choose W so that Wi∩fix(γi[φk+1])=∅ whenever i∈B, i≤j.
We have already explained in Step 1 that regardless of whether {γi:i∈B} are nice or not, there exists a nice word equivalent to it so we can also use our inductive hypothesis. That is, we may find η1∈H(ω2) such that φk+1⊂η1, σ(η0,η1)<δ′′ and Wi∩fix(γi[η1])=∅ for i∈B, i≤j. Naturally, we choose η1 close enough to η0 so that (1)η1, (2)η1 and (3)η1 hold and by 4.2, Wi=μih^[η1][W] for i∈B, i≤j.
From these conditions, it follows that there is x1∈V∩W with (μjh^)[η1](x1)=y0. This point has the additional property that f^i[η1](x1)=x1 for i∈A or i∈B, i<j; and (μih^)(x1)∈/S<j. Thus, we may assume that x1∈/Wi,y0∪Wi,y1 for all y∈S<j, by shrinking the clopen sets if necessary.
Let W0 and W1 be clopen sets such that x1∈W0∩W1, W1=f^j[η1][W0] and (W0∪W1)∩(Wi,y0∪Wi,y1)=∅ for all y∈S<j. We may also choose W0 in such a way that W0∩f^i[η0][W0]=∅ whenever i∈B and i<j. In fact, by the discussion before the statement of Step 2, let us also choose W0 so that W0∩f^i[η0][W0]=∅ whenever i∈A.
Given i∈B with i>j, let νi be the word such that f^i=νif^j. Notice that νi is short (but not nice). Since the set
[TABLE]
is finite, there is a point x2∈W0∩W1 that misses it and ρ(x2,x1)<δ′′. Let a=η1(x1). So consider η2∈H(ω2) with η2(x2)=a and η2 is equal to η1 outside some clopen set W⊂W0∩W1 containing x1 and x2 of diameter <δ′′.
Now, by our choice of W0 and η2, it is not hard to argue that μj[η1](a)=μj[η2](a). Then, it follows that μjh^[η2](x2)=y0 so f^j[η2](x2)=x2. If we choose W small enough (thus, x2 close enough to x1), η2 will have the properties of η1 that we have mentioned before, with x2 taking the place of x1. Moreover, we have the advantage that x2∈/fix(νi[φk+1]) for i∈B with i>j.
By shrinking W0 we may assume that W1∩fix(νi[φk+1])=∅ for i∈B with i>j. By our inductive assumption, there is η′′∈H(ω2) such that σ(η′′,η1)<δ′′, φk+1⊂η′′ and W0∩W1∩fix(νi)=∅ for all i∈B, i>j. Let us define η3∈H(ω2) to be equal to η′′ for points in W0∩W1 and equal to η2 otherwise. If η′′ is close enough to η2 so that η′′[W0∩W1]=η2[W0∩W1] (by 4.2), η3 will be well-defined.
Let x3∈W0 be such that η3(x3)=a. Since μj[η3](a)=μj[η2](a)=y, we obtain that μjh^[η3](x3)=y0 so f^j[η3](x3)=x3 and x3∈/fix(νi[η3]) for i∈B with i>j. Finally, shrink W0 so that x3∈W0 and W0∩fix(νi[η3])=∅ for all i∈B with i>j. Define Wj,y00=W0 and Wj,y10=W1. Then it follows that (1)η3, (2)η3 and (3)η3 hold for y=y0.
So we have finished the recursive construction of the clopen sets Wi,y0 and Wi,y1 for all y∈fix(γi[φk+1])∩Vℓi, where i∈B. Also, we have a homeomorphism η′′′∈H(ω2) with φk+1⊂η′′′ such that (1)η′′′, (2)η′′′ and (3)η′′′ hold for all y∈S. By choosing δ′′ carefully, we may assume that σ(η,η′′′)<δ′/2. We are thus ready to construct η′∈H(ω2) required by the statement of Step 2.
Fix some j∈B and y∈fix(γj[φk+1])∩Vℓj. Let αj and βj be the words such that f^=(αj)−1(βj)(αj)(fj^) and βj is short. We need to do some modifications in order to remove some fixed points from βj. However, we will not be as detailed as before because the arguments are completely analogous. First, we may modify η′′′ inside Wj,y0 so that there is x∈Wj,y0∩Wj,y1 with μjh^(x)=y and x∈/fix(βj[φm]). After this, we may shrink Wj,y0 so that αj[η′′′][Wj,y1]∩fix(βj[φm])=∅. Then, by another modification of η′′′, we may further assume that αj[η′′′][Wj,y1]∩fix(βj[η′′′])=∅. These three steps can be proved in essentially the same way as similar situations before.
Thus, we may assume that η′∈H(ω2) is such that (1)η′, (2)η′ and (3)η′ hold for all y∈S and moreover, αj[η′][Wj,y1]∩fix(βj[η′])=∅ every time j∈B and y∈fix(γj[φk+1])∩Vℓj.
We are only left to define Z. For each j∈B and y∈fix(γj[φk+1])∩Vℓj, let xj,y∈Wj,y0 be such that μjh^[η′](xj,y)=y. Then, f^j[η′](xj,y)=xj,y. Since xj,y∈Wj.y1, then αj[η′](xj,y) is not a fixed point of βj[η′]. Thus, (αj)−1(βj)(αj)[η′](xj,y)=xj,y. From this it follows that
f^[η′](xj,y)=xj,y. So simply define Z to be a clopen set containing the finite set {xj,y:j∈B,y∈S} and such that Z∩f^[η′][Z]=∅.
This concludes the proof of Step 2. As in the case of Step 1, in what follows we will assume that η in fact has the properties in the statement of Step 2. This is done in order to simplify notation. Let V′=V∖Z. For j∈A we already know that V′∩fix(f^j[η])=∅, next we would like to obtain this for j∈B.
Fix j∈B. By the definition of Z, we know that μjh^[η][V′] does not intersect fix(γj[φk+1]). Since γj is short, we have already argued that we may apply our inductive hypothesis. Thus, we will assume that η is already such that μjh^[η][V′] does not intersect fix(γj[η]). This easily implies that V′∩fix(f^j[η])=∅.
Thus, we may assume that V′∩fix(f^j[η])=∅ for all j∈A∪B. By compactness, there exists a partition V of V′ into clopen sets such that every time W∈V and j∈A∪B, then W∩f^j[η][W]=∅.
Step 3: Let W∈V and δ′>0. Then there exists η′∈H(ω2) such that φk+1⊂η′, σ(η,η′)<δ′ and W∩fix(f^)=∅.
Let W′=η[W]. We can find a finite partition W=⋃{Wi:i<t} into clopen sets, where the diameter of both Wi and Wi′=η[Wi] is less than δ′ for all i<t. Write f^=α^h^. For each i<t, let Wi′=Ci0∪Ci1 be a partition into pairwise disjoint clopen sets. Also, for each i<t, choose a partition Wi=Wi0∪Wi1 so that α^[η][Ci0]⊂Wi1 and α^[η][Ci1]⊂Wi0.
Let us define η′∈H(ω2) in the following way: η′↾ω2∖W=η↾ω2∖W and for each i<t, η′↾Wi0:Wi0→Ci0 and η′↾Wi1:Wi1→Ci1 are arbitrary homeomorphisms. From the definition of the partition of W it follows that σ(η,η′)<δ′. Also, φk+1⊂η′ because W∩Dk+1=∅.
Now, let us see that f^[η′] does not have fixed points. First, recall that if j∈A∪B, then W∩f^j[η][W]=∅. From this, it is not too hard to argue that α^[η]↾W′=α^[η′]↾W′. Let i<t. Then
[TABLE]
and it can be proved in an analogous way that f^[η′][Wi1]⊂Wi0. Thus, we obtain that Wi∩fix(f^)=∅ for all i<t. Thus, W∩fix(f^)=∅.
This concludes the proof of Step 3. Applying Step 3 for all W∈V, it easily follows that V′∩fix(f^)=∅. So this finally completes the proof of the claim.
∎
So just choose U to be equal to the complement of ⋃{B(x,i+11):x∈fix(f^[φk+1])} and use Claim 3. We immediately obtain the conclusion of (f) for m=n=k+1. This concludes the recursive construction. And, as discussed above, this is enough to complete the proof of Lemma 3.2.
5. Generalizations about cofinitary groups
We incidentaly obtain as a corollary that for the Cantor set, being CDH is witnessed by a proper subgroup of H(ω2), the elements of which have a special property. We will say that a topological space X is CDH with respect to a group G⊂H(X) if every time D,E⊂X are countable dense sets, there exists h∈G such that h[D]=E.
5.1. Corollary
CH implies that there exists a cofinitary group G⊂H(ω2) such that ω2 is CDH with respect to G.
Proof.
Enumerate all pairs countable dense subsets in a sequence of length ω1 and recursively apply Lemma 3.2.
∎
So it is natural to ask whether CH is necessary.
5.2. Question
Is there a cofinitary group G⊂H(ω2) such that ω2 is CDH with respect to G, in ZFC?
It turns out that if we assume Martin’s axiom we can prove a version of Lemma 3.2 which gives us the following result.
5.3. Theorem
MA implies that there exists a cofinitary group G⊂H(ω2) such that ω2 is CDH with respect to G.
Proof.
The proof is analogous to the proof of Corollary 5.1: enumerate all pairs of countable dense sets and recursively construct a cofinitary group. Clearly, we need some kind of version of Lemma 3.2 for groups of cardinality <c under MA.
Let D,E be two countable dense sets of ω2 and let G⊂H(ω2) be a cofinitary subgroup of cardinality <c. We would like to define H∈H(ω2) such that H[D]=E and ⟨⟨G∪{H}⟩⟩ is cofinitary. We will define a forcing P and argue that it is ccc. It will remain to use MA to extract a generic subset from P and use it to define H, this part we leave to the reader who can mimic the proof of Lemma 3.2.
We shall use all terminology from Section 4. Recall that the metric ρ in ω2 has its open balls clopen and that σ is the induced metric in H(ω2). A set of short words W⊂G[h^] will be called downwards closed if every time f^∈W and there are words g^,α^,β^ such that f^=α^g^β^ is a reduced expression and g^ is short, then g^∈W.
So define p∈P if and only if p=⟨hp,φp,np,Wp⟩, where:
(1)
hp∈H(ω2),
2. (2)
φp⊂D×E is a finite bijection,
3. (3)
φp⊂hp,
4. (4)
for all 1≤ℓ<ω, fix(φpℓ)=∅.
5. (5)
1≤np<ω,
6. (6)
Wp is a finite set of short words of G[h^] that is downwards closed, and
7. (7)
if f^∈Wp, the set fix(f^[hp]) is a subset of
⋃{B(x,1/np):x∈fix(f^[φp])}.
We define q≤p in P if either p=q or the following hold:
(i)
np<nq,
2. (ii)
φp⊂φq,
3. (iii)
σ(hp,hq)<1/np−1/nq, and
4. (iv)
if f^∈Wp, then fix(f^[φp])=fix(f^[φq]).
Naturally, all of these properties have some corresponding statement in Section 4. Now we prove that in fact P is σ-centered. For this, we have to write P as a countable union of centered subsets.
For each p∈P, notice that condition (7) is open. This means that there exists 1≤Mp<ω such that if f^∈W and g∈H(ω2) is such that σ(g,hp)<1/Mp, then fix(f^[g]) is still contained in ⋃{B(x,1/np):x∈fix(f^[φp])}.
Fix some countable dense set D⊂H(ω2). So for fixed finite φ⊂D×E, n,M<ω and h∈D, consider the set:
[TABLE]
Since there are countably many such sets, it is enough to prove that P∗ is centered.
So let Q⊂P be a finite set, we need to construct a common extension r∈P. Define nr=n+1 and φr=φ. Clearly, these definitions are enough to ensure properties (i), (ii) and (iv) of the extension. Also, let
[TABLE]
this is clearly a finite set of short words that is downwards closed.
Finally, choose any hr∈H(ω2) with φ⊂hr and σ(h,hr)<1/(2M), this is not hard to do. Notice that hr satisfies property (7) because M>Mq for all q∈Q. Also, (iii) holds trivially for all q∈Q. Thus, this such constructed p is an element of P that is a common extension to all elements of Q.
Thus, our poset is σ-centered. It remains to find adequate dense sets that will allow us to construct the desired homeomorphism H using a generic set of P. However, this argument is exactly analogous to the proof of Lemma 3.2 in Section 4. Thus, we will leave this work to the reader.
∎
Another similar question is whether fixed points are really necessary in these types of subgroups.
5.4. Question
Let G⊂H(ω2) be a subgroup such that ω2 is CDH with respect to G. Does there exist some h∈G such that fix(h)=∅?
Then, we can also ask for similar properties for other CDH spaces.
5.5. Question
Let X be the the space of irrationals, a metrizable manifold or the Hilbert cube.
(a)
Is there a cofinitary group G⊂H(X) with X is CDH with respect to G?
(b)
In case that X does not have the fixed point property, is there a G⊂H(X) such that X is CDH with respect to G and fix(G)=∅?
6. Final remarks about compact CDH spaces
The first natural question is if the space constructed in the proof of Theorem 1.2 can be constructed with no further hypothesis from ZFC.
6.1. Question
Is it consistent that all infinite compact Hausdorff CDH spaces contain topological copies of the Cantor set?
From the fact that the ZFC example of a compact CDH space with uncountable weight constructed in [8] is linearly ordered, a natural question is whether the example constructed in this paper can be linearly ordered. From the proof it seems hard to try to preserve the order relation in the recursive construction.
6.2. Proposition
An infinite, linearly ordered, CDH, compact and Hausdorff space must contain topological copies of the Cantor set.
Proof.
Assume that there exists a space X with the characteristics in the statement of this proposition. First, it is not hard to prove that any CDH space is a topological sum of homogeneous CDH spaces, this can be easily done following the proof of [6, Theorem, p. 20]. By the well-known characterization of the reals as the only separable, connected, linearly ordered set without endpoints, every non-trivial connected component of X is homeomorphic to [0,1]. So we may assume that X is [math]-dimensional and moreover it does not have isolated points.
By a result of Ostaszewki’s ([13]), it is not hard to see that there exists a set Y dense in (0,1) such that X is homeomorphic to the space ([0,1]×{0})∪(Y×{1}) with the topology given by the lexicographic order.
Now let us show that Y has the Baire property. If not, there exists a family {Cn:n<ω} of closed and nowhere dense subsets of [0,1] and an open set U⊂[0,1] such that Y∩U⊂⋃{Cn:n<ω}. Then there exists a Cantor set C⊂U∖Y and C×{0}⊂X is homeomorphic to the Cantor set.
Using that Y has the Baire property, it is possible to use arguments similar to the ones in Section 3 of [1] (or Section 3 in [7]) that show that X is not CDH. We leave the details to the reader.
∎
Finally, the techniques we have only produce [math]-dimensional spaces so we ask the following.
6.3. Question
Is there a connected example of a compact Hausdorff CDH space that contains no Cantor sets?
Bibliography14
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Arhangel’skiĭ, A. V. and van Mill, J.; “On the cardinality of countable dense homogeneous spaces.”, Proc. Amer. Math. Soc. 141 (2013), no. 11, 4031–4038.
2[2] Arhangel’skiĭ, A. V. and van Mill, J.; “Topological Homogeneity.”, Recent progress in general topology. III, 1–68, Atlantis Press, Paris, 2014.
3[3] Cameron, Peter J.; “Cofinitary permutation groups.” Bull. London Math. Soc. 28 (1996), no. 2, 113–140.
5[5] Engelking, R.; “General topology.” Translated from the Polish by the author. Second edition. Sigma Series in Pure Mathematics, 6. Heldermann Verlag, Berlin, 1989. viii+529 pp. ISBN: 3-88538-006-4