Laver ultrafilters
Abstract
We introduce Laver ultrafilters, namely ultrafilters U for which the associated Laver forcing LU has the Laver property. We give simple combinatorial characterisations of these ultrafilters, which allow us to analyse their position among several well-studied combinatorial classes, including P-points, rapid ultrafilters, and ultrafilters arising in Baumgartner's I-ultrafilter framework. In particular, we show that the class of Laver ultrafilters properly contains the class of rapid P-points and that it is properly contained both in the class of hereditarily rapid- and in the class of measure zero ultrafilters. Finally, we investigate the (generic) existence of Laver ultrafilters and establish bounds on their generic existence number. In particular, we show that it is consistent that P-points do not exist while Laver ultrafilters exist generically.
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.