In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets that can be well-ordered. They were introduced by the mathematician Georg Cantor^[1] and are named after the symbol he used to denote them, the Hebrew letter aleph (ℵ).^[2][a]

The cardinality of the natural numbers is ℵ₀ (read aleph-nought, aleph-zero, or aleph-null), the next larger cardinality of a well-ordered set is aleph-one ℵ₁, then ℵ₂ and so on. Continuing in this manner, it is possible to define a cardinal number ℵ_α for every ordinal number α, as described below.

The concept and notation are due to Georg Cantor,^[5] who defined the notion of cardinality and realized that infinite sets can have different cardinalities.

The aleph numbers differ from the infinity (∞) commonly found in algebra and calculus, in that the alephs measure the sizes of sets, while infinity is commonly defined either as an extreme limit of the real number line (applied to a function or sequence that "diverges to infinity" or "increases without bound"), or as an extreme point of the extended real number line.

ℵ₀ (aleph-nought, aleph-zero, or aleph-null) is the cardinality of the set of all natural numbers, and is an infinite cardinal. The set of all finite ordinals, called ω or ω₀ (where ω is the lowercase Greek letter omega), has cardinality ℵ₀. A set has cardinality ℵ₀ if and only if it is countably infinite, that is, there is a bijection (one-to-one correspondence) between it and the natural numbers. Examples of such sets are

• the set of natural numbers, irrespective of including or excluding zero,
• the set of all integers,
• any infinite subset of the integers, such as the set of all square numbers or the set of all prime numbers,
• the set of all rational numbers,
• the set of all constructible numbers (in the geometric sense),
• the set of all algebraic numbers,
• the set of all computable numbers,
• the set of all computable functions,
• the set of all binary strings of finite length, and
• the set of all finite subsets of any given countably infinite set.

These infinite ordinals: ω, ω + 1, ω⋅2, ω² are among the countably infinite sets.^[6] For example, the sequence (with ordinality ω⋅2) of all positive odd integers followed by all positive even integers

{1, 3, 5, 7, 9, ...; 2, 4, 6, 8, 10, ...}

is an ordering of the set (with cardinality ℵ₀) of positive integers.

If the axiom of countable choice (a weaker version of the axiom of choice) holds, then ℵ₀ is smaller than any other infinite cardinal, and is therefore the (unique) least infinite ordinal.

ℵ₁ is, by definition, the cardinality of the set of all countable ordinal numbers. This set is denoted by ω₁ (or sometimes Ω). The set ω₁ is itself an ordinal number larger than all countable ones, so it is an uncountable set. Therefore, ℵ₁ is distinct from ℵ₀. The definition of ℵ₁ implies (in ZF, Zermelo–Fraenkel set theory without the axiom of choice) that no cardinal number is between ℵ₀ and ℵ₁. If the axiom of choice is used, it can be further proved that the class of cardinal numbers is totally ordered, and thus ℵ₁ is the second-smallest infinite cardinal number. One can show one of the most useful properties of the set ω₁: Any countable subset of ω₁ has an upper bound in ω₁ (this follows from the fact that the union of a countable number of countable sets is itself countable). This fact is analogous to the situation in ℵ₀: Every finite set of natural numbers has a maximum which is also a natural number, and finite unions of finite sets are finite.

The ordinal ω₁ 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 σ-algebra generated by an arbitrary collection of subsets (see e.g. Borel hierarchy). This is harder than most explicit descriptions of "generation" in algebra (vector spaces, groups, etc.) because in those cases we only have to close with respect to finite operations – sums, products, etc. 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 cardinality of the set of real numbers (cardinality of the continuum) is 2^ℵ₀. It cannot be determined from ZFC (Zermelo–Fraenkel set theory augmented with the axiom of choice) where this number fits exactly in the aleph number hierarchy, but it follows from ZFC that the continuum hypothesis (CH) is equivalent to the identity

2^ℵ₀ = ℵ₁.^[7]

The CH states that there is no set whose cardinality is strictly between that of the integers and the real numbers.^[8] CH is independent of ZFC: It can be neither proven nor disproven within the context of that axiom system (provided that ZFC is consistent). That CH is consistent with ZFC was demonstrated by Kurt Gödel in 1940, when he showed that its negation is not a theorem of ZFC. That it is independent of ZFC was demonstrated by Paul Cohen in 1963, when he showed conversely that the CH itself is not a theorem of ZFC – by the (then-novel) method of forcing.^[7][9]

