Definition: The cartesian product of two sets
and
is the set of all ordered pairs where
is an element of
and
is an element of
.
![]()
But is this a set? To answer this we need the concept of the Power Set of a set
.
Definition: The Power Set
is the set of all subsets of
.
![]()
If we have for all
in
and for all
in
the set
the we know that
is an element of the Power Set of
by its definition. Similarly, we also know that
is an element of the Power Set of
. Hence noting that
:
![]()
If
is in the power set of the power set of
then the set of all
is a subset of the power set of the power set of
. From above
.
![]()
Hence we know the Power Set is a set and we know that a subset of a set is a set and so the cartesian product forms a set. All is good!
The cartesian product has many uses. At first encountered we may know it as a graph
that can be plotted i.e. a set of coordinates. This idea leads to an isomorphic map from cartesian products of sets of real numbers to vectors under a given basis. Ordered pairs can be used to describe relations out of which come mappings and functions. The set theory used in the above is profound and powerful in nature.
