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-Keisler equivalence classes of ultrafilters which are Tukey reducible to $\mathcal{U}_1$: Every ultrafilter which is Tukey reducible to $\mathcal{U}_1$ is isomorphic to a countable iteration of Fubini products of ultrafilters from among a fixed countable collection of ultrafilters. Moreover, we show that there is exactly one Tukey type of nonprincipal ultrafilters strictly below that of $\mathcal{U}_1$, namely the Tukey type a Ramsey ultrafilter.
We investigate the structure of the Tukey types of ultrafilters on countable sets partially ordered by reverse inclusion. A canonization of cofinal maps from a p-point into another ultrafilter is obtained. This is used in particular to study the Tukey types of p-points and selective ultrafilters. Results fall into three main categories: comparison to a basis element for selective ultrafilters, embeddings of chains and antichains into the Tukey types, and Tukey types generated by block-basic ultrafilters on FIN.
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…
Motivated by a question of Isbell, we show that Jensen's Diamond Principle implies there is a non-P-point ultrafilter U on omega such that U, whether ordered by reverse inclusion or reverse inclusion mod finite, is not Tukey equivalent to the finite sets of reals ordered by inclusion. We also show that, for every regular infinite kappa not greater than 2^{aleph_0}, if MA_{sigma-centered} holds, then some ultrafilter U on omega, ordered by reverse inclusion mod finite, is Tukey equivalent to the sets of reals of size less than kappa, ordered by inclusion. We also prove two negative ZFC results …
An ultrafilter $\mathcal{U}$ on a countable base {\em has continuous Tukey reductions} if whenever an ultrafilter $\mathcal{V}$ is Tukey reducible to $\mathcal{U}$, then every monotone cofinal map $f:\mathcal{U}\ra\mathcal{V}$ is continuous when restricted to some cofinal subset of $\mathcal{U}$. In the first part of the paper, we give mild conditions under which the property of having continuous Tukey reductions is inherited under Tukey reducibility. In particular, if $\mathcal{U}$ is Tukey reducible to a p-point then $\mathcal{U}$ has continuous Tukey reductions. In the second part, we show …
Extending recent investigations on the structure of Tukey types of ultrafilters on $\mathcal{P}(ω)$ to Boolean algebras in general, we classify the spectra of Tukey types of ultrafilters for several classes of Boolean algebras, including interval algebras, tree algebras, and pseudo-tree algebras.
This article surveys results regarding the Tukey theory of ultrafilters on countable base sets. The driving forces for this investigation are Isbell's Problem and the question of how closely related the Rudin-Keisler and Tukey reducibilities are. We review work on the possible structures of cofinal types and conditions which guarantee that an ultrafilter is below the Tukey maximum. The known canonical forms for cofinal maps on ultrafilters are reviewed, as well as their applications to finding which structures embed into the Tukey types of ultrafilters. With the addition of some Ramsey theory,…
We investigate the Tukey type of the generic ultrafilter added by the quotient $\mathcal{P}(ω\times ω) / (\mathrm{FIN} \times \mathrm{FIN})$. We prove that this ultrafilter is not basically generated and yet does not have the maximal Tukey type among directed partial orders of size continuum. Moreover, any Tukey reduction from this ultrafilter to any other ultrafilter is witnessed by a Baire class one map.
Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this article is to introduce ultrafilters in a friendly manner and present some applications to the branch of combinatorics known as Ramsey theory, culminating with a new ultrafilter-based proof of van der Waerden's theorem.
This paper investigates conditions under which canonical cofinal maps of the following three types exist: continuous, generated by finitary end-extension preserving maps, and generated by finitary maps. The main theorems prove that every monotone cofinal map on an ultrafilter from a certain class of ultrafilters is actually canonical when restricted to some cofinal subset. These theorems are then applied to find connections between Tukey, Rudin-Keisler, and Rudin-Blass reducibilities on large classes of ultrafilters. The main theorems on canonical cofinal maps are the following. Under a mild a…
The generic ultrafilter $\mathcal{G}_2$ forced by $\mathcal{P}(ω\timesω)/($Fin$\otimes$Fin) was recently proved to be neither maximum nor minimum in the Tukey order of ultrafilters (in a recent paper of Blass, Dobrinen, and Raghavan), but it was left open where exactly in the Tukey order it lies. We prove that $\mathcal{G}_2$ is in fact Tukey minimal over its projected Ramsey ultrafilter. Furthermore, we prove that for each $k\ge 2$, the collection of all nonprincipal ultrafilters Tukey reducible to the generic ultrafilter $\mathcal{G}_k$ forced by $\mathcal{P}(ω^k)/$Fin$^{\otimes k}$ forms a …
We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect this analysis with a cardinal invariant of Boolean algebras, the ultrafilter number, and prove consistency results concerning its possible values on Cohen and random algebras.
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting. Furthermore, we discuss the relation with Tukey reducibility and prove that, assuming the Continuum Hypothesis, there exist ultrafilters on the Cohen algebra which are RK-equivalent in the generalized sense but Tukey-incomparable, in stark contrast with the classical setting.
Posgrado Conjunto en Ciencias Matemáticas UNAM-UMSNH（UNAM-UMSNH数学科学联合研究生项目）；Escuela Superior de Fśica y Matemáticas Instituto Politécnico Nacional（国立理工学院高等物理与数学学院）；Centro de Ciencias Matemáticas Universidad Nacional Autónoma de México Campus Morelia（墨西哥国立自治大学莫雷利亚校区数学科学中心）
We study ultrafilters on $ω^2$ produced by forcing with the quotient of $\scr P(ω^2)$ by the Fubini square of the Fréchet filter on $ω$. We show that such an ultrafilter is a weak P-point but not a P-point and that the only non-principal ultrafilters strictly below it in the Rudin-Keisler order are a single isomorphism class of selective ultrafilters. We further show that it enjoys the strongest square-bracket partition relations that are possible for a non-P-point. We show that it is not basically generated but that it shares with basically generated ultrafilters the property of not being at …
We investigate families of partitions of omega which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these partition-ultrafilters, which we call Ramseyan ultrafilters, are similar to those of Ramsey ultrafilters. For example it will be shown that dual Mathias forcing restricted to a Ramseyan ultrafilter has the same features as Mathias forcing restricted to a Ramsey ultrafilter. Further we introduce an ordering on the set of partition-filters and consider the dual form of some cardina…
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…
We give a characterizations of Ramsey ultrafilters on $\mathscr P(ω)$ in terms of functions $f:ω^n\toω$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[ω]^n$ there is a finite partition~$\mathcal Q$ of $[ω]^{2n}$ such that any set $X\subseteq ω$ that is homogeneous for $\mathcal Q$ is a finite union of sets that are canonical for $\mathcal P$.
Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function is nondecreasing on some set in U. Natural weakenings of these properties led to the inequivalent notions of weakly Ramsey and of quasi-selective ultrafilter, introduced and studied in [1] and [4], respectively. U is weakly Ramsey if for every finite colouring of unordered pairs of integers there is a set in U whose pairs share only two colours, while U is …
Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $σ$-closed `almost reduction' relation analogously to the partial ordering of `mod finite' on $[ω]^ω$. Such forcings add new ultrafilters satisfying weak partition relations and have complete combinatorics. In cases where a forcing turned out to be equivalent to a topological Ramsey space, the strong Ramsey-theoretic techniques have aided in a fine-tuned analysis of the Rudin-Keisler a…
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 …
Associated to each ultrafilter $\mathcal{U}$ on $ω$ and each map $p:ω\rightarrow ω$ is a Dedekind cut in the ultrapower $ω^ω/p( \mathcal{U})$. Blass has characterized, under CH, the cuts obtainable when $\mathcal{U}$ is taken to be either a p-point ultrafilter, a weakly-Ramsey ultrafilter or a Ramsey ultrafilter. Dobrinen and Todorcevic have introduced the topological Ramsey space $\mathcal{R}_{1}$. Associated to the space $\mathcal{R}_{1}$ is a notion of Ramsey ultrafilter for $\mathcal{R}_{1}$ generalizing the familiar notion of Ramsey ultrafilter on $ω$. We characterize, under CH, the cuts …
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…
This paper investigates properties of $σ$-closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter $\mathcal{U}$ for $n$-tuples, denoted $t(\mathcal{U},n)$, is the smallest number $t$ such that given any $l\ge 2$ and coloring $c:[ω]^n\rightarrow l$, there is a member $X\in\mathcal{U}$ such that the restriction of $c$ to $[X]^n$ has no more than $t$ colors. Many well-known $σ$-closed forcings are known to generate ultrafilters with finite Ramsey degrees, but finding the precise degrees can sometimes prove elusive or quite involved, at …
A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fraïssé classes of finite relational structures satisfying the Ramsey property. The Product Ramsey Theorem of Sokič is extended to equivalence relations for finite products of structures from Fraïssé classes of finite relational structures satisfying the Ramsey property and the Order-Prescribed Free Amalgamation Property. This is essential to proving Ramsey-classification theorems for equivalence relations on fronts, generalizing the Pudlák-Rödl …
We introduce the relation of "almost-reduction" in an arbitrary topological Ramsey space R, as a generalization of the relation of "almost-inclusion" on the space of infinite sets of natural numbers (the Ellentuck space). This leads us to a type of ultrafilter U on the set of first approximations of the elements of R which corresponds to the well-known notion of "selective ultrafilter" on N, the set of natural numbers. The relationship turns out to be rather exact in the sense that it permits us to lift several well-known facts about selective ultrafilters on N and the Ellentuck space to the u…
Contents: 1. Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces, I; 2. Frechet-Urysohn fans in free topological groups; 3. Packing index of subsets in Polish groups; 4. Symmetric monochromatic subsets in colorings of the Lobachevsky plane; 5. Structural Ramsey theory of metric spaces and topological dynamics of isometry groups; 6. Distinguishing Number of Countable Homogeneous Relational Structures; 7. Indestructible colourings and rainbow Ramsey theorems; 8. Products of Borel subgroups; 9. Selection theorems and treeabili…
Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on forcings which contain dense subsets forming topological Ramsey spaces. These forcings motivated the development of new Ramsey theory, which then was applied to the generic ultrafilters to obtain the precise structure Rudin-Keisler and Tukey orders below such ultrafilters. The content of the first two tutorials has appeared in an expository article submitted to th…
For a discrete group $G$ and a discrete $G$-space $X$, we identify the Stone-Čech compactifications $βG$ and $βX$ with the sets of all ultrafilters on $G$ and $X$, and apply the natural action of $βG$ on $βX$ to characterize large, thick, thin, sparse and scattered subsets of $X$. We use $G$-invariant partitions and colorings to define $G$-selective and $G$-Ramsey ultrafilters on $X$. We show that, in contrast to the set-theoretical case, these two classes of ultrafilters are distinct. We consider also universally thin ultrafilters on $ω$, the $T$-points, and study interrelations between these…
We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.
We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $ω$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove that for any finite $n \geq 1$, there is a forcing extension with exactly $n$ near-coherence classes of ultrafilters. For evaluating the new forcing, we prove a strengthening of Gowers's theorem on colourings of ${\rm Fin}_k$.
This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such embeddings are fully iterable and so it is natural to ask about large cardinal notions asserting the existence of ultrafilters allowing only $α$-many iterations for some countable ordinal $α$. Here we study such $α$-iterable cardinals. We show that the $α$-iterable cardinals form a strict hierarchy for $α\leqω_1$, that they are downward absolute to $L$ for $α<ω_1^L…
Rutgers University（罗格斯大学）；Carnegie Mellon University（卡内基梅隆大学）；UC Berkeley（加州大学伯克利分校）；Hebrew University of Jerusalem（耶路撒冷希伯来大学）；Harvard University（哈佛大学）
By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for applications in Ramsey theory of numbers. To illustrate the use of our technique, we give a (rather) short proof of Milliken-Taylor's Theorem, and a ultrafilter version of Rado's theorem about partition regularity of diophantine equations.
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…
Given a topological Ramsey space $(\mathcal R,\leq, r)$, we extend the notion of semiselective coideal to sets $\mathcal H\subseteq\mathcal R$ and study conditions for $\mathcal H$ that will enable us to make the structure $(\mathcal R,\mathcal H,\leq, r)$ a Ramsey space (not necessarily topological) and also study forcing notions related to $\mathcal H$ which will satisfy abstract versions of interesting properties of the corresponding forcing notions in the realm of Ellentuck's space. This extends results of Farah, and results of Mijares, to the most general context of topological Ramsey spa…
