# 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 case of infinite sets, the infinite cardinal numbers have been introduced, which are often denoted with the Hebrew letter $\aleph$ (aleph) marked with subscript indicating their rank among the infinite cardinals.
Cardinality is defined in terms of bijective functions. Two sets have the same cardinality if, and only if, there is a one-to-one correspondence (bijection) between the elements of the two sets. In the case of finite sets, this agrees with the intuitive notion of number of elements. In the case of infinite sets, the behavior is more complex. A fundamental theorem due to Georg Cantor shows that it is possible for infinite sets to have different cardinalities, and in particular the cardinality of the set of real numbers is greater than the cardinality of the set of natural numbers. It is also possible for a proper subset of an infinite set to have the same cardinality as the original set—something that cannot happen with proper subsets of finite sets.
There is a transfinite sequence of cardinal numbers:
    $0,1,2,3,\ldots ,n,\ldots ;\aleph _{0},\aleph _{1},\aleph _{2},\ldots ,\aleph _{\alpha },\ldots .\$
This sequence starts with the natural numbers including zero (finite cardinals), which are followed by the aleph numbers. The aleph numbers are indexed by ordinal numbers. If the axiom of choice is true, this transfinite sequence includes every cardinal number. If the axiom of choice is not true (see Axiom of choice § Independence), there are infinite cardinals that are not aleph numbers.
Cardinality is studied for its own sake as part of set theory. It is also a tool used in branches of mathematics including model theory, combinatorics, abstract algebra and mathematical analysis. In category theory, the cardinal numbers form a skeleton of the category of sets.

## History

The notion of cardinality, as now understood, was formulated by Georg Cantor, the originator of set theory, in 1874–1884. Cardinality can be used to compare an aspect of finite sets. For example, the sets {1,2,3} and {4,5,6} are not equal, but have the same cardinality, namely three. This is established by the existence of a bijection (i.e., a one-to-one correspondence) between the two sets, such as the correspondence {1→4, 2→5, 3→6}.
Cantor applied his concept of bijection to infinite sets (for example the set of natural numbers N = {0, 1, 2, 3, ...}). Thus, he called all sets having a bijection with N denumerable (countably infinite) sets, which all share the same cardinal number. This cardinal number is called $\aleph _{0}$, aleph-null. He called the cardinal numbers of infinite sets transfinite cardinal numbers.
Cantor proved that any unbounded subset of N has the same cardinality as N, even though this might appear to run contrary to intuition. He also proved that the set of all ordered pairs of natural numbers is denumerable; this implies that the set of all rational numbers is also denumerable, since every rational can be represented by a pair of integers. He later proved that the set of all real algebraic numbers is also denumerable. Each real algebraic number z may be encoded as a finite sequence of integers, which are the coefficients in the polynomial equation of which it is a solution, i.e. the ordered n-tuple (a$_0$, a$_1$, ..., a$_n$), a$_i$ ∈ Z together with a pair of rationals (b$_0$, b$_1$) such that z is the unique root of the polynomial with coefficients (a$_0$, a$_1$, ..., a$_n$) that lies in the interval (b$_0$, b$_1$).
In his 1874 paper "On a Property of the Collection of All Real Algebraic Numbers", Cantor proved that there exist higher-order cardinal numbers, by showing that the set of real numbers has cardinality greater than that of N. His proof used an argument with nested intervals, but in an 1891 paper, he proved the same result using his ingenious and much simpler diagonal argument. The new cardinal number of the set of real numbers is called the cardinality of the continuum and Cantor used the symbol ${\mathfrak {c}}$ for it.
Cantor also developed a large portion of the general theory of cardinal numbers; he proved that there is a smallest transfinite cardinal number ($\aleph _{0}$, aleph-null), and that for every cardinal number there is a next-larger cardinal
    $(\aleph _{1},\aleph _{2},\aleph _{3},\ldots ).$
His continuum hypothesis is the proposition that the cardinality ${\mathfrak {c}}$ of the set of real numbers is the same as $\aleph _{1}$. This hypothesis is independent of the standard axioms of mathematical set theory, that is, it can neither be proved nor disproved from them. This was shown in 1963 by Paul Cohen, complementing earlier work by Kurt Gödel in 1940.

## Motivation

