Beth number

In mathematics, the infinite cardinal numbers are represented by the Hebrew letter $\aleph$ (aleph) indexed with a subscript that runs over the ordinal numbers (see aleph number). The second Hebrew letter $\beth$ (beth) is used in a related way, but does not necessarily index all of the numbers indexed by $\aleph$ .

Definition

To define the beth numbers, start by letting

\beth_0=\aleph_0

be the cardinality of any countably infinite set; for concreteness, take the set $\mathbb{N}$ of natural numbers to be a typical case. Denote by P(A) the power set of A; i.e., the set of all subsets of A. Then define

\beth_{\alpha+1}=2^{\beth_{\alpha}},

which is the cardinality of the power set of A if $\beth_{\alpha}$ is the cardinality of A.

Given this definition,

\beth_0,\ \beth_1,\ \beth_2,\ \beth_3,\ \dots

are respectively the cardinalities of

\mathbb{N},\ P(\mathbb{N}),\ P(P(\mathbb{N})),\ P(P(P(\mathbb{N}))),\ \dots.

so that the second beth number $\beth_1$ is equal to $\mathfrak c$ , the cardinality of the continuum, and the third beth number $\beth_2$ is the cardinality of the power set of the continuum.

Because of Cantor's theorem each set in the preceding sequence has cardinality strictly greater than the one preceding it. For infinite limit ordinals λ the corresponding beth number is defined as the supremum of the beth numbers for all ordinals strictly smaller than λ:

\beth_{\lambda}=\sup\{ \beth_{\alpha}:\alpha<\lambda \}.

One can also show that the von Neumann universes $V_{\omega+\alpha} \!$ have cardinality $\beth_{\alpha} \!$ .

Relation to the aleph numbers

Assuming the axiom of choice, infinite cardinalities are linearly ordered; no two cardinalities can fail to be comparable. Thus, since by definition no infinite cardinalities are between $\aleph_0$ and $\aleph_1$ , it follows that

\beth_1 \ge \aleph_1.

Repeating this argument (see transfinite induction) yields $\beth_\alpha \ge \aleph_\alpha$ for all ordinals $\alpha$ .

The continuum hypothesis is equivalent to

\beth_1=\aleph_1.

The generalized continuum hypothesis says the sequence of beth numbers thus defined is the same as the sequence of aleph numbers, i.e., $\beth_\alpha = \aleph_\alpha$ for all ordinals $\alpha$ .

Specific cardinals

Beth null

Since this is defined to be $\aleph_0$ or aleph null then sets with cardinality $\beth_0$ include:

the natural numbers N
the rational numbers Q
the algebraic numbers
the computable numbers and computable sets
the set of finite sets of integers

Beth one

Main article: cardinality of the continuum

Sets with cardinality $\beth_1$ include:

the transcendental numbers
the irrational numbers
the real numbers R
the complex numbers C
Euclidean space Rⁿ
the power set of the natural numbers (the set of all subsets of the natural numbers)
the set of sequences of integers (i.e. all functions N → Z, often denoted Z^N)
the set of sequences of real numbers, R^N
the set of all continuous functions from R to R
the set of finite subsets of real numbers

Beth two

$\beth_2$ (pronounced beth two) is also referred to as 2^c (pronounced two to the power of c).

Sets with cardinality $\beth_2$ include:

The power set of the set of real numbers, so it is the number of subsets of the real line, or the number of sets of real numbers
The power set of the power set of the set of natural numbers
The set of all functions from R to R (R^R)
The set of all functions from R^m to Rⁿ
The power set of the set of all functions from the set of natural numbers to itself, so it is the number of sets of sequences of natural numbers
The Stone–Čech compactifications of R, Q, and N

Beth omega

$\beth_\omega$ (pronounced beth omega) is the smallest uncountable strong limit cardinal.

Generalization

The more general symbol $\beth_\alpha(\kappa)$ , for ordinals α and cardinals κ, is occasionally used. It is defined by:

\beth_0(\kappa)=\kappa,

\beth_{\alpha+1}(\kappa)=2^{\beth_{\alpha}(\kappa)},

\beth_{\lambda}(\kappa)=\sup\{ \beth_{\alpha}(\kappa):\alpha<\lambda \}

if λ is a limit ordinal.

\beth_{\alpha}=\beth_{\alpha}(\aleph_0).

In ZF, for any cardinals κ and μ, there is an ordinal α such that:

\kappa \le \beth_{\alpha}(\mu).

And in ZF, for any cardinal κ and ordinals α and β:

\beth_{\beta}(\beth_{\alpha}(\kappa)) = \beth_{\alpha+\beta}(\kappa).

Consequently, in Zermelo–Fraenkel set theory absent ur-elements with or without the axiom of choice, for any cardinals κ and μ, the equality

\beth_{\beta}(\kappa) = \beth_{\beta}(\mu)

holds for all sufficiently large ordinals β (that is, there is an ordinal α such that the equality holds for every ordinal β ≥ α).

This also holds in Zermelo–Fraenkel set theory with ur-elements with or without the axiom of choice provided the ur-elements form a set which is equinumerous with a pure set (a set whose transitive closure contains no ur-elements). If the axiom of choice holds, then any set of ur-elements is equinumerous with a pure set.

References

T. E. Forster, Set Theory with a Universal Set: Exploring an Untyped Universe, Oxford University Press, 1995 — Beth number is defined on page 5.
Bell, John Lane; Slomson, Alan B. (2006) [1969]. Models and Ultraproducts: An Introduction (reprint of 1974 ed.). Dover Publications. ISBN 0-486-44979-3. See pages 6 and 204–205 for beth numbers.
Roitman, Judith (2011). Introduction to Modern Set Theory. Virginia Commonwealth University. ISBN 978-0-9824062-4-3. See page 109 for beth numbers.

This article is issued from Wikipedia - version of the Monday, January 04, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.