We can describe a set either by enumerating all the elements of the set
or by stating the properties that uniquely characterize the elements
of the set. Thus, the set of all even positive integers not larger than
10 can be described either as
or, equivalently, as
![]()
A set can have another set as one of its elements. For example, the set
contains two elements
and
; and the
first element is itself a set.
We will use the notation
to denote that
is an element of
(``belongs to'') the set
.
A set
is a subset of another set
, denoted as
, if
whenever
.
An empty set is one which contains no elements and we will denote
it with the symbol
. For example, let
be the set of all
students who fail the course CS120.
might turn out to be empty
(hopefully; if everybody studies hard). By definition, the empty set
is a subset of all sets. We will also assume an Universe
of discourse
, and every set that we will consider is a subset
of
. Thus we have
The union of two sets
and
, denoted
is the set
whose elements are exactly the elements of either
or
(or both).
The intersection of two sets
and
, denoted
is the set
whose elements are exactly the elements of both
and
. Thus, we have
The Cartesian product of two sets
and
, denoted by
, is the set of all ordered pairs
such that
and
. Thus,
We will use the following notation to denote some standard sets: