Suppose
and
.
Relabelling the elements of
yields a set
of the same cardinality, but which is disjoint from
.
Then
.
This observation lets one add cardinal numbers in general:
if
and
are arbitrary sets
then the sum of the cardinal numbers
and
is defined to be the cardinality of
where
is obtained from
by relabeling elements
so that
.
For example, in the disjoint union
The Cartesian product
of two sets
and
is the set of all ordered pairs
where
and
.
For example, if
and
, then
These equalities may look strange, but in fact,
such behavior is typical:
one can prove that if
and
are cardinal numbers
such that
and
is infinite,
then
.
There is no nice way of subtracting or dividing cardinal numbers.
But one can exponentiate.
If
and
are arbitrary sets,
let
denote the set of functions from
to
.
Note the reversal of order!
Then
is defined to be the cardinality of
.
For example,
if
and
,
then a sample element of
might be described by
the function {1,2,3}->N sending 1 to 12, 2 to 753, and 3 to 489.