Papers
Topics
Authors
Recent
Search
2000 character limit reached

A new class of Ramsey-classification theorems and their applications in the Tukey theory of ultrafilters

Published 26 May 2012 in math.LO, math.CO, and math.GN | (1205.5909v1)

Abstract: Motivated by Tukey classification problems and building on work in \cite{Dobrinen/Todorcevic11}, we develop a new hierarchy of topological Ramsey spaces $\mathcal{R}{\alpha}$, $\alpha<\omega_1$. These spaces form a natural hierarchy of complexity, $\mathcal{R}_0$ being the Ellentuck space, and for each $\alpha<\omega_1$, $\mathcal{R}{\alpha+1}$ coming immediately after $\mathcal{R}{\alpha}$ in complexity. Associated with each $\mathcal{R}{\alpha}$ is an ultrafilter $\mathcal{U}{\alpha}$, which is Ramsey for $\mathcal{R}{\alpha}$, and in particular, is a rapid p-point satisfying certain partition properties. We prove Ramsey-classification theorems for equivalence relations on fronts on $\mathcal{R}{\alpha}$, $2\le\alpha<\omega_1$. These are analogous to the Pudlak-\Rodl\ 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 $\mathcal{U}{\alpha}$, for each $2\le\alpha<\omega_1$: Every ultrafilter which is Tukey reducible to $\mathcal{U}{\alpha}$ 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 $\mathcal{U}{\alpha}$ form a descending chain of order type $\alpha+1$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.