Diamond principles and Tukey-top ultrafilters on a countable set

Abstract

We provide two types of guessing principles for ultrafilter (-λ(U), \ pλ(U)) on ω which form subclasses of Tukey-top ultrafilters, and construct such ultrafilters in ZFC. These constructions are essentially different from Isbell's construction Isbell65 of Tukey-top ultrafilters. We prove using the Borel-Cantelli Lemma that full guessing is not possible and rule out several stronger guessing principles e.g. we prove that no Dodd-sound ultrafilters exist on ω. We then apply these guessing principles to force a q-point which is Tukey-top (answering a question from Benhanou/Dobrinen23), and prove that the class of ultrafilters which satisfy -λ is closed under Fubini sum. Finally, we show that -λ and pλ can be separated.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…