The tree property at κ+ states that there are no Aronszajn trees on κ+, or, equivalently, that every κ+ tree has a cofinal branch. For singular strong limit cardinals κ, there is tension between the tree property at κ+ and failure of the singular cardinal hypothesis at κ; the former is typically the result of the presence of strongly compact cardinals in the background, and the latter is impossible above strongly compacts. In this paper, we reconcile (...) the two. We prove from large cardinals that the tree property at κ+ is consistent with failure of the singular cardinal hypothesis at κ. (shrink)

The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping Reflection Principle, a consequence of PFA. While the results fall short of showing that MRP implies SCH, it will be shown that MRP implies that if SCH fails first at κ then every stationary subset of reflects. It will also (...) be demonstrated that MRP always fails in a generic extension by Prikry forcing. (shrink)

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem. Suppose κ is a singular strong limit cardinal and 2κ λ where λ is not the successor of a cardinal of cofinality at most κ. If cf > ω then it follows that o λ, and if cf = ωthen either o λ or {α: K (...) o α+n} is confinal in κ for each n ε ω.We also prove several results which extend or are related to this result, notably Theorem. If 2ω ω1 then there is a sharp for a model with a strong cardinal.In order to prove these theorems we give a detailed analysis of the sequences of indiscernibles which come from applying the covering lemma to nonoverlapping sequences of extenders. (shrink)

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof uses the reflection principle MRP introduced by Moore in [11].

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

We show that o = k++ is necessary for ¬SCH. Together with previous results it provides the exact strenght of ¬SCH.

This paper attempts to present and organize several problems in the theory of Singular Cardinals. The most famous problems in the area (bounds for the ℶ-function at singular cardinals) are well known to all mathematicians with even a rudimentary interest in set theory. However, it is less well known that the combinatorics of singular cardinals is a thriving area with results and problems that do not depend on a solution of the Singular Cardinals Hypothesis. We (...) present here an annotated collection of representative problems with some references. Where the problems are novel, attribution is attempted and it is noted where money is attached to particular problems. Three closely related themes are represented in these problems: stationary sets and stationary set reflection, variations of square and approachability, and the singular cardinals hypothesis. Underlying many of them are ideas from Shelah's PCF theory. Important subthemes were mutual stationarity, Aronszajn trees, and superatomic Boolean Algebras. The author notes considerable overlap between this paper and the unpublished report submitted to the Banff Center for the Workshop on Singular Cardinals Combinatorics, May 1–5, 2004. (shrink)

The purpose of this communication is to present some recent advances on the consequences that forcing axioms and large cardinals have on the combinatorics of singular cardinals. I will introduce a few examples of problems in singular cardinal combinatorics which can be fruitfully attacked using ideas and techniques coming from the theory of forcing axioms and then translate the results so obtained in suitable large cardinals properties.The first example I will treat is the proof that the proper (...) forcing axiom PFA implies the singular cardinal hypothesis SCH, this will easily lead to a new proof of Solovay's theorem that SCH holds above a strongly compact cardinal. I will also outline how some of the ideas involved in these proofs can be used as means to evaluate the “saturation” properties of models of strong forcing axioms like MM or PFA.The second example aims to show that the transfer principle ↠ fails assuming Martin's Maximum MM. Also in this case the result can be translated in a large cardinal property, however this requires a familiarity with a rather large fragment of Shelah's pcf-theory.Only sketchy arguments will be given, the reader is referred to the forthcoming [25] and [38] for a thorough analysis of these problems and for detailed proofs. (shrink)

From large cardinals we obtain the consistency of the existence of a singular cardinal κ of cofinality ω at which the Singular Cardinals Hypothesis fails, there is a bad scale at κ and κ ++ has the tree property. In particular this model has no special κ +-trees.

Given a regular cardinal λ and λ many supercompact cardinals, we describe a type of forcing such that in the generic extension there is a cardinal κ with cofinality λ, the Singular Cardinal Hypothesis at κ fails, and the tree property holds at κ+.

