We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The consistency of the theory $\mathsf {ZF} + \mathsf {AD}_{\mathbb {R}} + {}$‘every set of reals is universally Baire’ is proved relative to $\mathsf {ZFC} + {}$‘there is a cardinal that is a limit of Woodin cardinals and of strong cardinals’. The proof is based on the derived model construction, which was used by Woodin to show that the theory $\mathsf {ZF} + \mathsf {AD}_{\mathbb {R}} + {}$‘every set of reals is Suslin’ is consistent relative to $\mathsf {ZFC} + {}$‘there is a cardinal $\lambda $ that is a limit of Woodin cardinals and of $\mathord {<}\lambda $-strong cardinals’. The $\Sigma ^2_1$ reflection property of our model is proved using genericity iterations as in Neeman [18] and Steel [22].
In 1967, Gerencsér and Gyárfás [16] proved a result which is considered the starting point of graph-Ramsey theory: In every 2-coloring of $K_n$, there is a monochromatic path on $\lceil (2n+1)/3\rceil $ vertices, and this is best possible. There have since been hundreds of papers on graph-Ramsey theory with some of the most important results being motivated by a series of conjectures of Burr and Erdős [2, 3] regarding the Ramsey numbers of trees (settled in [31]), graphs with bounded maximum degree (settled in [5]), and graphs with bounded degeneracy (settled in [23]).
In 1993, Erdős and Galvin [13] began the investigation of a countably infinite analogue of the Gerencsér and Gyárfás result: What is the largest d such that in every $2$-coloring of $K_{\mathbb {N}}$ there is a monochromatic infinite path with upper density at least d? Erdős and Galvin showed that $2/3\leq d\leq 8/9$, and after a series of recent improvements, this problem was finally solved in [7] where it was shown that $d={(12+\sqrt {8})}/{17}$.
This paper begins a systematic study of quantitative countably infinite graph-Ramsey theory, focusing on infinite analogues of the Burr-Erdős conjectures. We obtain some results which are analogous to what is known in finite case, and other (unexpected) results which have no analogue in the finite case.
It is shown that if $\{H_n\}_{n \in \omega}$ is a sequence of groups without involutions, with $1 \lt |H_n| \leq 2^{\aleph_0}$, then the topologist’s product modulo the finite words is (up to isomorphism) independent of the choice of sequence. This contrasts with the abelian setting: if $\{A_n\}_{n \in \omega}$ is a sequence of countably infinite torsion-free abelian groups, then the isomorphism class of the product modulo sum $\prod_{n \in \omega} A_n/\bigoplus_{n \in \omega} A_n$ is dependent on the sequence.
It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles on $\mathbb {R}^2$ does not.
We study the descriptive complexity of sets of points defined by restricting the statistical behaviour of their orbits in dynamical systems on Polish spaces. Particular examples of such sets are the sets of generic points of invariant Borel probability measures, but we also consider much more general sets (for example, $\alpha $-Birkhoff regular sets and the irregular set appearing in the multifractal analysis of ergodic averages of a continuous real-valued function). We show that many of these sets are Borel in general, and all these are Borel when we assume that our space is compact. We provide examples of these sets being non-Borel, properly placed at the first level of the projective hierarchy (they are complete analytic or co-analytic). This proves that the compactness assumption is, in some cases, necessary to obtain Borelness. When these sets are Borel, we measure their descriptive complexity using the Borel hierarchy. We show that the sets of interest are located at most at the third level of the hierarchy. We also use a modified version of the specification property to show that these sets are properly located at the third level of the hierarchy for many dynamical systems. To demonstrate that the specification property is a sufficient, but not necessary, condition for maximal descriptive complexity of a set of generic points, we provide an example of a compact minimal system with an invariant measure whose set of generic points is $\boldsymbol {\Pi }^0_3$-complete.
We prove several results showing that every locally finite Borel graph whose large-scale geometry is ‘tree-like’ induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs (i.e., CAT(0) cube complexes). Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty–Jackson–Kechris.
In a paper from 1980, Shelah constructed an uncountable group all of whose proper subgroups are countable. Assuming the continuum hypothesis, he constructed an uncountable group G that moreover admits an integer n satisfying that for every uncountable $X\subseteq G$, every element of G may be written as a group word of length n in the elements of X. The former is called a Jónsson group, and the latter is called a Shelah group.
In this paper, we construct a Shelah group on the grounds of $\textsf {{ZFC}}$ alone – that is, without assuming the continuum hypothesis. More generally, we identify a combinatorial condition (coming from the theories of negative square-bracket partition relations and strongly unbounded subadditive maps) sufficient for the construction of a Shelah group of size $\kappa $, and we prove that the condition holds true for all successors of regular cardinals (such as $\kappa =\aleph _1,\aleph _2,\aleph _3,\ldots $). This also yields the first consistent example of a Shelah group of size a limit cardinal.
In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb {Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a pair of Borel $\mathbb {Z}$-orderings are compatible with each other. We show that, if a pair of Borel $\mathbb {Z}$-orderings are incompatible, then a canonical incompatible pair of Borel $\mathbb {Z}$-orderings of $E_0$ can be Borel embedded into the given pair. We then consider hyperfinite-over-finite equivalence relations, which are countable Borel equivalence relations admitting Borel $\mathbb {Z}^2$-orderings. We show that if a hyperfinite-over-hyperfinite equivalence relation E admits a Borel $\mathbb {Z}^2$-ordering which is self-compatible, then E is hyperfinite.
In this paper, we show that $\mathsf {ZFC}+\mathsf {WA}_{n+1}$ implies the consistency of $\mathsf {ZFC}+\mathsf {WA}_n$ for $n\ge 0$. We also prove that $\mathsf {ZFC}+\mathsf {WA}_n$ is finitely axiomatizable, and $\mathsf {ZFC}+\mathsf {WA}$ is not finitely axiomatizable unless it is inconsistent.
Using iterated Sacks forcing and topological games, we prove that the existence of a totally imperfect Menger set in the Cantor cube with cardinality continuum is independent from ZFC. We also analyze the structure of Hurewicz and consonant subsets of the Cantor cube in the Sacks model.
We investigate Steel’s conjecture in ‘The Core Model Iterability Problem’ [10], that if $\mathcal {W}$ and $\mathcal {R}$ are $\Omega +1$-iterable, $1$-small weasels, then $\mathcal {W}\leq ^{*}\mathcal {R}$ iff there is a club $C\subset \Omega $ such that for all $\alpha \in C$, if $\alpha $ is regular, then $\alpha ^{+\mathcal {W}}\leq \alpha ^{+\mathcal {R}}$. We will show that the conjecture fails, assuming that there is an iterable premouse M which models KP and which has a -Woodin cardinal. On the other hand, we show that assuming there is no transitive model of KP with a Woodin cardinal the conjecture holds. In the course of this we will also show that if M is a premouse which models KP with a largest, regular, uncountable cardinal $\delta $, and $\mathbb {P} \in M$ is a forcing poset such that $M\models "\mathbb {P}\text { has the }\delta \text {-c.c.}"$, and $g\subset \mathbb {P}$ is M-generic, then $M[g]\models \text {KP}$. Additionally, we study the preservation of admissibility under iteration maps. At last, we will prove a fact about the closure of the set of ordinals at which a weasel has the S-hull property. This answers another question implicit in remarks in [10].
We argue that some of Brouwer’s assumptions, rejected by Bishop, should be considered and studied as possible axioms. We show that Brouwer’s Continuity Principle enables one to prove an intuitionistic Borel Hierarchy Theorem. We also explain that Brouwer’s Fan Theorem is useful for a development of the theory of measure and integral different from the one worked out by Bishop. We show that Brouwer’s bar theorem not only proves the Fan Theorem but also a stronger statement that we call the Almost-fan Theorem. The Almost-fan Theorem implies intuitionistic versions of Ramsey’s Theorem and the Bolzano-Weierstrass Theorem.
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper, ${}^\omega \omega $-bounding forcing notions, 2) the class of subproper, T-preserving forcing notions (where T is a fixed Souslin tree) and 3) the class of subproper, $[T]$-preserving forcing notions (where T is an $\omega _1$-tree) are iterable with revised countable support. In the second part, we adopt Miyamoto’s theory of nice iterations, rather than revised countable support. We show that this approach allows us to drop a technical condition in the definitions of subcompleteness and subproperness, still resulting in forcing classes that are iterable in this way, preserve $\omega _1$, and, in the case of subcompleteness, don’t add reals. Further, we show that the analogs of the iteration theorems proved in the first part for RCS iterations hold for nice iterations as well.
In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$ if and only if every regular first-countable space of weight $< \mathfrak c$ can be densely embedded into a regular first-countable countably compact space.
We prove a full measurable version of Vizing’s theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal {G}$ of degree uniformly bounded by $\Delta \in \mathbb {N}$ defined on a standard probability space $(X,\mu )$ admits a $\mu $-measurable proper edge coloring with $(\Delta +1)$-many colors. This answers a question of Marks [Question 4.9, J. Amer. Math. Soc. 29 (2016)] also stated in Kechris and Marks as a part of [Problem 6.13, survey (2020)], and extends the result of the author and Pikhurko [Adv. Math. 374, (2020)], who derived the same conclusion under the additional assumption that the measure $\mu $ is $\mathcal {G}$-invariant.
We investigate natural variations of behaviourally correct learning and explanatory learning—two learning paradigms studied in algorithmic learning theory—that allow us to “learn” equivalence relations on Polish spaces. We give a characterization of the learnable equivalence relations in terms of their Borel complexity and show that the behaviourally correct and explanatory learnable equivalence relations coincide both in uniform and non-uniform versions of learnability and provide a characterization of the learnable equivalence relations in terms of their Borel complexity. We also show that the set of uniformly learnable equivalence relations is $\boldsymbol {\Pi }^1_1$-complete in the codes and study the learnability of several equivalence relations arising naturally in logic as a case study.
Given a Polish group G, let $E(G)$ be the right coset equivalence relation $G^\omega /c(G)$, where $c(G)$ is the group of all convergent sequences in G. We first established two results:
(1) Let $G,H$ be two Polish groups. If H is TSI but G is not, then $E(G)\not \le _BE(H)$.
(2) Let G be a Polish group. Then the following are equivalent: (a) G is TSI non-archimedean; (b)$E(G)\leq _B E_0^\omega $; and (c) $E(G)\leq _B {\mathbb {R}}^\omega /c_0$. In particular, $E(G)\sim _B E_0^\omega $ iff G is TSI uncountable non-archimedean.
A critical theorem presented in this article is as follows: Let G be a TSI Polish group, and let H be a closed subgroup of the product of a sequence of TSI strongly NSS Polish groups. If $E(G)\le _BE(H)$, then there exists a continuous homomorphism $S:G_0\rightarrow H$ such that $\ker (S)$ is non-archimedean, where $G_0$ is the connected component of the identity of G. The converse holds if G is connected, $S(G)$ is closed in H, and the interval $[0,1]$ can be embedded into H.
As its applications, we prove several Rigid theorems for TSI Lie groups, locally compact Polish groups, separable Banach spaces, and separable Fréchet spaces, respectively.
We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any non-trivial strictly increasing function from a section of the tree into itself maps into a cofinal branch.
We show that in the Silver model the inequality $\mathrm {cov}(\mathfrak {C} _2) < \mathrm {cov}(\mathfrak {P}_2)$ holds true, where $\mathfrak {C}_2$ and $\mathfrak {P}_2$ are the two-dimensional Mycielski ideals.