Sets are arguably the most fundamental objects in modern mathematics.
Familiarity with set notation is a prerequisite to reading
post-secondary mathematics.
What follows is a brief summary of key definitions and concepts
related to sets required in this course.
Definition
A set is a well-defined collection of distinct mathematical objects.
The objects are called members or elements
of the set.
Describing sets
One can describe a set by
specifying a rule or a verbal description. For example,
one can say “let be the set of all odd integers”.
Then is a set and its elements are all the odd integers.
enclosing the list of members within curly brackets.
For example,
denotes a set of three numbers: 2, 4, and 5, and
denotes a set of two pairs of numbers.
Abbreviations can be used
if the set is large or infinite. For example, one may write
to specify the set of odd integers from up to
, and to specify the (infinite) set
of all positive integer multiples of .
Another option is to use set-builder notation:
is an integer with
is the set of cubes of the first
positive integers. (The way to interpret this is as follows:
is the set of all such that is an integer
from to .)
Examples
The set of all even integers is given by .
The set of all polynomials in with real coefficients having
degree at most two
is given by .
Special sets
denotes the empty set, the set with no members.
denotes the set of natural numbers; i.e. .
denotes the set of integers; i.e.
.
denotes the set of rational numbers
(the set of all possible fractions, including the integers).
denotes the set of real numbers.
denotes the set of complex numbers. (This set will be
introduced more formally later.)
Sets of -tuples
There is a convenient notation for specifying sets of -tuples whose
entries are from the same set.
Let be a set. Let be a positive integer.
Then, the set of -tuples whose entries are elements of is
denoted by .
For example, is the set of all -tuples whose
entries are integers. In other words,
.
Common Set Notation
Let and be sets.
, called cardinality of ,
denotes the number of elements of . For example,
if , then
.
if and only if they have precisely the same elements. For example,
if and or , then
.
if and only if
every element of is also an element of .
We call a subset of .
For example, .
means is a member of . For example,
means is not a member of .
For example,
denotes the set containing elements that are in both
and .
is called the intersection of and .
For example, if and , then
.
denotes the set containing elements that are in either
or or both.
is called the union of and .
For example, if and , then
.
denotes the set containing elements that are in
but not in .
is read as “ drop ”.
For example, if and , then
.