Generalized descriptive set theory at uncountable cardinals & actions of monoids in combinatorics

  • Abstract
  • Literature Map
  • Similar Papers
Abstract
Translate article icon Translate Article Star icon
Take notes icon Take Notes

Abstract The thesis is divided into two parts. The first one focuses on generalized descriptive set theory, and the second one on combinatorics, model theory, and Ramsey theory. Generalized descriptive set theory (GDST) is a natural extension of (classical) descriptive set theory (DST) where countable is replaced by uncountable. But the framework of GDST is narrow if compared to that of DST, as so far GDST has mostly concentrated on the study of the generalized Baire space , rather than considering arbitrary “Polish-like” spaces or standard $\kappa $ -Borel spaces. Also, GDST is usually developed for cardinals satisfying $\kappa ^{<\kappa }=\kappa $ , which implies that $\kappa $ must be regular. The goal of the first part of the thesis is to fill these gaps, studying classes of spaces that could take the role of Polish spaces in the generalized context under the weak assumption $2^{<\kappa }=\kappa $ , which allows one to include singular cardinals and can consistently hold at every cardinal (e.g., in models of $ \mathsf {ZFC+GCH} $ ). In Chapter 1, we begin by considering the case when $\kappa $ is regular. We consider several candidates for “Polish-like” spaces that have been proposed in the literature (e.g., $\mathbb {G}$ -Polish spaces and $\mathrm {SC}_\kappa $ -spaces), and introduce a new one ( $f\mathrm {SC}_\kappa $ -spaces). We show that all these classes are nicely organized in four groups, with two clear dividing lines between them: $ \kappa $ -additivity, which can be interpreted as a strong analog of zero-dimensionality, and the degree of completeness (Figure 1). Figure 1 Relationships among Polish-like classes of regular Hausdorff spaces of weight $\leq \kappa $ , for a totally ordered Abelian group $\mathbb {G}$ of degree $\deg (\mathbb {G})=\kappa>\omega $ . All the proposed classes give rise to the same class of spaces up to $ \kappa $ -Borel isomorphism, providing a natural setup to work with. Then, various results from classical DST about Polish, Borel, and standard Borel spaces are extended to this context. Chapter 2 extends the previous analysis to embrace singular cardinals too. In particular, it contains an in-depth study of the generalizations and characterizations of metrizability necessary in the singular case. The main result on this topic is a new metrization theorem in terms of topological games that holds for both classical metrizability and $\mathbb {G}$ -metrizability. Chapter 3 features various examples of spaces in the classes considered above, and a study of linearly ordered topological spaces (LOTS) and generalized ordered spaces (GO-spaces) in the context of GDST. The second part of the thesis deals with a recently discovered notion in combinatorics. In 2019, Solecki introduced the classes of Ramsey monoids and $\mathbb {Y}$ -controllable monoids to collect and extend different theorems in combinatorics, like Hindman’s Finite Sum Theorem, Carlson’s Theorem, Gowers’ FIN $_\kappa $ Theorem, and Furstenberg–Katznelson’s Ramsey Theorem. Then, he provided a necessary condition and some sufficient conditions for a finite monoid to be Ramsey or $\mathbb {Y}$ -controllable. Chapters 4 and 5 aim to continue the work started by Solecki on these and other related classes of monoids. We improve the necessary conditions and the sufficient conditions provided by Solecki, reaching in particular a full characterization of Ramsey monoids. This further extends results like Carlson’s Theorem and Gowers’ FIN $_\kappa $ Theorem, but it also sets a precise limit on when it is possible to obtain similar statements. We also give examples of classes of $\mathbb {Y}$ -controllable monoids that do not satisfy some of the sufficient conditions, suggesting possible strategies to improve the results we provided. Then, we show that in certain particular classes of $\mathbb {Y}$ -controllable monoids with stronger properties, the remaining sufficient conditions become necessary as well. In Chapter 5, we also study local versions of the classes of Ramsey and $\mathbb {Y}$ -controllable monoids that are better suited for infinite monoids. The thesis contains material from joint works with Luca Motto Ros, Philipp Schlicht, and Eugenio Colla. Abstract prepared by Claudio Agostini E-mail: agostini.claudio@renyi.hu Current affiliation: HUN-REN ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS REÁLTANODA UTCA 13-15 H-1053, BUDAPEST

Similar Papers
  • Book Chapter
  • 10.1007/978-3-662-08998-9_10
“Hyperfinite” descriptive set theory
  • Jan 1, 2004
  • Vladimir Kanovei + 1 more

