
TL;DR
This paper investigates the complexity of the shift map's isomorphism class on a special topological space, showing it cannot be distinguished from its inverse by simple topological properties, and explores implications under certain set-theoretic axioms.
Contribution
It proves that the isomorphism classes of the shift map and its inverse cannot be separated by Borel sets, and analyzes the nature of continuous images of the shift map under different set-theoretic assumptions.
Findings
The isomorphism classes of $\sigma$ and $\sigma^{-1}$ are not Borel separable.
Under $ extsf{OCA}+ extsf{MA}$, the set of continuous images of $\sigma$ is non-Borel.
The result contrasts with the case under $ extsf{CH}$ where continuous images form a closed set.
Abstract
The \emph{shift map} is the self-homeomorphism of induced by the successor function on . We prove that the isomorphism classes of and cannot be separated by a Borel set in , the space of all self-homeomorphisms of equipped with the compact-open topology. Van Douwen proved it is consistent for and not to be isomorphic. Whether it is also consistent for them to be isomorphic is an open problem. The theorem stated above can be thought of as a counterpoint to van Douwen's result: while and may not be isomorphic, there is no simple topological property that distinguishes them. As a relatively straightforward consequence of the main theorem, we deduce that implies the set of continuous…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The isomorphism class of the shift map
Will Brian
W. R. Brian
Department of Mathematics and Statistics
University of North Carolina at Charlotte
9201 University City Blvd.
Charlotte, NC 28223-0001
[email protected] wrbrian.wordpress.com
Abstract.
The shift map is the self-homeomorphism of induced by the successor function on . We prove that the isomorphism classes of and cannot be separated by a Borel set in , the space of all self-homeomorphisms of equipped with the compact-open topology.
Van Douwen proved it is consistent for and not to be isomorphic. Whether it is also consistent for them to be isomorphic is an open problem. The theorem stated above can be thought of as a counterpoint to van Douwen’s result: while and may not be isomorphic, there is no simple topological property that distinguishes them.
As a relatively straightforward consequence of the main theorem, we deduce that implies the set of continuous images of fails to be Borel in . (Here a “continuous image” of is meant in the sense of topological dynamics: any such that for some continuous surjection .) This contrasts starkly with a recent theorem of the author showing that under , the continuous images of form a closed subset of .
Key words and phrases:
topological dynamical systems, Stone-Čech remainder, compact-open topology, shift map
2010 Mathematics Subject Classification:
06E25, 08A35, 54H20, 03E35
1. Introduction
The shift map sends an ultrafilter to the unique ultrafilter generated by . Equivalently, is the restriction to of the unique map that continuously extends the successor function on .
Let denote the group of all self-homeomorphisms of . Two maps are isomorphic if they are conjugate in this group, i.e., if there is some third such that . In this case we say that is an isomorphism from to .
\omega^{*}$$\omega^{*}$$\omega^{*}$$\omega^{*}$$f$$g$$h$$h$$f\cong g
This is the standard notion of isomorphism in the category of topological dynamical systems. Isomorphic maps are topologically indistinguishable, in the sense that one cannot tell them apart without first assigning labels to the points of .
Beginning in the late 1980’s, van Douwen considered the question of whether it is possible for and to be isomorphic. He proved in [7] that it is consistent with for and not to be isomorphic. Specifically, van Douwen showed that if is an isomorphism from to , then cannot be trivial. A trivial map is one that does continuously extends to a function ; or, equivalently, trivial maps are those that are “induced” by functions . Shelah proved in [10] (prior to the appearance of van Douwen’s paper) that it is consistent for every member of to be trivial. Shelah and Steprāns showed later that this follows from [11], and ultimately Veličković showed that suffices to prove every is trivial, while \mathsf{MA}+\neg$$\mathsf{CH} does not suffice [13].
One may interpret van Douwen’s theorem as more than just a consistency result. By showing that any isomorphism from to must be non-trivial, he showed not only that such an isomorphism need not exist, but also that if such an isomorphism does exist, then it must be somewhat exotic. In other words, and cannot be isomorphic in too simple a way.
Here we prove a result in the opposite direction. Roughly, the theorem states that, although and may fail to be isomorphic, their isomorphism classes are essentially indistinguishable in , or in other words, and cannot fail to be isomorphic in too simple a way. More precisely:
Main Theorem**.**
The isomorphism classes of and cannot be separated by a Borel set in , the set of all self-homeomorphisms of endowed with the compact-open topology.
In Section 2, we introduce some notation and prove a few lemmas concerning the compact-open topology on when is a Stone space. The main result of this section identifies a particularly nice basis for : basic open sets are represented by finite digraphs showing the action of a map on a clopen partition of . In Section 3 we observe some topological properties of and . Finally, Section 4 contains a proof of the main theorem. Most of the work is accomplished via a lemma that is perhaps of some independent interest: it states that the isomorphism class of , considered as a subspace of , is a Baire space. We also derive a corollary: implies the set of all quotients of fails to be Borel in . (The notion of a quotient mapping is defined in Section 4.3.) This contrasts starkly with a recent theorem of the author showing that under , the set of all quotients of form a closed subset of .
2. The space when is a Stone space
In what follows, always denotes a compact Hausdorff space. A homeomorphism from to itself is called a topological dynamical system, and the set of all such homeomorphisms is denoted . The compact-open topology on is the topology generated by the sets of the form
[TABLE]
where is compact and is open.
Our first lemma shows that if is zero-dimensional, the compact-open topology on has a particularly nice subbasis. Note that a similar result was proved by Lupton and Pitz in [9, Section 3], where they study the space of continuous self-maps of , endowed with the compact-open topology, of which is a subspace.
Let denote the set of all clopen subsets of . Given , define
Lemma 2.1**.**
For any zero-dimensional compact Hausdorff space ,
[TABLE]
is a subbasis for the compact-open topology on .
Proof.
Let denote the topology on generated by
[TABLE]
and let denote the topology on generated by
[TABLE]
To prove the lemma, we must show that .
Observe that if then
[TABLE]
As all the sets , , , and are both compact and open, this shows that is the intersection of two subbasic open sets from . Thus every subbasic open set from is in , and it follows that .
Similarly, to show that , it suffices to show that every set of the form is in . This can be deduced directly from the results of Lupton and Pitz in [9, Section 3]. However, this part of their argument is short, and working in rather than makes it shorter still; so we include a (slighly simplified) version of their argument here.
Let be compact and open, and suppose . Let
[TABLE]
Because is a basis for and because , for every there is some such that . Thus is an open cover for , and as is compact, has a finite subcover . Let . Then , , and . Furthermore, is clopen in (because is a homeomorhpism).
Thus if , then for some with and . Conversely, it is clear that if and then . Hence
[TABLE]
Hence , as desired. ∎
It follows from Lemma 2.1 that has a basis of the form
[TABLE]
The following lemma shows that we can improve this slightly by requiring the to form a partition of into clopen sets.
Lemma 2.2**.**
Let be a zero-dimensional compact Hausdorff space. Then
[TABLE]
is a basis for the compact-open topology on .
Proof.
Every member of is open in by the previous lemma.
Now let be any basic open subset of (from the basis described in Lemma 2.1), and let . Let be the (finite) partition of generated by . Each member of this partition is clopen. Let . Then and . As and were arbtirary, this shows is a basis for . ∎
If is a collection of subsets of and , then we associate to and a hitting relation: for , write to mean that . This defines a directed graph:
[TABLE]
This directed graph, or digraph, with vertex set and edge relation , may have loops and may have two (oppositely directed) edges between some pairs of vertices. As in [4] or [12], one may view this digraph as a means of capturing the combinatorial content of the action of on . One may also view such digraphs as providing an alternative description of the compact-open topology, as the following theorem shows. If is a collection of subsets of and is a digraph with vertex set , then define
[TABLE]
Theorem 2.3**.**
Let be a zero-dimensional compact Hausdorff space. Then
[TABLE]
is a basis for the compact-open topology on .
Proof.
Let be a partition of into clopen sets. (Note that every such partition is finite, because is compact.) Let be a digraph with vertex set and edge relation . Then
[TABLE]
By Lemma 2.2, is open. Thus each member of is open in .
Let be a basic open subset of (from the basis described in Lemma 2.2), and let . Let and let . Then and . As and were arbtirary, this shows is a basis for . ∎
Theorem 2.3 gives us a nice basis for : a basic open set just specifies the hitting relation for a map on some clopen partition of . In particular, the basic open neighborhoods of some point are determined simply by the action of on some such partition. The next result states that using finer partitions, which give more information about the action of , results in smaller neighborhoods of .
Proposition 2.4**.**
Let be a zero-dimensional compact Hausdorff space. For each ,
[TABLE]
is a local basis for in . If and are both partitions of into clopen sets, and refines , then .
Proof.
If is in some basic open set , then by definition. Thus the first assertion follows from Theorem 2.3.
For the second assertion, suppose and are both partitions of into clopen sets, and refines . Let , which means that . If , then
[TABLE]
Thus , so . As was arbitrary, . ∎
Given a Boolean algebra , the set of all ultrafilters on , called the Stone space of and denoted , carries a natural topology with a basis of clopen sets of the form , where . With this topology, is a zero-dimensional compact Hausdorff space, and . Conversely, given a zero-dimensional compact Hausdorff space , the set forms a Boolean algebra such that . This correspondence, known as Stone duality, reveals that the category of Boolean algebras and the category of zero-dimensional compact Hausdorff spaces (also known as Stone spaces) are essentially interchangeable.
If is a Boolean algebra, then an automorphism mapping to itself is called an algebraic dynamical system, and the set of all such automorphisms is denoted . The topology of pointwise convergence on is the topology generated by the sets of the form
[TABLE]
where . In other words, the basic open subsets of are determined by specifying the action of a map at finitely many points of .
Stone duality extends naturally from Boolean algebras and Stone spaces to their respective self-maps. If is a Stone space and , then permutes the clopen subsets of and thus defines an automorphism of ; formally, is defined by setting
[TABLE]
for every clopen . Similarly, if is a Boolean algebra and , then permutes the ultrafilters on and thus defines a self-homeomorphism of ; formally, is defined on each by taking
[TABLE]
for all . One may check that is a bijection , and is a bijection . Furthermore, these bijections are inverse to one another: after identifying with in the natural way, for all , and after identifying with in the natural way, for all .
Proposition 2.5**.**
Suppose is a Stone space. The compact-open topology on is dual to the topology of pointwise convergence on , in the sense that the mapping that sends to is a homeomorphism. Similarly, if is a Boolean algebra, then the mapping that sends to is a homeomorphism.
Proof.
Each of these maps lift to a bijection from the subbasic open sets of the domain onto the subbasic open sets of the range. ∎
We end this section with a theorem due to Arens. Together with the other results in this section, it indicates that the compact-open topology is the “right” topology for .
Proposition 2.6**.**
, [2, Theorem 3] When endowed with the compact-open topology, is a topological group (with composition as the group operation). Furthermore, it is the coarsest topology on that makes it a topological group and has the property that the evaluation map is a continuous function .
When we cite this proposition in the following sections, we will really only need the fact that is a topological group. Note that this part of Arens’s result is fairly easy for Stone spaces: for example, given Proposition 2.1 above, the inversion operation is continuous because it is a bijection that permutes the subbasic open sets, sending to whenever .
3. The topological dynamics of the shift map
Let be a compact Hausdorff space and let be a topological dynamical system. Given an open cover of , we say that a sequence of points is a -chain if, for every , there is some such that . Roughly, one may think of a -chain as a finite piece of an -orbit, but computed with a small error at each step, where the allowed size of the error is determined by the fineness of . A dynamical system is chain transitive if for any and any open cover of , there is a -chain beginning at and ending at .
Lemma 3.1**.**
Let be a compact Hausdorff space. A topological dynamical system is chain transitive if and only if for every open . If is also zero-dimensional, then is chain transitive if and only if for every clopen .*
Proof.
The first assertion is proved for metrizable dynamical systems in [1, Theorem 4.12], using open covers that consist of -balls. The proof does not make any use of metrizability, and so a superficial modification of it yields a proof of the first assertion of the present lemma.
For the second assertion, suppose is zero-dimensional. It suffices to show that if for some open , then for some clopen . Notice that the assertion “” is equivalent to the assertion that is in the subbasic open subset of . In the proof of Lemma 2.1 above, we show (using the fact that is a Stone space) that implies there is some clopen such that . This set is as required. ∎
Corollary 3.2**.**
For any compact Hausdorff space , the set of all chain transitive maps is closed in .
Proof.
By the previous lemma, a topological dynamical system fails to be chain transitive if and only if
[TABLE]
Thus the set of non-chain-transitive maps is open in . ∎
A path in a directed graph is a finite sequence of vertices of such that for every , there is an edge from to . An infinite path in is an infinite sequence of vertices of such that for every , there is an edge from to . A directed graph is transitive if for any two of its vertices and , there is a path beginning at and ending at .
For convenience, let us henceforth adopt the convention that an open cover of a space does not contain the empty set.
Lemma 3.3**.**
Let be any compact Hausdorff space. A topological dynamical system is chain transitive if and only if is transitive for every open cover of .
Proof.
Suppose is chain transitive. Let be an open cover of , and let . Pick any and , and let be a -chain with and . For each , fix some such that . Then
[TABLE]
and as and were arbitrary, this shows is transitive.
Now suppose fails to be chain transitive. By Lemma 3.1, there is some open such that . Because is compact, is closed; recalling that every compact Hausdorff space is normal, there is some open with . This implies that is an open cover of . Because , we have . Using the surjectivity of , and the fact that , one may check that . Thus the graph has the following form:
U$$X\setminus\overline{V}
In particular, this graph is not transitive. ∎
In what follows, our focus will be on the space , the Stone space of the Boolean algebra . Given and its mod-finite equivalence class , we will write instead of for the corresponding clopen subset of .
Lemma 3.4**.**
Suppose is infinite. If is a partition of into clopen sets, then there is a finite partition of into infinite sets such that .
A function is called a mod-finite permutation of if there are some co-finite such that restricts to a bijection . Every mod-finite permutation of induces a homeomorphism , which sends every ultrafilter to the unique ultrafilter generated by :
[TABLE]
Equivalently, is the restriction to of the unique map that continuously extends . Members of that arise from mod-finite permutations of in this way are called trivial.
Lemma 3.5**.**
The shift map and its inverse are chain transitive. Up to isomorphism, these are the only two trivial maps in that are chain transitive.*
Proof.
Both assertions are proved in [5, Section 5]. ∎
We now turn more directly toward the main theme of the paper, which is to show that the shift map and its inverse are topologically indistinguishable within . Henceforth, let
[TABLE]
Theorem 3.6**.**
Let be a partition of into clopen sets, and let be a directed graph with vertex set . The following are equivalent:
- (1)
* is transitive.* 2. (2)
* for some .* 3. (3)
* for some .*
Proof.
Both and imply by Lemmas 3.3 and 3.5.
To show that implies , let be a partition of into clopen sets. By Lemma 3.4, we may write , where is a partition of into finitely many infinite sets.
Because is transitive, if and are edges in , then it is always possible to find a path from to ; i.e., a path connecting the end of the one edge to the beginning of the other. Using this fact, and the fact that the members of are naturally identified with the vertices of , a simple recursive construction allows us to build an infinite sequence of members of such that is a path in and
For every with , there are infinitely many such that and .
In other words, this path traverses every edge in infinitely often. Observe that a transitive graph has no isolated vertices; thus in particular, implies is infinite for every .
Next define a function by setting
[TABLE]
for all . This function is well-defined because each is infinite. This function is clearly injective, and using the fact that is infinite for every , it is not hard to see that is also surjective. Thus is a bijection .
Finally, let denote the function . Roughly, we may think of the bijection as a relabelling of the points of , and then think of as the (relabelled) successor map. We claim that is isomorphic to and that .
First, note that and are both mod-finite permutations of , so that . To see that is isomorphic to , let denote the successor function and note that . This implies . But , so this shows that is an isomorphism from to .
For any two (not necessarily distinct), let
[TABLE]
If , then is infinite by property . On the other hand, if then , because the sequence has for every . Thus
[TABLE]
By our definition of , . Now observe that, by our definition of ,
[TABLE]
which implies is infinite if and only if is infinite. So
[TABLE]
As and were arbitrary members of and , this shows that , which completes the proof that implies .
One can prove that implies by a similar argument. Alternatively, one may deduce that implies from the now-proved fact that implies for all . To see this, fix some partition of into clopen sets, and let be a transitive digraph with vertex set . Let denote the digraph obtained from by inverting the edge relation. It is easy to check a digraph is transitive if and only if its inverse is; hence is transitive. Because implies for every digraph, this means there is some with . But then and . ∎
Corollary 3.7**.**
If is open, then if and only if .
Proof.
Let be open. Suppose , and fix some . By Theorem 2.3, there is a partition of into clopen sets, and a digraph with vertex set , such that or, equivalently, . By the previous theorem, there is some such that . But this means , so witnesses the fact that . An essentially identical argument shows that if then . ∎
Notice that this corollary implies a weak version of the main theorem: and cannot be separated by an open subset of .
We end this section with a strengening of Corollary 3.7. This extension is not necessary for understanding the proof of the main theorem in the next section (and thus may be skipped if desired). It is, however, further support for the informal idea behind the main theorem: that no simple topological property can distinguish from .
Recall that denotes the splitting number, the smallest cardinality of a family of subsets of such that, for every , there is some such that both and are infinite.
Theorem 3.8**.**
Suppose is an intersection of open sets in . Then if and only if .
Proof.
Suppose is an intersection of open subsets of , and suppose . (We consider later the possibility that but .) By shrinking each open set to a finite intersection of subbasic open neighborhoods of , we may (and do) assume that is an intersection of subbasic open sets: that is, .
Because , there is some such that for every , either or is finite.
We now define a permutation by “flipping” some intervals associated to . Specifically, let and let be an increasing enumeration of the set . Define by setting
[TABLE]
\dots$$d_{0}$$d_{1}$$d_{2}$$d_{3}$$d_{4}$$d_{5}
Now consider the map , where denotes the successor function . This function is not defined at (because ), but is defined on the rest of . We have
[TABLE]
\dots$$d_{0}$$d_{1}$$d_{2}$$d_{3}$$d_{4}$$d_{5}
Observe that and are mod-finite permutations of , so . Furthermore, is an isomorphism from to because implies . A little less precisely (but perhaps more clearly), is isomorphic to because one can transform into by relabelling the points of (which is clear from the picture).
Thus , and we claim that . Let . By our choice of , either or is finite. If is finite, then for all but finitely many , which means
[TABLE]
If on the other hand is finite, then for all (except possibly ), either , in which case , or else , and then for some and . Thus
[TABLE]
Thus in either case, , which implies . As this holds for all , we have as claimed.
The preceding argument shows that if , where is some -sized intersection of open subsets of , then . Next suppose , but (possibly) . Fix an isomorphism between and ; that is, fix some such that , or equivalently, . Let
[TABLE]
and observe that because .
By Proposition 2.6, the map is a self-homeomorphism of . In particular, is a countable intersection of open sets in . As , the argument above allows us to conclude that there is some . By definition, implies . But is isomorphic to (indeed, is a witnessing isomorphism), and is isomorphic to ; thus is isomorphic to . Hence .
This shows that if then , thus proving the “only if” direction of the lemma. To prove the “if” direction, one may either note that the argument above is easily modified, by swapping the roles of and , to obtain a proof of this direction, or note that one may deduce the “if” direction from the “only if” direction directly, using the fact that the inversion map is a self-homeomorphism of by Proposition 2.6. ∎
4. A proof of the main theorem
Lemma 4.1**.**
* is a Baire space. That is, if is a collection of dense open subsets of , then is dense in .*
Proof.
Let be a collection of dense open subsets of , and let be a nonempty open subset of . To prove the lemma, we must show .
By Theorem 2.3, the sets of the form constitute a basis for . It follows that the sets of the form constitute a basis for . For convenience, we will denote by for the remainder of the proof.
To begin, we define by recursion a sequence of basic open subsets of , along with a sequence of partitions of , satisfying the following five properties for all :
- (1)
partitions into finitely many infinite sets. 2. (2)
. 3. (3)
. 4. (4)
if , then . 5. (5)
if , then is a refinement of .
To begin the recursion, note that because is a nonempty open subset of , Theorem 2.3 implies there is some partition of into clopen sets, and some directed graph with vertex set , such that
[TABLE]
By Lemma 3.4, we may write , where is some partition of into finitely many infinite sets. This concludes the base step of the recursion: properties through are satisfied for , and properties and are vacuous for .
After stage of the recursion, we have a sequence of basic open subsets of , and a sequence of partitions of , such that properties through above are satisfied for . We must construct , , and . Note that is a nonempty open subset of . Because is a dense open subset of , this implies is a nonempty open subset of ; hence it contains a nonempty basic open set. That is, we may choose some partition of into clopen sets, and some digraph with vertex set , such that
[TABLE]
For each , let and observe that is a partition of into (nonempty) clopen sets. By Lemma 3.4, there is a partition of into finitely many infinite sets such that . Let
[TABLE]
This definition of makes it obvious that hypothesis is satisfied for . Also, because was obtained by taking each of the finitely many infinite sets in and further partitioning each of them into finitely many infinite sets, it is clear that hypothesis is satisfied for , and that hypothesis is satisfied for (using the fact that hypothesis is satisfied for ).
To define the digraph , first recall . Fix some (any) and let . Note that , so in particular . Furthermore, because refines ,
[TABLE]
by Proposition 2.4. Thus
[TABLE]
Using this containment, it is clear that the inductive hypotheses and for follow from the inductive hypotheses and for .
This completes the recursive construction: thus we obtain a sequence of basic open subsets of , together with a sequence of partitions of such that properties through listed above are satisfied for every .
In the next part of the proof, we construct a function . The idea is that ultimately we will let denote the map as in the proof of Theorem 3.6, and we will then complete the proof of the lemma by showing . The construction of the map here is similar to the construction of the map in the proof of Theorem 3.6, but with one extra complication: instead of representing a path through a single digraph (like the function in the proof of Theorem 3.6), the function constructed here “diagonalizes” across an infinite sequence of digraphs .
Before defining , we first define an infinite sequence of paths, one through each of the graphs . For each , let denote the edge relation for .
To begin, consider the digraph , which is transitive by Theorem 3.6. Because is transitive, if and are edges in , then it is always possible to find a path from to ; i.e., a path connecting the end of the one edge to the beginning of the other. Using this fact, and the fact that the members of are naturally identified with the vertices of , a simple recursive construction allows us to build a finite sequence of members of such that
is a path in .
For every with , there is at least one such that and .
In other words, this path traverses every edge in at least once. Observe that a transitive graph has no isolated vertices; thus in particular, implies for every .
After stage of the recursion, suppose we have constructed for every some finite sequence of members of such that
is a path in .
For every with , there is at least one such that and .
If denotes the (unique) member of containing , then .
To construct , first consider the last set in the finite sequence constructed at the previous step of our recursion. Choose any such that , and then choose to be any member of contained in . Note that some such choice of is possible because is transitive, and some such choice of is possible because refines . This choice of ensures that hypothesis holds. Now that is chosen, we proceed as in the base step to find the rest of satisfying and . As in the base step, it is the transitivity of that enables us to find a finite sequence of sets in satisfying and .
This completes the recursion. Thus we obtain an infinite sequence of finite sequences , each satisfying and , and also satisfying when . By concatenating these infinitely many finite paths, we obtain a single infinite sequence: that is, define by setting
[TABLE]
Next, define by setting
[TABLE]
for all . This function is well-defined because each is infinite. This function is clearly injective, and we claim that it is also surjective. For suppose is not surjective, and let be the least natural number not in the image of . There is some such that every is equal to for some . For every , . As is a partition of , there is some with . Because a transitive graph has no isolated vertices, and because is transitive by Lemma 3.6, condition implies . If is the least index such that , then our definition of implies
[TABLE]
This contradicts our choice of and proves is surjective. Thus is a bijection .
Let denote the function . Roughly, we may think of the bijection as a relabelling of the points of , and then think of as the (relabelled) successor map. We claim that
[TABLE]
Observe that by definition, and by our construction of the and (specifically by property stated in their construction). So it remains to show that and that for every .
Note that and are mod-finite permutations of , so . To see that , let denote the successor function and note that . This implies . But , so this shows that is an isomorphism from to . Hence .
It remains to show for all . Fix . For any two (not necessarily distinct), let
[TABLE]
Claim**.**
* is infinite if and only if .*
Proof of claim.
Suppose , and consider the following two statements:
(i)
(ii)
for some such that and .
We claim that and are equivalent. To see this, recall that and fix some . Because refines ,
[TABLE]
so that and are equivalent as claimed.
is infinite if and only if there are infinitely many such that and . Recall that was defined from the sequence so that for all . For all but finitely many , is a member of a partition for some , which means that refines ; thus is either contained in or disjoint from each of and . Consequently, is infinite if and only if there are infinitely many such that and .
Suppose . Let . Because and are equivalent, there are some with and , such that . By property , there is some such that and ; so taking , we get and . Because this holds for every , there are infinitely many such that and . By the previous paragraph, this means is infinite.
Conversely, suppose is infinite; equivalently, suppose there are infinitely many such that and . In particular, there is then some such with . We consider two cases, according to whether and come from the same partition or not. For the first case, suppose for some . Then condition implies that , and (using the assertion proved above, with and ) this implies . In the other case, we must have and for some . But then condition implies that for some with . Because and comes from a partition that refines the partition containing , we have . Hence (using the assertion proved above, with and as in the previous sentence), this implies . ∎
Returning to the proof of the lemma, observe that by our definition of , if then
[TABLE]
which implies is infinite if and only if is infinite. From this and the claim above, it follows that for ,
[TABLE]
Because , this shows that . Therefore . As was arbitrary, as claimed. ∎
Notice that in the previous lemma, we actually showed a bit more than was stated: every countable intersection of dense open subsets of contains a dense set of trivial maps. Let us point out that, by modifying the proof of Theorem 2.3 in [3], one may show that every non-empty subset of contains a trivial map. Thus it is not entirely surprising that the statement of Lemma 4.1 can be strengthened in this way.
Lemma 4.2**.**
* is a Baire space. That is, if is a collection of dense open subsets of , then is dense in .*
Proof.
Recall that is a topological group by Proposition 2.6. In particular, the map is a self-homeomorphism of , and it restricts to a homeomorphism . Thus this lemma follows from the previous one. ∎
Recall that a subset of a topological space has the property of Baire if for some open and meager . Recall also that, in any topological space , the sets having the property of Baire form a -algebra containing all the Borel sets.
If , then separates and if it contains one and misses the other: i.e., if either and , or else and .
Theorem 4.3**.**
No Borel subset of separates and .
Proof.
Because the class of Borel sets is closed under taking complements, if a Borel set separates and , then there is a Borel set containing and disjoint from .
Suppose is Borel and that . We shall show that .
Let . Then is still a Borel set containing ; moreover, is relatively Borel in the subspace of . In particular, has the property of Baire in . Fix a relatively open and a relatively meager such that .
Generally, if is dense in (some space) , then any somewhere dense subset of is somewhere dense in . Consequently, if is nowhere dense in then is nowhere dense in . It follows that if is meager in then is meager in .
By Theorem 3.6, every open subset of meeting also meets . It follows that is dense in . By the previous paragraph, is meager in . By Lemma 4.1, this means . Therefore .
By the same argument, is dense in , and is meager in . By Lemma 4.2, this implies is dense in . Hence
[TABLE]
Hence . As , it follows that . Hence no Borel subset of can contain without including some of . ∎
Suppose and are topological dynamical systems. We say that is a quotient of if there is a continuous surjection such that .
\omega^{*}$$\omega^{*}$$\omega^{*}$$\omega^{*}$$f$$g$$q$$q$$f\twoheadrightarrow g
This is the standard notion of “continuous image” in the category of topological dynamical systems. Recently, in [6], the quotients of the shift map were characterized as follows:
Theorem 4.4**.**
Suppose is a compact Hausdorff space with weight . Then is a quotient of the shift map if and only if is chain transitive.
In [6] it was asserted that this theorem gives a “simple” characterization of the quotients of the shift map having weight . The topological perspective employed here allows us to formalize this assertion:
Corollary 4.5**.**
If is a compact Hausdorff space with weight , then
[TABLE]
is a closed subset of . In particular, if holds then
[TABLE]
is closed in .
Proof.
This follows immediately from Theorem 4.4 and Corollary 3.2. ∎
It is customary, in the study of , that when one observes some consistent behavior under , one should investigate whether the “opposite” behavior occurs under . The topological perspective employed here gives us a framework for doing just this.
Theorem 4.6**.**
Assuming ,
[TABLE]
is not Borel in .
We recall that implies . Thus this theorem shows, among other things, that the of the previous corollary cannot be improved to an in general. (However, it can be improved to an consistently, e.g. if ; see [6, Theorem 5.10].)
Proof of Theorem 4.6.
By Lemma 3.5, and are chain transitive, and these are (up to isomorphism) the only chain transitive trivial maps in . By a result of Veličković mentioned already in the introduction, implies that all members of are trivial. Thus the chain transitive members of are precisely those in .
Every quotient of a chain transitive dynamical system is chain transitive (see, e.g., [1]). Thus, by the previous paragraph, if there are no nontrivial members of then .
Building on work of Farah [8], it was proved in [6, Theorem 5.7] that implies is not a quotient of . Thus, by the previous paragraph, implies .
As mentioned in the introduction, van Douwen proved in [7] that if there are no nontrivial maps in then . In particular, implies . By Theorem 4.3, this implies neither nor is Borel in . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Akin, The General Topology of Dynamical Systems , Graduate Studies in Mathematics, American Mathematical Society, reprint edition, Providence, RI (2010).
- 2[2] R. Arens, “Topologies for homeomorphism groups,” American Journal of Mathematics 68 (1946), pp. 593–610.
- 3[3] A. Bella, A. Dow, K. P. Hart, M. Hrušaḱ, J. van Mill, and P. Ursino, “Embeddings into 𝒫 ( ℕ ) / fin 𝒫 ℕ fin \mathcal{P}(\mathbb{N})/\mathrm{fin} and extension of automorphisms,” Fundamenta Mathematicae 174 (2002), pp. 271–284.
- 4[4] N. C. Bernardes, Jr. and U. B. Darji, “Graph theoretic structure of maps of the Cantor space,” Advances in Mathematics 231 (2012), pp. 1655–1680.
- 5[5] W. R. Brian, “ P 𝑃 P -sets and minimal right ideals in ℕ ∗ superscript ℕ \mathbb{N}^{*} ,” Fundamenta Mathematicae 229 (2015), pp. 277–293.
- 6[6] W. R. Brian, “Abstract omega-limit sets,” Journal of Symbolic Logic 83 (2018), pp. 477–495.
- 7[7] E. K. van Douwen, “The automorphism group of 𝒫 ( ω ) / fin 𝒫 𝜔 fin \mathcal{P}(\omega)/\mathrm{fin} need not be simple,” Topology Proceedings 34 (1990), pp. 97–103.
- 8[8] I. Farah, Analytic quotients: theory of lifting for quotients over analytic ideals on the integers, Memoirs of the American Mathematical Society no. 702 (2000), vol. 148.
