Singular cardinals hypothesis

Last updated

In set theory, the singular cardinals hypothesis (SCH) arose from the question of whether the least cardinal number for which the generalized continuum hypothesis (GCH) might fail could be a singular cardinal.

According to Mitchell (1992), the singular cardinals hypothesis is:

If κ is any singular strong limit cardinal, then 2κ = κ+.

Here, κ+ denotes the successor cardinal of κ.

Since SCH is a consequence of GCH, which is known to be consistent with ZFC, SCH is consistent with ZFC. The negation of SCH has also been shown to be consistent with ZFC, if one assumes the existence of a sufficiently large cardinal number. In fact, by results of Moti Gitik, ZFC + ¬SCH is equiconsistent with ZFC + the existence of a measurable cardinal κ of Mitchell order κ++.

Another form of the SCH is the following statement:

2cf(κ) < κ implies κcf(κ) = κ+,

where cf denotes the cofinality function. Note that κcf(κ)= 2κ for all singular strong limit cardinals κ. The second formulation of SCH is strictly stronger than the first version, since the first one only mentions strong limits. From a model in which the first version of SCH fails at ω and GCH holds above ω+2, we can construct a model in which the first version of SCH holds but the second version of SCH fails, by adding ω Cohen subsets to n for some n.

Jack Silver proved that if κ is singular with uncountable cofinality and 2λ = λ+ for all infinite cardinals λ < κ, then 2κ = κ+. Silver's original proof used generic ultrapowers. The following important fact follows from Silver's theorem: if the singular cardinals hypothesis holds for all singular cardinals of countable cofinality, then it holds for all singular cardinals. In particular, then, if is the least counterexample to the singular cardinals hypothesis, then .

The negation of the singular cardinals hypothesis is intimately related to violating the GCH at a measurable cardinal. A well-known result of Dana Scott is that if the GCH holds below a measurable cardinal on a set of measure one—i.e., there is normal -complete ultrafilter D on such that , then . Starting with a supercompact cardinal, Silver was able to produce a model of set theory in which is measurable and in which . Then, by applying Prikry forcing to the measurable , one gets a model of set theory in which is a strong limit cardinal of countable cofinality and in which —a violation of the SCH. Gitik, building on work of Woodin, was able to replace the supercompact in Silver's proof with measurable of Mitchell order . That established an upper bound for the consistency strength of the failure of the SCH. Gitik again, using results of inner model theory, was able to show that a measurable cardinal of Mitchell order is also the lower bound for the consistency strength of the failure of SCH.

A wide variety of propositions imply SCH. As was noted above, GCH implies SCH. On the other hand, the proper forcing axiom, which implies and hence is incompatible with GCH also implies SCH. Solovay showed that large cardinals almost imply SCH—in particular, if is strongly compact cardinal, then the SCH holds above . On the other hand, the non-existence of (inner models for) various large cardinals (below a measurable cardinal of Mitchell order ) also imply SCH.

Related Research Articles

In mathematics, specifically set theory, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states that

there is no set whose cardinality is strictly between that of the integers and the real numbers,

<span class="mw-page-title-main">Cardinal number</span> Size of a possibly infinite set

In mathematics, a cardinal number, or cardinal for short, is what is commonly called the number of elements of a set. In the case of a finite set, its cardinal number, or cardinality is therefore a natural number. For dealing with the case of infinite sets, the infinite cardinal numbers have been introduced, which are often denoted with the Hebrew letter (aleph) marked with subscript indicating their rank among the infinite cardinals.

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A.

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal κ is strongly inaccessible if it is uncountable, it is not a sum of fewer than κ cardinals smaller than κ, and implies .

In mathematics, a Mahlo cardinal is a certain kind of large cardinal number. Mahlo cardinals were first described by Paul Mahlo. As with all large cardinals, none of these varieties of Mahlo cardinals can be proven to exist by ZFC.

In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Hanf & Scott (1961).

In mathematics, a measurable cardinal is a certain kind of large cardinal number. In order to define the concept, one introduces a two-valued measure on a cardinal κ, or more generally on any set. For a cardinal κ, it can be described as a subdivision of all of its subsets into large and small sets such that κ itself is large, and all singletons {α}, ακ are small, complements of small sets are large and vice versa. The intersection of fewer than κ large sets is again large.

In set theory, a Woodin cardinal is a cardinal number such that for all functions

In set theory, a supercompact cardinal is a type of large cardinal. They display a variety of reflection properties.

<span class="mw-page-title-main">Aleph number</span> Infinite cardinal number

In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality of infinite sets that can be well-ordered. They were introduced by the mathematician Georg Cantor and are named after the symbol he used to denote them, the Semitic letter aleph.

In axiomatic set theory, the gimel function is the following function mapping cardinal numbers to cardinal numbers:

In mathematics, limit cardinals are certain cardinal numbers. A cardinal number λ is a weak limit cardinal if λ is neither a successor cardinal nor zero. This means that one cannot "reach" λ from another cardinal by repeated successor operations. These cardinals are sometimes called simply "limit cardinals" when the context is clear.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that is a regular cardinal if and only if every unbounded subset has cardinality . Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular.

In mathematics, particularly in set theory, the beth numbers are a certain sequence of infinite cardinal numbers, conventionally written , where is the second Hebrew letter (beth). The beth numbers are related to the aleph numbers, but unless the generalized continuum hypothesis is true, there are numbers indexed by that are not indexed by .

In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. Easton (1970) showed via forcing that the only constraints on permissible values for 2κ when κ is a regular cardinal are

In the mathematical field of set theory, the proper forcing axiom (PFA) is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings.

In set theory, an Aronszajn tree is a tree of uncountable height with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal κ, a κ-Aronszajn tree is a tree of height κ in which all levels have size less than κ and all branches have height less than κ. They are named for Nachman Aronszajn, who constructed an Aronszajn tree in 1934; his construction was described by Kurepa (1935).

Moti Gitik is a mathematician, working in set theory, who is professor at the Tel-Aviv University. He was an invited speaker at the 2002 International Congresses of Mathematicians, and became a fellow of the American Mathematical Society in 2012.

This is a glossary of set theory.

References