HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, limit cardinals are certain
cardinal number 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 cas ...
s. A cardinal number ''λ'' is a weak limit cardinal if ''λ'' is neither a
successor cardinal In set theory, one can define a successor operation on cardinal numbers in a similar way to the successor operation on the ordinal numbers. The cardinal successor coincides with the ordinal successor for finite cardinals, but in the infinite case th ...
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. A cardinal ''λ'' is a strong limit cardinal if ''λ'' cannot be reached by repeated
powerset In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is po ...
operations. This means that ''λ'' is nonzero and, for all ''κ'' < ''λ'', 2''κ'' < ''λ''. Every strong limit cardinal is also a weak limit cardinal, because ''κ''+ ≤ 2''κ'' for every cardinal ''κ'', where ''κ''+ denotes the successor cardinal of ''κ''. The first infinite cardinal, \aleph_0 (
aleph-naught In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets. They were introduced by the mathematician Georg Cantor and are named after the symbol he used t ...
), is a strong limit cardinal, and hence also a weak limit cardinal.


Constructions

One way to construct limit cardinals is via the union operation: \aleph_ is a weak limit cardinal, defined as the union of all the alephs before it; and in general \aleph_ for any
limit ordinal In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...
''λ'' is a weak limit cardinal. The ב operation can be used to obtain strong limit cardinals. This operation is a map from ordinals to cardinals defined as :\beth_ = \aleph_0, :\beth_ = 2^, (the smallest ordinal equinumerous with the powerset) :If ''λ'' is a limit ordinal, \beth_ = \bigcup \. The cardinal :\beth_ = \bigcup \ = \bigcup_ \beth_ is a strong limit cardinal of cofinality ω. More generally, given any ordinal ''α'', the cardinal :\beth_ = \bigcup_ \beth_ is a strong limit cardinal. Thus there are arbitrarily large strong limit cardinals.


Relationship with ordinal subscripts

If the
axiom of choice In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
holds, every cardinal number has an initial ordinal. If that initial ordinal is \omega_ \,, then the cardinal number is of the form \aleph_\lambda for the same ordinal subscript ''λ''. The ordinal ''λ'' determines whether \aleph_\lambda is a weak limit cardinal. Because \aleph_ = (\aleph_\alpha)^+ \,, if ''λ'' is a successor ordinal then \aleph_\lambda is not a weak limit. Conversely, if a cardinal ''κ'' is a successor cardinal, say \kappa = (\aleph_)^+ \,, then \kappa = \aleph_ \,. Thus, in general, \aleph_\lambda is a weak limit cardinal if and only if ''λ'' is zero or a limit ordinal. Although the ordinal subscript tells us whether a cardinal is a weak limit, it does not tell us whether a cardinal is a strong limit. For example, ZFC proves that \aleph_\omega is a weak limit cardinal, but neither proves nor disproves that \aleph_\omega is a strong limit cardinal (Hrbacek and Jech 1999:168). The generalized continuum hypothesis states that \kappa^+ = 2^ \, for every infinite cardinal ''κ''. Under this hypothesis, the notions of weak and strong limit cardinals coincide.


The notion of inaccessibility and large cardinals

The preceding defines a notion of "inaccessibility": we are dealing with cases where it is no longer enough to do finitely many iterations of the successor and powerset operations; hence the phrase "cannot be reached" in both of the intuitive definitions above. But the "union operation" always provides another way of "accessing" these cardinals (and indeed, such is the case of limit ordinals as well). Stronger notions of inaccessibility can be defined using cofinality. For a weak (respectively strong) limit cardinal ''κ'' the requirement is that cf(''κ'') = ''κ'' (i.e. ''κ'' be regular) so that ''κ'' cannot be expressed as a sum (union) of fewer than ''κ'' smaller cardinals. Such a cardinal is called a weakly (respectively strongly) inaccessible cardinal. The preceding examples both are singular cardinals of cofinality ω and hence they are not inaccessible. \aleph_0 would be an inaccessible cardinal of both "strengths" except that the definition of inaccessible requires that they be uncountable. Standard Zermelo–Fraenkel set theory with the axiom of choice (ZFC) cannot even prove the consistency of the existence of an inaccessible cardinal of either kind above \aleph_0, due to Gödel's incompleteness theorem. More specifically, if \kappa is weakly inaccessible then L_ \models ZFC. These form the first in a hierarchy of
large cardinal In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least ...
s.


See also

*
Cardinal number 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 cas ...


References

* * * {{Citation , last1=Kunen , first1=Kenneth , author1-link=Kenneth Kunen , title=Set theory: An introduction to independence proofs , publisher=
Elsevier Elsevier ( ) is a Dutch academic publishing company specializing in scientific, technical, and medical content. Its products include journals such as ''The Lancet'', ''Cell (journal), Cell'', the ScienceDirect collection of electronic journals, ...
, isbn=978-0-444-86839-8 , year=1980


External links

* http://www.ii.com/math/cardinals/ Infinite ink on cardinals Set theory Cardinal numbers