In informal use, a cardinal number is what is normally referred to as a counting number, provided that 0 is included: 0, 1, 2, .... They may be identified with the natural numbers beginning with 0. The counting numbers are exactly what can be defined formally as the finite cardinal numbers. Infinite cardinals only occur in higher-level mathematics and logic.
More formally, a non-zero number can be used for two purposes: to describe the size of a set, or to describe the position of an element in a sequence. For finite sets and sequences it is easy to see that these two notions coincide, since for every number describing a position in a sequence we can construct a set that has exactly the right size. For example, 3 describes the position of 'c' in the sequence <'a','b','c','d',...>, and we can construct the set {a,b,c}, which has 3 elements.
However, when dealing with infinite sets, it is essential to distinguish between the two, since the two notions are in fact different for infinite sets. Considering the position aspect leads to ordinal numbers, while the size aspect is generalized by the cardinal numbers described here.
The intuition behind the formal definition of cardinal is the construction of a notion of the relative size or "bigness" of a set, without reference to the kind of members which it has. For finite sets this is easy; one simply counts the number of elements a set has. In order to compare the sizes of larger sets, it is necessary to appeal to more refined notions.
A set Y is at least as big as a set X if there is an injective mapping from the elements of X to the elements of Y. An injective mapping identifies each element of the set X with a unique element of the set Y. This is most easily understood by an example; suppose we have the sets X = {1,2,3} and Y = {a,b,c,d}, then using this notion of size, we would observe that there is a mapping:
    1 → a
    2 → b
    3 → c
which is injective, and hence conclude that Y has cardinality greater than or equal to X. The element d has no element mapping to it, but this is permitted as we only require an injective mapping, and not necessarily a bijective mapping. The advantage of this notion is that it can be extended to infinite sets.
We can then extend this to an equality-style relation. Two sets X and Y are said to have the same cardinality if there exists a bijection between X and Y. By the Schroeder–Bernstein theorem, this is equivalent to there being both an injective mapping from X to Y, and an injective mapping from Y to X. We then write |X| = |Y|. The cardinal number of X itself is often defined as the least ordinal a with |a| = |X|. This is called the von Neumann cardinal assignment; for this definition to make sense, it must be proved that every set has the same cardinality as some ordinal; this statement is the well-ordering principle. It is however possible to discuss the relative cardinality of sets without explicitly assigning names to objects.
The classic example used is that of the infinite hotel paradox, also called Hilbert's paradox of the Grand Hotel. Supposing there is an innkeeper at a hotel with an infinite number of rooms. The hotel is full, and then a new guest arrives. It is possible to fit the extra guest in by asking the guest who was in room 1 to move to room 2, the guest in room 2 to move to room 3, and so on, leaving room 1 vacant. We can explicitly write a segment of this mapping:
    1 → 2
    2 → 3
    3 → 4
    n → n + 1
With this assignment, we can see that the set {1,2,3,...} has the same cardinality as the set {2,3,4,...}, since a bijection between the first and the second has been shown. This motivates the definition of an infinite set being any set that has a proper subset of the same cardinality (i.e., a Dedekind-infinite set); in this case {2,3,4,...} is a proper subset of {1,2,3,...}.
When considering these large objects, one might also want to see if the notion of counting order coincides with that of cardinal defined above for these infinite sets. It happens that it does not; by considering the above example we can see that if some object "one greater than infinity" exists, then it must have the same cardinality as the infinite set we started out with. It is possible to use a different formal notion for number, called ordinals, based on the ideas of counting and considering each number in turn, and we discover that the notions of cardinality and ordinality are divergent once we move out of the finite numbers.
It can be proved that the cardinality of the real numbers is greater than that of the natural numbers just described. This can be visualized using Cantor's diagonal argument; classic questions of cardinality (for instance the continuum hypothesis) are concerned with discovering whether there is some cardinal between some pair of other infinite cardinals. In more recent times, mathematicians have been describing the properties of larger and larger cardinals.
Since cardinality is such a common concept in mathematics, a variety of names are in use. Sameness of cardinality is sometimes referred to as equipotence, equipollence, or equinumerosity. It is thus said that two sets with the same cardinality are, respectively, equipotent, equipollent, or equinumerous.

## Formal definition

