# 0.3: Other Important Sets

- Page ID
- 89700

We have seen a few important sets above — namely \(\mathbb{N}, \mathbb{Z}, \mathbb{Q}\) and \(\mathbb{R}\text{.}\) However, arguably the most important set in mathematics is the empty set.

The empty set (or null set or void set) is the set which contains no elements. It is denoted \(\varnothing\text{.}\) For any object \(x\text{,}\) we always have \(x \notin \varnothing\text{;}\) hence \(\varnothing = \{ \}\text{.}\)

Note that it is important to realise that the empty set is not *nothing*; think of it as an empty bag. Also note that with quite a bit of hard work you can actually define the natural numbers in terms of the empty set. Doing so is very formal and well beyond the scope of this text.

When a set does not contain too many elements it is fine to specify it by listing out its elements. But for infinite sets or even just big sets we can't do this and instead we have to give the defining rule. For example the set of all perfect square numbers we write as

\begin{align*} S &= \{x \mbox{ s.t.} x = k^2 \mbox{ where } k \in \mathbb{Z} \} \end{align*}

Notice we have used another piece of shorthand here, namely \(\mbox{s.t.}\text{,}\) which stands for “such that” or “so that”. We read the above statement as “\(S\) is the set of elements \(x\) such that \(x\) equals \(k\)-squared where \(k\) is an integer”. This is the standard way of writing a set defined by a rule, though there are several shorthands for “such that”. We shall use two them:

\begin{align*} P &= \{ p \mbox{ s.t.} p \mbox{ is prime} \} = \{ p \,|\, p \mbox{ is prime} \} \end{align*}

Other people also use “:” is shorthand for “such that”. You should recognise all three of these shorthands.

Even more examples…

- Let \(A = \{2,3,5,7,11,13,17,19\}\) and let
\begin{align*} B &= \{ a \in A | a \lt 8\} = \{2,3,5,7\} \end{align*}

the set of elements of \(A\) that are strictly less than 8. - Even and odd integers
\begin{align*} E &= \{ n | n \mbox{ is an even integer} \}\\ &= \{n | n =2k \mbox{ for some $k \in \mathbb{Z}$ } \}\\ &= \{2n | n \in \mathbb{Z}\}, \end{align*}

and similarly\begin{align*} O &= \{ n | n \mbox{ is an odd integer} \}\\ &= \{2n+1 | n \in \mathbb{Z}\}. \end{align*}

- Square integers
\begin{align*} S &= \{n^2 | n \in \mathbb{Z}\}. \end{align*}

The set^{1}\(S'= \left \{ n^2 | n \in \mathbb{N} \right \}\) is not the same as \(S\) because \(S'\) does not contain the number \(0\text{,}\) which is definitely a square integer and \(0\) is in \(S\text{.}\) We could also write \(S =\left \{ n^2 | n \in \mathbb{Z}, n \geq 0\right \}\) and \(S=\left \{n^2 | n=0,1,2,\dots \right \}\text{.}\)

The sets \(A\) and \(B\) in the above example illustrate an important point. Every element in \(B\) is an element in \(A\text{,}\) and so we say that \(B\) is a subset of \(A\)

Let \(A\) and \(B\) be sets. We say “\(A\) is a subset of \(B\)” if every element of \(A\) is also an element of \(B\text{.}\) We denote this \(A \subseteq B\) (or \(B \supseteq A\)). If \(A\) is a subset of \(B\) and \(A\) and \(B\) are not the same , so that there is some element of \(B\) that is not in \(A\) then we say that \(A\) is a proper subset of \(B\text{.}\) We denote this by \(A \subset B\) (or \(B \supset A\)).

Two things to note about subsets:

- Let \(A\) be a set. It is always the case that \(\varnothing \subseteq A\text{.}\)
- If \(A\) is not a subset of \(B\) then we write \(A \not\subseteq B\text{.}\) This is the same as saying that there is some element of \(A\) that is not in \(B\text{.}\) That is, there is some \(a \in A\) such that \(a \notin B\text{.}\)

