On embedding of partially ordered sets in $(\beta\omega,\le_{RK})$
Nikolai L. Poliakov, Denis I. Saveliev

TL;DR
This paper investigates the embeddability of finite partial orders into the Rudin--Keisler order on ultrafilters, demonstrating in ZFC that certain large lattices can be embedded with relations between the Rudin--Keisler and Comfort orders.
Contribution
It proves that in ZFC, large lattices of finite and countable subsets can be embedded into ultrafilters with relations between the Rudin--Keisler and Comfort orders, extending prior results.
Findings
Embeddability of large lattices in ultrafilters in ZFC.
Re-proving Blass' result without CH.
Embedding of ordered lattices with intermediate relations.
Abstract
A natural question, which appeared as Problem 61 in Hart and van Mill's list of open problems on (2024), asks whether every finite partial order is embeddable in the Rudin--Keisler order on (types of) ultrafilters over a countable set. Although the positive answer, even for all countable partial orders, was proved under CH in Blass' thesis (1970), the situation in ZFC alone remains widely open. We show that, in ZFC, not only this result by Blass can be re-proved, but, moreover, the ordered by inclusion lattices of finite subsets of a set of cardinality , and of countable subsets of a set of cardinality , both are embeddable in ultrafilters with any relation lying between the Rudin--Keisler and Comfort orders.
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
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Algebra and Logic
