<?xml version="1.0" encoding="UTF-8"?>

<record version="3" id="5710">
 <title>aleph numbers</title>
 <name>AlephNumbers</name>
 <created>2004-03-15 10:54:22</created>
 <modified>2006-12-30 03:14:32</modified>
 <type>Definition</type>
<parent id="1302">cardinal number</parent>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <classification>
	<category scheme="msc" code="03E10"/>
 </classification>
 <synonyms>
	<synonym concept="aleph numbers" alias="alephs"/>
 </synonyms>
 <related>
	<object name="GeneralizedContinuumHypothesis"/>
	<object name="BethNumbers"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

\def\N{\mathbb{N}}
\def\Q{\mathbb{Q}}
\def\Z{\mathbb{Z}}</preamble>
 <content>\PMlinkescapeword{alphabet}

The \emph{aleph numbers} are infinite cardinal numbers 
defined by transfinite recursion, as described below.
They are written $\aleph_\alpha$, where $\aleph$ is aleph,
the first letter of the Hebrew alphabet,
and $\alpha$ is an ordinal number.
Sometimes we write $\omega_\alpha$ instead of $\aleph_\alpha$,
usually to emphasise that it is an ordinal.

To start the transfinite recursion, 
we define $\aleph_0$ to be the first infinite ordinal.
This is the cardinality of countably infinite sets, such as $\N$ and $\Q$.
For each ordinal $\alpha$,
the cardinal number $\aleph_{\alpha+1}$ is defined to be 
the least ordinal of cardinality greater than $\aleph_\alpha$.
For each limit ordinal $\delta$, 
we define $\aleph_\delta=\bigcup_{\alpha\in\delta}\aleph_\alpha$.

As a consequence of the \PMlinkname{Well-Ordering Principle}{ZermelosWellOrderingTheorem},
every infinite set is equinumerous with an aleph number.
Every infinite cardinal is therefore an aleph.
More precisely, for every infinite cardinal $\kappa$ there is exactly one ordinal $\alpha$ such that $\kappa=\aleph_\alpha$.</content>
</record>
