Beth number explained

In mathematics, particularly in set theory, the beth numbers are a certain sequence of infinite cardinal numbers (also known as transfinite numbers), conventionally written

\beth _{0,} \beth _{1,} \beth _{2,} \beth _{3,} ... , where \beth is the Hebrew letter beth. The beth numbers are related to the aleph numbers (\aleph _{0,} \aleph _{1,} ... ), but unless the generalized continuum hypothesis is true, there are numbers indexed by \aleph that are not indexed by \beth .

Definition

Beth numbers are defined by transfinite recursion:

\beth _{0} = \aleph _{0,} \beth _{\alpha+1} = 2 ^{\beth _{\alpha}} , \beth _{λ} = \sup l \{ \beth _{\alpha} : \alpha < λ r \},

where

\alpha is an ordinal and λ is a limit ordinal.^[1]

The cardinal

\beth _{0} = \aleph _{0} is the cardinality of any countably infinite set such as the set N of natural numbers, so that \beth _{0} = | N | .

Let

\alpha be an ordinal, and A _{\alpha} be a set with cardinality \beth _{\alpha} = |A _{\alpha|} . Then, l{P}(A _{\alpha)} denotes the power set of A _{\alpha} (i.e., the set of all subsets of A _{\alpha} ),

• the set

2 ^{A _{\alpha}} \subset l{P}(A _{\alpha} x 2 ) denotes the set of all functions from A _{\alpha} to \{ 0 , 1 \} ,

• the cardinal

2 ^{\beth _{\alpha}} is the result of cardinal exponentiation, and\beth _{\alpha+1} = 2 ^{\beth _{\alpha}} = \left| 2 ^{A _{\alpha}} \right| = | l{P}(A _{\alpha)|} is the cardinality of the power set of A _{\alpha} .

Given this definition,

\beth _{0,} \beth _{1,} \beth _{2,} \beth _{3,} ...

are respectively the cardinalities of

N , l{P}( N ), l{P}( l{P}( N )), l{P}( l{P}( l{P}( N ))), ...

so that the second beth number

\beth _{1} is equal to ak{c} , the cardinality of the continuum (the cardinality of the set of the real numbers), 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 to be the supremum of the beth numbers for all ordinals strictly smaller than λ :\beth _{λ} = \sup l \{ \beth _{\alpha} : \alpha < λ r \}.

One can show that this definition is equivalent to

\beth _{λ} = | c up l \{ A _{\alpha} : \alpha < λ r \}|.

For instance:

\beth _{\omega} is the cardinality of c up l \{ N , l{P}( N ), l{P}( l{P}( N )), l{P}( l{P}( l{P}( N ))), ... r \} .\beth _{2\omega} is the cardinality of c up l \{ N , l{P}( N ), l{P}( l{P}( N )), l{P}( l{P}( l{P}( N ))), ..., {A _{\omega},} l{P}({A _{\omega}),} l{P}( l{P}({A _{\omega})),} l{P}( l{P}( l{P}({A _{\omega}))),} ... r \} .\beth _{\omega ^{2}} is the cardinality of c up l \{ N , l{P}( N ), l{P}( l{P}( N )), l{P}( l{P}( l{P}( N ))), ..., {A _{\omega},} l{P}({A _{\omega}),} l{P}( l{P}({A _{\omega})),} ... , {A _{2\omega} }, \mathcal, \mathcal(\mathcal), \dots, {A _{3\omega} }, \mathcal, \mathcal(\mathcal), \dots, \dots \Bigr\}.

This equivalence can be shown by seeing that:

• for any set

S , the union set of all its members can be no larger than the supremum of its member cardinalities times its own cardinality, | c up S |\le l (| S | x \sup l \{|s|:s\in S r \} r )

• for any two non-zero cardinalities

\kappa _{a,} \kappa _{b} , if at least one of them is an infinite cardinality, then the product will be the larger of the two, \kappa _{a} x \kappa _{b} = max \{\kappa _{a,} \kappa _{b\}}

• the set

l \{ A _{\alpha} : \alpha < λ r \} will be smaller than most or all of its subsets for any limit ordinal λ

• therefore,

| c up l \{ A _{\alpha} : \alpha < λ r \}| = \sup l \{ \beth _{\alpha} : \alpha < λ r \} for any limit ordinal λ

Note that this behavior is different from that of successor ordinals. Cardinalities less than

\beth _{\beta} but greater than any \beth _{\alpha:} \alpha<\beta can exist when \beta is a successor ordinal (in that case, the existence is undecidable in ZFC and controlled by the Generalized Continuum Hypothesis); but cannot exist when \beta is a limit ordinal, even under the second definition presented.

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, sets with cardinality \beth _{0} include:

