aleph number#Aleph-nought

$\backslash aleph\_0$ (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 $\backslash omega$ or $\backslash omega\_0$ (where $\backslash omega$ is the lowercase Greek letter omega), also has cardinality $\backslash aleph\_0$. A set has cardinality $\backslash aleph\_0$ 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.

Among the countably infinite sets are certain infinite ordinals,{{efn|This is assuming the convention that an ordinal is identified with the set of all ordinals less than itself (the so-called von Neumann ordinals).}} including for example $\backslash omega$, $\backslash omega+1$, $\backslash omega\; \backslash cdot\; 2$, $\backslash omega^2$, $\backslash omega^\backslash omega$, and $\backslash varepsilon\_0$.{{cite book | last1=Jech | first1=Thomas | title=Set Theory | publisher= Springer-Verlag| location=Berlin, New York | series=Springer Monographs in Mathematics | year=2003}} For example, the sequence (with order type $\backslash omega\; \backslash cdot\; 2$) of all positive odd integers followed by all positive even integers $\backslash \{1,\; 3,\; 5,\; 7,\; 9,\; \backslash cdots;\; 2,\; 4,\; 6,\; 8,\; 10,\; \backslash cdots\backslash \}$ is an ordering of the set (with cardinality $\backslash aleph\_0$) of positive integers.

If the axiom of countable choice (a weaker version of the axiom of choice) holds, then $\backslash aleph\_0$ is smaller than any other infinite cardinal, and is therefore the (unique) least infinite ordinal.

{{Redirect|Aleph One}}

$\backslash aleph\_1$ is the cardinality of the set of all countable ordinal numbers.{{Cite web |title=Power of the continuum {{!}} mathematics {{!}} Britannica |url=https://www.britannica.com/science/power-of-the-continuum |access-date=2025-02-06 |website=www.britannica.com |language=en}} This set is denoted by $\backslash omega\_1$ (or sometimes Ω). The set $\backslash omega\_1$ is itself an ordinal number larger than all countable ones, so it is an uncountable set. Therefore, $\backslash aleph\_1$ is the smallest cardinality that is larger than $\backslash aleph\_0,$ the smallest infinite cardinality.

The definition of $\backslash aleph\_1$ implies (in ZF, Zermelo–Fraenkel set theory without the axiom of choice) that no cardinal number is between $\backslash aleph\_0$ and $\backslash aleph\_1.$ If the axiom of choice is used, it can be further proved that the class of cardinal numbers is totally ordered, and thus $\backslash aleph\_1$ is the second-smallest infinite cardinal number. One can show one of the most useful properties of the set {{tmath|\omega_1}}: Any countable subset of $\backslash omega\_1$ has an upper bound in $\backslash omega\_1$ (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 $\backslash aleph\_0$: Every finite set of natural numbers has a maximum which is also a natural number, and finite unions of finite sets are finite.

An example application of the ordinal $\backslash omega\_1$ 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 $\backslash omega\_1.$

{{Main|Continuum hypothesis}}

{{See also|Beth number}}

The cardinality of the set of real numbers (cardinality of the continuum) is 2^{$\backslash aleph\_0$}. 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^{$\backslash aleph\_0$} = $\backslash aleph\_1$.

{{cite web

|url=http://mathworld.wolfram.com/ContinuumHypothesis.html

|title=Continuum Hypothesis

|last=Szudzik |first=Mattew

|date=31 July 2018

|website=Wolfram Mathworld

|publisher=Wolfram Web Resources

|access-date=15 August 2018

}}

The CH states that there is no set whose cardinality is strictly between that of the natural numbers and the real numbers.

{{cite web

|last=Weisstein |first=Eric W.

|title=Continuum Hypothesis

|url=https://mathworld.wolfram.com/ContinuumHypothesis.html

|access-date=2020-08-12

|website=mathworld.wolfram.com

|language=en

}}

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.

{{cite arXiv

|last=Chow |first=Timothy Y.

|title=A beginner's guide to forcing

|eprint=0712.1320

|date=2007

|class=math.LO

}}

Aleph-omega is $\backslash aleph\_\backslash omega\; =\; \backslash sup\backslash \{\backslash aleph\_n|\; n\; \backslash in\; \backslash omega\backslash \}\; =\; \backslash sup\backslash \{\backslash aleph\_n|\; n\; \backslash in\; \backslash \{0,\; 1,\; 2,\backslash cdots\backslash \}\backslash \}$ where the smallest infinite ordinal is denoted as $\backslash omega$. That is, the cardinal number $\backslash aleph\_\backslash omega$ is the least upper bound of $\backslash sup\backslash \{\backslash aleph\_n|\; n\; \backslash in\; \backslash \{0,\; 1,\; 2,\backslash cdots\backslash \}\backslash \}$.

Notably, $\backslash aleph\_\backslash omega$ 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^\{\backslash aleph\_0\}$: For any natural number $n\; \backslash ge\; 1$, we can consistently assume that $2^\{\backslash aleph\_0\}\; =\; \backslash aleph\_n$, and moreover it is possible to assume that $2^\{\backslash aleph\_0\}$ is as least as large as any cardinal number we like. The main restriction ZFC puts on the value of $2^\{\backslash aleph\_0\}$ is that it cannot equal certain special cardinals with cofinality $\backslash aleph\_0$. An uncountably infinite cardinal $\backslash kappa$ having cofinality $\backslash aleph\_0$ means that there is a (countable-length) sequence $\backslash kappa\_0\; \backslash le\; \backslash kappa\_1\; \backslash le\; \backslash kappa\_2\; \backslash le\; \backslash cdots$ of cardinals whose limit (i.e. its least upper bound) is $\backslash kappa$ (see Easton's theorem). As per the definition above, $\backslash aleph\_\backslash omega$ is the limit of a countable-length sequence of smaller cardinals.

To define $\backslash aleph\_\backslash alpha$ for arbitrary ordinal number $\backslash alpha$, we must define the successor cardinal operation, which assigns to any cardinal number $\backslash rho$ the next larger well-ordered cardinal $\backslash rho^\{+\}$ (if the axiom of choice holds, this is the (unique) next larger cardinal).

We can then define the aleph numbers as follows:

:$\backslash aleph\_0\; =\; \backslash omega$

:$\backslash aleph\_\{\backslash alpha+1\}\; =\; (\backslash aleph\_\{\backslash alpha\})^\{+\}$

: for $\backslash lambda$ an infinite limit ordinal,

The $\backslash alpha$-th infinite initial ordinal is written $\backslash omega\_\backslash alpha$. Its cardinality is written $\backslash aleph\_\backslash alpha$.

Informally, the aleph function $\backslash aleph\; :\; \backslash text\{On\}\; \backslash rightarrow\; \backslash text\{Cd\}$ is a bijection from the ordinals to the infinite cardinals.

Formally, in ZFC, $\backslash aleph$ is not a function, but a function-like class, as it is not a set (due to the Burali-Forti paradox).

For any ordinal $\backslash alpha$ we have $\backslash alpha\; \backslash le\; \backslash omega\_\backslash alpha$.

In many cases $\backslash omega\_\backslash alpha$ is strictly greater than α. For example, it is true for any successor ordinal: $\backslash alpha\; +\; 1\; \backslash le\; \backslash omega\_\{\backslash alpha\; +\; 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

:$\backslash omega,\; \backslash omega\_\{\backslash omega\},\; \backslash omega\_\{\backslash omega\_\{\backslash omega\}\},\; \backslash cdots$

which is sometimes denoted $\backslash omega\_\{\backslash omega\_\{\backslash ddots\}\}$.

Any weakly inaccessible cardinal is also a fixed point of the aleph function.

{{cite web

| author=Harris, Kenneth A.

| date=6 April 2009

| title=Lecture 31

| series=Intro to Set Theory

| id=Math 582

| department=Department of Mathematics

| publisher=University of Michigan

| website=kaharris.org

| url=http://kaharris.org/teaching/582/Lectures/lec31.pdf

| access-date=September 1, 2012

| archive-url=https://web.archive.org/web/20160304121941/http://kaharris.org/teaching/582/Lectures/lec31.pdf

| archive-date=March 4, 2016

| url-status=dead

| df=mdy-all

}}

This can be shown in ZFC as follows. Suppose $\backslash kappa\; =\; \backslash aleph\_\{\backslash lambda\}$ is a weakly inaccessible cardinal. If $\backslash lambda$ were a successor ordinal, then $\backslash aleph\_\{\backslash lambda\}$ would be a successor cardinal and hence not weakly inaccessible. If $\backslash lambda$ were a limit ordinal less than $\backslash kappa$ then its cofinality (and thus the cofinality of $\backslash aleph\_\backslash lambda$) would be less than $\backslash kappa$ and so $\backslash kappa$ would not be regular and thus not weakly inaccessible. Thus $\backslash lambda\; \backslash ge\; \backslash kappa$ and consequently $\backslash lambda\; =\; \backslash kappa$ 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 $\backslash text\{card\}(S)$ to be the set of sets with the same cardinality as $S$ of minimum possible rank. This has the property that $\backslash text\{card\}(S)\; =\; \backslash text\{card\}(T)$ if and only if $S$ and $T$ have the same cardinality. (The set $\backslash text\{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

{{notelist}}

{{reflist|25em}}

• {{springer|title=Aleph-zero|id=p/a011280|ref=none}}
• {{MathWorld | urlname=Aleph-0 | title=Aleph-0}}

{{Mathematical logic}}

{{Authority control}}

{{DEFAULTSORT:Aleph Number}}

Category:Cardinal numbers

Category:Hebrew alphabet

Category:Infinity