Chains of P-points
Dilip Raghavan, Jonathan L. Verner

TL;DR
Under the Continuum Hypothesis, the paper proves that increasing sequences of rapid P-points of length less than the continuum's successor are bounded above by a rapid P-point, simplifying key constructions in the field.
Contribution
It improves existing results by showing such sequences are bounded and simplifies the core definitions used in constructing long chains of P-points.
Findings
Sequences of rapid P-points are bounded under CH.
Equivalence of $oldsymbol{ extdelta}$-generic and weaker notions.
Simplification of the construction of long P-point chains.
Abstract
It is proved that the Continuum Hypothesis implies that any sequence of rapid P-points of length which is increasing with respect to the Rudin-Keisler ordering is bounded above by a rapid P-point. This is an improvement of a result from [Kuzeljevi\'c, Raghavan: A long chain of P-points, arxiv:1607.07188 [math.LO]]. It is also proved that the notion of a -generic sequence is equivalent to an apparently much weaker notion. This allows the central definition used in the construction in [Kuzeljevi\'c, Raghavan: A long chain of P-points, arxiv:1607.07188 [math.LO]] to be considerably simplified.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Topology and Set Theory · semigroups and automata theory