In Part I of this series [A. Poveda, A. Rinot and D. Sinapova, Sigma-Prikry forcing I: The axioms, Canad. J. Math. 73(5) (2021) 1205–1238], 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 center around singular cardinals of countable cofinality are [Formula: see text]-Prikry. We showed that given a [Formula: see text]-Prikry poset [Formula: see text] and a [Formula: see text]-name for a (...) non-reflecting 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 and, as an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting 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. (shrink)

We determine exact consistency strengths for various failures of the Singular Cardinals Hypothesis (SCH) in the setting of the Zermelo-Fraenkel axiom system ZF without the Axiom of Choice (AC). By the new notion of parallel Prikry forcing that we introduce, we obtain surjective failures of SCH using only one measurable cardinal, including a surjective failure of Shelah's pcf theorem about the size of the power set of $\aleph _{\omega}$ . Using symmetric collapses to $\aleph _{\omega}$ , $\aleph (...) _{\omega _{1}}$ , or $\aleph _{\omega _{2}}$ , we show that injective failures at $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ , or $\aleph _{\omega _{2}}$ can have relatively mild consistency strengths in terms of Mitchell orders of measurable cardinals. Injective failures of both the aforementioned theorem of Shelah and Silver's theorem that GCH cannot first fail at a singular strong limit cardinal of uncountable cofinality are also obtained. Lower bounds are shown by core model techniques and methods due to Gitik and Mitchell. (shrink)

