Sigma-Prikry forcing I: The Axioms

Joint work with Alejandro Poveda and Dima Sinapova.

Abstract. We introduce a class of notions of forcing which we call Σ-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are Σ-Prikry. We show that given a Σ-Prikry poset P and a name for a non-reflecting stationary set T, there exists a corresponding Σ-Prikry poset that projects to P and kills the stationarity of T. Then, in a sequel to this paper, we develop an iteration scheme for Σ-Prikry posets. Putting the two works together, we obtain a proof of the following.

Theorem. If κ is the limit of a countable increasing sequence of supercompact cardinals, then there exists a forcing extension in which κ remains a strong limit cardinal, every finite collection of stationary subsets of κ+ reflects simultaneously, and 2κ=κ++.

Downloads:

Citation information:

A. Poveda, A. Rinot and D. Sinapova, Sigma-Prikry forcing I: The axioms, Canad. J. Math., 73(5): 1205-1238, 2021.

 

This entry was posted in Compactness, Publications, Singular Cardinals Combinatorics and tagged , , , , , . Bookmark the permalink.

One Response to Sigma-Prikry forcing I: The Axioms

  1. saf says:

    Submitted to Canadian Journal of Mathematics, September 2019.
    Accepted, May 2020.

Comments are closed.