In mathematics, the cardinality of a set is a measure of the "number of elements of the set". For example, the set $A\; =\; \backslash \{2,\; 4,\; 6\backslash \}$ contains 3 elements, and therefore $A$ has a cardinality of 3. There are two approaches to cardinality – one which compares sets directly using and injections, and another which uses .
The cardinality of a set is also called its size, when no confusion with other notions of size[Such as length and area in geometry. – A line of finite length is a set of points that has infinite cardinality.] is possible.
The cardinality of a set $A$ is usually denoted $A$, with a vertical bar on each side; this is the same notation as absolute value and the meaning depends on Ambiguity. Alternatively, the cardinality of a set $A$ may be denoted by $n(A)$, $A$, $card(A)$, or $\backslash \#A$.
Comparing sets
While the cardinality of a finite set is just the number of its elements, extending the notion to infinite sets usually starts with defining the notion of comparison of arbitrary (in particular infinite) sets.
Definition 1: =
 Two sets A and B have the same cardinality if there exists a bijection from A to B, that is, a function from A to B that is both injective and surjective. Such sets are said to be equipotent, equipollent, or equinumerous. This relationship can also be denoted A ≈ B or A ~ B.
 For example, the set E = {0, 2, 4, 6, ...} of nonnegative has the same cardinality as the set N = {0, 1, 2, 3, ...} of natural numbers, since the function f( n) = 2 n is a bijection from N to E.
Definition 2: ≤
 A has cardinality less than or equal to the cardinality of B if there exists an injective function from A into B.
Definition 3: <
 A has cardinality strictly less than the cardinality of B if there is an injective function, but no bijective function, from A to B.
 For example, the set N of all natural numbers has cardinality strictly less than the cardinality of the set R of all , because the inclusion map i : N → R is injective, but it can be shown that there does not exist a bijective function from N to R (see Cantor's diagonal argument or Cantor's first uncountability proof).
If ≤ and ≤ then = (Schröder–Bernstein theorem). The axiom of choice is equivalent to the statement that ≤ or ≤ for every A, B.[  Original edition (1914)]
Cardinal numbers
Above, "cardinality" was defined functionally. That is, the "cardinality" of a set was not defined as a specific object itself. However, such an object can be defined as follows.
The relation of having the same cardinality is called equinumerosity, and this is an equivalence relation on the class of all sets. The equivalence class of a set A under this relation then consists of all those sets which have the same cardinality as A. There are two ways to define the "cardinality of a set":

The cardinality of a set A is defined as its equivalence class under equinumerosity.

A representative set is designated for each equivalence class. The most common choice is the initial ordinal in that class. This is usually taken as the definition of cardinal number in axiomatic set theory.
Assuming AC, the cardinalities of the are denoted
 $\backslash aleph\_0\; <\; \backslash aleph\_1\; <\; \backslash aleph\_2\; <\; \backslash ldots\; .$
For each
Ordinal number $\backslash alpha$,
$\backslash aleph\_\{\backslash alpha\; +\; 1\}$ is the least cardinal number greater than
$\backslash aleph\_\backslash alpha$.
The cardinality of the is denoted aleph number ($\backslash aleph\_0$), while the cardinality of the is denoted by "$\backslash mathfrak\; c$" (a lowercase fraktur script "c"), and is also referred to as the cardinality of the continuum. Cantor showed, using the diagonal argument, that $\{\backslash mathfrak\; c\}\; >\backslash aleph\_0$. We can show that $\backslash mathfrak\; c\; =\; 2^\{\backslash aleph\_0\}$, this also being the cardinality of the set of all subsets of the natural numbers. The continuum hypothesis says that $\backslash aleph\_1\; =\; 2^\{\backslash aleph\_0\}$, i.e. $2^\{\backslash aleph\_0\}$ is the smallest cardinal number bigger than $\backslash aleph\_0$, i.e. there is no set whose cardinality is strictly between that of the integers and that of the real numbers.
The continuum hypothesis is independent of ZFC, a standard axiomatization of set theory; that is, it is impossible to prove the continuum hypothesis or its negation from ZFC (provided ZFC is consistent). See below for more details on the cardinality of the continuum.
Finite, countable and uncountable sets
If the axiom of choice holds, the law of trichotomy holds for cardinality. Thus we can make the following definitions:

Any set X with cardinality less than that of the , or  X  <  N , is said to be a finite set.

Any set X that has the same cardinality as the set of the natural numbers, or  X  =  N  = $\backslash aleph\_0$, is said to be a countably infinite set.

Any set X with cardinality greater than that of the natural numbers, or  X  >  N , for example  R  = $\backslash mathfrak\; c$ >  N , is said to be uncountable set.
Infinite sets
Our intuition gained from
breaks down when dealing with
. In the late nineteenth century
Georg Cantor,
Gottlob Frege,
Richard Dedekind and others rejected the view that the whole cannot be the same size as the part. One example of this is Hilbert's paradox of the Grand Hotel.
Indeed, Dedekind defined an infinite set as one that can be placed into a onetoone correspondence with a strict subset (that is, having the same size in Cantor's sense); this notion of infinity is called Dedekind infinite. Cantor introduced the cardinal numbers, and showed that (according to his bijectionbased definition of size) some infinite sets are greater than others. The smallest infinite cardinality is that of the natural numbers (
$\backslash aleph\_0$).
Cardinality of the continuum
One of Cantor's most important results was that the cardinality of the continuum (
$\backslash mathfrak\{c\}$) is greater than that of the natural numbers (
$\backslash aleph\_0$); that is, there are more real numbers
R than whole numbers
N. Namely, Cantor showed that
$\backslash mathfrak\{c\}\; =\; 2^\{\backslash aleph\_0\}\; =\; \backslash beth\_1$ (see Beth one) satisfies:
 $2^\{\backslash aleph\_0\}\; >\; \backslash aleph\_0$
 (see Cantor's diagonal argument or Cantor's first uncountability proof).
