Xrthnty

In mathematics, the cardinality of a set is a measure of the "number of elements of the set". For example, the set A=2,4,6displaystyle A=2,4,6 contains 3 elements, and therefore Adisplaystyle A has a cardinality of 3. There are two approaches to cardinality – one which compares sets directly using bijections and injections, and another which uses cardinal numbers.^[1]
The cardinality of a set is also called its size, when no confusion with other notions of size^[2] is possible.

The cardinality of a set Adisplaystyle A is usually denoted |A|A, with a vertical bar on each side; this is the same notation as absolute value and the meaning depends on context. Alternatively, the cardinality of a set Adisplaystyle A may be denoted by n(A)displaystyle n(A), Adisplaystyle A, card(A)displaystyle card(A), or #Adisplaystyle #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 (possibly infinite) sets.

Bijective function from N to E. Although E is a proper subset of N, both sets have the same cardinality.

Definition 1: |A| = |B|

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 non-negative even numbers has the same cardinality as the set N = 0, 1, 2, 3, ... of natural numbers, since the function f(n) = 2n is a bijection from N to E.

Definition 2: |A| ≤ |B|

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| < |B|

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 real numbers , 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 |A| ≤ |B| and |B| ≤ |A| then |A| = |B| (Schröder–Bernstein theorem). The axiom of choice is equivalent to the statement that |A| ≤ |B| or |B| ≤ |A| for every A, B.^[3][4]

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":

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


2. 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 infinite sets are denoted

ℵ0<ℵ1<ℵ2<….displaystyle aleph _0<aleph _1<aleph _2<ldots .

For each ordinal αdisplaystyle alpha , ℵα+1displaystyle aleph _alpha +1 is the least cardinal number greater than ℵαdisplaystyle aleph _alpha .

The cardinality of the natural numbers is denoted aleph-null (ℵ0displaystyle aleph _0), while the cardinality of the real numbers is denoted by "cdisplaystyle 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 c>ℵ0displaystyle mathfrak c>aleph _0. We can show that c=2ℵ0displaystyle mathfrak c=2^aleph _0, this also being the cardinality of the set of all subsets of the natural numbers. The continuum hypothesis says that ℵ1=2ℵ0displaystyle aleph _1=2^aleph _0, i.e. 2ℵ0displaystyle 2^aleph _0 is the smallest cardinal number bigger than ℵ0displaystyle 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.^[5][6][7]

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 natural numbers, 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 | = ℵ0displaystyle 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 | = cdisplaystyle mathfrak c > | N |, is said to be uncountable.

Infinite sets

Our intuition gained from finite sets breaks down when dealing with infinite sets. 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 one-to-one 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 bijection-based definition of size) some infinite sets are greater than others. The smallest infinite cardinality is that of the natural numbers (ℵ0displaystyle aleph _0).

Cardinality of the continuum

One of Cantor's most important results was that the cardinality of the continuum (cdisplaystyle mathfrak c) is greater than that of the natural numbers (ℵ0displaystyle aleph _0); that is, there are more real numbers R than natural numbers N. Namely, Cantor showed that c=2ℵ0=ℶ1displaystyle mathfrak c=2^aleph _0=beth _1 (see Beth one) satisfies:

2ℵ0>ℵ0displaystyle 2^aleph _0>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ℵ0=ℵ1displaystyle 2^aleph _0=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 segment of that line, but that this is equal to the number of points on a plane and, indeed, in any finite-dimensional space. These results are highly counterintuitive, because they imply that there exist proper subsets and proper supersets 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 one-to-one 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 space-filling curves, curved lines that twist and turn enough to fill the whole of any square, or cube, or hypercube, or finite-dimensional space. These curves are not a direct proof that a line has the same number of points as a finite-dimensional space, but they can be used to obtain such a proof.

Cantor also showed that sets with cardinality strictly greater than cdisplaystyle 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

2c=ℶ2>cdisplaystyle 2^mathfrak c=beth _2>mathfrak c

(see Beth two).

The cardinal equalities c2=c,displaystyle mathfrak c^2=mathfrak c, cℵ0=c,displaystyle mathfrak c^aleph _0=mathfrak c, and cc=2cdisplaystyle mathfrak c^mathfrak c=2^mathfrak c can be demonstrated using cardinal arithmetic:

c2=(2ℵ0)2=22×ℵ0=2ℵ0=c,displaystyle mathfrak c^2=left(2^aleph _0right)^2=2^2times aleph _0=2^aleph _0=mathfrak c,

cℵ0=(2ℵ0)ℵ0=2ℵ0×ℵ0=2ℵ0=c,displaystyle mathfrak c^aleph _0=left(2^aleph _0right)^aleph _0=2^aleph _0times aleph _0=2^aleph _0=mathfrak c,

cc=(2ℵ0)c=2c×ℵ0=2c.displaystyle mathfrak c^mathfrak c=left(2^aleph _0right)^mathfrak c=2^mathfrak ctimes aleph _0=2^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

|A∪B|=|A|+|B|.displaystyle leftvert Acup Brightvert =leftvert Arightvert +leftvert Brightvert .

From this, one can show that in general the cardinalities of unions and intersections are related by^[8]

|C∪D|+|C∩D|=|C|+|D|.displaystyle leftvert Ccup Drightvert +leftvert Ccap Drightvert =leftvert Crightvert +leftvert Drightvert ,.

See also

Wikimedia Commons has media related to Cardinality.

Wikidata has the properties: cardinality of the group (P1164) (see uses) cardinality of this set (P2820) (see uses)

• Aleph number


• Beth number


• Countable set


• Counting


• Ordinality

References