Let \(S = \{1,2\}\text{.}\) What are all the subsets of \(S\text{?}\) Well — each element of \(S\) can either be in the subset or not (independent of the other elements of the set). So we have \(2\times2 = 4\) possibilities: neither \(1\) nor \(2\) is in the subset, \(1\) is but \(2\) is not, \(2\) is but \(1\) is not, and both \(1\) and \(2\) are. That is

\begin{align*} \varnothing , \{1\}, \{2\}, \{1,2\} & \subseteq S \end{align*}

This argument can be generalised with a little work to show that a set that contains exactly \(n\) elements has exactly \(2^n\) subsets.

In much of our work with functions later in the text we will need to work with subsets of real numbers, particularly segments of the “real line”. A convenient and standard way of representing such subsets is with interval notation.

Let \(a, b \in \mathbb{R}\) such that \(a \lt b\text{.}\) We name the subset of all numbers between \(a\) and \(b\) in different ways depending on whether or not the ends of the interval (\(a\) and \(b\)) are elements of the subset.

- The closed interval \([a,b] = \{x \in \mathbb{R} : a \leq x \leq b\}\) — both end points are included.
- The open interval \((a,b) = \{x \in \mathbb{R} : a \lt x \lt b\}\) — neither end point is included.

We also define half-open ^{2} intervals which contain one end point but not the other:

\begin{align*} (a,b] &= \{ x \in \mathbb{R} : a \lt x \leq b\} & [a,b) &= \{ x \in \mathbb{R} : a \leq x \lt b\} \end{align*}

We sometimes also need unbounded intervals

\begin{align*} [a, \infty) &= \{ x \in \mathbb{R} : a \leq x \} & (a, \infty) &= \{ x \in \mathbb{R} : a \lt x \}\\ (-\infty, b] &= \{ x \in \mathbb{R} : x \leq b \} & (-\infty, b) &= \{ x \in \mathbb{R} : x \lt b \} \end{align*}

These unbounded intervals do not include “\(\pm\infty\)”, so that end of the interval is always open ^{3}.

## More on Sets

So we now know how to say that one set is contained within another. We will now define some other operations on sets. Let us also start to be a bit more precise with our definitions and set them out carefully as we get deeper into the text.

Let \(A\) and \(B\) be sets. We define the union of \(A\) and \(B\text{,}\) denoted \(A \cup B\text{,}\) to be the set of all elements that are in at least one of \(A\) or \(B\text{.}\)

\begin{align*} A \cup B &= \{x | x\in A \mbox{ or } x \in B \} \end{align*}

It is important to realise that we are using the word “or” in a careful mathematical sense. We mean that \(x\) belongs to \(A\) or \(x\) belongs to \(B\) *or both*. Whereas in normal every-day English “or” is often used to be “exclusive or” — \(A\) or \(B\) but not both ^{4}.

We also start the definition by announcing “Definition” so that the reader knows “We are about to define something important”. We should also make sure that everything is (reasonably) self-contained — we are not assuming the reader already knows \(A\) and \(B\) are sets.

It is vital that we make our definitions clear otherwise anything we do with the definitions will be very difficult to follow. As writers we must try to be nice to our readers ^{5}.

Let \(A\) and \(B\) be sets. We define the intersection of \(A\) and \(B\text{,}\) denoted \(A \cap B\text{,}\) to be the set of elements that belong to both \(A\) and \(B\text{.}\)

\begin{align*} A \cap B &= \{ x \;|\; x\in A \mbox{ and } x \in B \} \end{align*}

Again note that we are using the word “and” in a careful mathematical sense (which is pretty close to the usual use in English).

Let \(A = \{1,2,3,4 \}\text{,}\) \(B = \{p : p \mbox{ is prime} \}\text{,}\) \(C = \{5,7,9\}\) and \(D = \{\mbox{even positive integers}\}\text{.}\) Then

\begin{align*} A \cap B &= \{2,3\}\\ B \cap D &= \{2 \}\\ A \cup C &= \{1,2,3,4,5,7,9\}\\ A \cap C &= \varnothing \end{align*}

In this last case we see that the two sets have no elements in common — they are said to be *disjoint*.