COUNTABLE BOREL EQUIVALENCE RELATIONS

2002 ◽  
Vol 02 (01) ◽  
pp. 1-80 ◽  
Author(s):  
S. JACKSON ◽  
A. S. KECHRIS ◽  
A. LOUVEAU

This paper develops the foundations of the descriptive set theory of countable Borel equivalence relations on Polish spaces with particular emphasis on the study of hyperfinite, amenable, treeable and universal equivalence relations.

2013 ◽  
Vol 78 (2) ◽  
pp. 439-458 ◽  
Author(s):  
Vadim Kulikov

AbstractIt is shown that the power set of κ ordered by the subset relation modulo various versions of the non-stationary ideal can be embedded into the partial order of Borel equivalence relations on 2κ under Borel reducibility. Here κ is an uncountable regular cardinal with κ<κ = κ.


2018 ◽  
Vol 83 (1) ◽  
pp. 13-28
Author(s):  
ADAM R. DAY ◽  
ANDREW S. MARKS

AbstractWe investigate the class of bipartite Borel graphs organized by the order of Borel homomorphism. We show that this class is unbounded by finding a jump operator for Borel graphs analogous to a jump operator of Louveau for Borel equivalence relations. The proof relies on a nonseparation result for iterated Fréchet ideals and filters due to Debs and Saint Raymond. We give a new proof of this fact using effective descriptive set theory. We also investigate an analogue of the Friedman-Stanley jump for Borel graphs. This analogue does not yield a jump operator for bipartite Borel graphs. However, we use it to answer a question of Kechris and Marks by showing that there is a Borel graph with no Borel homomorphism to a locally countable Borel graph, but each of whose connected components has a countable Borel coloring.


2007 ◽  
Vol 13 (4) ◽  
pp. 482-537 ◽  
Author(s):  
Étienne Matheron ◽  
Miroslav Zelený

AbstractThis is a survey paper on the descriptive set theory of hereditary families of closed sets in Polish spaces. Most of the paper is devoted to ideals and σ-ideals of closed or compact sets.


2016 ◽  
Vol 27 (8) ◽  
pp. 1414-1436 ◽  
Author(s):  
VASSILIOS GREGORIADES ◽  
TAMÁS KISPÉTER ◽  
ARNO PAULY

Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy.As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.


2020 ◽  
Vol 21 (01) ◽  
pp. 2050021
Author(s):  
Vassilios Gregoriades ◽  
Takayuki Kihara ◽  
Keng Meng Ng

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore–Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture.


2015 ◽  
Vol 80 (4) ◽  
pp. 1379-1397 ◽  
Author(s):  
ITAÏ BEN YAACOV ◽  
JULIEN MELLERAY

AbstractWe develop the basics of an analogue of descriptive set theory for functions on a Polish space X. We use this to define a version of the small index property in the context of Polish topometric groups, and show that Polish topometric groups with ample generics have this property. We also extend classical theorems of Effros and Hausdorff to the topometric context.


2021 ◽  
Author(s):  
Yu-Lin Chou

We give,as a preliminary result, some topological characterizations of locally compact second-countable Hausdorff spaces. Then we show that a topological manifold, with boundary or not,is precisely a Polish space with a coordinate open cover; this connects geometry with descriptive set theory.


1999 ◽  
Vol 5 (2) ◽  
pp. 161-174 ◽  
Author(s):  
Alexander S. Kechris

§1. I will start with a quick definition of descriptive set theory: It is the study of the structure of definable sets and functions in separable completely metrizable spaces. Such spaces are usually called Polish spaces. Typical examples are ℝn, ℂn, (separable) Hilbert space and more generally all separable Banach spaces, the Cantor space 2ℕ, the Baire space ℕℕ, the infinite symmetric group S∞, the unitary group (of the Hilbert space), the group of measure preserving transformations of the unit interval, etc.In this theory sets are classified in hierarchies according to the complexity of their definitions and the structure of sets in each level of these hierarchies is systematically analyzed. In the beginning we have the Borel sets in Polish spaces, obtained by starting with the open sets and closing under the operations of complementation and countable unions, and the corresponding Borel hierarchy ( sets). After this come the projective sets, obtained by starting with the Borel sets and closing under the operations of complementation and projection, and the corresponding projective hierarchy ( sets).There are also transfinite extensions of the projective hierarchy and even much more complex definable sets studied in descriptive set theory, but I will restrict myself here to Borel and projective sets, in fact just those at the first level of the projective hierarchy, i.e., the Borel (), analytic () and coanalytic () sets.


2014 ◽  
Vol 20 (1) ◽  
pp. 94-97
Author(s):  
Natasha Dobrinen

1996 ◽  
Vol 2 (1) ◽  
pp. 94-107 ◽  
Author(s):  
Greg Hjorth

§0. Preface. There has been an expectation that the endgame of the more tenacious problems raised by the Los Angeles ‘cabal’ school of descriptive set theory in the 1970's should ultimately be played out with the use of inner model theory. Questions phrased in the language of descriptive set theory, where both the conclusions and the assumptions are couched in terms that only mention simply definable sets of reals, and which have proved resistant to purely descriptive set theoretic arguments, may at last find their solution through the connection between determinacy and large cardinals.Perhaps the most striking example was given by [24], where the core model theory was used to analyze the structure of HOD and then show that all regular cardinals below ΘL(ℝ) are measurable. John Steel's analysis also settled a number of structural questions regarding HODL(ℝ), such as GCH.Another illustration is provided by [21]. There an application of large cardinals and inner model theory is used to generalize the Harrington-Martin theorem that determinacy implies )determinacy.However, it is harder to find examples of theorems regarding the structure of the projective sets whose only known proof from determinacy assumptions uses the link between determinacy and large cardinals. We may equivalently ask whether there are second order statements of number theory that cannot be proved under PD–the axiom of projective determinacy–without appealing to the large cardinal consequences of the PD, such as the existence of certain kinds of inner models that contain given types of large cardinals.


Sign in / Sign up

Export Citation Format

Share Document