Layered posets and Kunen's universal collapse
Sean D. Cox

TL;DR
This paper introduces layered posets to prove a new iteration theorem that simplifies chain condition arguments for universal Kunen iterations, with applications to saturated ideals and the Tree Property.
Contribution
It develops the theory of layered posets and proves an iteration theorem that generalizes chain condition arguments for universal Kunen iterations.
Findings
Universal Kunen iterations of c posets are c under certain conditions.
Various c posets can be absorbed by quotients of saturated ideals.
The Tree Property at c is consistent with Chang's Conjecture.
Abstract
We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if is weakly compact then any universal Kunen iteration of -cc posets (each possibly of size ) is -cc, as long as direct limits are used sufficiently often. This iteration theorem simplifies and generalizes the various chain condition arguments for universal Kunen iterations in the literature on saturated ideals, especially in situations where finite support iterations are not possible. We also provide two applications: (1) For any , a wide variety of -closed, -cc posets of size can consistently be absorbed (as regular suborders) by quotients of saturated ideals on (see Theorem 7 and Corollary 8); and (2) For any , the Tree Property at is…
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.
