In this section we carry out some basic preparatory work and establish notation which will be used throughout the rest of this module (and in many subsequent ones).
In many ways, mathematics is like a language; an important part of doing mathematics at university level is learning to read and write it correctly. We need to learn both which symbols to use and how to put them together to communicate what we want to say in a way that should be clear to any reader.
We begin with a concept even more basic than that of a number.
A set is a collection of objects. The objects concerned are called the elements (or members) of the set.
Sets are usually denoted by capital letters , and so on. The elements of a set may be anything, but most of the sets we shall consider will be collections of numbers.
We use the following symbols for particular sets of numbers.
(written ) is the set of natural numbers:
(written ) is the set of natural numbers and zero:
(written ) is the set of integers:
(written ) is the set of rational numbers: those that can be written in the form , where and are integers (and ).
(written ) is the set of real numbers: all ‘‘points on the number line’’, or equivalently all numbers having a (possibly infinite) decimal expansion — e.g., , , and .
(For now we shall simply assume that we know what the elements of these sets are; later we shall consider this question in a little more detail.)
Let be a set. We write to mean ‘‘ is an element of ’’ (or ‘‘ belongs to ’’). Similarly, we write to mean ‘‘ is not an element of ’’ (or ‘‘ does not belong to ’’). These can also be written the other way round: for example, means ‘‘ contains ’’, which is the same as .
We have but ; also , but .
There is one particular set which is distinguished by having no elements at all!
The set containing no elements is called the empty set, and is written ; any set other than the empty set is called non-empty.
We shall next introduce two different methods to link a set with all of its elements.
We can describe a finite set simply by listing all of its elements, using curly brackets to enclose them; for example, the set whose elements are , and is written
This notation may be extended to infinite sets by using dots (provided that it is clear what is meant); thus we may write
When listing the elements of a set is not possible, we may instead describe it by specifying a defining property. More precisely, if is a set and stands for some statement involving , then we write
for ‘‘the set of all in such that is true’’ (the colon is read ‘‘such that’’). Thus for example
is the set of real solutions to the equation , i.e., . Similarly, we have
This set could also be specified as , using a variant of this notation. Another example of this variant is
Note the difference between (i) and (ii): what goes before the colon gives the elements themselves, while what goes after the colon gives any conditions they must satisfy.
Finally we state some definitions involving pairs of sets; they may well be familiar.
Given two sets and , we say that is a subset of if every element of also lies in ; we write (or ) to indicate this.
and
Clearly if and then , since and have the same elements.
The remaining definitions provide ways of constructing a new set from two old ones.
Given two sets and , their intersection is the set of elements common to both and ; it is written . If , then we say that and are disjoint.
Thus we have . Clearly and .
and
Given two sets and , their union is the set of elements which lie in at least one of and ; it is written .
Thus we have . Clearly and .
and
Given two sets and , their (set-theoretic) difference is the set of elements which belong to , but not to ; it is written .
Thus we have .
and ;
and .