Descriptive set theory studies those subsets of topological spaces (called pointsets) which can be defined, by means of a list of specified operations including, e.g., complement, countable union and intersection, projection, beginning with open sets of the space. Classical descriptive set theory (DST) considers mainly sets in Polish (that is, separable metric) spaces, this is why we shall identify it here as Polish descriptive set theory.

  • Research Article
  • Cite Count Icon 1
  • 10.1016/j.jmateco.2016.04.005
A space of lexicographic preferences
  • May 11, 2016
  • Journal of Mathematical Economics
  • Byung Soo Lee

A space of lexicographic preferences

  • Research Article
  • 10.1017/bsl.2024.10
From real-life to very strong axioms. Classification problems in Descriptive Set Theory and regularity properties in Generalized Descriptive Set Theory
  • Jun 1, 2024
  • The Bulletin of Symbolic Logic
  • Martina Iannella

This thesis is divided into three parts, the first and second ones focused on combinatorics and classification problems on discrete and geometrical objects in the context of descriptive set theory, and the third one on generalized descriptive set theory at singular cardinals of countable cofinality.Descriptive Set Theory (briefly: DST) is the study of definable subsets of Polish spaces, i.e., separable completely metrizable spaces. One of the major branches of DST is Borel reducibility, successfully used in the last 30 years to solve and compare many classification problems. One of our goals is the classification of knots, very familiar and tangible objects in everyday life, which also play an important role in modern mathematics. The study of knots and their properties is known as knot theory. Our plan is to gain insight into knots using discrete objects, such as linear and circular orders. This approach was already exploited in [6]. The first part of this work is therefore devoted to countable linear orders and the study of the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results. We also expand our research to the case of circular orders.Another objective of this first part is to extend the notion of convex embeddability on countable linear orders. We provide a family of quasi-orders of which embeddability is a particular case as well. We study these quasi-orders from a combinatorial point of view and analyse their complexity with respect to Borel reducibility. Furthermore, we extend the analysis of these quasi-orders to the set of uncountable linear orders.The second part of the project deals with classification problems on knots and $3$ -manifolds. The goal here is to apply the results obtained in the first part to the study of proper arcs and knots, establishing lower bounds for the complexity of some natural relations between these geometrical objects. We also obtain some combinatorial results which are particularly interesting when we restrict to the set of wild proper arcs and wild knots, classes which haven’t received much attention so far. These parts are included in the two preprints [4, 5] in collaboration with my supervisor Alberto Marcone, Luca Motto Ros (University of Torino), and Vadim Weinstein (University of Oulu).The second part of this work also includes the classification of non-compact $3$ -manifolds up to homeomorphism (the case of compact $3$ -manifolds has already been solved: indeed, there are only countably many $3$ -manifolds up to homeomorphism; see [7]), and that of Cantor sets of $\mathbb {R}^3$ up to conjugation (answering to Question 5.5 of [3]). Here we resort to algebraic tools. Stone duality gives a neat way to go back-and-forth between totally disconnected Polish spaces and countable Boolean algebras (see [1]). The main ingredient is the Stone space of all ultrafilters on a Boolean algebra. In this work we introduce a weaker concept which we call “blurry filter”. Using blurry filters instead of ultrafilters enables one to extend the class of spaces under consideration beyond totally disconnected. As an application of this method, we show that both homeomorphism on non-compact $3$ -manifolds and conjugation of Cantor sets in $\mathbb {R}^3$ are completely classifiable by countable structures. These results are part of an upcoming paper in collaboration with Vadim Weinstein.The last part of this thesis concerns the natural generalization of descriptive set theory that occurs when countable is replaced by uncountable, called Generalized Descriptive Set Theory (briefly: GDST). In particular, we focus on the case of GDST for a singular cardinal $\kappa $ of countable cofinality. The goal here is to study the generalizations of the Perfect Set Property and the Baire Property to subsets of spaces of higher cardinalities, like the power set $\mathcal {P}(\kappa )$ . We consider the question under which large cardinal hypotheses classes of definable subsets of these spaces possess such regularity properties, focusing on rank-into-rank axioms, like I2, and classes of sets definable by $\Sigma _1$ -formulas with parameters from various collections of sets. The obtained results are included in [2], a joint work with my co-supervisor Vincenzo Dimonte and Philipp Lücke (University of Hamburg).Abstract prepared by Martina IannellaE-mail: martina.iannella@tuwien.ac.at.URL: https://air.uniud.it/handle/11390/1262824.

  • Single Book
  • Cite Count Icon 2310
  • 10.1007/978-1-4612-4190-4
Classical Descriptive Set Theory
  • Jan 1, 1995
  • Alexander S Kechris

