In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we prove that if the real line is the countable union of countable sets, then there exists an F-sigma-delta set which is uncountable but contains no perfect subset. Finally, we construct a model of ZF in which we have an infinite Dedekind finite set of reals which is F-sigma-delta.
Asaf Karagila pointed out that Remark 3.4 [1], directly contradicts Theorem 3.3 (c) [2] which was incorrectly stated. This note contains a proof of this remark. [1] Miller, Arnold W.; A Dedekind Finite Borel Set, Arch. Math. Logic 50 (2011), no. 1-2, 1--17. [2] Kanamori, A.; Pincus, D.; Does GCH imply AC locally?, Paul Erdos and his mathematics, II (Budapest, 1999), 413-426, Bolyai Soc. Math. Stud., 11, Janos Bolyai Math. Soc., Budapest, 2002.
It is consistent with ZF set theory that the Euclidean topology on the real line is not sequential, yet every infinite set of reals contains a countably infinite subset. This answers a question of Gutierres.
Cohen's first model is a model of Zermelo--Fraenkel set theory in which there is a Dedekind-finite set of real numbers, and it is perhaps the most famous model where the Axiom of Choice fails. We force over this model to add a function from this Dedekind-finite set to some infinite ordinal $κ$. In the case that we force the function to be injective, it turns out that the resulting model is the same as adding $κ$ Cohen reals to the ground model, and that we have just added an enumeration of the canonical Dedekind-finite set. In the case where the function is merely surjective it turns out that …
We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is superamorphous if all finitary relations on it are definable in the language of equality.) We also show that the property of "inexhaustibility" is not closed under supersets unless the full axiom of choice holds.
We prove that the category of Dedekind $σ$-complete Riesz spaces is an infinitary variety, and we provide an explicit equational axiomatization. In fact, we show that finitely many axioms suffice over the usual equational axiomatization of Riesz spaces. Our main result is that $\mathbb{R}$, regarded as a Dedekind $σ$-complete Riesz space, generates this category as a quasi-variety, and therefore as a variety. Analogous results are established for the categories of (i) Dedekind $σ$-complete Riesz spaces with a weak order unit, (ii) Dedekind $σ$-complete lattice-ordered groups, and (iii) Dedekin…
Let n be finite >2. We show that any class between S\Nr_n\CA_{n+3} and RCA_n is not atom canonical, and any class containing the class of completely representable algebras and contained in S_c\Nr_n\CA_{n+3} is not elementary. We show that there is no finite variable universal axiomatization of many diagonal free reducts of representable cylindric algebras of dimension n, like the varieties of representable diagonal-free cylindric algebras and Halmos' polyadic algebras (without equality). We apply our hitherto obtained algebraic results to show that the omitting types theorem fails for finite v…
We show that a locally finite Borel graph is nonsmooth if and only if it admits marker sequences which are "far" from every point. Our proof uses the Galvin-Prikry theorem and the Glimm-Effros dichotomy.
We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or, equivalently, $\leq 3$) Borel chromatic number form a $\mathbfΣ^1_2$-complete set. This answers a question of Kechris and Marks and strengthens several earlier results.
We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and "Can marked groups with isomorphic Cayley graphs have Borel chromatic numbers for their shift graphs which differ by more than one?" We also provide a new bound for Borel chromatic numbers of graphs whose connected components all have two ends.
We consider reducibility of equivalence relations (ERs, for brevity), in a nonstandard domain, in terms of the Borel reducibility and the countably determined (CD, for brevity) reducibility. This reveals phenomena partially analogous to those discovered in descriptive set theory. The Borel reducibility structure of Borel sets and (partially) CD reducibility structure of CD sets in *N is described. We prove that all CD ERs with countable equivalence classes are CD-smooth, but not all are B-smooth, for instance, the ER of having finite difference on *N. Similarly to the Silver dichotomy theorem …
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 give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of Σ^0_α-measurable functions (for every fixed 1 \leq α< ω_1). Moreover, we present some results concerning those Borel functions which are ω-decomposable into continuous functions (also called countably continuous functions in the literature): such results should be viewed as a contribution towards the goal of generalizing a remarkable theorem of Jayne and Rogers to a…
We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most $M_n := 2^{n-1}(n^2+3n+2)-2$ edges; this generalizes a result of Jackson-Kechris-Louveau in the case $n = 1$. The proof is based on that of a classical result of Whitehead on countable CW-complexes.
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of Borel reducibility. Following the approach of Louveau and Rosendal for the study of analytic equivalence relations, we study countable Borel quasi-orders. In this paper we are concerned with universal countable Borel quasi-orders, i.e. countable Borel quasi-orders above all other countable Borel quasi-orders with regard to Borel reducibility. We…
Let $μ$ be a Borel measure on a compactum $X$. The main objects in this paper are $σ$-ideals $I(dim)$, $J_0(μ)$, $J_f(μ)$ of Borel sets in $X$ that can be covered by countably many compacta which are finite-dimensional, or of $μ$-measure null, or of finite $μ$-measure, respectively. Answering a question of J. Zapletal, we shall show that for the Hilbert cube, the $σ$-ideal $I(dim)$ is not homogeneous in a strong way. We shall also show that in some natural instances of measures $μ$ with non-homogeneous $σ$-ideals $J_0(μ)$ or $J_f(μ)$, the completions of the quotient Boolean algebras $Borel(X)/…
Jaligot's Lemma states that the Fitting subgroups of distinct Borel subgroups do not intersect in a tame minimal simple groups of finite Morley. Such a strong result appears hopeless without tameness. Here we use the 0-unipotence theory to build a toolkit for the analysis of nonabelian intersections of Borel subgroups. As a demonstration, we show that any connected nilpotent subgroup of an intersection of Borel subgroups, in a nontame minimal simple group, must actually be abelian.
A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we prove that this question always has a positive answer when the acting group is polycyclic, and we obtain a positive answer for all free actions of a large class of groups including the lamplighter group and all virtually solvable groups having finite Prüfer rank. This marks the first time that a group of exponential volume-growth has been verified to have this property. In obtaining this…
We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields the existence of Borel matchings for such graphs of degree at least three. As a corollary, it follows that acyclic locally countable Borel graphs of degree at least three generating $μ$-hyperfinite equivalence relations admit $μ$-measurable matchings. We establish the analogous result for Baire measurable matchings in the locally finite case, and provide a c…
For a continuous action of a countable discrete group $G$ on a Polish space $X$, a countable Borel partition $P$ of $X$ is called a generator if $G \cdot P := \{ gC : g \in G, C \in P \}$ generates the Borel $σ$-algebra of $X$. For $G = Z$, the Kolmogorov--Sinai theorem gives a measure-theoretic obstruction to the existence of finite generators: they do not exist in the presence of an invariant probability measure with infinite entropy. It was asked by Benjamin Weiss in the late 80s whether the nonexistence of any invariant probability measure guarantees the existence of a finite generator. We…
We prove that, for any natural number n $\ge$ 1, we can find a finite alphabet $Σ$ and a finitary language L over $Σ$ accepted by a one-counter automaton, such that the $ω$-power L $\infty$ := {w 0 w 1. .. $\in$ $Σ$ $ω$ | $\forall$i $\in$ $ω$ w i $\in$ L} is $Π$ 0 n-complete. We prove a similar result for the class $Σ$ 0 n .
This paper is a continuation of the study of topological properties of omega context free languages (omega-CFL). We proved before that the class of omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there exist some omega-CFL which are analytic but non Borel sets. We prove here that there exist some omega context free languages which are Borel sets of infinite (but not finite) rank, giving additional answer to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621].
Let $Γ$ be a countable group and let $G$ be the Schreier graph of the free part of the Bernoulli shift of $Γ$ (with respect to some finite subset $F \subseteq Γ$). We show that the Borel fractional chromatic number of $G$ is equal to $1$ over the measurable independence number of $G$. As a consequence, we asymptotically determine the Borel fractional chromatic number of $G$ when $Γ$ is the free group, answering a question of Meehan.
We study groups which satisfy Gardner's equidecomposition conjecture for uniformly distributed sets. We prove that an amenable group has this property if and only if it does not admit $(\mathbb{Z}/2\mathbb{Z}) *(\mathbb{Z}/2\mathbb{Z})$ as a quotient by a finite subgroup. Our technical contribution is an algorithm for rounding Borel flows for actions of amenable groups.