Formally, assuming the axiom of choice, the cardinality of a set X is the least ordinal number α such that there is a bijection between X and α. This definition is known as the von Neumann cardinal assignment. If the axiom of choice is not assumed, then a different approach is needed. The oldest definition of the cardinality of a set X (implicit in Cantor and explicit in Frege and Principia Mathematica) is as the class [X] of all sets that are equinumerous with X. This does not work in ZFC or other related systems of axiomatic set theory because if X is non-empty, this collection is too large to be a set. In fact, for X ≠ ∅ there is an injection from the universe into [X] by mapping a set m to {m} × X, and so by the axiom of limitation of size, [X] is a proper class. The definition does work however in type theory and in New Foundations and related systems. However, if we restrict from this class to those equinumerous with X that have the least rank, then it will work (this is a trick due to Dana Scott: it works because the collection of objects with any given rank is a set).
Von Neumann cardinal assignment implies that the cardinal number of a finite set is the common ordinal number of all possible well-orderings of that set, and cardinal and ordinal arithmetic (addition, multiplication, power, proper subtraction) then give the same answers for finite numbers. However, they differ for infinite numbers. For example, $2^{\omega }=\omega <\omega ^{2}$ in ordinal arithmetic while $2^{\aleph _{0}}>\aleph _{0}=\aleph _{0}^{2}$ in cardinal arithmetic, although the von Neumann assignment puts $\aleph _{0}=\omega$. On the other hand, Scott's trick implies that the cardinal number 0 is $\{\emptyset \}$, which is also the ordinal number 1, and this may be confusing. A possible compromise (to take advantage of the alignment in finite arithmetic while avoiding reliance on the axiom of choice and confusion in infinite arithmetic) is to apply von Neumann assignment to the cardinal numbers of finite sets (those which can be well ordered and are not equipotent to proper subsets) and to use Scott's trick for the cardinal numbers of other sets.
Formally, the order among cardinal numbers is defined as follows: |X| ≤ |Y| means that there exists an injective function from X to Y. The Cantor–Bernstein–Schroeder theorem states that if |X| ≤ |Y| and |Y| ≤ |X| then |X| = |Y|. The axiom of choice is equivalent to the statement that given two sets X and Y, either |X| ≤ |Y| or |Y| ≤ |X|.
A set X is Dedekind-infinite if there exists a proper subset Y of X with |X| = |Y|, and Dedekind-finite if such a subset does not exist. The finite cardinals are just the natural numbers, in the sense that a set X is finite if and only if |X| = |n| = n for some natural number n. Any other set is infinite.
Assuming the axiom of choice, it can be proved that the Dedekind notions correspond to the standard ones. It can also be proved that the cardinal $\aleph _{0}$ (aleph null or aleph-0, where aleph is the first letter in the Hebrew alphabet, represented $\aleph$) of the set of natural numbers is the smallest infinite cardinal (i.e., any infinite set has a subset of cardinality $\aleph _{0}$). The next larger cardinal is denoted by $\aleph _{1}$, and so on. For every ordinal α, there is a cardinal number $\aleph _{\alpha },$ and this list exhausts all infinite cardinal numbers.

## Cardinal arithmetic

We can define arithmetic operations on cardinal numbers that generalize the ordinary operations for natural numbers. It can be shown that for finite cardinals, these operations coincide with the usual operations for natural numbers. Furthermore, these operations share many properties with ordinary arithmetic.

### Successor cardinal