Descriptive set theory has been one of the main areas of research in set theory for almost a century. This text attempts to present a largely balanced approach, which combines many elements of the different traditions of the subject. It includes a wide variety of examples, exercises (over 400), and applications, in order to illustrate the general concepts and results of the theory. This text provides a first basic course in classical descriptive set theory and covers material with which mathematicians interested in the subject for its own sake or those that wish to use it in their field should be familiar. Over the years, researchers in diverse areas of mathematics, such as logic and set theory, analysis, topology, probability theory, etc., have brought to the subject of descriptive set theory their own intuitions, concepts, terminology and notation.

  • Research Article
  • Cite Count Icon 5
  • 10.2178/jsl/1203350774
Classifying Borel automorphisms
  • Dec 1, 2007
  • Journal of Symbolic Logic
  • John D Clemens

§1. Introduction. This paper considers several complexity questions regarding Borel automorphisms of a Polish space. Recall that a Borel automorphism is a bijection of the space with itself whose graph is a Borel set (equivalently, the inverse image of any Borel set is Borel). Since the inverse of a Borel automorphism is another Borel automorphism, as is the composition of two Borel automorphisms, the set of Borel automorphisms of a given Polish space forms a group under the operation of composition. We can also consider the class of automorphisms of all Polish spaces. We will be primarily concerned here with the following notion of equivalence:Definition 1.1. Two Borel automorphisms f and g of the Polish spaces X and Y are said to be Borel isomorphic, f ≅ g, if they are conjugate, i.e. there is a Borel bijection φ: X → Y such that φ ∘ f = g ∘ φ.We restrict ourselves to automorphisms of uncountable Polish spaces, as the Borel automorphisms of a countable space are simply the permutations of the space. Since any two uncountable Polish spaces are Borel isomorphic, any Borel automorphism is Borel isomorphic to some automorphism of a fixed space. Hence, up to Borel isomorphism we can fix a Polish space and represent any Borel automorphism as an automorphism of this space. We will use the Cantor space 2ω (with the product topology) as our representative space.

  • Book Chapter
  • Cite Count Icon 36
  • 10.1016/s0049-237x(08)71103-0
Admissible Sets and Infinitary Logic
  • Jan 1, 1977
  • Studies in Logic and the Foundations of Mathematics
  • Michael Makkai

Admissible Sets and Infinitary Logic

  • Research Article
  • Cite Count Icon 6
  • 10.2307/2274650
Some results about Borel sets in descriptive set theory of hyperfinite sets
  • Jun 1, 1990
  • Journal of Symbolic Logic
  • Boško Živaljević

A remarkable result of Henson and Ross [HR] states that if a function whose graph is Souslin in the product of two hyperfinite sets in an ℵ1 saturated nonstandard universe possesses a certain nice property (capacity) then there exists an internal subfunction of the given one possessing the same property. In particular, they prove that every 1-1 Souslin function preserves any internal counting measure, and show that every two internal sets A and B with ∣A∣/∣B∣ ≈ 1 are Borel bijective. As a supplement to the last-mentioned result of Henson and Ross, Keisler, Kunen, Miller and Leth showed [KKML] that two internal sets A and B are bijective by a countably determined bijection if and only if ∣A∣/∣B∣ is finite and not infinitesimal.In this paper we first show that injective Borel functions map Borel sets into Borel sets, a fact well known in classical descriptive set theory. Then, we extend the result of Henson and Ross concerning the Borel bijectivity of internal sets whose quotient of cardinalities is infinitely closed to 1. We prove that two Borel sets, to which we may assign a counting measure not equal to 0 or ∞, are Borel bijective if and only if they have the same counting measure ≠0, ∞. This, together with the similar characterization for Souslin and measurable countably determined sets, extends the above-mentioned results from [HR] and [KKML].

  • Research Article
  • Cite Count Icon 13
  • 10.2307/2274812
Descriptive set theory over hyperfinite sets
  • Dec 1, 1989
  • The Journal of Symbolic Logic
  • H Jerome Keisler + 3 more

The separation, uniformization, and other properties of the Borel and projective hierarchies over hyperfinite sets are investigated and compared to the corresponding properties in classical descriptive set theory. The techniques used in this investigation also provide some results about countably determined sets and functions, as well as an improvement of an earlier theorem of Kunen and Miller.

  • Research Article
  • Cite Count Icon 25
  • 10.1017/s0022481200041062
Descriptive set theory over hyperfinite sets
  • Dec 1, 1989
  • Journal of Symbolic Logic
  • H Jerome Keisler + 3 more