The continuum hypothesis states that there is no cardinal number between the cardinality of the reals and the cardinality of the natural numbers, that is,
 $2^\{\backslash aleph\_0\}\; =\; \backslash aleph\_1$
However, this hypothesis can neither be proved nor disproved within the widely accepted ZFC axiomatic set theory, if ZFC is consistent.
Cardinal arithmetic can be used to show not only that the number of points in a real number line is equal to the number of points in any line segment of that line, but that this is equal to the number of points on a plane and, indeed, in any finitedimensional space. These results are highly counterintuitive, because they imply that there exist and of an infinite set S that have the same size as S, although S contains elements that do not belong to its subsets, and the supersets of S contain elements that are not included in it.
The first of these results is apparent by considering, for instance, the tangent function, which provides a onetoone correspondence between the interval (−½π, ½π) and R (see also Hilbert's paradox of the Grand Hotel).
The second result was first demonstrated by Cantor in 1878, but it became more apparent in 1890, when Giuseppe Peano introduced the spacefilling curves, curved lines that twist and turn enough to fill the whole of any square, or cube, or hypercube, or finitedimensional space. These curves are not a direct proof that a line has the same number of points as a finitedimensional space, but they can be used to obtain such a proof.
Cantor also showed that sets with cardinality strictly greater than $\backslash mathfrak\; c$ exist (see his generalized diagonal argument and theorem). They include, for instance:
 * the set of all subsets of R, i.e., the power set of R, written P( R) or 2^{ R}
 * the set R^{ R} of all functions from R to R
Both have cardinality
 $2^\backslash mathfrak\; \{c\}\; =\; \backslash beth\_2\; >\; \backslash mathfrak\; c$
 (see Beth two).
The cardinal equalities $\backslash mathfrak\{c\}^2\; =\; \backslash mathfrak\{c\},$ $\backslash mathfrak\; c^\{\backslash aleph\_0\}\; =\; \backslash mathfrak\; c,$ and $\backslash mathfrak\; c\; ^\{\backslash mathfrak\; c\}\; =\; 2^\{\backslash mathfrak\; c\}$ can be demonstrated using cardinal arithmetic:
 $\backslash mathfrak\{c\}^2\; =\; \backslash left(2^\{\backslash aleph\_0\}\backslash right)^2\; =\; 2^\{2\backslash times\{\backslash aleph\_0\}\}\; =\; 2^\{\backslash aleph\_0\}\; =\; \backslash mathfrak\{c\},$
 $\backslash mathfrak\; c^\{\backslash aleph\_0\}\; =\; \backslash left(2^\{\backslash aleph\_0\}\backslash right)^\{\backslash aleph\_0\}\; =\; 2^\; =\; 2^\{\backslash aleph\_0\}\; =\; \backslash mathfrak\{c\},$
 $\backslash mathfrak\; c\; ^\{\backslash mathfrak\; c\}\; =\; \backslash left(2^\{\backslash aleph\_0\}\backslash right)^\{\backslash mathfrak\; c\}\; =\; 2^\{\backslash mathfrak\; c\backslash times\backslash aleph\_0\}\; =\; 2^\{\backslash mathfrak\; c\}.$
Examples and properties

If X = { a, b, c} and Y = {apples, oranges, peaches}, then  X  =  Y  because { ( a, apples), ( b, oranges), ( c, peaches)} is a bijection between the sets X and Y. The cardinality of each of X and Y is 3.

If  X  <  Y , then there exists Z such that  X  =  Z  and Z ⊆ Y.

If  X  ≤  Y  and  Y  ≤  X , then  X  =  Y . This holds even for infinite cardinals, and is known as Cantor–Bernstein–Schroeder theorem.

Sets with cardinality of the continuum
Union and intersection
If
A and
B are
disjoint sets, then
 $\backslash left\backslash vert\; A\; \backslash cup\; B\; \backslash right\backslash vert\; =\; \backslash left\backslash vert\; A\; \backslash right\backslash vert\; +\; \backslash left\backslash vert\; B\; \backslash right\backslash vert.$
From this, one can show that in general the cardinalities of unions and intersections are related by[Applied Abstract Algebra, K.H. Kim, F.W. Roush, Ellis Horwood Series, 1983, (student edition), (library edition)]
 $\backslash left\backslash vert\; C\; \backslash cup\; D\; \backslash right\backslash vert\; +\; \backslash left\backslash vert\; C\; \backslash cap\; D\; \backslash right\backslash vert\; =\; \backslash left\backslash vert\; C\; \backslash right\backslash vert\; +\; \backslash left\backslash vert\; D\; \backslash right\backslash vert\; \backslash ,.$
See also