• the natural numbers

N

• the rational numbers

Q

• the algebraic numbers

l{A}

• the computable numbers and computable sets
• the set of finite sets of integers or of rationals or of algebraic numbers
• the set of finite multisets of integers
• the set of finite sequences of integers.

Beth one

See 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

• the uncomputable real numbers

R ^{n}

• the power set of the natural numbers

2 ^{N} (the set of all subsets of the natural numbers)

• the set of sequences of integers (i.e.,

Z ^{N} , which includes all functions from N to Z )

• the set of sequences of real numbers,

R ^{N}

• the set of all real analytic functions from

R to R

• the set of all continuous functions from

R to R

• the set of all functions from

R to R with at most countable discontinuities ^[2]

• the set of finite subsets of real numbers
• the set of all analytic functions from

C to C (the holomorphic functions)

• the set of all functions from the natural numbers to the natural numbers (

N ^{N} ).

Beth two

\beth _{2} (pronounced beth two) is also referred to as 2 ^{ak{c}} (pronounced two to the power of ak{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 ^{n}

• the set of all functions from

R to R with uncountably many discontinuities ^[2]

• the power set of the set of all functions from the set of natural numbers to itself, or the number of sets of sequences of natural numbers
• the Stone–Čech compactifications of

R , Q , and N

• the set of deterministic fractals in

R ^{n} ^[3]

• the set of random fractals in

R ^{n} .^[4]

Beth omega

\beth _{\omega} (pronounced beth omega) is the smallest uncountable strong limit cardinal.

Generalization

The more general symbol

\beth _{\alpha(\kappa)} , for ordinals \alpha and cardinals \kappa , is occasionally used. It is defined by:\beth _{0(\kappa)=\kappa,} \beth _{\alpha+1} (\kappa) =2 ^{\beth _{\alpha(\kappa)}} , \beth _{λ(\kappa)=\sup\{} \beth _{\alpha(\kappa):\alpha<λ} \} if λ is a limit ordinal.

So

\beth _{\alpha=\beth} _{\alpha(\aleph} _{0).}

In Zermelo–Fraenkel set theory (ZF), for any cardinals

\kappa and \mu , there is an ordinal \alpha such that:\kappa \le \beth _{\alpha(\mu).}

And in ZF, for any cardinal

\kappa and ordinals \alpha and \beta :\beth _{\beta(\beth} _{\alpha(\kappa))} = \beth _{\alpha+\beta} (\kappa).

Consequently, in ZF absent ur-elements, with or without the axiom of choice, for any cardinals

\kappa and \mu , the equality\beth _{\beta(\kappa)} = \beth _{\beta(\mu)}

holds for all sufficiently large ordinals

\beta . That is, there is an ordinal \alpha such that the equality holds for every ordinal \beta \geq \alpha .

This also holds in Zermelo–Fraenkel set theory with ur-elements (with or without the axiom of choice), provided that 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.

Borel determinacy

Borel determinacy is implied by the existence of all beths of countable index.^[5]

See also

• Transfinite number
• Uncountable set

References

1. Book: Jech, Thomas . 2002 . Set Theory . 3rd . Millennium ed, rev. and expanded. Corrected 4th printing 2006. . Springer . 55 . 978-3-540-44085-7 .
2. Soltanifar . Mohsen . 2023 . A classification of elements of function space F(R,R) . Mathematics . 11 . 17 . 3715 . 10.3390/math11173715 . free . 2308.06297 .
3. Soltanifar . Mohsen . 2021 . A generalization of the Hausdorff dimension theorem for deterministic fractals . Mathematics . 9 . 13 . 1546 . 2007.07991 . 10.3390/math9131546 . free .
4. Soltanifar . Mohsen . 2022 . The second generalization of the Hausdorff dimension theorem for random fractals . Mathematics . 10 . 5 . 706 . 1807/110291 . free . 10.3390/math10050706 . free .
5. Web site: Borel Determinacy Does Not Require Replacement . Leinster . Tom . 23 July 2021 . The n-Category Café . The University of Texas at Austin . 25 August 2021 .

Bibliography

• T. E. Forster, Set Theory with a Universal Set: Exploring an Untyped Universe, Oxford University Press, 1995 - Beth number is defined on page 5.
• Book: Bell, John Lane . John Lane Bell. Slomson, Alan B. . 2006 . Models and Ultraproducts: An Introduction . reprint of 1974 . 1969 . . 0-486-44979-3 . See pages 6 and 204–205 for beth numbers.
• Book: Roitman , Judith . Judith Roitman

. Judith Roitman . Introduction to Modern Set Theory . 2011 . . 978-0-9824062-4-3 . See page 109 for beth numbers.