The 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. In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics.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^{}$ -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 “ $^{\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 $^{\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 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 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. (shrink)

In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ 1 -definable in (H(ω 2 ), ∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω 1 , ω 1 * , C, C * where X is any suborder of the reals of size (...) ω 1 and C is any Countryman line. Third, the Proper Forcing Axiom implies the Singular Cardinals Hypothesis at κ unless stationary subsets of S κ + ω reflect. The techniques are expected to be applicable to other open problems concerning the theory of H(ω 2 ). (shrink)

I use generic embeddings induced by generic normal measures on that can be forced to exist if κ is an indestructibly weakly compact cardinal. These embeddings can be applied in order to obtain the forcing axioms in forcing extensions. This has consequences in : The Singular Cardinal Hypothesis holds above κ, and κ has a useful Jónsson-like property. This in turn implies that the countable tower works much like it does when κ is a Woodin limit (...) of Woodin cardinals. One consequence is that every set of reals in the Chang model is Lebesgue measurable and has the Baire Property, the Perfect Set Property and the Ramsey Property. So indestructible weak compactness has effects on cardinal arithmetic high up and also on the structure of sets of real numbers, down low, similar to supercompactness. (shrink)

Our theme is that not every interesting question in set theory is independent of ZFC. We give an example of a first order theory T with countable D(T) which cannot have a universal model at ℵ1 without CH; we prove in ZFC a covering theorem from the hypothesis of the existence of a universal model for some theory; and we prove--again in ZFC--that for a large class of cardinals there is no universal linear order (e.g. in every regular $\aleph_1 (...) < \lambda < 2^{\aleph_0}$). In fact, what we show is that if there is a universal linear order at a regular λ and its existence is not a result of a trivial cardinal arithmetical reason, then λ "resembles" ℵ1--a cardinal for which the consistency of having a universal order is known. As for singular cardinals, we show that for many singular cardinals, if they are not strong limits then they have no universal linear order. As a result of the nonexistence of a universal linear order, we show the nonexistence of universal models for all theories possessing the strict order property (for example, ordered fields and groups, Boolean algebras, p-adic rings and fields, partial orders, models of PA and so on). (shrink)

We show how to construct Gitik’s short extenders gap-3 forcing using a morass, and that the forcing notion is of Prikry type.

We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinal axioms, ranging from supercompactness to rank-to-rank embeddings. The majority of these large cardinal properties can be defined in terms of suitable elementary embeddings j:Vγ→Vλ. One key observation is that such embeddings are uniquely determined by the image structures j[Vγ]≺Vλ. These structures will be the prototypes guessing models. We (...) shall show, using guessing models M, how to prove for the ordinal κM=jM) many of the combinatorial properties that we can prove for the cardinal j) using the structure j[Vγ]≺Vj. κM will always be a regular cardinal, but consistently can be a successor and guessing models M with κM=ℵ2 exist assuming the proper forcing axiom. By means of these models we shall introduce a new structural property of models of PFA: the existence of a “Laver function” f:ℵ2→Hℵ2 sharing the same features of the usual Laver functions f:κ→Hκ provided by a supercompact cardinal κ. Further applications of our analysis will be proofs of the singular cardinal hypothesis and of the failure of the square principle assuming the existence of guessing models. In particular the failure of square shows that the existence of guessing models is a very strong assumption in terms of large cardinal strength. (shrink)

Answering a question of Pereira we show that it is possible to have a model violating the Singular Cardinal Hypothesis without a tree-like continuous scale.

We show that, assuming the consistency of a supercompact cardinal, the first inaccessible cardinal can satisfy a strong form of a Löwenheim–Skolem–Tarski theorem for the equicardinality logic L, a logic introduced in [5] strictly between first order logic and second order logic. On the other hand we show that in the light of present day inner model technology, nothing short of a supercompact cardinal suffices for this result. In particular, we show that the Löwenheim–Skolem–Tarski theorem for the (...) equicardinality logic at κ implies the Singular Cardinals Hypothesis above κ as well as Projective Determinacy. (shrink)

In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency (...) strength of this situation for $\operatorname {\mathrm {cf}}(\nu ) = \omega $ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon. (shrink)

Motivated by the goal of constructing a model in which there are no κ-Aronszajn trees for any regular $k>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square fail.

We investigate the compatibility of $$I_0$$ with various combinatorial principles at $$\lambda ^+$$, which include the existence of $$\lambda ^+$$ -Aronszajn trees, square principles at $$\lambda $$, the existence of good scales at $$\lambda $$, stationary reflections for subsets of $$\lambda ^{+}$$, diamond principles at $$\lambda $$ and the singular cardinal hypothesis at $$\lambda $$. We also discuss whether these principles can hold in $$L(V_{\lambda +1})$$.

I describe several ways in which forcing arguments can be used to yield clean and conceptual proofs of nonreducibility, ergodicity and other results in the theory of analytic equivalence relations. In particular, I present simple Borel equivalence relationsE, Fsuch that a natural proof of nonreducibility ofEtoFuses the independence of the Singular Cardinal Hypothesis at ℵω.

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this (...) framework.We also present an application to homogeneous model theory: for [Formula: see text] a homogeneous diagram in a first-order theory [Formula: see text], if [Formula: see text] is both stable in [Formula: see text] and categorical in [Formula: see text] then [Formula: see text] is stable in all [Formula: see text]. (shrink)

We show that Gitik’s short extender gap-2 forcing is of Prikry type.

We construct a model in which the singular cardinal hypothesis fails at ℵωℵω. We use characterizations of genericity to show the existence of a projection between different Prikry type forcings.

We give simple proofs of the Singular Cardinal Hypothesis from the Weak Reflection Principle and the Fodor-type Reflection Principle which do not use better scales.

We prove equiconsistency results concerning gaps between a singular strong limit cardinal κ of cofinality 0 and its power under assumptions that 2κ=κ+δ+1 for δ<κ and some weak form of the Singular Cardinal Hypothesis below κ. Together with the previous results this basically completes the study of consistency strength of the various gaps between such κ and its power under GCH type assumptions below.

The extender based Prikry forcing notion is being generalized to super compact extenders.

We study the role of meeting numbers in pcf theory. In particular, Shelah's Strong Hypothesis is shown to be equivalent to the assertion that for any singular cardinal σ of cofinality ω, there is a size collection Q of countable subsets of σ with the property that for any infinite subset a of σ, there is a member of Q meeting a in an infinite set.

We contribute to the study of generalizations of the Perfect Set Property and the Baire Property to subsets of spaces of higher cardinalities, like the power set ${\mathcal {P}}({\lambda })$ of a singular cardinal $\lambda $ of countable cofinality or products $\prod _{i<\omega }\lambda _i$ for a strictly increasing sequence $\langle {\lambda _i}~\vert ~{i<\omega }\rangle $ of cardinals. We consider the question under which large cardinal hypothesis classes of definable subsets of these spaces possess such regularity (...) properties, focusing on rank-into-rank axioms and classes of sets definable by $\Sigma _1$ -formulas with parameters from various collections of sets. We prove that $\omega $ -many measurable cardinals, while sufficient to prove the perfect set property of all $\Sigma _1$ -definable sets with parameters in $V_\lambda \cup \{V_\lambda \}$, are not enough to prove it if there is a cofinal sequence in $\lambda $ in the parameters. For this conclusion, the existence of an I2-embedding is enough, but there are parameters in $V_{\lambda +1}$ for which I2 is still not enough. The situation is similar for the Baire property: under I2 all sets that are $\Sigma _1$ -definable using elements of $V_\lambda $ and a cofinal sequence as parameters have the Baire property, but I2 is not enough for some parameter in $V_{\lambda +1}$. Finally, the existence of an I0-embedding implies that all sets that are $\Sigma ^1_n$ -definable with parameters in $V_{\lambda +1}$ have the Baire property. (shrink)

In their paper from 1981, Milner and Sauer conjectured that for any poset $\langle P,\le\rangle$ , if $cf(P,\le)=\lambda>cf(\lambda)=\kappa$ , then P must contain an antichain of size κ. We prove that for λ > cf(λ) = κ, if there exists a cardinal μ < λ such that cov(λ, μ, κ, 2) = λ, then any poset of cofinality λ contains λ κ antichains of size κ. The hypothesis of our theorem is very weak and is a consequence of (...) many well-known axioms such as GCH, SSH and PFA. The consistency of the negation of this hypothesis is unknown. (shrink)

The paper is a continuation of [The SCH revisited]. In § 1 we define a forcing with countably many nice systems. It is used, for example, to construct a model "GCH below κ, c f κ = ℵ0, and $2^\kappa > \kappa^{+\omega}$" from 0(κ) = κ+ω. In § 2 we define a triangle iteration and use it to construct a model satisfying "{μ ≤ λ∣ c f μ = ℵ0 and $pp(\mu) > \lambda\}$ is countable for some λ". The question (...) of whether this is possible was asked by S. Shelah. In § 3 a forcing for blowing the power of a singular cardinal without collapsing cardinals or adding new bounded subsets is presented. Answering a question of H. Woodin, we show that it is consistent to have "c f κ = ℵ0, GCH below $\kappa, 2^\kappa > \kappa^+$, and ¬□* κ". In § 4 a variation of the forcing of [The SCH revisited, § 1] is defined. It behaves nicely in iteration processes. As an application, we sketch a construction of a model satisfying: "κ is a measurable and 2κ ≥ κ+α for some $\alpha, \kappa < c f \alpha < \alpha$" starting with 0(κ) = κ+α. This answers the question from Gitik's On measurable cardinals violating the continuum hypothesis. (shrink)

We prove that if λ is a strong limit singular cardinal and κ a regular uncountable cardinal < λ, then NSκλ, the non-stationary ideal over [Formula: see text], is nowhere precipitous. We also show that under the same hypothesis every stationary subset of [Formula: see text] can be partitioned into λκ disjoint stationary sets.

§1. Introduction. Among the most remarkable discoveries in set theory in the last quarter century is the rich structure of the arithmetic of singular cardinals, and its deep relationship to large cardinals. The problem of finding a complete set of rules describing the behavior of the continuum function 2ℵα for singular ℵα's, known as the Singular Cardinals Problem, has been attacked by many different techniques, involving forcing, large cardinals, inner models, and various combinatorial methods. The work on (...) the singular cardinals problem has led to many often surprising results, culminating in a beautiful theory of Saharon Shelah called the pcf theory. The most striking result to date states that if 2ℵn < ℵω for every n = 0, 1, 2, …, then 2ℵω < ℵω4.In this paper we present a brief history of the singular cardinals problem, the present knowledge, and an introduction into Shelah's pcf theory. In Sections 2, 3 and 4 we introduce the reader to cardinal arithmetic and to the singular cardinals problems. Sections 5, 6, 7 and 8 describe the main results and methods of the last 25 years and explain the role of large cardinals in the singular cardinals problem. In Section 9 we present an outline of the pcf theory.§2. The arithmetic of cardinal numbers. Cardinal numbers were introduced by Cantor in the late 19th century and problems arising from investigations of rules of arithmetic of cardinal numbers led to the birth of set theory. The operations of addition, multiplication and exponentiation of infinite cardinal numbers are a natural generalization of such operations on integers. Addition and multiplication of infinite cardinals turns out to be simple: when at least one of the numbers κ, λ is infinite then both κ + λ and κ·λ are equal to max {κ, λ}. In contrast with + and ·, exponentiation presents fundamental problems. In the simplest nontrivial case, 2κ represents the cardinal number of the power set P, the set of all subsets of κ. (Here we adopt the usual convention of set theory that the number κ is identified with a set of cardinality κ, namely the set of all ordinal numbers smaller than κ. (shrink)

We show that from a supercompact cardinal $\kappa$, there is a forcing extension $V[G]$ that has a symmetric inner model $N$ in which $\mathrm {ZF}+\lnot\mathrm {AC}$ holds, $\kappa$ and $\kappa^{+}$ are both singular, and the continuum function at $\kappa$ can be precisely controlled, in the sense that the final model contains a sequence of distinct subsets of $\kappa$ of length equal to any predetermined ordinal. We also show that the above situation can be collapsed to obtain a model (...) of $\mathrm {ZF}+\lnot\mathrm {AC}_{\omega}$ in which either $\aleph_{1}$ and $\aleph_{2}$ are both singular and the continuum function at $\aleph_{1}$ can be precisely controlled, or $\aleph_{\omega}$ and $\aleph_{\omega+1}$ are both singular and the continuum function at $\aleph_{\omega}$ can be precisely controlled. Additionally, we discuss a result in which we separate the lengths of sequences of distinct subsets of consecutive singular cardinals $\kappa$ and $\kappa^{+}$ in a model of $\mathrm {ZF}$. Some open questions concerning the continuum function in models of $\mathrm {ZF}$ with consecutive singular cardinals are posed. (shrink)

Abstract.We investigate the existence of strong colorings on successors of singular cardinals. This work continues Section 2 of [1], but now our emphasis is on finding colorings of pairs of ordinals, rather than colorings of finite sets of ordinals.

We present a survey of combinatorial set theory relevant to the study of singular cardinals and their successors. The topics covered include diamonds, squares, club guessing, forcing axioms, and PCF theory.

The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa $ is strongly compact if and only if the strong tree property holds at $\kappa $, and supercompact if and only if ITP holds at $\kappa $. We present several results motivated by the problem of obtaining the strong tree property and ITP at many successive cardinals (...) simultaneously; these results focus on the successors of singular cardinals. We describe a general class of forcings that will obtain the strong tree property and ITP at the successor of a singular cardinal of any cofinality. Generalizing a result of Neeman about the tree property, we show that it is consistent for ITP to hold at $\aleph _n$ for all $2 \leq n < \omega $ simultaneously with the strong tree property at $\aleph _{\omega +1}$ ; we also show that it is consistent for ITP to hold at $\aleph _n$ for all $3 < n < \omega $ and at $\aleph _{\omega +1}$ simultaneously. Finally, turning our attention to singular cardinals of uncountable cofinality, we show that it is consistent for the strong and super tree properties to hold at successors of singulars of multiple cofinalities simultaneously. (shrink)