Borel equivalence relations induced by actions of tsi Polish groups
Abstract
We study Borel equivalence relations induced by Borel actions of tsi Polish groups on standard Borel spaces. We characterize when such an equivalence relation admits classification by countable structures using a variant of the -dichotomy. In particular, we find a class that serves as a base for non-classification by countable structures for these equivalence relations under Borel reducibility. We use this characterization together with the result of Miller [Mila] to show that if such an equivalence relation admits classification by countable structures but it is not essentially countable, then the equivalence relation Borel reduces to it.
1 Introduction
In this paper we study complexity of Borel equivalence relations induced by Borel actions of tsi Polish groups on standard Borel spaces. This can be seen as part of the program that studies the formalization of the isomorphism problem. The abstract framework for the study of the isomorphism problem is provided by the so-called invariant descriptive set theory. Namely, the class of structures that we want to study is naturally encoded into a Polish topological space and the isomorphism relation translates to a definable equivalence relation on . The main notion that allows to compare various isomorphism problems throughout mathematics is called Borel reducibility. This is just an abstract version of the well-known strategy of assigning invariants to structures in order to distinguish them in various settings. A classical examples include: (a) topological spaces and fundamental groups or (b) Bernoulli shifts and entropy.
During several decades of study, benchmark examples of equivalence relations and their relationships were discovered, see the books [Gao09, Kan08] for a summary. A particularly important examples are so-called orbit equivalence relations. That is, equivalence relations induced by group actions. One line of research is to understand all possible complexities of equivalence relations that are induced by actions of groups from a given class. In this paper we focus on tsi Polish groups and their actions. Recall that a Polish group is tsi if it admits conjugacy invariant open base at the identity. It is well-known that the condition is equivalent with existence of a two-sided invariant compatible metric. This class includes separable Banach spaces, or, in general, commutative Polish groups. Recently, tsi Polish groups attracted quite a lot of attention from various perspectives [DG17, Mila, AP20, All20]. In this paper, we study possible complexities of equivalence relations induced by actions of tsi Polish groups. In particular, we focus on the situation when they admit classification by countable structures or are essentially countable. Both notions are well studied. The former was studied by Hjorth [Hjo00b], the theory of turbulence provides a dynamical obstacle for a continuous action of a Polish group to be classifiable by countable structures. The latter stems from the work of Kechris [Kec92], is ultimately connected with the theory of countable Borel equivalnce relations [Kec21], and some recent progress shows that this notion is equivalent to a geometrical notion of -lacunarity [Gre20] introduced and characterized by Miller in [Mila].
Our main contribution to the study of Borel equivalence relations induced by actions of tsi Polish groups is two-fold. First, we characterize classification by countable structures with a variant of the -dichotomy and provide a basis for non-classification by countable structures using a natural class of equivalence relations tightly connected to lsc submeasures and -equalities, see [Far01a, Far01b] and [Kan08, ChaptersΒ 3 andΒ 15]. Second, we show that if such an equivalence relation admits classification by countable structures but is not essentially countable, then there is a Borel reduction from a canonical such equivalence relation, . Next, we formulate our results and describe high-level ideas.
1.1 High-level overview of the arguments
Recall that we denote as the orbit equivalence relation that is induced by a Borel action of a Polish group on a standard Borel space , that is,
for every . The main technical tool that we use in this paper are variants of the -dichotomy of Kechris, Solecki and Todorcevic [KST99]. Recall that the -dichotomy characterizes Borel graphs of Borel chromatic number at most . That is, a Borel graph either admits a decomposition into at most countably many independent sets or a Borel homomorphism from the graph , a canonical example of graph that does not admit such a decomposition. The elementary proof of this dichotomy is due to Miller [Mil12].
Our approach is profoundly influenced by [Kec92, Hjo00a, Hjo00b, Mila]. In particular, the results of Miller [Mila] are not only literally used as a part of the proof of our main result but the ideas are internally present throughout the paper.
The starting goal of this project, also suggested by Miller, was to understand Hjorthβs -dichotomy [Hjo00a]. Recall that the equivalence relation is induced by the canonical action of the Banach space on and that this action is turbulent, i.e., does not admit classification by countable structures. Hjorthβs -dichotomy states that a restriction of to any Borel subset of is either essentially countable or Borel bi-reducible with . To prove this result one can use a variant of the -dichotomy as follows. The dichotomy is applied to a family of oriented hypergraphs , where for every open neighborhoods of the identity in we define an oriented hypergraph on by declaring to be an edge if the consecutive elements are connected by elements in and the first and last element of are not connected by any element of . Fixing and applying a variant of the -dichotomy to a decreasing sequence of open neighborhoods of gives either a homomorphism from a canonical -like object or a decomposition into -invariant sets. In the case of homomorphism one can use a refinement technique, see [Mila], to find a reduction from . In the other case, it is not hard to see that the corresponding decomposition is made of sets that intersect each orbit in bounded and separated islands (or galaxies, aka grainy sets [Kan08, ChapterΒ 15.2]). Formally, we make the following definition, see SectionΒ 4.
Definition 1.1 (Property (IC)).
We say that satisfies Property (IC) if for every open neighborhood of there is a sequence of Borel sets such that
-
β’
for every there is an open neighborhood of such that is -independent,
-
β’
.
To understand why we derive essential countability in this case, it might be illustrative to make a detour and discuss Kechrisβ result [Kec92] that says that every equivalence relation induced by a Borel action of a locally compact Polish group is essentially countable. As a first step in the original proof Kechris basically shows that every such action satisfies Property (IC). The reason why we can conclude in both examples that the equivalence relation is essentially countable is a combination of Property (IC) and the following notion. We say that an action admits a -bounded topology if there is a compatible Polish topology on that makes the action continuous111Compatible topology that makes the action continuous is called a -Polish topology. and such that for every vertex there is an open neighborhood of such that acting with group elements from on does not approximate elements from different orbit, i.e., the -closure of is a subset of the orbit of . It is easy to see that if is compact and the action is continuous, then the topology is -bounded. Also the canonical topology on is -bounded for the canonical action of the Banach space . The proof of Hjorthβs theorem and Kechrisβ theorem is then finished by our first result
Theorem 1.2.
Suppose that a Borel equivalence relation satisfies Property (IC). Then is essentially countable if and only if it admits a -bounded topology.
A natural question is to understand in which situation we can apply the aforementioned variant of the -dichotomy for the oriented hypergraphs and get similar results. It is not difficult to show that if we have a decomposition into -independent sets, then the action is not turbulent (this result hold for any Polish group). We obtain the following result.
Theorem 1.3.
Suppose that is a Borel equivalence relation induced by a Borel action of a tsi Polish group , that is, admits a two-sided invariant compatible metric. Then the following are equivalent
-
β’
satisfies Property (IC),
-
β’
admits classification by countable structures.
The reason why Property (IC) implies classification by countable structures is intuitively clear, the corresponding Borel decomposition into -independent sets mimics the behavior of actions of non-archimedean groups. For this class Property (IC) holds trivially, and it is well-known that the corresponding orbit equivalence relations admit classification by countable structures. The other implication is more challenging. By a variant of the -dichotomy we get a homomorphism from some canonical object. We use heavily the assumption that the group is tsi to do several refinements. Ultimately we obtain a Borel reduction from a Borel equivalence relation that is closely connected to tall lsc submeasures, or -equalities, [Far01a, Far01b, Kan08]. These are known to be induced by turbulent actions and this can be used to show that cannot be classifiable by countable structures. Even though we are not able not show that tall lsc submeasures and -equalities form a base for non-classification by countable structures, our result serves as an indication that this might be the case for equivalence relations that are induced by actions of tsi Polish groups. For general Borel equivalence relations, in particular, the ones induced by actions of general Polish groups, we do not have any intuition.
Next we turn our attention to our main result. We use results of Miller [Mila] to show that is a canonical obstacle for essential countability under the assumption that admits classification by countable structures. In the case of non-archimedean tsi Polish groups, the result was proved by Hjorth and Kechris [HK01]. Recently Miller found a proof that uses a variant of the -dichotomy [Mila]. We manage to weaken the assumption to merely tsi Polish groups but we need to keep the assumption that the equivalence relation admits classification by countable structures. Note that without this assumption the situation is more complicated, e.g., is not essentially countable but there is no reduction from to . In general, there is no reduction from if the corresponding action admits -bounded topology.
Theorem 1.4.
Suppose that is a Borel equivalence relation that admits classification by countable structures and is induced by a Borel action of a tsi Polish group , that is, admits a two-sided invariant compatible metric. Then the following are equivalent:
-
β’
is essentially countable,
-
β’
the action admits -bounded topology,
-
β’
.
The strategy for proving this result is to use the -dichotomy two times. First, by TheoremΒ 1.3 we get that Property (IC) holds, i.e., there is a Borel decomposition that mimics the behavior of non-archimedean groups. Second, we use the result of Miller [Mila] who found a variant of the -dichotomy that characterizes -lacunarity (a formal strengthening of essential countability). If we get a Borel decomposition into independent sets in his result, then we conclude that the action is -lacunary, i.e., essentially countable. In the other case we get a homomorphism from some canonical object. Miller was able to refine the homomorphism to get a reduction from under the assumption that the group is non-archimedean. We show that his argument goes through under the weaker assumption of Property (IC).
Acknowledgement
The author is indebted to Ben D. Miller for introducing him into the topic during his AKTION stay at KGRC in Vienna in 2017. Also he would like to thank Ben D. Miller and ZoltΓ‘n VidnyΓ‘szky for many engaging discussions and Ilijas Farah for useful suggestions. The research was supported by Leverhulme Research Project Grant RPG-2018-424 and by the GACR project 17-33849L and RVO: 67985840.
2 Preliminaries
For a set we write for the set of all finite sequences of . Let . We define to be the length of and write for the -th element of for every . That is is the first element and is the last element of in this notation. We set
A relation on is any subset of . A relation is a (finite-dimensional) dihypergraph on if and it is a digraph if . If is a dihypergraph (or digraph) on and , then we say that is -independent if the restriction of to , in symbols
is empty.
Let be sets and be a map. The coordinate-wise extension of to is defined as
for every and . We abuse the notation and write instead of . Suppose that we have collections and of relations on and , respectively, where is some index set. We say that a map is a homomorphism from to if
for every and . Moreover, it is a reduction if we have
for every and .
2.1 Polish -space
A topological space is a Polish space if the underlying topology is separable and completely metrizable. A standard Borel space is a set endowed with a -algebra that is a -algebra of Borel sets for some Polish topology on . We call such a Polish topology compatible. A topological group is a Polish group if the underlying topology is Polish. We denote the -ideal of meager sets on as . We use the category quantifiers , in the standard meaning, e.g.,
where is an open set and is some property, see [Gao09].
A Borel action of a Polish group on a standard Borel space is an action that is additionally Borel measurable as a function from to . We write for the evaluation of the action at particular elements and . Similarly, we define for any and . We denote as the induced equivalence relation and as the equivalence class, or orbit, of . A set is -invariant if it is a union of equivalence classes of . If , then we set if and only if . It is a result of Becker and Kechris [BK96] that one can always find a compatible Polish topology on such that the action is continuous. Any such Polish topology is called a -Polish topology. If such a topology is fixed we say that is a Polish -space. For and we set .
Definition 2.1.
Let be a Polish -space. We say that is a -lg comeager set if for every . Equivalently,
holds for every
2.2 Borel reducibility
A Borel equivalence relation on a standard Borel space is is an equivalence relation that is additionally a Borel subset of . We assume throughout the paper that the orbit equivalence relations of the form that we consider are always Borel equivalence relations. A Borel equivalence relation on is Borel reducible to a Borel equivalence on , in symbols , if there is a Borel map that is a reduction from to .
We say that a Borel equivalence relation is essentially countable if it is Borel reducible to some countable Borel equivalence relation, see [Kec21].222A Borel equivalence relation is countable if the cardinality of each equivalence class is at most countable. In our setting, that is Borel equivalence relations inudeced by Polish group actions, this is equivalent to -lacunarity [Gre20].
We say that a Borel equivalence relation is classifiable by countable structures if it is Borel reducible to some equivalence relation induced by a Borel action of , the permutation group of . There are several other equivalent characterizations of classification by countable structures [Kan08, TheoremΒ 12.3.3] or [Gao09].
The benchmark examples of Borel equivalence relations that we consider in this paper are , and . The equivalence relation on is defined as if and only if . The equivalence relation is defined in the Introduction. The equivalence relation is the countable product of , that is, is the equivalence relation on defined as if and only if holds for every . We refer the reader to [Kan08] for more information about these particular examples.
2.3 Turbulence
Let be a Polish -space, , and . We introduce some notation that is connected to the definition of local orbit, seeΒ [Gao09, SectionΒ 10.2]. First, we define
the set of all -jumps. Let . Assuming now that and are open neighborhoods of and the identity , respectively, we define the local orbit
That is, are those elements of that are reachable from by -jumps within .
Definition 2.2 (SectionΒ 10 [Gao09]).
Let be a Polish group and be a Polish -space. We say that the action is turbulent if
-
β’
every equivalence class of is dense and meager in ,
-
β’
the local orbit is somewhere dense for every and every open neighborhoods and of and , respectively.
Let be an equivalence relation on a Polish space . We say that is generically -ergodic if for every Polish -space and every Baire measurable homomorphism from to there is such that is comeager in .
Theorem 2.3 (Corollary 10.4.3 [Gao09]).
Let be a Polish group and be a Polish -space. Suppose that the action is turbulent. Then is generically -ergodic. In particular, is not classifiable by countable structures.
2.4 Tsi Polish groups
A Polish group is tsi (states for two-sided invariant) if there is an open basis at made of conjugacy invariant open sets. That is, there is a sequence of open neighborhoods of that is an open base and such that for every and . Equivalently, seeΒ [Gao09, ExerciseΒ 2.1.4], there is a compatible metric on that is two sided invariant, i.e., for every . It follows from [Gao09, ExerciseΒ 2.2.4] that such a metric is necessarily complete. We always assume that such a metric on is fixed and put . We have for every and . We abuse the notation and define for every . Note that is a conjugacy invariant open base at such that and for every .
We define the dihypergraphs that we use in this paper.
Definition 2.4.
Let be a Polish -space and . We set
We note that the definition makes sense for any Polish group and any sequence of (symmetric) neighborhoods of .
2.5 -dichotomy
We formulate three versions of the -dichotomy. First version is the original dichotomy and the other two are the versions that we use in this paper. We formulate the statements in bigger generality as it is done in [Milb].
For define the graph
on . Fix some dense collection such that , i.e., , for every . Here dense means that for every there is such that . Set .
Theorem 2.5 (-dichotomy [KST99]).
Suppose that is a Hausdorff space and is an analytic graph on . Then exactly one of the following holds:
-
1.
there is a sequence of Borel subsets of such that and is -independent for every ,
-
2.
there is a continuous homomorphism from to .
Next we formulate two versions of the -dichotomy that we use in this paper. For the first one we need to recall some notation from [Mila]. Let be such that , for every and for every there are infinitely many such that . Fix such that for every and is dense in for every . Set
for every .
Theorem 2.6 (TheoremΒ 2 [Mila]).
Suppose that is a Hausdorff space and is an increasing-in- sequence of analytic digraphs on . Then exactly one of the following holds:
-
1.
there is a sequence of Borel subsets of such that and the Borel chromatic number of is at most countable for every ,
-
2.
there exist a function and a continuous homomorphism from to .
We define a generalization of and for special class of finitely branching trees. We say that a tree is finitely uniformly branching if there is a sequence of natural numbers such that for every and we have
for every . If is a tree and , then we define . Note that whenever and . We denote as the set of all branches through , i.e., if and only if for every .
Definition 2.7.
Let be a finitely uniformly branching tree and . The dihypergraph on is defined as
The equivalence relation on is defined as
where . Note that in the case when we have .
Theorem 2.8 (-dichotomy for dihypergraphs, Theorem 2.2.12 [Milb]).
Let be a Hausdorff space and let be a sequence of analytic dihypergraphs on . Then at least one of the following holds:
-
1.
there is a sequence of Borel subsets of such that and for every there is such that is -independent,
-
2.
there is a finitely uniformly branching tree , a dense sequence such that for every and a continuous homomorphism from to .
Moreover, if the sequence is decreasing then the conditions are mutually exclusive.
2.6 Borel pseudometrics
Definition 2.9.
Let be a finitely uniformly branching tree. A function is called a Borel pseudometric if
-
1.
is pseudometric,
-
2.
is a Borel subset of for every ,
-
3.
is a separable pseudometric space for every ,
-
4.
if and is a -Cauchy sequence, then .
Moreover, we say that a Borel pseudoemtric is uniform if
-
β’
for every , and we have
where we set .
We describe a canonical way how to find Borel pseudometrics. Recall that if is a tsi Polish group, then is a fixed compatible two-sided invariant metric on .
Proposition 2.10.
Let be a tsi Polish group, be a Polish -space such that is Borel, be a finitely uniformly branching tree and be a continuous map. Then the function defined as
for is a Borel pseudometric.
Proof.
(1.) The invariance of guarantees that for every and consequently that is symmetric. Let . We may assume that . In that case for every there is such that and . Then we have
because by the invariance of .
(2.) Recall that for we defined . It follows from our assumption that is a Borel equivalence relation together with [Gao09, TheoremΒ 7.1.2] that the relation is Borel for every . We have
and that shows (2).
(3.) Let . The space endowed with is a separable metric space. It is easy to see that the assignment where is a contraction from to the quotient metric space .
(4.) Let satisfy the assumptions of (4). After possibly passing to a subsequence we may suppose that there is a sequence such that and . Define for every . Then it follows that is -Cauchy whenever is fixed. Since is complete there is such that for every . Moreover, we have . Continuity of the action and of the map gives
This finishes the proof. β
Every Borel pseudoemtric on defines a Borel equivalence relation on as
Note that in the case of PropositionΒ 2.10 we have that .
Theorem 2.11.
Let be a finitely uniformly branching tree and be a uniform Borel pseudometric such that . Then the following are equivalent
-
(a)
is nonmeager,
-
(b)
.
Proof.
(b) (a) is trivial. We show that (a) (b). Suppose first, that for every there is such that for every such that and . We may assume that is strictly increasing and we set .
Let and define such that and for every . Then clearly , for every and . Let and . Then we have
and consequently . This shows that is a -Cauchy sequence and by (4) from the definition of Borel pseudometric we have . In particular, there is such that and therefore . Altogether we have and since were arbitrary we have that .
Second, suppose that there is such that for every there are such that , and . We show that this contradicts being non-meager.
Note that is a Borel equivalence relation and every -equivalence class is dense in because . This implies, by [Kec95, TheoremΒ 8.41], that there is such that is comeager in . By (3.) in the definition of Borel pseudometric, there are Borel sets such that and
for every and .
By [Kec95, PropositionΒ 8.26], we find and such that is comeager in . Pick such that and . We may suppose that and where , and .
Let be such that and . Then we have that is comeager in and therefore there is such that
In particular, we have .
We use that is uniform. We have
and
This implies
and that contradicts . This finishes the proof. β
2.7 Base for non-classification by countable structures
We describe the family of Borel equivalence relations that will serve as a base under Borel reducibility for non-classification by countable structures in the proof of TheoremΒ 1.3. To that end we recall definitions of two types of Borel equivalence relations that are well-studied [Far01a, Far01b] and [Kan08, ChaptersΒ 3 andΒ 15]. We denote the power set of as .
A map is a lsc submeasure if , whenever , for every and
for every . We say that is tall if .
Let be a tall lsc submeausre. Then the equivalence relation on is defined as
for every . Similarly as in TheoremΒ 2.11, we have that is non-meager if and only if . We refer the reader to [Kan08, ChapterΒ 3] for more information about lsc submeasures and their connection to Borel reducibility.
A sequence of finite metric spaces is called non-trivial if
where and is the minimal such that there is and a sequence that contains every element of and satisfies for every .
Let be a non-trivial sequence of finite metric spaces and be endowed with the product topology. Then the equivalence relation on is defined as
for every . We refer the reader to [Far01a, Far01b, Kan08] for more information about these equivalence relations and their connection to Borel reducibility.
Definition 2.12.
Denote as the collection of all Borel meager equivalence relations that contain for some tall lsc submeasure or for some non-trivial sequence of finite metric spaces . That is for every there is either tall lsc submeasure such that and is a meager subset of , or there is a non-trivial sequence of finite metric spaces such that and is a meager subset of .
Theorem 2.13.
Let . Then is not classifiable by countable structures.
Proof.
We start by recalling the following well-known facts, seeΒ [Gre19, AppendixΒ 3.7] andΒ [Kan08, ChapterΒ 16]. Suppose that is a tall lsc submeasure and is meager. Then is induced by a turbulent action of a Polish group on . Similarly, if is a non-trivial sequence of finite metric spaces, then is induced by a turbulent action of a Polish group on . In particlar, these equivalence relations do not admit classification by countable structures.
Let be an equivalence relation on . By the definition we find such that either for some tall lsc submeasure or for some non-trivial sequence of finite metric spaces . Now we use the fact that turbulent actions are generically -ergodic.
Suppose for a contradiction that admits classification by countable structures. That is, there is a Polish -space and a Borel map that is a reduction from to . In particular, is a Borel homomorphism from to . It follows from TheoremΒ 2.3 that there is such that is comeager in . Since is a reduction we have
An application of [Kec95, TheoremΒ 8.41] shows that is comeager and that is a contradiction. β
3 -bounded Topology
In this section we introduce the notion of -bounded topology. We show that this property is closed downwards in the Borel reducibility order and that essentially countable equivalence relation induced by group actions always admit such a topology. Our main result is that if a Polish -space admits a (finer) -bounded topology, then is not Borel reducible to . Results in this section hold for all Polish groups, except for CorollaryΒ 3.8.
Let be a topology on a space and . We write for the -closure of in . If is understood from the context, we omit the superscript.
Definition 3.1.
Let be a Polish -space and be the underlying -Polish topology on . We say that is -bounded if
-
β’
for every there is an open neighborhood of such that .
Instead of saying that is -bounded -Polish topology, we say simply bounded -Polish topology.
We mentioned in the introduction that if is a locally compact Polish group, then any -Polish topology on is -bounded. Similarly this holds when is a countable discrete group. Next we discuss the example with the Banach space in a greater detail.
Example 3.2.
Let be the Banach space of all absolutely summable real sequences and consider the canonical action that is given by coordinate-wise summation. Then the product topology turns into a Polish -space. Let and be such that for every and . Fix , then we have
as . This shows that and therefore we see that the product topology is -bounded.
Next, we show that the existence of a -bounded topology is closed downwards in the Borel reducibility order. In the proof we use several technical but elementary results that are collected in AppendixΒ A
Theorem 3.3.
Let be a Polish -space and be a Polish -space such that is Borel, and the Polish topology on is -bounded. Then there is a finer -Polish topology on that is -bounded.
Proof.
Let be a Borel reduction from to . It is easy to see that the assumptions of LemmaΒ A.2 and LemmaΒ A.3 are satisfied. Let be the finer Polish topology on that is given by LemmaΒ A.3 and be a Borel -lg comeager set that satisfies conclusions of both LemmaΒ A.2 and LemmaΒ A.3. We show that works as required.
Let and be an open neighborhood of such that
LemmaΒ A.2 then gives an open neighborhood of such that
Let . By the definition we find such that . By LemmaΒ A.3 we have that because . Note that . This gives that . Since is a reduction we have . We see that and satisfies the assumption of LemmaΒ A.1 and therefore is -bounded. β
Corollary 3.4.
Let be a Polish -space such that is essentially countable. Then there is a finer -Polish topology on that is -bounded.
Recall that is the countable product of . Since the latter is induced by the canonical continuous action , it is not hard to see that the former is induced by the canonical continuous action of .
Theorem 3.5.
There is no finer bounded -Polish topology on .
Proof.
First we introduce an auxiliary notation. Set
for every . Then it is easy to see that is an open basis of made of clopen subgroups.
Suppose that is a finer bounded -Polish topology on . Define
Note that is an increasing sequence and we have .
Claim 3.6.
The set is co-analytic for every .
Proof.
Fix an open basis of . Then we have
The formula on the right-hand side is co-analytic because is a Borel relation. β
Using ClaimΒ 3.6 and [Kec95, PropositionΒ 8.26] we find and a basic open set , in the (canonical) product topology, such that is comeager in . Note that since βs are increasing we may assume that the first-coordinates of the indices that define are strictly less than .
It follows from [Kec95, TheoremΒ 8.38] that there is a Borel set that is comeager in the product topology such that the product topology and coincide on . Define
Then is a Borel set by [Kec95, TheoremΒ 16.1] and a routine use of [Kec95, TheoremΒ 8.41] shows that is comeager in the product topology. Then clearly and therefore we have
In fact, we have
for every because is comeager, thus dense in (see (I) in the proof of LemmaΒ A.1).
Consider the canonical identification between and . Another use of [Kec95, TheoremΒ 8.41] gives such that
is comeager in with respect to the product topology. Pick and note that the set
is meager. Therefore there is such that . However, we have
and that is a contradiction. β
Corollary 3.7.
Let be a Polish -space such that is Borel. Suppose that admits a bounded -Polish topology . Then .
Proof.
If , then admits a finer bounded -Polish topology by TheoremΒ 3.3. That contradicts TheoremΒ 3.5. β
Hjorth and Kechris have shown that if is a non-archimedean333A topological group is non-archimedean if it admits a base at the identity made of clopen subgroups. tsi Polish group, is a Polish -space such that is a Borel equivalence relation, then either is essentially countable or , seeΒ [HK01, TheoremΒ 8.1]. This gives immediately.
Corollary 3.8.
Let be a tsi non-archimedean Polish group and be a Polish -space such that is Borel. Then the following are equivalent:
-
β’
is essentially countable,
-
β’
there is a finer bounded -Polish topology on ,
-
β’
.
4 Property (IC)
We define a combinatorial property that characterizes classification by countable structures for equivalence relations induced by actions of tsi Polish groups, this is proved later in SectionΒ 5. Similar property was considered, e.g., in [Kan08, ChapterΒ 15.2] under the name βGrainy setsβ. This property, as well as classification by countable structures, does not depend on the underlying Polish topology on the space , i.e., it depends only on the Borel -algebra. We note that every action of non-archimedean Polish group trivially satisfies this property.
Recall that the dihypergraphs are defined in DefinitionΒ 2.4.
Definition 4.1 (Property (IC)).
Let be a Polish -space and be a -invariant Borel set. We say that satisfies Property (IC) if there is a sequence of Borel sets such that
-
β’
for every there is such that is -independent,
-
β’
for every .
We say that the Polish -space or the equivalence relation satisfy Property (IC) if satisfies property (IC).
We start by showing that Property (IC) is orthogonal to turbulence for actions of any Polish group.
Theorem 4.2.
Let be a Polish -space that satisfies Property (IC). Then the action is not turbulent.
Proof.
Suppose that the action is turbulent. Let be a Borel comeager set such that is relatively open in for every . This can be done using [Kec95, PropositionΒ 8.26]. It follows from [Kec95, TheoremΒ 16.1] and [Kec95, TheoremΒ 8.41] that
is a Borel comeager subset of .
Pick . Note that is comeager in . We show that is nonmeager. Suppose that is meager. Then there are closed nowhere dense sets such that . Note that is closed for every and . By [Kec95, PropositionΒ 8.26] there is an index such that contains an open set. This implies that there is and such that and . Let such that . Note that
because is closed.
Use the definition of to find an open set such that . Consider the local orbit and pick . By the definition, there is such that , and for every . Let be an open neighborhood of . Note that , are open and is comeager, in particular, dense in . Therefore we can find a sequence such that , , for every , for every and . Note that we have
for every . The set is -independent and therefore . This implies that and consequently that
Therefore contains an open set by the assumption that the action is turbulent, i.e., is somewhere dense. This shows that is nonmeager and that contradicts the definition of turbulence. β
We conclude this section by stating that Property (IC) is a stronger condition than classification by countable structures for tsi Polish groups.
Theorem 4.3.
Let be a tsi Polish group and be a Polish -space such that is Borel. Suppose that satisfies Property (IC). Then is classifiable by countable structures.
Proof.
An elementary proof of this statement follows from [Gre19, DefinitionΒ 3.3.6,Β PropositionΒ 3.3.7,Β TheoremΒ 3.3.8].
Alternative approach that does not need the assumption that is Borel is to appeal to [Kec02, TheoremΒ 13.18] and TheoremΒ 4.2. β
5 Proof of TheoremΒ 1.2
We show that Property (IC) together with the existence of bounded -Polish topology implies that the equivalence relation is essentially countable. Note that it follows from CorollaryΒ 3.4 that if a Borel equivalence relation induced by an action of Polish group is essentially countable, then it admits a bounded -Polish topology. The following is a formal formulation of TheoremΒ 1.2 for tsi Polish groups.
Theorem 5.1.
Let be a tsi Polish group be a Polish -space such that is Borel. Then the following are equivalent:
-
(A)
satisfies Property (IC) and there is a finer bounded -Polish topology on ,
-
(B)
is essentially countable.
Moreover, (A) implies (B) for any Polish group .
The strategy for showing (A) implies (B) is as follows. By the assumptions we fix a bounded -Polish topology and a sequence of Borel -independent sets. We define an equivalence relation on as
for every and . Note that if , then .
Since is -bounded we find for each natural numbers such that . By [Kec95, TheoremΒ 12.13] there is a Borel selector that picks from every nonempty -closed set one of its elements. We define
The idea is to show that this is a Borel map with range that is a countable complete section. This can be done once we pass from to a suitable Borel -lg comeager set . Formal proof follows.
Proof of TheoremΒ 5.1 and TheoremΒ 1.2.
We start with (B) (A). We mentioned above that by CorollaryΒ 3.4 we have that (B) implies the existence of a bounded -Polish topology for every Polish group . To show that (B) implies Property (IC), we need to assume that is tsi. In that case, we either use TheoremΒ 6.1, or exploit the fact that essential countability is equivalent to -lacunarity [Gre20] together with LemmaΒ A.6.
Next, we formalize the ideas for (A) (B) that are sketched before the proof. We fix a bounded -Polish topology and a sequence of -independent Borel sets. We may assume that are pairwise disjoint for every . We denote as the unique such that , i.e., for every . Let be a Borel selector that assigns to a non-empty -closed subset its element, i.e., a Borel map from the standard Borel space of -closed non-empty subsets to , seeΒ [Kec95, TheoremΒ 12.13]. The proof consists of five steps.
(I). Fix and use LemmaΒ A.5 for the sequence to get a Borel -lg comeager set . Define . Then we have that is a Borel -lg comeager set and for every and there is an open neighborhood of such that
by LemmaΒ A.5.
(II). Let . Define the equivalence relation on as
for every . We show that is Borel and that every -class contains at most countably many -classes.
Let and . Then is relatively open in by the properties of from (I). This shows that each -class contains at most countably many -classes because is a separable space.
Set for the restriction of the relation to . It follows from [BK96, TheoremΒ 7.1.2] and the assumption that is Borel that is Borel. Inductively on define relations on as
It follows inductively from [Kec95, TheoremΒ 16.1] that is a Borel subset of .
We show that . It is easy to see that .
Claim 5.2.
Suppose that . Then there is an open neighborhood of (that depends on and ) such that for every such that .
Proof.
Let and pick . There is such that . Use (I) to find such that and . Then for every such that we have and since we conclude that .
Let and be such that and . By the inductive hypothesis there is an open neighborhood of such that whenever . Write where . Using (I) we find an open neighborhood of such that and . We claim that works as required. Let such that . Note that
is an open neighborhood of . Let be such that , note that there are nonmeager many such because is comeager in . Then we have and
This shows that and the claim follows. β
Suppose that and pick such that the witness from the definition of has minimal length. It follows that and for some . Use ClaimΒ 5.2 to find an open neighborhood of that satisfies for every such that . Let be such that . The set
is an open neighborhood of . Then we have
for every . Note that is comeager in and that shows that , a contradiction.
(III). Fix and define
for every . Let be a -open set. Then we have
where the last equivalence follows from properties of from (I). Combination of (II) and [Kec95, TheoremΒ 16.1] implies that is a Borel map, seeΒ [Kec95, SectionΒ 12].
(IV). Put . Then is a Borel map for every by (III). Define
It is easy to see that is a Borel set. We show that , the projection to the second coordinate, is a Borel countable section of .
First observe that for we have if and only if for every and . It follows from (II) that there are at most countable many -classes within each -class and therefore is a countable section of . To see that is Borel note that by the properties of from (I) and the definition of and we have
where is the projection to the first coordinate. Since is Borel we have that is Borel by [Kec95, TheoremΒ 16.1].
(V). Finally, we need to show that is a complete section. Let . It follows from the definition of Property (IC) and that there is such that
Then we have and consequently . This shows that . β
6 Proof of TheoremΒ 1.3
In this section we show that classification by countable structures is equivalent to Property (IC) for Borel equivalence relations induced by actions of tsi Polish groups. In the proof we use the dihypergraph variant of -dichotomy TheoremΒ 2.8. Namely, we show that (1.) implies Property (IC), and that the continuous map from (2.) can be refined to a reduction from an equivalence relation from , see SectionΒ 2.7. The technical results that we need are collected in AppendixΒ A and AppendixΒ B. The following statement is a formal reformulation of TheoremΒ 1.3.
Theorem 6.1.
Let be a tsi Polish group and be a Polish -space such that is Borel. Then the following are equivalent:
-
1.
satisfies Property (IC),
-
2.
is classifiable by countable strutures.
Moreover, the conditions are not satisfied if and only if there is such that .
Proof of TheoremΒ 1.3 and of TheoremΒ 6.1.
It follows from TheoremΒ 4.3 that (1) implies (2). Moreover, by TheoremΒ 2.13 we have that the latter condition implies the former in the additional part of the statement. Altogether, it is enough to show that if does not satisfy Property (IC), then there is such that .
Fix and consider the dihypergraphs . Note that for every . Then exactly one alternative in TheoremΒ 2.8 holds. Suppose that the first one is satisfied for every . Then it follows directly from the definition that satisfies Property (IC). Since we assume that this is not the case, there must be , a finitely uniformly branching tree , a dense sequence such that and a continuous homomorphism from to .
Next, we refine to find . The following is the main technical result, the proof can be found in AppendixΒ B, see also SectionΒ 2.6 for corresponding definitions. We note that it uses crucially that is tsi.
Lemma 6.2.
There is a finitely uniformly branching tree , a dense sequence such that for every and a continuous homomorphism from to such that , defined as in PropositionΒ 2.10, is a uniform Borel pseudometric. Moreover, where is a continuous map.
The rest of the proof consists of four steps.
(I). Let , such that , and . Then
(*) |
We use that is uniform. Namely, we have
and that gives the estimate by the triangle inequality.
In particular, we have
because is a homomorphism from to and for every .
(II). The Borel equivalence relation is meager in . Otherwise there is such that is comeager in by and [Kec95, TheoremΒ 8.41]. It follows from (3) in the definition of Borel pseudometric that there are Borel sets such that and
for every and . Using [Kec95, PropositionΒ 8.41] and the density of we find such that is comeager in . This gives such that
Since is a homomorphism from to , we have . Consequently,
i.e.,
This contradicts the choice of and we conclude that is a meager equivalence relation.
(III). Write for the sequence . Let . Since is a finite pseudometric space we find a metric space where and
for every . We have
and because is a homomorphism from to .
This implies immediately that is a non-trivial sequence of finite metric spaces. Consider the bijective homeomorphism
that is defined as
If , then we are done because by (II) and is a reduction from to .
(IV). Suppose that in (III). By the definition, we find such that
and . Set and .
We have because . Let be an increasing enumeration of and set , for every . There is a sequence such that
Define as
for every , where if and if . Write for the extension of to . It is easy to see that is a well defined continuous map.
Set and . It is easy to see that is a uniform Borel pseudometric, this follows from the definition of . Moreover, . Consequently by TheoremΒ 2.11, we have that is meager in .
To finish the proof we define a tall lsc submeasure such that . Indeed, then we have and, clearly, is a reduction from to .
Recall that is the power set of . Let be finite. Define
Let be infinite. Then we define .
(a). We show that is a tall lsc submeasure.
-
β’
It is easy to see that is monotone, and for every .
-
β’
Let be finite and such that . Set to be equal to on and to to on . Then we have
becuase is a pseudometric. Since this holds for every such , we conclude that . For infinite the conclusion holds by taking the limit in the definition.
-
β’
Let and be such that only when . Observe that this implies that and differ only at . We have
by (* β£ 6) and the definition of in (III). This shows that and by the choice of and . This shows that is a tall lsc submeasure.
(b) Let be such that . We show that . Set . Then we have that by the definition of . For every , define for every and for every . We have for every and .
We have that by continuity of and it is easy to see that
Let . We have that . Consequently, by the definition of and our assumption, we have
In particular, is a -Cauchy sequence. By the definition of Borel pseudometric we have . In particular, and, consequently, . β
7 Proof of TheoremΒ 1.4
In this section we combine the characterization of classification by countable structures from previous section together with a result of Miller [Mila] to show that if a Borel equivalence relation induced by an action of tsi Polish group admits classification by countable structures, then it is essentially countable if and only if . In another words, under the assumption of classification by countable structures we have that is the canonical obstruction for EC. We note that in the previous results [HK01, Mila] the corresponding statement is proved for tsi non-archimedean Polish groups.
The strategy of the proof combines two variants of the -dichotomy. First one is hidden in the implication that classification by countable structures implies Property (IC) and the second one is the characterization of -lacunarity given by Miller [Mila]. The technical results that are used in the proof are collected in AppendixΒ B. The following statement is a formal reformulation of TheoremΒ 1.4
Theorem 7.1.
Let be a tsi Polish group, be a Polish -space and be a Borel equivalence relation that is classifiable by countable structures. Then the following are equivalent:
-
1.
is essentially countable,
-
2.
there is a finer -Polish topology on that is -bounded,
-
3.
.
Proof of TheoremΒ 1.4 and TheoremΒ 7.1.
(1) (2) is CorollaryΒ 3.4 and (2) (3) is CorollaryΒ 3.7. It remains to show that (3) (1).
Recall from SectionΒ 2.5 that is such that , for every and for every there are infinitely many such that .
It will be convenient for us to fix another open base at . During the construction we pass two times to a subsequence of but we keep the notation . In the beginning we set but one should keep in mind that changes during the refinements. Similar warning applies to the following definition of Miller [Mila]. Define for every . Suppose that does not satisfy (1), i.e., it is not essentially countable. Then it follows from [Mila, TheoremΒ 1.1,Β PropositionΒ 2.3] that there is a function and a continuous homomorphism from to . In this step TheoremΒ 2.6 is used.
The proof of the following result can be found in AppendixΒ B. We note that LemmaΒ 7.2 uses crucially that is tsi Polish group while LemmaΒ 7.3 holds for every Polish group.
Lemma 7.2 (First refinement).
Let be a continuous homomorphism from to . Then, after possibly passing to a subsequence of , there is a continuous homomorphism from to .
By TheoremΒ 1.3 we have that satisfies Property (IC). That is there is a sequence of Borel sets such that for every and is -independent for some . We stress that the dihypergraphs are defined using the sequence . We put to be the minimal such that . The proof of the following result can be found in AppendixΒ B.
Lemma 7.3 (Second refinement).
Let be a continuous homomorphism from to . Then, after possibly passing to a subsequence of , there is a continuous homomorphism from to and for every there is such that and the set
is -independent for every such that .
The rest of the proof closely follows the proof of [Mila, TheoremΒ 4.1]. Suppose that we have as in LemmaΒ 7.3. In particular it satisfies [Mila, LemmaΒ 4.2]. Set for all and define as for all and , see the definition after [Mila, LemmaΒ 4.2].
Claim.
The continuous map is a homomorphism from to .
Proof.
Let and suppose that there is such that
and the set on the left-hand side is finite. It is easy to see that . We show that, in fact, .
Set and . Write for the increasing enumeration of the indices where and differ. From the assumption we have and for every . Let and differ from only in the -th position for every . Clearly, . By LemmaΒ 7.2 and LemmaΒ 7.3, we have that and . Consequently, we have
as promised.
Let be such that . Define and to be equal to except for the vertical section , where it is equal to . Set , and It is easy to see that in , and by the continuity of we have in . Moreover, satisfy the assumption above and we conclude that
Pick that satisfies . Then we have
in . By the definition of , we have that
for some . The continuity of the action guarantees that , that is, , and the proof is finished. β
In order to use [Mila, LemmaΒ 3.6] we need to verify the assumptions. Recall that for and we define
Claim.
For every and finite set , the equivalence relation
is meager in .
Proof.
The proof of [Mila, LemmaΒ 4.5] uses only the fact that the is a homomorphism from to . Therefore it can be applied in our situation as well. β
The proof is now finished as follows. By [Mila, LemmaΒ 3.6] we find a continuous homomorphism from to , where denotes the complement of . The function is the desired reduction from to . β
8 Remarks
There are two main open questions connected to TheoremΒ 1.3 and TheoremΒ 1.4.
Question 8.1.
Consider the class of Borel equivalence relations induced by actions of tsi Polish groups.
-
1.
Let be the collection of meager equivalence relations and where runs over all tall lsc submeasures and over non-trivial sequences of finite metric spaces. Is it enough to take , instead of , as the base of non-classification by countable structures?
-
2.
Is the existence of a bounded -Polish topology equivalent to non-reducibility of ?
We conclude our investigation with several remarks. We mentioned in the introduction that our starting point was Hjorthβs dichotomy [Hjo00a]. From our results, as stated, it does not directly follow that we can recover this dichotomy. However, there are two easy modifications that gives this result. First, TheoremΒ 1.3 can be stated relative to an analytic set , seeΒ [Gre19, TheoremΒ 3.3.5]. Second, if we formulate Hjorthβs dichotomy in the form where the Banach space is replaced by the summable ideal [Kan08, ChapterΒ 15], then it is not difficult to verify that one is always in (IV) in the proof of TheoremΒ 6.1, the lsc submeasure constructed there corresponds to the summable ideal and the map can be refined to a reduction, see [Gre19, Proof of TheoremΒ 3.1.3].
As a last thing we mention that it is possible to prove that if is a Borel reduction from to , where is tsi Polish group, and admits classification by countable structures, then there is a Borel -nvariant set that contains such that admits classification by countable structures. This implies a slight strengthening of TheoremΒ 7.1.
Theorem 8.2.
Let be a tsi Polish group and be a Polish -space such that is Borel. Then the following are equivalent:
-
1.
is essentially countable for every Borel set that is -invariant and is classifiable by countable structures,
-
2.
.
References
- [All20] S.Β Allison. Non-archimedean tsi polish groups and their potential Borel complexity spectrum. arXiv:2010.05085, 2020.
- [AP20] S.Β Allison and A.Β Panagiotopoulos. Dynamical obstructions to classification by (co)homology and other tsi-group invariants. arXiv:2004.07409, 2020.
- [BK96] H.Β Becker and A.Β S. Kechris. The descriptive set theory of Polish group actions, volume 232 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1996.
- [DG17] Longyun Ding and SuΒ Gao. Non-archimedean abelian polish groups and their actions. Advances in Mathematics, 307:312β343, 2017.
- [Far01a] I.Β Farah. Basis problem for turbulent actions. i. tsirelson submeasures. Ann. Pure Appl. Logic, 108(1β3):189β203, 2001.
- [Far01b] I.Β Farah. Basis problem for turbulent actions. ii. -equalities. Proc. London Math. Soc., 82(1):1β30, 2001.
- [Gao09] SuΒ Gao. Invariant descriptive set theory, volume 293 of Pure and Applied Mathematics (Boca Raton). CRC Press, Boca Raton, FL, 2009.
- [Gre19] J.Β GrebΓk. Definable graphs. PhD thesis, https://dspace.cuni.cz/handle/20.500.11956/123575, 2019.
- [Gre20] J.Β GrebΓk. -lacunary actions of Polish groups. Proc. Amer. Math. Soc., 148:3583β3589, 2020.
- [Hjo00a] G.Β Hjorth. Actions by the classical banach spaces. J. Symbolic Logic, 65(1):392β420, 2000.
- [Hjo00b] G.Β Hjorth. Classification and orbit equivalence relations, volumeΒ 75 of Math. Surveys Monogr. American Mathematical Society, Providence, RI, 2000.
- [HK01] Greg Hjorth and AlexanderΒ S. Kechris. Recent developments in the theory of Borel reducibility. Fund. Math., 170(1β2):21β52, 2001.
- [Kan08] V.Β Kanovei. Borel equivalence relations. Structure and classification, volumeΒ 44 of University Lecture Series. American Mathematical Society, Providence, RI, 2008.
- [Kec92] A.Β S. Kechris. Countable sections for locally compact group actions. Ergodic Theory and Dynamical Systems, 12(2):283β295, 1992.
- [Kec95] AlexanderΒ S. Kechris. Classical descriptive set theory, volume 156 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1995.
- [Kec02] A.Β S. Kechris. Actions of Polish groups and classification problems, volume 262 of Analysis and logic (Mons, 1997), 115β-187, London Math. Soc. Lecture Note Ser.,. Cambridge University Press, Cambridge, 2002.
- [Kec21] A.Β S. Kechris. The theory of countable Borel equivalence relations. http://www.math.caltech.edu/Β kechris/papers/lectures%20on%20CBER05book.pdf, 2021.
- [KST99] A.Β S. Kechris, S.Β Solecki, and S.Β Todorcevic. Borel chromatic numbers. Adv. Math., 141(1):1β44, 1999.
- [Mila] B.Β D. Miller. A generalization of the dichotomy and a strengthening of the dichotomy. To appear in the Journal of Mathematical Logic.
- [Milb] B.Β D. Miller. An introduction to classicaldescriptive set theory. https://homepage.univie.ac.at/benjamin.miller/lecturenotes/descriptivesettheory.pdf.
- [Mil12] B.Β D. Miller. The graph-theoretic approach to descriptive set theory. Bull. Symbolic Logic, 18(4):554β575, 2012.
Appendix A Technical results
Lemma A.1.
Let be a Polish -space and be a -lg comeager set such that for every there is an open neighborhood of such that . Then the Polish topology on is -bounded.
Proof.
The proof consists of three steps.
(I). Let and be any neighborhood of . We show that
Let . Then there are such that . Fix a decreasing sequence of open subsets of such that . We may assume (after passing to a subsequence) that for every . Note that is an open subset of because the action is continuous. Moreover, we have that the open set is non-empty, since it contains . Now the assumption that is -lg comeager guarantees that . Pick . Then we have and . This shows that and consequently that .
(II). Let and be open neighborhoods of such that and . We show that
Let be such that and . Note that need not be an element of , but since is -lg comeager set we have is comeager in . Pick . Then we have . It is clearly enough to show that . We have because acts by homeomorphism on , and for every . This shows that . By step (I) and the assumption we have
and the claim follows.
(III). Let . There is and such that because is -lg comeager. By (I), (II) and the assumption on there is an open neighborhood of such that . Let be an open neighborhood of such that . Let be such that . Since acts on by homeomorphism we have that
This implies that and consequently that . β
Lemma A.2.
Let be a Polish -space and be a Polish -space such that is Borel. Suppose that is a Borel homomorphism from to , i.e., . Then there is a Borel -lg comeager set such that
-
β’
for every and every , open neighborhood of , there is , an open neighborhood of , such that
whenever and .
Proof.
Fix an open neighborhood of . Recall that the assumption that that is Borel together with [BK96, TheoremΒ 7.1.2] gives that is a Borel relation. Put
and
It follows that and are Borel sets.
Let be an open neighborhood basis at . Define
It follows from [Kec95, TheoremΒ 16.1] that is a Borel subset of .
We show that is an -lg comeager set. To this end pick and suppose that is not comeager in . By [Kec95, PropositionΒ 8.26] there is an open set such that is meager in . Let and pick a sequence such that where . We have and
because is a homomorphism from to . It follows again from [Kec95, PropositionΒ 8.26] that there is and an open set such that is comeager in . Let and be such that and . We show that and that contradicts the choice of . First note that is comeager in . This is because
and the latter is comaeger in since is an open subset of . Pick . We have by the definition of and . Therefore there are such that
This shows that and consequently . Altogether, we have that is a Borel -lg comeager set.
Let be an open basis at and put
It follows from the previous paragraph that is a Borel -lg comeager set. Let and be an open neighborhood of . Take such that and such that . Pick such that and such that . We show that .
Write and . By the definition we have and , and consequently is comeager in and is comeager in . This implies that are both comeager in since and are open sets. Let . Then we have and . Consequently, . But that implies
and the proof is finished. β
Lemma A.3.
Let be a Polish -space and be a Polish space. Suppose that is a Borel map. Then there is a -lg comeager set and a finer -Polish topology on such that
-
β’
is -continuous.
Proof.
Let be an open set. We find a finer -Polish topology and a Borel -lg comeager set such that is relatively open in , i.e., for some . Once we have this we finish the proof as follows. Fix some open basis of . Define and to be the topology generated by . It is easy to see that is a Borel -lg comeager set and using [Gao09, LemmaΒ 4.3.2] we have that is a finer -Polish topology on . Moreover, for every we have and
thus showing that is -continuous.
Let be an open neighborhood basis at . Define
-
β’
-
β’
-
β’
-
β’
It follows from [Kec95, TheoremΒ 16.1] that all the sets are Borel. Moreover, we have , , and . The equalities follow from the fact that if, for example, , then there is such that and are both comeager in . This gives such that and that is a contradiction.
Put . We show that is a Borel -lg comeager set and that there is a finer -Polish topology such that . First we demonstrate how this finishes the proof. Put . Then we have
by the previous paragraph and the fact that . Hence, is relatively -open in .
First we show that is an -lg comeager set. Let and suppose that is not comeager in . By [Kec95, PropositionΒ 8.26] there is an open set such that is meager in . Note that . Therefore there is an open set such that one of is comeager in . Suppose, for example, that is comeager in (the other case is similar). Since is open we find
and such that . The set is comeager in . This is because
and the latter set is comeager in because . Note that whenever and by the choice of . We conclude that and that is a contradiction with .
Next we show that there is a finer -Polish topology such that .
Claim A.4.
Let be a Borel set. Then there is a finer -Polish topology such that
Proof.
Recall [Gao09, TheoremΒ 4.3.3]
-
(I)
If is a Borel set and is open, then there is a finer -Polish topology such that
Define
for . Then is a Borel set by [Kec95, TheoremΒ 16.1] and . Apply (I) above for and to find a finer -Polish topology such that
Set to be the topology generated by . Then is a finer -Polish topology by [Gao09, LemmaΒ 4.3.2] and . To finish the proof we show that .
Let . By the definition we have that there is such that and consequently that is comeager in . Since we have that . This gives that
is comeager in and therefore is comeager in . Now it is easy to see that .
Suppose now that . Then we have and is comeager in . Pick . Then the set
is comeager in because and consequently is comeager in . This shows that for every . Consequently, and that finishes the proof. β
Note that we can apply ClaimΒ A.4 to both sets and to get finer -Polish topologies and such that and . Then by [Gao09, LemmaΒ 4.3.2] we have that the topology that is generated by is a finer -Polish topology that contains , and the proof is finished. β
Lemma A.5.
Let be a Polish -space and be a sequence of pairwise disjoint Borel subsets of such that Then there is a Borel -lg comeager set such that for every and there is an open neighborhood of such that
Proof.
Define a Borel map where if and only if . Then LemmaΒ A.3 gives a Borel -lg comeager set and a finer -Polish topology on such that is -continuous.
Let and . Since the map is -continuous there must be -open set such that . Note that is a -Polish topology and therefore we find open neighborhood of such that . Altogether we have and the proof is finished. β
Lemma A.6.
Let be a tsi Polish group, be a Polish -space and be a -independent analytic subset of for some . Then there is a Borel -invariant set such that and a sequence of -independent Borel subsets of such that .
Proof.
We may assume that . Define
Then it is easy to see that is an analytic subset of . Let . Pick any such that and for every . Then we have
for every . The set is -independent and that gives . We have
and that shows that is -independent.
By [Kec95, TheoremΒ 28.5] there is a Borel set that is -independent and . Define
It follows from [Kec95, TheoremΒ 16.1] that is a Borel set. The definition of together with implies that . Similar argument as in previous paragraph shows that is -independent. Moreover it is easy to see that if is comeager in , then for every . This shows that is open in for every .
Let be a dense subset of such that . Define and . Then is a -invariant Borel set because is nonempty open set whenever . Moreover, .
It remains to show that is -invariant for every . Let , be a conjugacy invariant open neighborhood of and . Then if and only if . This shows that
where the action is extended coordinate-wise. Consequently, is -independent for every . This finishes the proof. β
Appendix B Refinements
In this section we prove LemmaΒ 6.2, LemmaΒ 7.2 and LemmaΒ 7.3. Our aim is to develop a technical machinery for finding subtrees of a given finitely uniformly branching tree that satisfy several constraints. The techniques involve diagonalizing a sequence of trees and iterative application of Baire category argument. First we define all the relevant notation and then prove two auxiliary lemmata. These are then used in the proof of our main technical results.
Let be a finitely uniformly branching tree. Let , where denotes the set of all infinite subsets of . We define as
and denote as the branches of . Note that is closed in .
Write for the increasing enumeration of . Then there is a unique finitely uniformly branching tree and a unique map that satisfy
-
β’
for every ,
-
β’
-
β’
for every ,
-
β’
for every such that .
It is easy to verify that extends to a unique continuous homeomorphism
that is a reduction from to for every . This is because for every and we have if and only if for every .
Lemma B.1.
Let be a sequence of finitely uniformly branching trees, be such that for every and for every . Then there is a finitely uniformly branching tree and a sequence of continuous maps such that
-
1.
for every , in particular, holds for every ,
-
2.
for every and there is such that whenever for every ,
-
3.
for every ,
-
4.
is a reduction from to for every .
Proof.
Observe that if , then . Define and note that this defines a finitely unifmormly branching tree that satisfies (1).
For and we define . For we set inductively . It is easy to see that for every and if , then for every .
Define
for every and . Note that is well defined element of . Moreover, we have
for every and . This shows (3).
Note that (1) and (2) imply (4) and therefore it remains to show (2). Let and . Put such that
Let and . It is clearly enough to show that for every .
We show inductively that for every , where . By the definition we have
for every . Suppose that the claim holds for where . Fix an enumeration of . Then for every there is such that and . This is because . If , then and we have
by the inductive assumption. If , then
and the proof is finished. β
Lemma B.2.
Let be a finitely uniformly branching tree, be such that for every , , , be a sequence of subsets of with the Baire property such that and be such that is dense in for every . Then there is such that, if we put , we have
-
1.
,
-
2.
for every there is such that ,
-
3.
is dense in for every ,
-
4.
there is such that .
Proof.
Let be an enumeration of such that is infinite for every and . The construction proceeds by induction on . Namely, in every step we construct , , and such that ,
and
In the end we put and .
(I) . Let be an enumeration of . Define inductively such that
-
β’
for every ,
-
β’
for every ,
-
β’
for every there is such that is comeager in .
This can be achieved by [Kec95, PropositionΒ 8.26]. Write and use the density of to find such that . Let be such that and .
Define
Note that is comeager in for every . Fix a decreasing collection of open subsets of such that , and is dense in for every .
(II) . Suppose that we have , , and that satisfies
-
(a)
and for every ,
-
(b)
for every ,
-
(c)
if , and for some , then there is such that and for every such that .
Note that if , then (a)β(c) are satisfied. Next we show how to find , , and such that (a)β(c) holds.
Let be an enumeration of . Construct inductively such that
-
β’
for every ,
-
β’
for every .
This can be done because for every there is such that and is dense in . Put . If satisfies the assumption of (c), that is for some , and , then pick such that . Otherwise pick any . It follows from the density of that there is such that . Define such that , , and .
It is easy to see that (a) and (c) hold. Property (b) follows from for every .
(III). Let and . Set . We show that properties (1)β(4) are satisfied.
(1) Is trivial.
(2) Let . Note that by the definition of . Consequently,
By (I), there is such that
and is comeager in . Let and . Define
Then it is easy to see that and, using (b) from the inductive construction, we get
Therefore
and that shows (2).
(3) Let and where . By the properties of the enumeration, there are infinitely many such that . Pick one such that . Then during the construction in (II) we take such that and such that and to define such that . Let
Then it follows from the definition that and the fact that gives .
(4) Note that where is such that by the definition in (I). This finishes the proof. β
Proof of LemmaΒ 6.2.
Let be a dense subset of . The construction proceeds by induction on . Let be an enumeration of such that for every . We construct a sequence of finitely uniformly branching trees together with such that for every , , for every and such that the following holds
-
1.
for every ,
-
2.
is a homomorphism from to for every ,
-
3.
for every ,
-
4.
is a dense subset of such that and is a homomorphism from to for every ,
-
5.
if , then (note that by (1)),
-
6.
for every there is such that for every there is such that we have
for every , where is defined as in PropositionΒ 2.10.
We put , , for every and . Conditions (1) and (5) are empty, (2)β(4) are satisfied by assumption and for (6) it is enough to take for every .
In the inductive step we construct , , and such that (1)β(6) holds. We use a version of LemmaΒ B.2, where instead of a sequence we take single , e.g., to apply LemmaΒ B.2 we may consider any partition of to disjoint sets and pick arbitrarily.
Set , , , , if otherwise we put and , where and
-
β’
if and , then for every and ,
-
β’
if , then if and only if
It is easy to see that the first line in the second item defines an analytic set and it follows from PropositionΒ 2.10 that the second line defines Borel set. Altogether, is an analytic subset of , i.e., it has the Baire property by [Kec95, TheoremΒ 21.6], for every and .
It is easy to see that (1) and (2) hold. Note that because by LemmaΒ B.2Β (4) we have for some . This shows (3) and (5) follows from . First part of item (4) follows from LemmaΒ B.2Β (3). Second part follows from the inductive hypothesis and definition of . Namely, for every there is such that . Note that . Then we have that is a homomorphism from to and is a reduction from to . This shows that is a homomorphism from to because .
It remains to show (6). Recall that . It follows from LemmaΒ B.2Β (2) that there is such that . Let and define . Take any . By the definition of we find such that
Since we find such that, if we set , we have
by the definition of . That shows (6) an the proof is finished.
Constructing . LemmaΒ B.1 gives a finitely uniformly branching tree and a sequence of continuous maps . Define for some, or equivalently (by LemmaΒ B.2Β (3)) any, . Note that is a continuous map and where .
Define . It follows from (1) and LemmaΒ B.1Β (1) that for every and . By (4) and LemmaΒ B.1Β (4) we have that is a homomorphism from to for every . Let . Then there is such that . It follows by (5) that and, consequently, is dense in .
It remains to show that is uniform. Let and . It follows from LemmaΒ B.1Β (2) that there are such that
for every .
Let be as in (6). We have
Consequently, after doing the same argument for , we obtain
Pick any such that and if they exist. Then we have
(**) |
by (6). The invariance of gives
where the last inequality follows from
Similarly
This implies
Similar argument for implies that
In the case when such do not exist, then, by (** β£ B), we have
and trivially
This finishes the proof. β
Proof of LemmaΒ 7.2.
Recall that is such that , for every and for every there are infinitely many such that . Also, we defined for every and the definitions of are made with respect to . Set for every . Then it is easy to see that we have for every . Define as
for every . Note that we have for every .
The proof consists of two steps. In the first step (A) we find a continuous homomorphism from to . In the second step (B) we find a subsequence of and such that is a homomorphism from to .
(A). The construction proceeds by induction on . We construct together with , and such that the following holds
-
1.
for every ,
-
2.
is a partition of for every ,
-
3.
for every ,
-
4.
is dense in for every ,
-
5.
is a homomorphism from to whenever for every ,
-
6.
is a homomorphism from to for every and .
Having this we use LemmaΒ B.1 and define as for some, or equivalently any, by LemmaΒ B.1Β (2), . Let . By LemmaΒ B.1Β (3) we have that is a reduction from to . Property (6) then implies that is a homomorphism from to .
Let and suppose that we have , and that satisfy (2)β(6). We show how to construct , , and that satisfy (1)β(6). In the case we put and for every . Then properties (2)β(5) follow directly from definitions, while (6) is easy to see once we realize that is a homomorphism from to and .
Let be a dense subset of . To build we use LemmaΒ B.2 with , , , , and , where
It follows from the density of that . Moreover, by the definition, we have that is an analytic subset of for every , thus it has the Baire property byΒ [Kec95, TheoremΒ 21.6]. Now, LemmaΒ B.2 gives that satisfies LemmaΒ B.2Β (1)β(4). Next we verify properties (1)β(6).
It is easy to see that Properties (1) and (3) hold when we put . Let be an enumeration of the set
and for every . Then it follows from LemmaΒ B.2Β (3) that Properties (2) and (4) hold. Let and be such that . Then we have that is a reduction from to . By (5) of the inductive assumption we have that is a homomorphism from to where . Then we have that is a homomorphism from to . By the definition we have and that shows (5).
It remains to show (6). By LemmaΒ B.2Β (2) there is such that . By LemmaΒ B.2Β (4) and the definition of we have that where . We have that is a homomorphism from to because is a reduction from to and is a homomorphism from to by (5). Let , then we have and it follows from the definition of that there is such that
holds for every . This implies that
and, by the definition of , we have
for every .
Recall that . Let and . Pick , and such that
-
β’
,
-
β’
,
-
β’
,
-
β’
.
An easy calculation shows that
Recall that , and are conjugacy invariant and symmetric. Then we have
Assume that then
The assumption that implies that
hence we have (6).
(B). In the first step (A) we found a continuous homomorphism from to . Put and define inductively for every . Let
and . Put and define such that . This is well defined since for every .
We show that is a homomorphism from to . We have that is a reduction from to for every . Fix and let . Then is a homomorphism from to . We have
because and . Therefore, after passing to the subsequence we have that is a homomorphism from to and that finishes the proof. β
Proof of LemmaΒ 7.3.
Recall that is the minimal number such that and is a decreasing sequence of open neighborhoods of . The relations are defined with respect to . Recall also that , where is some fixed compatible metric on , and the relations are defined with respect to . We assume that for every . By the assumption, there is a sequence of Borel sets such that is a partition of for every fixed and is -independent for every and some .
The proof consists of two steps. In the first step, (A), we find a continuous homomorphism from to and a sequence such that
is -independent for every . In the second step, (B), we pass to a subsequence of and massage so that it meets the desired requirements.
(A). The construction proceeds by induction on . We construct , , , and such that the following holds
-
1.
for every ,
-
2.
is a partition of for every ,
-
3.
for every ,
-
4.
is dense in for every ,
-
5.
is a homomorphism from to whenever for every ,
-
6.
is a homomorphism from to ,
-
7.
is -independent for every and for every .
Having this, we use LemmaΒ B.1 and define as for some, or equivalently, by LemmaΒ B.1Β (2) any, . By LemmaΒ B.1Β (3), we have that is a reduction from to for every and every . This implies that is a homomorphism from to . Let , then it follows from LemmaΒ B.1Β (1)andΒ (2) that
This implies that is -independent for every .
Let and suppose that we have , and that satisfy (2)β(5). We show how to construct , , , and that satisfy (1)β(7). In the case when we put for every , , and choose any that satisfies (4). Then it is easy to see that properties (2)β(5) are satisfied.
To build we use LemmaΒ B.2 with , , , , and , where
for every . Now, LemmaΒ B.2 gives that satisfies LemmaΒ B.2Β (1)β(4).
It is easy to see that Properties (1) and (3) hold when we put . Let be an enumeration of the set
and for every . It follows from LemmaΒ B.2Β (3) that Properties (2) and (4) hold. Let be such that for some . Then by the definition we have and is a homomorphism from to by (5) of the inductive assumption. This gives that is a homomorphism from to because is a reduction from to . This shows (5). By LemmaΒ B.2Β (4) we have that . This implies that and, by (5), is a homomorphism from to for every . This proves (6).
By LemmaΒ B.2Β (2) we have that for every there is such that . Consequently,
and there is such that is -independent. Define
Then it is easy to see that is -independent for every and the proof of (A) is finished.
(B). Let . Inductively define an increasing sequence such that and . Put , define and such that for every .
We have that and, consequently, are homomorphisms from and , respecetively, to for every . Since we have
we conclude that is a homomorphism from to .
Let be the minimal such that for some, or equivalently any, . Let . Then there is unique such that . This is because and therefore because is increasing and . Then we have
and the latter set is -independent. This implies trivially that is -independent for every . Passing to a subsequence and setting then work as required. The proof is finished. β