HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, particularly in
set theory Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
, the beth numbers are a certain sequence of infinite
cardinal number In mathematics, a cardinal number, or cardinal for short, is what is commonly called the number of elements of a set. In the case of a finite set, its cardinal number, or cardinality is therefore a natural number. For dealing with the cas ...
s (also known as
transfinite number In mathematics, transfinite numbers or infinite numbers are numbers that are " infinite" in the sense that they are larger than all finite numbers. These include the transfinite cardinals, which are cardinal numbers used to quantify the size of i ...
s), conventionally written \beth_0, \beth_1, \beth_2, \beth_3, \dots, where \beth is the Hebrew letter beth. The beth numbers are related to the
aleph number In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets. They were introduced by the mathematician Georg Cantor and are named after the symbol he used t ...
s (\aleph_0, \aleph_1, \dots), but unless the generalized continuum hypothesis is true, there are numbers indexed by \aleph that are not indexed by \beth or the gimel function \gimel.


Definition

Beth numbers are defined by
transfinite recursion Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers. Its correctness is a theorem of ZFC. Induction by cases Let P(\alpha) be a property defined for a ...
: * \beth_0 = \aleph_0, * \beth_ = 2^, * \beth_\lambda = \sup\Bigl\, where \alpha is an ordinal and \lambda is a
limit ordinal In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...
. The cardinal \beth_0 = \aleph_0 is the cardinality of any
countably infinite In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbe ...
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
such as the set \mathbb of
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s, so that \beth_0 = , \mathbb, . Let \alpha be an ordinal, and A_\alpha be a set with cardinality \beth_\alpha = , A_\alpha, . Then, * \mathcal(A_\alpha) denotes the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is po ...
of A_\alpha (i.e., the set of all subsets of A_\alpha), * the set 2^ \subset \mathcal(A_\alpha \times 2) denotes the set of all functions from A_\alpha to \, * the cardinal 2^ is the result of
cardinal exponentiation In mathematics, a cardinal number, or cardinal for short, is what is commonly called the number of elements of a set. In the case of a finite set, its cardinal number, or cardinality is therefore a natural number. For dealing with the case ...
, and * \beth_ = 2^ = \left, 2^ \ = , \mathcal(A_\alpha), is the cardinality of the power set of A_\alpha. Given this definition, :\beth_0, \beth_1, \beth_2, \beth_3, \dots are respectively the cardinalities of :\mathbb, \mathcal(\mathbb), \mathcal(\mathcal(\mathbb)), \mathcal(\mathcal(\mathcal(\mathbb))), \dots so that the second beth number \beth_1 is equal to \mathfrak, the
cardinality of the continuum In set theory, the cardinality of the continuum is the cardinality or "size" of the set of real numbers \mathbb R, sometimes called the continuum. It is an infinite cardinal number and is denoted by \bold\mathfrak c (lowercase Fraktur "c") or \ ...
(the cardinality of the set of the
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s), and the third beth number \beth_2 is the cardinality of the power set of the continuum. Because of
Cantor's theorem In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any Set (mathematics), set A, the set of all subsets of A, known as the power set of A, has a strictly greater cardinality than A itself. For finite s ...
, each set in the preceding sequence has cardinality strictly greater than the one preceding it. For infinite
limit ordinal In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...
s \lambda, the corresponding beth number is defined to be the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
of the beth numbers for all ordinals strictly smaller than \lambda: :\beth_\lambda = \sup \Bigl\. One can show that this definition is equivalent to :\beth_\lambda = , \bigcup \Bigl\, . For instance: *\beth_\omega is the cardinality of \bigcup \Bigl\. *\beth_ is the cardinality of \bigcup \Bigl\. *\beth_ is the cardinality of \bigcup \Bigl\. This equivalence can be shown by seeing that: *for any set \mathbb, the union set of all its members can be no larger than the supremum of its member cardinalities times its own cardinality, , \bigcup\mathbb, \le \Bigl(, \mathbb, \times \sup\Bigl\\Bigr) *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 \times \kappa_b = \max\ *the set \Bigl\ will be smaller than most or all of its subsets for any limit ordinal \lambda *therefore, , \bigcup\Bigl\, =\sup \Bigl\ for any limit ordinal \lambda 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_ have cardinality \beth_.


Relation to the aleph numbers

