If $X$ is a set, $E$ is an equivalence relation on $X$, and $n \in ω$, then define $$[X]^n_E = \{(x_0, ..., x_{n - 1}) \in {}^nX : (\forall i,j)(i \neq j \Rightarrow \neg(x_i \ E \ x_j))\}.$$
For $n \in ω$, a set $X$ has the $n$-Jónsson property if and only if for every function $f : [X]^n_= \rightarrow X$, there exists some $Y \subseteq X$ with $X$ and $Y$ in bijection so that $f[[Y]^n_=] \neq X$. A set $X$ has the Jónsson property if and only for every function $f : (\bigcup_{n \in ω}[X]^n_=) \rightarrow X$, there exists some $Y \subseteq X$ with $X$ and $Y$ in bijection so that $f[\bigcup_{n \in ω} [Y]^n_=] \neq X$.
Let $n \in ω$, $X$ be a Polish space, and $E$ be an equivalence relation on $X$. $E$ has the $n$-Mycielski property if and only if for all comeager $C \subseteq {}^nX$, there is some $\mathbf{Δ_1^1}$ $A \subseteq X$ so that $E \leq_{\mathbf{Δ_1^1}} E \upharpoonright A$ and $[A]^n_E \subseteq C$.
The following equivalence relations will be considered: $E_0$ is defined on ${}^\omega2$ by $x \ E_0 \ y$ if and only if $(\exists n)(\forall k > n)(x(k) = y(k))$. $E_1$ is defined on ${}^ω({}^\omega2)$ by $x \ E_1 \ y$ if and only if $(\exists n)(\forall k > n)(x(k) = y(k))$. $E_2$ is defined on ${}^\omega2$ by $x \ E_2 \ y$ if and only if $\sum\{\frac{1}{n + 1} : n \in x \ \triangle \ y\} < \infty$, where $\triangle$ denotes the symmetric difference. $E_3$ is defined on ${}^ω({}^\omega2)$ by $x \ E_3 \ y$ if and only if $(\forall n)(x(n) \ E_0 \ y(n))$.
Holshouser and Jackson have shown that $\mathbb{R}$ is Jónsson under $\mathsf{AD}$. It will be shown that $E_0$ does not have the $3$-Mycielski property and that $E_1$, $E_2$, and $E_3$ do not have the $2$-Mycielski property. Under $\mathsf{ZF + AD}$, ${}^ω2 / E_0$ does not have the $3$-Jónsson property.
We study the analytic digraphs of uncountable Borel chromatic number on Polish spaces, and compare them with the notion of injective Borel homomorphism. We provide some minimal digraphs incomparable with G 0. We also prove the existence of antichains of size continuum, and that there is no finite basis. 2010 Mathematics Subject Classification. 03E15, 54H05
We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $Σ^1_2$ chains in the assumption that $ω_1^{L[x]}<ω_1$ for all reals $x$.
We compute the model-theoretic Grothendieck ring, $K_0(\mathcal{Q})$, of a dense linear order (DLO) with or without end points, $\mathcal{Q}=(Q,<)$, as a structure of the signature $\{<\}$, and show that it is a quotient of the polynomial ring over $\mathbb{Z}$ generated by $\mathbb N_+\times(Q\sqcup\{-\infty\})$ by an ideal that encodes multiplicative relations of pairs of generators. As a corollary we obtain that a DLO satisfies the pigeon hole principle (PHP) for definable subsets and definable bijections between them--a property that is too strong for many structures.
We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we characterize the Borel graphs on standard Borel spaces of vertex-degree at most two with this property, and show that the analogous result for digraphs fails.
We characterize the completely determined Borel subsets of HYP as exactly the omega_1^{ck} subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel d-regular bipartite graph has a Borel perfect matching, among other examples. Therefore, the Borel Dual Ramsey Theorem and several theorems of descriptive combinatorics are not theories of hyperarithmetic analysis. In the case of the Borel Dual Ramsey Theorem, this answers a question of Astor, Dzhafarov, Montalban, Solomon & the third author.
We construct pairs of marked groups with isomorphic Cayley graphs but different Borel chromatic numbers for the free parts of their shift graphs. This answers a question of Kechris and Marks. We also show that these graphs have different Baire measurable and measure chromatic numbers, answering analogous versions of the question.
Every permutation invariant Borel subset of the space of countable structures is definable in $\La_{ω_1ω}$ by a theorem of Lopez-Escobar. We prove variants of this theorem relative to fixed relations and fixed non-permutation invariant quantifiers. Moreover we show that for every closed subgroup $G$ of the symmetric group $S_{\infty}$, there is a closed binary quantifier $Q$ such that the $G$-invariant subsets of the space of countable structures are exactly the $\La_{ω_1ω}(Q)$-definable sets.
The space of Lascar strong types, on some sort and relative to a given first order theory T, is in general not a compact Hausdorff space. This paper has at least three aims. First to show that spaces of Lascar strong types and other related spaces such as the Lascar group, have well-defined Borel cardinalities. The second is to compute the Borel cardinalities of the known examples as well as some new examples. The third is to explore notions of definable map, embedding and isomorphism between these and related quotient objects. The motivation for writing this paper is the recent discovery, via…
Let $X$ be a Polish space with Borel probability measure $μ,$ and let $G$ be a Borel graph on $X$ with no odd cycles and maximum degree $Δ(G).$ We show that the Baire measurable edge chromatic number of $G$ is at most $Δ(G)+1$, and if $G$ is $μ$-hyperfinite then the $μ$-measurable edge chromatic number obeys the same bound. More generally, we show that $G$ has Borel edge chromatic number at most $Δ(G)$ plus its asymptotic separation index.
Let $(X,τ)$ be a Polish space with Borel probability measure $μ,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of an amenable (resp., polynomial growth) group then we show the same result $μ$-a.e. (resp., everywhere). Our results generalize recent work of Timár, as well as of Conley, Gaboriau, Marks, and Tucker-Drob, who proved this in the probability measure preserving setting. We apply our theorem to find Borel orientations in even degree graphs and measurable and Baire mea…
We develop a flexible method for showing that Borel witnesses to some combinatorial property of $Δ^1_1$ objects yield $Δ^1_1$ witnesses. We use a modification the Gandy--Harrington forcing method of proving dichotomies, and we can recover the complexity consequences of many known dichotomies with short and simple proofs. Using our methods, we give a simplified proof that smooth $Δ^1_1$ equivalence relations are $Δ^1_1$-reducible to equality; we prove effective versions of the Lusin--Novikov and Feldman--Moore theorems; we prove new effectivization results related to dichotomy theorems due to H…
We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep connections to many other areas. After giving some background material, we present in careful detail some basic tools and results on the existence of Borel satisfying assignments: Borel versions of greedy algorithms and augmenting procedures, local rules, Borel transversals, etc. Also, we present the construction of Andrew Marks of acyclic Borel graphs for which …
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $Σ^1_2$ thin sets in the assumption that $ω_1^{L[x]}<ω_1$ for all reals $x$. We also prove that definable thin wellorderings admit partitions into definable chains in the Solovay model.
Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto λx)_{λ\in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in \mathbb{Z}, -m \leq k \leq m - 1 : [k,k+1] \cap E \neq \emptyset \} | < m^s $$ for sufficiently large $m \in \mathbb{N}$. Then there is an $n \in \mathbb{N}$ and a linear $T : \mathbb{R}^n \to \mathbb{R}$ such that $T(E^n)$ is dense. It follows that if $E$ is in addition nowhere dense then $(\mathbb{R},<,+,0,(x \mapsto λx)_{λ\in \mathbb{R}}, E)$ defines every bounded Borel su…
In this paper, we study definable variants of the notion of the distinguishing number of a graph in descriptive set theoretic setting. We introduce the notion of the Borel distinguishing number of a Borel graph and provide examples that separate distinguishing number and Borel distinguishing number at various levels. More specifically, we prove that there exist Borel graphs with countable distinguishing number but uncountable Borel distinguishing number and that, for every integer $n \geq 3$, there exists a Borel graph with distinguishing number $2$ whose Borel distinguishing number is finite …
In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some of the classes which were different for open covers are equal for Borel covers -- Section 1; 2. Some Borel classes coincide with classes that have been studied under a different guise by other authors -- Section 4.
We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge chromatic numbers of bounded degree acyclic hyperfinite Borel graphs and use this to answer a question of Kechris and Marks about the relationship between Borel chromatic number and measure chromatic number. We also show that for every $d > 1$ there is a $d$-regular acyclic hyperfinite Borel bipartite graph with no Borel perfect matching. These techniques also gi…
Assume $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $E$ be a $\mathbfΣ^1_1$ equivalence relation coded in $\mathrm{HOD}$. $E$ has an ordinal definable equivalence class without any ordinal definable elements if and only if $\mathrm{HOD} \models E$ is unpinned. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves $E$-class section uniformization when $E$ is a $\mathbfΣ^1_1$ equivalence relation on $\mathbb{R}$ which is pinned in every transitive model of $\mathsf{ZFC}$ containing the real which codes $E$: Suppose $R$ is a relation on $\mathbb{R}$ such that each section $R_…
We study strong types and Galois groups in model theory from a topological and descriptive-set-theoretical point of view, leaning heavily on topological dynamical tools. More precisely, we give an abstract (not model theoretic) treatment of problems related to cardinality and Borel cardinality of strong types, quotients of definable groups and related objecets, generalising (and often improving) essentially all hitherto known results in this area. In particular, we show that under reasonable assumptions, strong type spaces are "locally" quotients of compact Polish groups. It follows that they …
We are concerned with the problem of witnessing the Baire property of the Borel and the projective sets (assuming determinacy) through a sufficiently definable function in the codes. We prove that in the case of projective sets it is possible to satisfy this for almost all codes using a continuous function. We also show that it is impossible to improve this to all codes even if more complex functions in the codes are allowed. We also study the intermediate steps of the Borel hierarchy, and we give an estimation for the complexity of such functions in the codes, which verify the Baire property …
We continue to investigate various diagonalization properties for sequences of open covers of separable metrizable spaces introduced in Part I. These properties generalize classical ones of Rothberger, Menger, Hurewicz, and Gerlits-Nagy. In particular, we show that most of the properties introduced in Part I are indeed distinct. We characterize two of the new properties by showing that they are equivalent to saying all finite powers have one of the classical properties above (Hurewicz property in one case and in the Menger property in other). We consider for each property the smallest cardinal…
The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the Lovász Local Lemma (the LLL for short), which was introduced by Erdős and Lovász in the mid-1970s. Here we develop a version of the LLL that can be used to prove the existence of continuous colorings. We then give several applications in Borel and topological dynamics. * Seward and Tucker-Drob showed that every free Borel action $Γ\curvearrowright X$ of a coun…
Let $Γ$ and $Δ$ be sufficiently distinct countable groups. We show that there is an orbit equivalence relation $E$, induced by an action of the Polish wreath product group $Γ\wrΓ$, so that $E$ is generically $F$-ergodic for any orbit equivalence relation $F$ induced by an action of $Δ\wrΔ$. More generally, we establish generic ergodicity between $Γ$-jumps and the iterated $Δ$-jumps, answering a question of Clemens and Coskey. The proofs follow a translation between Borel homomorphisms and definable pins.
In this paper we study the combinatorics of free Borel actions of the group $\mathbb Z^d$ on Polish spaces. Building upon recent work by Chandgotia and Meyerovitch, we introduce property $F$ on $\mathbb Z^d$-shift spaces $X$ under which there is an equivariant map from any free Borel action to the free part of $X$. Under further entropic assumptions, we prove that any subshift $Y$ (modulo the periodic points) can be Borel embedded into $X$. Several examples satisfy property $F$ including, but not limited to, the space of proper $3$-colourings, tilings by rectangles (under a natural arithmetic …
We generalise the main theorems from the paper "The Borel cardinality of Lascar strong types" by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between fundamental properties of bounded invariant equivalence relations (such as smoothness or type-definability) which also requires finding a series of counterexamples. Finally, we apply the generalisation mentioned above to prove a conjecture from a paper by the first author and J. Gismatullin, showing that the key technical assumption of the main theorem (conc…
We investigate bounds in Ramsey's theorem for relations definable in NIP structures. Applying model-theoretic methods to finitary combinatorics, we generalize a theorem of Bukh and Matousek [B. Bukh, J. Matoušek. "Erdős-Szekeres-type statements: Ramsey function and decidability in dimension $1$", Duke Mathematical Journal 163.12 (2014): 2243-2270] from the semialgebraic case to arbitrary polynomially bounded $o$-minimal expansions of $\mathbb{R}$, and show that it doesn't hold in $\mathbb{R}_{\exp}$. This provides a new combinatorial characterization of polynomial boundedness for $o$-minimal s…
We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation induced by the natural action of $\mathrm{GL}_2(\mathbb{Q})$ on $\mathrm{Ar}(\mathbb{Q}^2)$ is not concretely classifiable. Then we analyze the isomorphism relation for countable ordered Archimedean groups, and pin its complexity in terms of the hierarchy of Hjorth, Kechris and Louveau. In particular, we show that its potential class is not $\boldsymbolΠ^0_…