A new class of Ramsey-classification theorems and their applications in the Tukey theory of ultrafilters
Abstract
Motivated by Tukey classification problems and building on work in Dobrinen/Todorcevic11, we develop a new hierarchy of topological Ramsey spaces Rα, α<ω1. These spaces form a natural hierarchy of complexity, R0 being the Ellentuck space, and for each α<ω1, Rα+1 coming immediately after Rα in complexity. Associated with each Rα is an ultrafilter Uα, which is Ramsey for Rα, and in particular, is a rapid p-point satisfying certain partition properties. We prove Ramsey-classification theorems for equivalence relations on fronts on Rα, 2α<ω1. These are analogous to the Pudlak-\ Theorem canonizing equivalence relations on barriers on the Ellentuck space. We then apply our Ramsey-classification theorems to completely classify all Rudin-Keisler equivalence classes of ultrafilters which are Tukey reducible to Uα, for each 2α<ω1: Every ultrafilter which is Tukey reducible to Uα is isomorphic to a countable iteration of Fubini products of ultrafilters from among a fixed countable collection of rapid p-points. Moreover, we show that the Tukey types of nonprincipal ultrafilters Tukey reducible to Uα form a descending chain of order type α+1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.