Simultaneous reflection and impossible ideals

2012 ◽  
Vol 77 (4) ◽  
pp. 1325-1338 ◽  
Author(s):  
Todd Eisworth

AbstractWe prove that ifholds for a singular cardinalμ, then any collection of fewer than cf(μ) stationary subsets ofμ+must reflect simultaneously.

2021 ◽  
pp. 2150019
Author(s):  
Alejandro Poveda ◽  
Assaf Rinot ◽  
Dima Sinapova

In Part I of this series [5], we introduced a class of notions of forcing which we call [Formula: see text]-Prikry, and showed that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are [Formula: see text]-Prikry. We proved that given a [Formula: see text]-Prikry poset [Formula: see text] and a [Formula: see text]-name for a nonreflecting stationary set [Formula: see text], there exists a corresponding [Formula: see text]-Prikry poset that projects to [Formula: see text] and kills the stationarity of [Formula: see text]. In this paper, we develop a general scheme for iterating [Formula: see text]-Prikry posets, as well as verify that the Extender-based Prikry forcing is [Formula: see text]-Prikry. As an application, we blow-up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all nonreflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds.


2013 ◽  
Vol 78 (2) ◽  
pp. 667-680 ◽  
Author(s):  
Yo Matsubara ◽  
Toshimichi Usuba

AbstractWe introduce the notion of skinniness for subsets of and its variants, namely skinnier and skinniest. We show that under some cardinal arithmetical assumptions, precipitousness or 2λ-saturation of NSκλ ∣ X, where NSκλ denotes the non-stationary ideal over , implies the existence of a skinny stationary subset of X. We also show that if λ is a singular cardinal, then there is no skinnier stationary subset of . Furthermore, if λ is a strong limit singular cardinal, there is no skinny stationary subset of . Combining these results, we show that if λ is a strong limit singular cardinal, then NSκλ ∣ X can satisfy neither precipitousness nor 2λ-saturation for every stationary X ⊆ . We also indicate that , where , is equivalent to the existence of a skinnier (or skinniest) stationary subset of under some cardinal arithmetical hypotheses.


2017 ◽  
Vol 17 (01) ◽  
pp. 1750001 ◽  
Author(s):  
Itay Kaplan ◽  
Saharon Shelah ◽  
Pierre Simon

A theory [Formula: see text] is said to have exact saturation at a singular cardinal [Formula: see text] if it has a [Formula: see text]-saturated model which is not [Formula: see text]-saturated. We show, under some set-theoretic assumptions, that any simple theory has exact saturation. Also, an NIP theory has exact saturation if and only if it is not distal. This gives a new characterization of distality.


2012 ◽  
Vol 77 (3) ◽  
pp. 934-946 ◽  
Author(s):  
Dima Sinapova

AbstractWe show that given ω many supercompact cardinals, there is a generic extension in which the tree property holds at ℵω2+ 1 and the SCH fails at ℵω2.


2021 ◽  
Vol 27 (2) ◽  
pp. 221-222
Author(s):  
Alejandro Poveda

AbstractThe dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle (Part I). In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics (Part II and Part III).We commence Part I by investigating the Identity Crisis phenomenon in the region comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{(n)}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $(\lambda ^{+\omega })^{\mathrm {HOD}}<\lambda ^+$ , for every regular cardinal $\lambda $ .” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal $\lambda $ is singular in HOD and $(\lambda ^+)^{\textrm {{HOD}}}=\lambda ^+$ , there may still be no agreement at all between V and HOD about successors of regular cardinals.In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis (SCH) with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics.Specifically, Part II is devoted to prove the consistency of the Tree Property at both $\kappa ^+$ and $\kappa ^{++}$ , whenever $\kappa $ is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for $\kappa $ and arbitrary failures for the SCH.In the last part of the dissertation (Part III) we introduce the notion of $\Sigma $ -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others.Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every $\kappa ^{++}$ -length iteration with support of size $\leq \kappa $ has the $\kappa ^{++}$ -cc, provided the iterates belong to a relevant class of $\kappa ^{++}$ -cc forcings. While there are a myriad of works on this vein for regular cardinals, this contrasts with the dearth of investigations in the parallel context of singular cardinals. Our main contribution is the proof that such a result is available whenever the class of forcings under consideration is the family of $\Sigma $ -Prikry forcings. Finally, and as an application, we prove that it is consistent—modulo large cardinals—the existence of a strong limit cardinal $\kappa $ with countable cofinality such that $\mathrm {SCH}_\kappa $ fails and every finite family of stationary subsets of $\kappa ^+$ reflects simultaneously.


2020 ◽  
pp. 1-9
Author(s):  
JAMES CUMMINGS ◽  
YAIR HAYUT ◽  
MENACHEM MAGIDOR ◽  
ITAY NEEMAN ◽  
DIMA SINAPOVA ◽  
...  

2000 ◽  
Vol 65 (1) ◽  
pp. 272-284
Author(s):  
Saharon Shelah ◽  
Pauli Väisänen

AbstractSuppose λ is a singular cardinal of uncountable cofinality κ. For a model of cardinality λ, let No() denote the number of isomorphism types of models of cardinality λ which are L∞λ-equivalent to . In [7] Shelah considered inverse κ-systems of abelian groups and their certain kind of quotient limits Gr()/ Fact(). In particular Shelah proved in [7, Fact 3.10] that for every cardinal Μ there exists an inverse κ-system such that consists of abelian groups having cardinality at most Μκ and card(Gr()/ Fact()) = Μ. Later in [8, Theorem 3.3] Shelah showed a strict connection between inverse κ-systems and possible values of No (under the assumption that θκ < λ for every θ < λ): if is an inverse κ-system of abelian groups having cardinality < λ, then there is a model such that card() = λ and No() = card(Gr()/ Fact()). The following was an immediate consequence (when θκ < λ for every θ < λ): for every nonzero Μ < λ or Μ = λκ there is a model , of cardinality λ with No() = Μ. In this paper we show: for every nonzero Μ ≤ λκ there is an inverse κ-system of abelian groups having cardinality < λ such that card(Gr()/ Fact()) = Μ (under the assumptions 2κ < λ and θ<κ < λ for all θ < λ when Μ > λ), with the obvious new consequence concerning the possible value of No. Specifically, the case No() = λ is possible when θκ > λ for every λ < λ.


Sign in / Sign up

Export Citation Format

Share Document