We define a collection of topological Ramsey spaces consisting of equivalence relations on $ω$ with the property that the minimal representatives of the equivalence classes alternate according to a fixed partition of $ω$. To prove the associated pigeonhole principles, we make use of the left-variable Hales-Jewett theorem and its extension to an infinite alphabet. We also show how to transfer the corresponding infinite-dimensional Ramsey results to equivalence relations on countable limit ordinals (up to a necessary restriction on the set of minimal representatives of the equivalence classes) in order to obtain a dual Ramsey theorem for such ordinals.
A big Ramsey spectrum of a countable chain (i.e. strict linear order) C is a sequence of big Ramsey degrees of finite chains computed in C. In this paper we consider big Ramsey spectra of countable scattered chains. We prove that countable scattered chains of infinite Hausdorff rank do not have finite big Ramsey spectra, and that countable scattered chains of finite Hausdorff rank with bounded finite sums have finite big Ramsey spectra. Since big Ramsey spectra of all non-scattered countable chains are finite by results of Galvin, Laver and Devlin, in order to complete the characterization of …
Closed ordinal Ramsey numbers are a topological variant of the classical (ordinal) Ramsey numbers. We compute the exact value of the closed ordinal Ramsey number $R^{cl}(ω^2,3) = ω^6$.
We study Ramsey's theorem for pairs and two colours in the context of the theory of $α$-large sets introduced by Ketonen and Solovay. We prove that any $2$-colouring of pairs from an $ω^{300n}$-large set admits an $ω^n$-large homogeneous set. We explain how a formalized version of this bound gives a more direct proof, and a strengthening, of the recent result of Patey and Yokoyama [Adv. Math. 330 (2018), 1034--1070] stating that Ramsey's theorem for pairs and two colours is $\forallΣ^0_2$-conservative over the axiomatic theory $\mathsf{RCA}_0$ (recursive comprehension).
Given a countable set S of positive reals, we study finite-dimensional Ramsey-theoretic properties of the countable ultrametric Urysohn space with distances in S.
We show that the existence of a Pi^{1}_{N}-indescribable cardinal over the Zermelo-Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and lower Mahlo operations. Furthermore we describe a proof-theoretic bound on definable countable ordinals whose existence is provable from the existence of second order indescribable cardinals over ZF.
A system of uniform families on an infinite subset $M$ of $\nn$ is a collection $(\cca_ξ)_{ξ<ω_1}$ of families of finite subsets of $\nn$ (where, $\cca_k$ consists of all $k$--element subset of $M$, for $k\in \nn$) with the properties that each $\cca_ξ$ is thin (i.e. it does not contain proper initial segments of any of its element) and the Cantor--Bendixson index, defined for $\cca_ξ$, is equal to $ξ+1$ and stable when we restrict ourselves to any subset of $M$. We indicate how to extend the generalized Schreier families to a system of uniform families. Using that notion we establish the corr…
The celebrated Erdős-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by Ramsey's Theorem in general. On the other hand, in uncountable cardinalities, the model-theoretic property of stability guarantees a uniform set much larger than the bound provided by the Erdős-Rado Theorem in general. Even though the consequences of stability in the finite have been much studied in the literature, the countable setting seems a priori quite dif…
We pursue the idea of generalizing Hindman's Theorem to uncountable cardinalities, by analogy with the way in which Ramsey's Theorem can be generalized to weakly compact cardinals. But unlike Ramsey's Theorem, the outcome of this paper is that the natural generalizations of Hindman's Theorem proposed here tend to fail at all uncountable cardinals.
Let αbe a countable ordinal and ¶(α) the collection of its subsets isomorphic to α. We show that the separative quotient of the set ¶(α) ordered by the inclusion is isomorphic to a forcing product of iterated reduced products of Boolean algebras of the form P(ω^γ)/I(ω^γ), where γis a limit ordinal or 1 and I(ω^γ) the corresponding ordinal ideal. Moreover, the poset ¶(α) is forcing equivalent to a two-step iteration P(ω)/Fin * π, where πis an ω_1-closed separative pre-order in each extension by P(ω)/Fin and, if the distributivity number is equal toω_1, to P(ω)/Fin. Also we analyze the quotients…
We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.
We study the topological version of the partition calculus in the setting of countable ordinals. Let $α$ and $β$ be ordinals and let $k$ be a positive integer. We write $β\to_{top}(α,k)^2$ to mean that, for every red-blue coloring of the collection of 2-sized subsets of $β$, there is either a red-homogeneous set homeomorphic to $α$ or a blue-homogeneous set of size $k$. The least such $β$ is the topological Ramsey number $R^{top}(α,k)$. We prove a topological version of the Erdős-Milner theorem, namely that $R^{top}(α,k)$ is countable whenever $α$ is countable. More precisely, we prove that $R…
Let $F_{ω_1}$ be the countable admissible ordinal equivalence relation defined on ${}^ω2$ by $x \ F_{ω_1} \ y$ if and only if $ω_1^x = ω_1^y$. It will be shown that $F_{ω_1}$ is classifiable by countable structures and must be classified by structures of high Scott rank. If $E$ and $F$ are equivalence relations, then $E$ is almost Borel reducible to $F$ if and only if there is a Borel reduction of $E$ to $F$, except possibly on countably many $E$-classes. Let $E_{ω_1}$ denote the equivalence of order types of reals coding well-orderings. It will be shown that in the constructible universe $L$ …
We examine a version of Ramsey's theorem based on Tao, Gaspar and Kohlenbach's "finitary" infinite pigeonhole principle.We will show that the "finitary" infinite Ramsey's theorem naturally gives rise to statements at the level of the infinite Ramsey's theorem, Friedman's infinite adjacent Ramsey theorem (well-foundedness of certain ordinals up to $\varepsilon_0$), $1$-consistency of theories up to PA and the finite Ramsey's theorem.
Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open problem posed by Carlson whether every Ramsey algebra has an idempotent ultrafilter. This paper developes a general framework to study idempotent ultrafilters. Under certain countable setting, the main result roughly says that every nondegenerate Ramsey algebra has a nonprincipal idempotent ultrafilter in some nontrivial countable field of sets. This amounts to …
The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of reals of size $\aleph_1$. In the other direction, it is shown that the existence of both a strongly Luzin set and a coherent Souslin tree is compatible with the existence of a countable partition of pairs of countable ordinals such that no coloring is strong over it. This clarifies the interaction between a gallery of coloring assertions going back to Luzin and Sierpinski a hundred years ago.
The theory of ordinal ranks on Baire class 1 functions developed by Kechris and Loveau was recently extended by Elekes, Kiss and Vidnyánszky to Baire class $ξ$ functions for any countable ordinal $ξ\geq1$. In this paper, we answer two of the questions raised by them in their paper (Ranks on the Baire class $ξ$ functions, Trans. Amer. Math. Soc. 368(2016), 8111-8143). Specifically, we show that for any countable ordinal $ξ\geq1,$ the ranks $β_ξ^{\ast}$ and $γ_ξ^{\ast}$ are essentially equivalent, and that neither of them is essentially multiplicative. Since the rank $β$ is not essentially multi…
We investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. The nice connection between finite iteration and addition, multiplication, and exponentiation is lost when passing to the transfinite. In this note, we investigate a new equivalence relation on ordinal functionals with respect to which we restore the connection.
Motivated by a Tukey classification problem we develop here a new topological Ramsey space $\mathcal{R}_1$ that in its complexity comes immediately after the classical is a natural Ellentuck space \cite{MR0349393}. Associated with $\mathcal{R}_1$ is an ultrafilter $\mathcal{U}_1$ which is weakly Ramsey but not Ramsey. We prove a canonization theorem for equivalence relations on fronts on $\mathcal{R}_1$. This is analogous to the Pudlak-\Rodl\ Theorem canonizing equivalence relations on barriers on the Ellentuck space. We then apply our canonization theorem to completely classify all Rudin-Keis…
We study an infinite countable iteration of the natural product between ordinals. We present an "effective" way to compute this countable natural product, in the non trivial cases the result depends only on the natural sum of the degrees of the factors, where the degree of a nonzero ordinal is the largest exponent in its Cantor normal form representation. Thus we are able to lift former results about infinitary sums to infinitary products. Finally, we provide an order-theoretical characterization of the infinite natural product, this characterization merges in a nontrivial way a theorem by Car…
Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_α(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the following theory: ZFC - Replacement + "There exists $ω$ Woodin cardinals which are cofinal in the ordinals." T has consistency strength weaker than that of the theory ZFC + "There exists omega Woodin cardinals", but stronger than that of the theory ZFC + "There exists n Woodin Cardinals", for each n. Let M be the canonic…
In this paper we introduce a new topological Ramsey space whose elements are infinite ordered polyhedra. Then, we show as an application that the set of finite polyhedra satisfies two types of Ramsey property: one, when viewed as a category over $\mathbb N$; the other, when considered as a class of finite structures. The (ordered) random polyhedron is the Fraisse limit of the class of finite ordered polyhedra; we prove that its group of automorphisms is extremely amenable. Finally, we present a countably infinite family of topological Ramsey subspaces; each one determines a class of finite ord…
The Bolzano-Weierstrass principle of choice is the oldest method of the set theory, traditionally used in mathematical analysis. We are extending it towards transfinite sequences of steps indexed by ordinals. We are introducing the notions: hiker's tracks, hiker's maps and statements $P_n(X, Y, m)$; which are used similarly in finite, countable and uncountable cases. New proofs of Ramsey's theorem and Erdös-Rado theorem are presented as some applications.
Moore characterized the amenability of automorphism groups of countable ultrahomogeneous structures by a Ramsey-type property. We extend this result to automorphism groups of metric Fraïssé structures, which encompass all Polish groups. As an application, we prove that amenability is a G_delta condition.
We give a partial answer to the following question of Dobrinen: For a given topological Ramsey space $\mathcal{R}$, are the notions of selective for $\mathcal{R}$ and Ramsey for $\mathcal{R}$ equivalent? Every topological Ramsey space $\mathcal{R}$ has an associated notion of Ramsey ultrafilter for $\mathcal{R}$ and selective ultrafilter for $\mathcal{R}$ (see \cite{MijaresSelective}). If $\mathcal{R}$ is taken to be the Ellentuck space then the two concepts reduce to the familiar notions of Ramsey and selective ultrafilters on $ω$; so by a well-known result of Kunen the two are equivalent. We…
If $\mathcal{N}$ is a proper Polish metric space and $\mathcal{M}$ is any countable dense submetric space of $\mathcal{N}$, then the Scott rank of $\mathcal{N}$ in the natural first order language of metric spaces is countable and in fact at most $ω_1^{\mathcal{M}} + 1$, where $ω_1^{\mathcal{M}}$ is the Church-Kleene ordinal of $\mathcal{M}$ (construed as a subset of $ω$) which is the least ordinal with no presentation on $ω$ computable from $\mathcal{M}$. If $\mathcal{N}$ is a rigid Polish metric space and $\mathcal{M}$ is any countable dense submetric space, then the Scott rank of $\mathcal{…
Motivated by Tukey classification problems and building on work in \cite{Dobrinen/Todorcevic11}, we develop a new hierarchy of topological Ramsey spaces $\mathcal{R}_α$, $α<ω_1$. These spaces form a natural hierarchy of complexity, $\mathcal{R}_0$ being the Ellentuck space, and for each $α<ω_1$, $\mathcal{R}_{α+1}$ coming immediately after $\mathcal{R}_α$ in complexity. Associated with each $\mathcal{R}_α$ is an ultrafilter $\mathcal{U}_α$, which is Ramsey for $\mathcal{R}_α$, and in particular, is a rapid p-point satisfying certain partition properties. We prove Ramsey-classification theorems…
We study in this paper some connections between the Fraisse theory of amalgamation classes and ultrahomogeneous structures, Ramsey theory, and topological dynamics of automorphism groups of countable structures.
We prove that in the Solovay model every OD graph G on reals satisfies one and only one of the following two conditions: (I) G admits an OD colouring by ordinals; (II) there exists a continuous homomorphism of G_0 into G, where G_0 is a certain F_sigma locally countable graph which is not R-OD colourable by ordinals in the Solovay model. If the graph G is locally countable or acyclic then (II) can be strengthened by the requirement that the homomorphism is a 1-1 map, i.e. an embedding. As the second main result we prove that Sigma^1_2 graphs admit the dichotomy (I) vs. (II) in set--generic ext…
We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $ω^{ω^ω}$. This was conjectured to be the case by Hatzikiriakou and Simpson. Since we use Friedman's adjacent Ramsey theorem for fixed dimensions in the upper bound, we also give a treatment of the reverse mathematical status of that theorem.
We give, for each countable ordinal $ξ\geq 1$, an example of a ${\bfΔ}^0_2$ countable union of Borel rectangles that cannot be decomposed into countably many ${\bfΠ}^0_ξ$ rectangles. In fact, we provide a graph of a partial injection with disjoint domain and range, which is a difference of two closed sets, and which has no ${\bfΔ}^0_ξ$-measurable countable coloring.
Oscillating subalgebras of the atomless countable Boolean algebra
University of Florida（佛罗里达大学）；Charles University（查理大学）；Institute of Mathematics of the Czech Academy of Sciences（捷克科学院数学研究所）；University of Waterloo（滑铁卢大学）；TU Dresden（德累斯顿工业大学）；University of Toronto（多伦多大学）；Institut de Mathématiques de Jussieu, CNRS（巴黎第七大学/法国国家科学研究中心儒勒·让塞数学研究所）；Matematički Institut, SANU（塞尔维亚科学与艺术学院数学研究所）
We compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF. Extending the classical result of Erd{ö}s and Rado we show that the axiom of choice precludes the natural infinite exponent partition relations for polychromatic Ramsey theory. We introduce rainbow Ramsey ultrafilters, a polychromatic analogue of the usual Ramsey ultrafilters. We investigate the relationship of rainbow Ramsey ultrafilters with various specia…
We prove an exact, i.e., formulated without $Δ$-expansions, Ramsey principle for infinite block sequences in vector spaces over countable fields, where the two sides of the dichotomic principle are represented by respectively winning strategies in Gowers' block sequence game and winning strategies in the infinite asymptotic game. This allows us to recover Gowers' dichotomy theorem for block sequences in normed vector spaces by a simple application of the basic determinacy theorem for infinite asymptotic games.
We investigate the existence of metric spaces which, for any coloring with a fixed number of colors, contain monochromatic isomorphic copies of a fixed starting space K. In the main theorem we construct such a space of size \(2^{\aleph_0}\) for colorings with \(\aleph_0\) colors and any metric space \(K\) of size \(\aleph_0\). We also give a slightly weaker theorem for countable ultrametric \(K\) where, however, the resulting space has size~\(\aleph_1\).
In \cite{J}, Theorem 4.2, Jockusch proves that for any computable k-coloring of pairs of integers, there is an infinite $Π^0_2$ homogeneous set. The proof uses a countable collection of $Π^0_2$ sets as potential infinite homogeneous sets. In a remark preceding the proof, Jockusch states without proof that it can be shown that there is no computable way to prove this result with a finite number of $Π^0_2$ sets. We provide a proof of this latter fact.
As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a better alternative, since it shares most of the usual properties of the addition on the naturals. A countably infinite version of the natural sum has been used in a recent paper by Väänänen and Wang, with applications to infinitary logics. We provide an order theoretical characterization of this operation. We show that this countable natural sum differs from the…
Infinite draughts, or checkers, is played just like the finite game, but on an infinite checkerboard extending without bound in all four directions. We prove that every countable ordinal arises as the game value of a position in infinite draughts. Thus, there are positions from which Red has a winning strategy enabling her to win always in finitely many moves, but the length of play can be completely controlled by Black in a manner as though counting down from a given countable ordinal.
We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent from ZFC for ordinal time machines (OTMs) with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider, infinite time Turing machines (ITTMs), unresetting and resetting infinite time register machines (wITRMs, ITRMs), and α-Turing machines for countable …
We extend the hierarchy of finite-dimensional Ellentuck spaces to infinite dimensions. Using uniform barriers $B$ on $ω$ as the prototype structures, we construct a class of continuum many topological Ramsey spaces $\mathcal{E}_B$ which are Ellentuck-like in nature, and form a linearly ordered hierarchy under projection. We prove new Ramsey-classification theorems for equivalence relations on fronts, and hence also on barriers, on the spaces $\mathcal{E}_B$, extending the Pudlak-Rodl Theorem for barriers on the Ellentuck space. The inspiration for these spaces comes from continuing the iterati…
We describe a proof-theoretic bound on $Sigma_{2}$-definable countable ordinals in Kripke-Platek set theory with $Pi_{1}$-Collection and the existence of $omega_{1}$.
