Aleph number

From Example Problems
Jump to: navigation, search
This article is about the aleph numbers. For Aleph One as it pertains to the Marathon computer game, see that article.

In the branch of mathematics known as set theory, the aleph numbers are a series of numbers used to represent the cardinality (or size) of infinite sets. They are named after the symbol used to denote them, the Hebrew letter aleph (\aleph ).

The cardinality of the natural numbers is aleph-null (\aleph _{0}) (also aleph-naught, aleph-nought); the next larger cardinality is aleph-one \aleph _{1}, then \aleph _{2} and so on. Continuing in this manner, it is possible to define a cardinal number \aleph _{\alpha } for every ordinal number α, as will be described below.

The concept goes back to Georg Cantor, who defined the notion of cardinality and realized that infinite sets can have different cardinalities.

It should be noted that the aleph numbers are not the same as the infinity (∞) commonly found in algebra and calculus. Alephs measure the sizes of sets. Infinity, however, could roughly be defined as the extreme limit of the real number line. While some alephs are larger than others, ∞ is just ∞.


Aleph-null (\aleph _{0}) is by definition the cardinality of the set of all natural numbers, and (assuming, as usual, the axiom of choice) is the smallest of all infinite cardinalities. A set has cardinality \aleph _{0} if and only if it is countably infinite, which is the case if and only if it can be put into a direct one-to-one correspondence with the integers. Such sets include the set of all prime numbers and the set of all rational numbers.


\aleph _{1} is the cardinality of the set of all countably infinite ordinal numbers, called ω1 or Ω. This definition implies (already in ZF, Zermelo-Fraenkel set theory without the axiom of choice) that no cardinal number is between \aleph _{0} and \aleph _{1}. If the axiom of choice (AC) is used, it can be further proved that the class of cardinal numbers is totally ordered, and thus \aleph _{1} is the second-smallest infinite cardinal number. Using AC we can show one of the most useful properties of the set Ω (the standard example of a set of size \aleph _{1}): any countable subset of Ω has an upper bound (with respect to the standard well-ordering of ordinals) in Ω (the proof is easy: a countable union of countable sets is countable; this is one of the most common applications of AC). This fact is analogous to the situation in \aleph _{0}: any finite set of natural numbers (subset of ω) has a maximum which is also a natural number (has an upper bound in ω) — finite unions of finite sets are finite.

Ω is actually a useful concept, if somewhat exotic-sounding. An example application is "closing" with respect to countable operations; e.g., trying to explicitly describe the sigma-algebra generated by an arbitrary collection of subsets. This is harder than most explicit descriptions of "generation" in algebra (for example vector spaces, groups, etc.) because in those cases we only have to close with respect to finite operations — sums, products, and the like. The process involves defining, for each countable ordinal, via transfinite induction, a set by "throwing in" all possible countable unions and complements, and taking the union of all that over all of Ω.

The continuum hypothesis

The cardinality of the set of real numbers is 2^{{\aleph _{0}}}. It is not clear where this number fits in the aleph number hierarchy. It follows from ZFC (Zermelo-Fraenkel set theory with the axiom of choice) that the celebrated continuum hypothesis, CH, is equivalent to the identity

2^{{\aleph _{0}}}=\aleph _{1}.

CH is independent of ZFC: it can be neither proven nor disproven within the context of that axiom system. That it is consistent with ZFC was demonstrated by Kurt Gödel in 1940; that it is independent of ZFC was demonstrated by Paul Cohen in 1963.


Conventionally the smallest infinite ordinal is denoted ω, and the cardinal number \aleph _{\omega } is the smallest upper bound of

\left\{\,\aleph _{n}:n\in \left\{\,0,1,2,\dots \,\right\}\,\right\}.

Aleph-ω is the first uncountable cardinal number that can be demonstrated within Zermelo-Fraenkel set theory not to be equal to the cardinality of the set of all real numbers; for any positive integer n we can consistently assume that 2^{{\aleph _{0}}}=\aleph _{n}, and moreover it is possible to assume 2^{{\aleph _{0}}} is as large as we like. We are only forced to avoid setting it to certain special cardinals with cofinality \aleph _{0}, meaning there is an unbounded function from \aleph _{0} to it.

Aleph-α for general α

To define aleph-α for arbitrary ordinal number α, we need the successor cardinal operation, which assigns to any cardinal number ρ the next bigger cardinal \rho ^{+}.

We can then define the aleph numbers as follows

\aleph _{0}=\omega
\aleph _{{\alpha +1}}=\aleph _{{\alpha }}^{+}

and for λ, an infinite limit ordinal,

\aleph _{{\lambda }}=\bigcup _{{\beta <\lambda }}\aleph _{\beta }.

See also

es:Alef-0 he:אלף 0 sv:Aleftal