Aleph-omega is

ℵ_ω = sup{ ℵ_n | n ∈ ω } = sup{ ℵ_n | n ∈ {0, 1, 2, ...} }

where the smallest infinite ordinal is denoted as ω. That is, the cardinal number ℵ_ω is the least upper bound of

{ ℵ_n | n ∈ {0, 1, 2, ...} }.

Notably, ℵ_ω 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 2^ℵ₀: For any natural number n ≥ 1, we can consistently assume that 2^ℵ₀ = ℵ_n, and moreover it is possible to assume that 2^ℵ₀ is as least as large as any cardinal number we like. The main restriction ZFC puts on the value of 2^ℵ₀ is that it cannot equal certain special cardinals with cofinality ℵ₀. An uncountably infinite cardinal κ having cofinality ℵ₀ means that there is a (countable-length) sequence κ₀ ≤ κ₁ ≤ κ₂ ≤ ... of cardinals κ_i < κ whose limit (i.e. its least upper bound) is κ (see Easton's theorem). As per the definition above, ℵ_ω is the limit of a countable-length sequence of smaller cardinals.

To define ℵ_α for arbitrary ordinal number α, we must define the successor cardinal operation, which assigns to any cardinal number ρ the next larger well-ordered cardinal ρ⁺ (if the axiom of choice holds, this is the (unique) next larger cardinal).

We can then define the aleph numbers as follows:

ℵ₀ = ω

ℵ_α+1 = (ℵ_α)⁺

ℵ_λ = ⋃{ ℵ_α | α < λ } for λ an infinite limit ordinal,

The α-th infinite initial ordinal is written ω_α. Its cardinality is written ℵ_α.

Informally, the aleph function ℵ: On → Cd is a bijection from the ordinals to the infinite cardinals. Formally, in ZFC, ℵ is not a function, but a function-like class, as it is not a set (due to the Burali-Forti paradox).

For any ordinal α we have

α ≤ ω_α.

In many cases ω_α is strictly greater than α. For example, it is true for any successor ordinal: α + 1 < ω_α+1 holds. There are, however, some limit ordinals which are fixed points of the omega function, because of the fixed-point lemma for normal functions. The first such is the limit of the sequence

ω, ω_ω, ω_ωω, ...,

which is sometimes denoted ω_ω....

Any weakly inaccessible cardinal is also a fixed point of the aleph function.^[10] This can be shown in ZFC as follows. Suppose κ = ℵ_λ is a weakly inaccessible cardinal. If λ were a successor ordinal, then ℵ_λ would be a successor cardinal and hence not weakly inaccessible. If λ were a limit ordinal less than κ then its cofinality (and thus the cofinality of ℵ_λ) would be less than κ and so κ would not be regular and thus not weakly inaccessible. Thus λ ≥ κ and consequently λ = κ which makes it a fixed point.

The cardinality of any infinite ordinal number is an aleph number. Every aleph is the cardinality of some ordinal. The least of these is its initial ordinal. Any set whose cardinality is an aleph is equinumerous with an ordinal and is thus well-orderable.

Each finite set is well-orderable, but does not have an aleph as its cardinality.

Over ZF, the assumption that the cardinality of each infinite set is an aleph number is equivalent to the existence of a well-ordering of every set, which in turn is equivalent to the axiom of choice. ZFC set theory, which includes the axiom of choice, implies that every infinite set has an aleph number as its cardinality (i.e. is equinumerous with its initial ordinal), and thus the initial ordinals of the aleph numbers serve as a class of representatives for all possible infinite cardinal numbers.

When cardinality is studied in ZF without the axiom of choice, it is no longer possible to prove that each infinite set has some aleph number as its cardinality; the sets whose cardinality is an aleph number are exactly the infinite sets that can be well-ordered. The method of Scott's trick is sometimes used as an alternative way to construct representatives for cardinal numbers in the setting of ZF. For example, one can define card(S) to be the set of sets with the same cardinality as S of minimum possible rank. This has the property that card(S) = card(T) if and only if S and T have the same cardinality. (The set card(S) does not have the same cardinality of S in general, but all its elements do.)

• Beth number
• Gimel function
• Regular cardinal
• Infinity
• Transfinite number
• Ordinal number

• "Aleph-zero", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Weisstein, Eric W. "Aleph-0". MathWorld.