English

Diamond principles and Tukey-top ultrafilters on a countable set

Logic 2024-04-04 v1 General Topology

Abstract

We provide two types of guessing principles for ultrafilter (λ(U), λp(U)\diamondsuit^{-}_{\lambda}(U), \ \diamondsuit^p_\lambda(U)) on ω\omega which form subclasses of Tukey-top ultrafilters, and construct such ultrafilters in ZFCZFC. These constructions are essentially different from Isbell's construction \cite{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 ω\omega. We then apply these guessing principles to force a qq-point which is Tukey-top (answering a question from \cite{Benhanou/Dobrinen23}), and prove that the class of ultrafilters which satisfy ¬λ\neg\diamondsuit^{-}_\lambda is closed under Fubini sum. Finally, we show that λ\diamondsuit^{-}_\lambda and λp\diamondsuit^p_\lambda can be separated.

Keywords

Cite

@article{arxiv.2404.02379,
  title  = {Diamond principles and Tukey-top ultrafilters on a countable set},
  author = {Tom Benhamou and Fanxin Wu},
  journal= {arXiv preprint arXiv:2404.02379},
  year   = {2024}
}