Skip to main content
Logo image

Section 5.4 Special Sets

We introduce notation for some sets that we will use throughout this course.
We use special capital letters to make this notation easy to recognize: \(\A\text{,}\) \(\N\text{,}\) \(\PP\text{,}\) \(\W\text{,}\) and \(\Z\text{.}\) These letters are written in a font called blackboard bold. Some sets in the following definition are already familiar. We will see why the others are important later.

Definition 5.4.1.

We define the following sets:
  1. The set \(\Z:=\{\dots,-3,-2,-1,0,1,2,3\dots\}\) is the set of integers.
  2. The set \(\W=\{0,1,2,3,\dots\}\) is the set of whole numbers. It is also known as the set of non-negative integers.
  3. The set \(\N:=\{1,2,3,\dots\}\) is the set of natural numbers.
  4. The set \(\PP\) is the set of prime numbers.
  5. For \(n\in\N\) we define \(\Z_n:=\{0,1,2,\dots,n-1\}\text{.}\) We read \(\Z_n\) as “z n.”
  6. For \(n\in\N\) we define \(\Z_n^\otimes:=\{1,2,\dots,n-1\}\text{.}\) We read \(\Z_n^\otimes\) as “z n without zero.”
  7. The set \(\A:=\{\cspace,\mathtt{a},\mathtt{b},\mathtt{c},\dots,\mathtt{x},\mathtt{y},\mathtt{z}\}\) is the set of characters
     1 
    For technical reasons we use the symbol \(\cspace\) instead of the character space to separate words.
    .
We have already seen the integers and natural numbers in Part I and now have a handy way of talking about all of these as the set of integers \(\Z\) and the set of natural numbers \(\N\text{.}\) The set \(W\) contains all elements of \(\N\) and also the number \(0\text{.}\)
We will discuss the prime numbers in Chapter 10.
We will use the sets \(\Z_n\) and \(\Z_n^\otimes\) throughout this course. The set \(\Z_n\) contains exactly the numbers that can occur as remainders when dividing by \(n\text{,}\) that is
\begin{equation*} \Z_n = \{ x\fmod n\mid x\in\Z\}. \end{equation*}
In Chapter 14 we will study operations on the elements of these sets.
We use the set of characters \(\A\) to encode characters as numbers in Section 8.1 and to encode texts as numbers in Section 12.3. We will also use it when encrypting messages in Section 8.3, Section 8.4, and Section 16.3. To distinguish characters from variables we write characters in a typewriter font.
(a) The set of integers \(\Z\) on the number line.
(b) The set of whole numbers \(\W\) on the number line.
(c) The set of natural numbers \(\N\) on the number line.
(d) The set of \(\Z_7=\{0,1,2,3,4,5,6\}\) on the number line.
(e) The set of \(\Z_7^\otimes=\{1,2,3,4,5,6\}\) on the number line.
Figure 5.4.2. The sets \(\Z\text{,}\) \(\W\text{,}\) \(\N\text{,}\) \(\Z_7\text{,}\) and \(\Z_7^\otimes\) on the number line line
In Figure 5.4.2 we show sets from Definition 5.4.1 on the number line. For the sets \(\Z_n\) and \(\Z_n^\otimes\) we chose the special case \(n=7\text{.}\) In Example 5.4.3 we consider the sets \(\Z_n\) and \(\Z_n^\otimes\text{,}\) where \(n = 6\text{.}\)

Example 5.4.3. Reading \(\Z_6\) and \(\Z_6^\otimes\).

  1. \(\Z_6=\{0,1,2,3,4,5\}\) is read “Z 6 is equal to the set containing 0,1,2,3,4, and 5.”
  2. \(\Z_6^\otimes=\{1,2,3,4,5\}\) is read “Z 6 without 0 is equal to the set containing 1,2,3,4, and 5.”
It is useful to check what a definition means in the borderline cases. The sets \(\Z_n\) and \(\Z_n^\otimes\) are defined for all natural numbers \(n\text{.}\) We check the definition for the two lowest allowed values of \(n\text{,}\) namely \(n=1\) and \(n=2\text{.}\)

Example 5.4.4. \(\Z_n\) and \(\Z_n^\otimes\) for \(n\in\{1,2\}\).

We consider \(\Z_n\) and \(\Z_n^\otimes\) and \(n\in\{1,2\}\) (this means we will look at the cases when \(n =1\) and when \(n =2\)).
  1. \(\displaystyle \Z_1=\{0\}\)
  2. \(\displaystyle \Z_1^\otimes=\{\}\)
  3. \(\displaystyle \Z_2=\{0,1\}\)
  4. \(\displaystyle \Z_2^\otimes=\{1\}\)
The video in Figure 5.4.5 reviews the definitions of special sets. It also shows how to write statements from Chapter 1 in a shorter way by using set notation.
Figure 5.4.5. Special Sets by Matt Farmer and Stephen Steward

Subsection Formulating Statements with Sets

We can use set notation and the special sets defined above to give shorter formulations of statements from Section 1.3. Essentially we are replacing “let \(a\) be an integer” by “let \(a\in\Z\)”.

Example 5.4.6. All natural numbers are positive in set notation.

We can write the commutative property of addition for integers from Example 1.3.16 as follows:

Example 5.4.7. Commutative property in set notation.

For all \(a\in\Z\) and \(b\in\Z\) we have \(a+b = b+a\text{.}\)
Likewise, the distributive property (compare Example 1.3.17) can be written as:

Example 5.4.8. Distributive property in set notation.

For all \(a\in\Z\text{,}\) \(b\in\Z\text{,}\) and \(c\in\Z\) we have \(a\cdot(b+c)=(a\cdot b) + (a\cdot c)\text{.}\) p
Theorem 1.3.25 states that for all integers there exists an additive inverse. We can write this theorem as:
Finally, we use set notation to restate Theorem 1.4.6 and Theorem 1.4.7 and Theorem 1.4.12.