Assuming the
axiom of choice In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
, 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 In mathematics, specifically set theory, the continuum hypothesis (abbreviated CH) is a hypothesis about the possible sizes of infinite sets. It states: Or equivalently: In Zermelo–Fraenkel set theory with the axiom of choice (ZFC), this ...
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 number In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets. They were introduced by the mathematician Georg Cantor and are named after the symbol he used t ...
s, 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 number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s \mathbb * the
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all ...
s \mathbb * the
algebraic number In mathematics, an algebraic number is a number that is a root of a function, root of a non-zero polynomial in one variable with integer (or, equivalently, Rational number, rational) coefficients. For example, the golden ratio (1 + \sqrt)/2 is ...
s \mathbb * the computable numbers and
computable set In computability theory, a set of natural numbers is computable (or decidable or recursive) if there is an algorithm that computes the membership of every natural number in a finite number of steps. A set is noncomputable (or undecidable) if it i ...
s * the set of
finite set In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example, is a finite set with five elements. Th ...
s of
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
s or of rationals or of
algebraic number In mathematics, an algebraic number is a number that is a root of a function, root of a non-zero polynomial in one variable with integer (or, equivalently, Rational number, rational) coefficients. For example, the golden ratio (1 + \sqrt)/2 is ...
s * the set of finite multisets of
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
s * the set of finite sequences of
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
s.


Beth one

Sets with cardinality \beth_1 include: * the transcendental numbers * the
irrational number In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, ...
s * the
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s \mathbb * the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
s \mathbb * the uncomputable real numbers *
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
\mathbb^n * the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is po ...
of the
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s 2^\mathbb (the set of all subsets of the natural numbers) * the set of
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
s of integers (i.e., \mathbb^\mathbb, which includes all functions from \mathbb to \mathbb) * the set of sequences of real numbers, \mathbb^\mathbb * the set of all real analytic functions from \mathbb to \mathbb * the set of all
continuous function In mathematics, a continuous function is a function such that a small variation of the argument induces a small variation of the value of the function. This implies there are no abrupt changes in value, known as '' discontinuities''. More preci ...
s from \mathbb to \mathbb * the set of all functions from \mathbb to \mathbb with at most countable discontinuities *the set of finite subsets of real numbers *the set of all
analytic function In mathematics, an analytic function is a function that is locally given by a convergent power series. There exist both real analytic functions and complex analytic functions. Functions of each type are infinitely differentiable, but complex ...
s from \mathbb to \mathbb (the holomorphic functions) *the set of all functions from the natural numbers to the natural numbers (\mathbb^\mathbb).


Beth two

\beth_2 (pronounced ''beth two'') is also referred to as 2^\mathfrak (pronounced ''two to the power of \mathfrak''). Sets with cardinality \beth_2 include: * the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is po ...
of the set of
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s, so it is the number of
subset In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
s of the
real line A number line is a graphical representation of a straight line that serves as spatial representation of numbers, usually graduated like a ruler with a particular origin (geometry), origin point representing the number zero and evenly spaced mark ...
, 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 \mathbb to \mathbb (\mathbb^\mathbb) * the set of all functions from \mathbb^m to \mathbb^n * the set of all functions from \mathbb to \mathbb with uncountably many discontinuities * 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 compactification In the mathematical discipline of general topology, Stone–Čech compactification (or Čech–Stone compactification) is a technique for constructing a Universal property, universal map from a topological space ''X'' to a Compact space, compact Ha ...
s of \mathbb, \mathbb, and \mathbb * the set of deterministic
fractal In mathematics, a fractal is a Shape, geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fractals appear similar at various scale ...
s in \mathbb^n * the set of random
fractal In mathematics, a fractal is a Shape, geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fractals appear similar at various scale ...
s in \mathbb^n.


Beth omega

\beth_\omega (pronounced ''beth omega'') is the smallest
uncountable In mathematics, an uncountable set, informally, is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger tha ...
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_(\kappa)=2^, :\beth_\lambda(\kappa)=\sup\ if ''λ'' is a limit ordinal. So :\beth_\alpha=\beth_\alpha(\aleph_0). In
Zermelo–Fraenkel set theory In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes suc ...
(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_(\kappa). Consequently, in ZF absent ur-elements, with or without the
axiom of choice In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
, 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 In mathematics, the transitive closure of a homogeneous binary relation on a set (mathematics), set is the smallest Relation (mathematics), relation on that contains and is Transitive relation, transitive. For finite sets, "smallest" can be ...
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.


See also

*
Transfinite number In mathematics, transfinite numbers or infinite numbers are numbers that are " infinite" in the sense that they are larger than all finite numbers. These include the transfinite cardinals, which are cardinal numbers used to quantify the size of i ...
*
Uncountable set In mathematics, an uncountable set, informally, is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger t ...


References


Bibliography

* T. E. Forster, ''Set Theory with a Universal Set: Exploring an Untyped Universe'',
Oxford University Press Oxford University Press (OUP) is the publishing house of the University of Oxford. It is the largest university press in the world. Its first book was printed in Oxford in 1478, with the Press officially granted the legal right to print books ...
, 1995 — ''Beth number'' is defined on page 5. * See pages 6 and 204–205 for beth numbers. * See page 109 for beth numbers. {{refend Cardinal numbers Infinity