To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

# Limit cardinal

## From Wikipedia, the free encyclopedia

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.

A cardinal λ is a strong limit cardinal if λ cannot be reached by repeated powerset 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, ${\displaystyle \aleph _{0}}$ (aleph-naught), is a strong limit cardinal, and hence also a weak limit cardinal.

## Constructions

One way to construct limit cardinals is via the union operation: ${\displaystyle \aleph _{\omega }}$ is a weak limit cardinal, defined as the union of all the alephs before it; and in general ${\displaystyle \aleph _{\lambda }}$ for any limit ordinal λ 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

${\displaystyle \beth _{0}=\aleph _{0},}$
${\displaystyle \beth _{\alpha +1}=2^{\beth _{\alpha }},}$ (the smallest ordinal equinumerous with the powerset)
If λ is a limit ordinal, ${\displaystyle \beth _{\lambda }=\bigcup \{\beth _{\alpha }:\alpha <\lambda \}.}$

The cardinal

${\displaystyle \beth _{\omega }=\bigcup \{\beth _{0},\beth _{1},\beth _{2},\ldots \}=\bigcup _{n<\omega }\beth _{n}}$

is a strong limit cardinal of cofinality ω. More generally, given any ordinal α, the cardinal

${\displaystyle \beth _{\alpha +\omega }=\bigcup _{n<\omega }\beth _{\alpha +n}}$

is a strong limit cardinal. Thus there are arbitrarily large strong limit cardinals.

## Relationship with ordinal subscripts

If the axiom of choice holds, every cardinal number has an initial ordinal. If that initial ordinal is ${\displaystyle \omega _{\lambda }\,,}$ then the cardinal number is of the form ${\displaystyle \aleph _{\lambda }}$ for the same ordinal subscript λ. The ordinal λ determines whether ${\displaystyle \aleph _{\lambda }}$ is a weak limit cardinal. Because ${\displaystyle \aleph _{\alpha ^{+}}=(\aleph _{\alpha })^{+}\,,}$ if λ is a successor ordinal then ${\displaystyle \aleph _{\lambda }}$ is not a weak limit. Conversely, if a cardinal κ is a successor cardinal, say ${\displaystyle \kappa =(\aleph _{\alpha })^{+}\,,}$ then ${\displaystyle \kappa =\aleph _{\alpha ^{+}}\,.}$ Thus, in general, ${\displaystyle \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 ${\displaystyle \aleph _{\omega }}$ is a weak limit cardinal, but neither proves nor disproves that ${\displaystyle \aleph _{\omega }}$ is a strong limit cardinal (Hrbacek and Jech 1999:168). The generalized continuum hypothesis states that ${\displaystyle \kappa ^{+}=2^{\kappa }\,}$ 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.

${\displaystyle \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 ${\displaystyle \aleph _{0}}$, due to Gödel's incompleteness theorem. More specifically, if ${\displaystyle \kappa }$ is weakly inaccessible then ${\displaystyle L_{\kappa }\models ZFC}$. These form the first in a hierarchy of large cardinals.

## References

• Hrbacek, Karel; Jech, Thomas (1999), Introduction to Set Theory (3 ed.), ISBN 0-8247-7915-0
• Jech, Thomas (2003), Set Theory, Springer Monographs in Mathematics (third millennium ed.), Berlin, New York: Springer-Verlag, doi:10.1007/3-540-44761-X, ISBN 978-3-540-44085-7
• Kunen, Kenneth (1980), Set theory: An introduction to independence proofs, Elsevier, ISBN 978-0-444-86839-8
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.