Skip to main content

On the Existence of Ramsey Ultrafilters

  • Chapter
Combinatorial Set Theory

Part of the book series: Springer Monographs in Mathematics ((SMM))

  • 2641 Accesses

Abstract

So far we have seen that \(\mathfrak {p}=\mathfrak {c}\) implies the existence of Ramsey ultrafilters (see Proposition 10.9). In particular, if we assume CH, then Ramsey ultrafilters exist. Moreover, by Proposition 13.9 we know that MA(countable) implies the existence of \(\mathfrak {2}^{\mathfrak {c}}\) mutually non-isomorphic Ramsey ultrafilters. Furthermore, by Theorem 21.5 we know that \(\mathfrak {p}\le \mathit {cov}(\mathcal {M})\), and Chapter 13 ∣ Related Result 80 tells us that MA(countable) is equivalent to \(\mathit {cov}(\mathcal {M})=\mathfrak {c}\). Hence, \(\mathit {cov}(\mathcal {M})=\mathfrak {c}\) is a sufficient condition for the existence of Ramsey ultrafilters and it is natural to ask whether \(\mathit {cov}(\mathcal {M})=\mathfrak {c}\) is necessary, too. In the first section of this chapter we shall give a negative answer to this question by constructing a model of \(\mathsf {ZFC}+\mathit {cov}(\mathcal {M})<\mathfrak {c}\) in which there is a Ramsey ultrafilter. Since in that model we have \(\mathfrak {h}=\mathfrak {c}\) and \(\mathfrak {h}\) is related to the Ramsey property (cf. Chapter 9), one might think that perhaps \(\mathfrak {h}=\mathfrak {c}\) implies the existence of a Ramsey ultrafilter; but this is not the case, as we shall see in the second section of this chapter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bohuslav Balcar, Jan Pelant, Petr Simon: The space of ultrafilters on N covered by nowhere dense sets. Fundam. Math. 110, 11–24 (1980)

    MathSciNet  MATH  Google Scholar 

  2. Tomek Bartoszyński, Haim Judah: Set Theory: On the Structure of the Real Line. AK Peters, Wellesley (1995)

    MATH  Google Scholar 

  3. Jaime I. Ihoda: Strong measure zero sets and rapid filters. J. Symb. Log. 53, 393–402 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Thomas Jech: Set Theory. Pure and Applied Mathematics. Academic Press, London (1978)

    Google Scholar 

  5. Haim Judah, Saharon Shelah: Q-sets, Sierpinski sets, and rapid filters. Proc. Am. Math. Soc. 111, 821–832 (1991)

    MathSciNet  MATH  Google Scholar 

  6. Kenneth Kunen: Some points in βN. Math. Proc. Camb. Philos. Soc. 80, 385–398 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Richard Laver: On the consistency of Borel’s conjecture. Acta Math. 137, 151–169 (1976)

    Article  MathSciNet  Google Scholar 

  8. Arnold W. Miller: There are no Q-points in Laver’s model for the Borel conjecture. Proc. Am. Math. Soc. 78, 103–106 (1980)

    MATH  Google Scholar 

  9. Arnold W. Miller: Rational perfect set forcing. In: Axiomatic Set Theory, James E. Baumgartner, Donald A. Martin, Saharon Shelah (eds.). Contemporary Mathematics, vol. 31, pp. 143–159. Am. Math. Soc., Providence (1984)

    Chapter  Google Scholar 

  10. Judy Roitman: p-points in iterated forcing extensions. Proc. Am. Math. Soc. 69, 314–318 (1978)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lorenz J. Halbeisen .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Halbeisen, L.J. (2012). On the Existence of Ramsey Ultrafilters. In: Combinatorial Set Theory. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-4471-2173-2_25

Download citation

Publish with us

Policies and ethics