The separation, uniformization, and other properties of the Borel and projective hierarchies over hyperfinite sets are investigated and compared to the corresponding properties in classical descriptive set theory. The techniques used in this investigation also provide some results about countably determined sets and functions, as well as an improvement of an earlier theorem of Kunen and Miller.

  • Research Article
  • Cite Count Icon 6
  • 10.1016/j.apal.2010.09.010
Classical descriptive set theory as a refinement of effective descriptive set theory
  • Oct 27, 2010
  • Annals of Pure and Applied Logic
  • Yiannis N Moschovakis

Classical descriptive set theory as a refinement of effective descriptive set theory

  • Single Book
  • Cite Count Icon 14
  • 10.23943/princeton/9780691153551.001.0001
Fréchet Differentiability of Lipschitz Functions and Porous Sets in Banach Spaces (AM-179)
  • Feb 26, 2012
  • Joram Lindenstrauss + 2 more

This book makes a significant inroad into the unexpectedly difficult question of existence of Fréchet derivatives of Lipschitz maps of Banach spaces into higher dimensional spaces. Because the question turns out to be closely related to porous sets in Banach spaces, it provides a bridge between descriptive set theory and the classical topic of existence of derivatives of vector-valued Lipschitz functions. The topic is relevant to classical analysis and descriptive set theory on Banach spaces. The book opens several new research directions in this area of geometric nonlinear functional analysis. The new methods developed here include a game approach to perturbational variational principles that is of independent interest. Detailed explanation of the underlying ideas and motivation behind the proofs of the new results on Fréchet differentiability of vector-valued functions should make these arguments accessible to a wider audience. The most important special case of the differentiability results, that Lipschitz mappings from a Hilbert space into the plane have points of Fréchet differentiability, is given its own chapter with a proof that is independent of much of the work done to prove more general results. The book raises several open questions concerning its two main topics.

  • Book Chapter
  • Cite Count Icon 22
  • 10.1016/s0049-237x(08)71121-2
Descriptive Set Theory: Projective Sets
  • Jan 1, 1977
  • Studies in Logic and the Foundations of Mathematics
  • Donald A Martin

Descriptive Set Theory: Projective Sets

  • Research Article
  • Cite Count Icon 16
  • 10.1112/s0025579300009712
Borel isomorphisms at the first level—I
  • Jun 1, 1979
  • Mathematika
  • J E Jayne + 1 more

A Borel isomorphism that, together with its inverse, maps ℱσ-sets to ℱσ-sets will be said to be a Borel isomorphism at the first level. Such a Borel isomorphism will be called a first level isomorphism, for short. We study such first level isomorphisms between Polish spaces and between their Borel and analytic subsets.

  • Research Article
  • 10.7282/t37m0834
Borel superrigidity for actions of low rank lattices
  • Jan 1, 2009
  • Scott Schneider

A major recent theme in Descriptive Set Theory has been the study of countable Borel equivalence relations on standard Borel spaces, including their structure under the partial ordering of Borel reducibility. We shall contribute to this study by proving Borel incomparability results for the orbit equivalence relations arising from Bernoulli, profinite, and linear actions of certain subgroups of $PSL_2(mathbb R)$. We employ the techniques and general strategy pioneered by Adams and Kechris in cite{AK}, and develop purely Borel versions of cocycle superrigidity results arising in the dynamical theory of semisimple groups. Specifically, using Zimmer's cocycle superrigidity theorems cite{zim}, we will prove Borel superrigidity results for suitably chosen actions of groups of the form $PSL_2(mathcal{O})$, where $mathcal{O}$ is the ring of integers inside a multi-quadratic number field. In particular, for suitable primes $pne q$, we prove that the orbit equivalence relations arising from the natural actions of $PSL_2(mathbb Z[sqrt{q}])$ on the $p$-adic projective lines are incomparable with respect to Borel reducibility as $p$, $q$ vary. Furthermore, we also obtain Borel non-reducibility results for orbit equivalence relations arising from Bernoulli actions of the groups $PSL_2(mathcal{O})$. In particular, we show that if $E_p$ denotes the orbit equivalence relation arising from a nontrivial Bernoulli action of $PSL_2(mathbb Z[sqrt{p},])$, then $E_p$ and $E_q$ are incomparable with respect to Borel reducibility whenever $pne q$.%%%%

  • Research Article
  • 10.1006/aima.1996.0078
Isomorphisms for Convergence Structures: II. Borel Spaces and Infinite Measures
  • Dec 1, 1996
  • Advances in Mathematics
  • Yeneng Sun

Isomorphisms for Convergence Structures: II. Borel Spaces and Infinite Measures

Save Icon
Up Arrow
Open/Close
  • Ask R Discovery Star icon
  • Chat PDF Star icon

AI summaries and top papers from 250M+ research sources.