Perfect Tree Forcings for Singular Cardinals
Natasha Dobrinen, Dan Hathaway, and Karel Prikry

TL;DR
This paper studies perfect tree forcings associated with singular cardinals, revealing their distributivity properties, embeddings, and effects on cardinal characteristics, thus advancing understanding of forcing at singular cardinals.
Contribution
It provides new results on the distributivity, embeddings, and collapsing properties of perfect tree forcings for singular cardinals, including generalizations to uncountable cofinality.
Findings
The Boolean completion is $( ext{omega}, ext{mu})$-distributive for all $ ext{mu}< ext{kappa}$.
The Boolean algebra satisfies a Sacks-type property, ensuring $( ext{omega}, ext{infinity},< ext{kappa})$-distributivity.
The algebra collapses $ ext{kappa}^ ext{omega}$ to $ ext{h}$ and embeds $ ext{P}( ext{omega})/ ext{Fin}$.
Abstract
We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals , Prikry defined the forcing all perfect subtrees of , and proved that for , assuming the necessary cardinal arithmetic, the Boolean completion of is -distributive for all but -distributivity fails for all , implying failure of the -d.l. These hitherto unpublished results are included, setting the stage for the following recent results. satisfies a Sacks-type property, implying that 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.