If the axiom of choice holds, then every cardinal κ has a successor, denoted κ$^+$, where κ$^+$ > κ and there are no cardinals between κ and its successor. (Without the axiom of choice, using Hartogs' theorem, it can be shown that for any cardinal number κ, there is a minimal cardinal κ$^+$ such that $\kappa ^{+}\nleq \kappa .$) For finite cardinals, the successor is simply κ + 1. For infinite cardinals, the successor cardinal differs from the successor ordinal.

### Cardinal addition

If X and Y are disjoint, addition is given by the union of X and Y. If the two sets are not already disjoint, then they can be replaced by disjoint sets of the same cardinality (e.g., replace X by X×{0} and Y by Y×{1}).
    $|X|+|Y|=|X\cup Y|.$
Zero is an additive identity κ + 0 = 0 + κ = κ.
Addition is associative (κ + μ) + ν = κ + (μ + ν).
Addition is commutative κ + μ = μ + κ.
Addition is non-decreasing in both arguments:
    $(\kappa \leq \mu )\rightarrow ((\kappa +\nu \leq \mu +\nu ){\mbox{ and }}(\nu +\kappa \leq \nu +\mu )).$
Assuming the axiom of choice, addition of infinite cardinal numbers is easy. If either κ or μ is infinite, then
    $\kappa +\mu =\max\{\kappa ,\mu \}\,.$

#### Subtraction

Assuming the axiom of choice and, given an infinite cardinal σ and a cardinal μ, there exists a cardinal κ such that μ + κ = σ if and only if μ ≤ σ. It will be unique (and equal to σ) if and only if μ < σ.

### Cardinal multiplication

The product of cardinals comes from the Cartesian product.
    $|X|\cdot |Y|=|X\times Y|$
κ·0 = 0·κ = 0.
κ·μ = 0 → (κ = 0 or μ = 0).
One is a multiplicative identity κ·1 = 1·κ = κ.
Multiplication is associative (κ·μ)·ν = κ·(μ·ν).
Multiplication is commutative κ·μ = μ·κ.
Multiplication is non-decreasing in both arguments: κ ≤ μ → (κ·ν ≤ μ·ν and ν·κ ≤ ν·μ).
Multiplication distributes over addition: κ·(μ + ν) = κ·μ + κ·ν and (μ + ν)·κ = μ·κ + ν·κ.
Assuming the axiom of choice, multiplication of infinite cardinal numbers is also easy. If either κ or μ is infinite and both are non-zero, then
    $\kappa \cdot \mu =\max\{\kappa ,\mu \}.$
Thus the product of two infinite cardinal numbers is equal to their sum.

#### Division

Assuming the axiom of choice and, given an infinite cardinal π and a non-zero cardinal μ, there exists a cardinal κ such that μ · κ = π if and only if μ ≤ π. It will be unique (and equal to π) if and only if μ < π.

### Cardinal exponentiation

Exponentiation is given by
    $|X|^{|Y|}=\left|X^{Y}\right|,$
where X$^Y$ is the set of all functions from Y to X. It is easy to check that the right-hand side depends only on ${|X|}$ and ${|Y|}$.
    κ$^0$ = 1 (in particular 0$^0$ = 1), see empty function.
    If 1 ≤ μ, then 0$^μ$ = 0.
    1$^μ$ = 1.
    κ$^1$ = κ.
    κ$^{μ+ν}$ = κ$^μ$·κ$^ν$.
    κ$^{μ·ν}$ = (κ$^μ$)$^ν$.
    (κ·μ)$^ν$ = κ$^ν$·μ$^ν$.
Exponentiation is non-decreasing in both arguments:
    (1 ≤ ν and κ ≤ μ) → (ν$^κ$ ≤ ν$^μ$) and
    (κ ≤ μ) → (κ$^ν$ ≤ μ$^ν$).
2$^{|X|}$ is the cardinality of the power set of the set X and Cantor's diagonal argument shows that 2$^{|X|}$ > |X| for any set X. This proves that no largest cardinal exists (because for any cardinal κ, we can always find a larger cardinal 2$^κ$). In fact, the class of cardinals is a proper class. (This proof fails in some set theories, notably New Foundations.)
All the remaining propositions in this section assume the axiom of choice:
    If κ and μ are both finite and greater than 1, and ν is infinite, then κ$^ν$ = μ$^ν$.
    If κ is infinite and μ is finite and non-zero, then κ$^μ$ = κ.
If 2 ≤ κ and 1 ≤ μ and at least one of them is infinite, then:
    Max (κ, 2$^μ$) ≤ κ$^μ$ ≤ Max (2$^κ$, 2$^μ$).
Using König's theorem, one can prove κ < κ$^{cf(κ)}$ and κ < cf(2$^κ$) for any infinite cardinal κ, where cf(κ) is the cofinality of κ.

#### Roots

Assuming the axiom of choice and, given an infinite cardinal κ and a finite cardinal μ greater than 0, the cardinal ν satisfying $\nu ^{\mu }=\kappa$ will be $\kappa$.

#### Logarithms

Assuming the axiom of choice and, given an infinite cardinal κ and a finite cardinal μ greater than 1, there may or may not be a cardinal λ satisfying $\mu ^{\lambda }=\kappa$. However, if such a cardinal exists, it is infinite and less than κ, and any finite cardinality ν greater than 1 will also satisfy $\nu ^{\lambda }=\kappa$.
The logarithm of an infinite cardinal number κ is defined as the least cardinal number μ such that κ ≤ 2$^μ$. Logarithms of infinite cardinals are useful in some fields of mathematics, for example in the study of cardinal invariants of topological spaces, though they lack some of the properties that logarithms of positive real numbers possess.

## The continuum hypothesis

The continuum hypothesis (CH) states that there are no cardinals strictly between $\aleph _{0}$ and $2^{\aleph _{0}}.$ The latter cardinal number is also often denoted by ${\mathfrak {c}}$; it is the cardinality of the continuum (the set of real numbers). In this case $2^{\aleph _{0}}=\aleph _{1}.$
Similarly, the generalized continuum hypothesis (GCH) states that for every infinite cardinal $\kappa$, there are no cardinals strictly between $\kappa$ and $2^{\kappa }$. Both the continuum hypothesis and the generalized continuum hypothesis have been proved to be independent of the usual axioms of set theory, the Zermelo–Fraenkel axioms together with the axiom of choice (ZFC).
Indeed, Easton's theorem shows that, for regular cardinals $\kappa$, the only restrictions ZFC places on the cardinality of $2^{\kappa }$ are that $\kappa <\operatorname {cf} (2^{\kappa })$, and that the exponential function is non-decreasing.