Indestructibility of some compactness principles over models of PFA

preprint2022arXivOpen access

Abstract

We show that PFA\mathsf{PFA} (Proper Forcing Axiom) implies that adding any number of Cohen subsets of ωω will not add an ω2ω_2-Aronszajn tree or a weak ω1ω_1-Kurepa tree, and moreover no σσ-centered forcing can add a weak ω1ω_1-Kurepa tree (a tree of height and size ω1ω_1 with at least ω2ω_2 cofinal branches). This partially answers an open problem whether ccc forcings can add ω2ω_2-Aronszajn or ω1ω_1-Kurepa trees. We actually prove more: We show that a consequence of PFA\mathsf{PFA}, namely the guessing model principle, GMP\mathsf{GMP}, which is equivalent to the ineffable slender tree property, ISP\mathsf{ISP}, is preserved by adding any number of Cohen subsets of ωω. And moreover, GMP\mathsf{GMP} implies that no σσ-centered forcing can add a weak ω1ω_1-Kurepa tree. For more generality, we study the principle GMP\mathsf{GMP} at an arbitrary regular cardinal κ=κ<κκ= κ^{<κ} (we denote this principle GMPκ++\mathsf{GMP}_{κ^{++}}), and as an application we show that there is a model in which there are no weak ℵω+1\aleph_{ω+1}-Kurepa trees and no ℵω+2\aleph_{ω+2}-Aronszajn trees.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.