EF Defining sets

Section 9.2 Defining sets

Remember that mathematical notation is about communicating mathematical information. Since a set is defined by its member objects, to communicate the details of a set of objects one needs to provide a means to decide whether any given object is or is not an element of the set.

🔗

Subsection 9.2.1 Listing elements

🔗

One way to communicate the details of a set definition is to explicitly list or describe all elements of the set. Such a list should be enclosed in braces to indicate that the objects in the list are being collected into a set.

🔗

Example 9.2.1. Listing the elements of a set.

🔗

If we write

A = {monkey, tennis ball, the number 2},

🔗

then we intend for the letter

A

to become a label representing the set consisting of some specific monkey, some specific tennis ball, and the number

2 .

🔗

Here are some sets containing familiar collections of numbers. Notice how in the first two examples we “list” the elements by providing a pattern and then using … to imply that the pattern continues as expected, and in the second two examples we merely describe what the elements are in words.

$N$: 🔗
the set ${0, 1, 2, \dots}$ of natural numbers
$Z$: 🔗
the set ${\dots, - 2, - 1, 0, 1, 2, \dots}$ of integers
$Q$: 🔗
the set of all fractions, call the set of rational numbers
$R$: 🔗
the set of all decimal numbers, called the set of real numbers

🔗

Note 9.2.2.

🔗

Keep the following in mind for a set defined by listing elements.

🔗
Order does not matter. For example, ${a, b}$ and ${b, a}$ are the same set because they consist of precisely the same member elements.
🔗
Repetition does not matter. For example, ${a, a, b}$ and ${a, b}$ are the same set because they consist of precisely the same member elements.

🔗

Subsection 9.2.2 Candidate-condition notation

🔗

Another way to define a set is candidate-condition notation:

set = {candidate domain | condition(s) on candidates} .

🔗

This notation provides a means to decide whether an object is a member of the set by first using an already-defined set as a pool of “member candidates” as well a condition or a list of conditions each candidate must satisfy in order to actually be a member.

🔗

If we write

S

for the set being defined,

C

for the set of candidates, and

T

for the test those candidates must satisfy to be included in

S

(that is,

T

is a predicate with domain

C

), then the candidate-condition notation takes the form

S = {x \in C | T (x)},

🔗

and can be read as

🔗
$S$ is the set of those elements $x$ in $C$ for which $T (x)$ is true.

🔗

Example 9.2.3. Using candidate-condition notation to define a set.

🔗

Consider the set

A = {0, 3, 6, 9, 12, \dots} .

🔗

We could define this set in a more precise manner (i.e. without resorting to using dots) as follows.

A = {n \in N | n divisible by 3}

🔗

The “

n \in N

” part to the left of the divider tells us that the pool of “member candidates” for

A

is the set of natural numbers, and the test to the right of the divider tells us how to decide when a given candidate natural number

n

is actually a member of

A .

In words, you should think of the above definition as saying the following.

🔗
Set $A$ consists of those elements of $N$ which are divisible by $3 .$

🔗

Subsection 9.2.3 Form-parameter notation

🔗

Finally, sets can be defined by form-parameter notation:

set = {form involving parameter | parameter domain} .

🔗

This notation describes the members of a set by providing a “form” to which the members must conform. Usually the “form” is based on parameter variables that can range over a set of possibilities.

🔗

Example 9.2.4. Using form-parameter notation to define a set.

🔗

Again consider the set

A = {0, 3, 6, 9, 12, \dots} .

🔗

We could also define this set as

A = {3 n | n \in N} .

🔗

Here, the form of the elements of

A

is given to the left of the divider as “

3

times a number”, where the number is represented by the parameter

n .

Then the allowed range of the number parameter

n

is given to the right of the divider. In words, you should think of the above definition as saying the following.

🔗
The elements of set $A$ are precisely those objects that are $3$ times a natural number.

🔗

Example 9.2.5. Defining the set of fractions.

🔗

We could define the set

Q

of rational numbers in this way:

Q = {\frac{m}{n} | m, n \in Z, n \neq 0} .

🔗

This says that the set

Q

consists of all symbols of the form “number over number”, where the numbers can be any integers, as long as the bottom number is not zero. However, we need to be a little bit careful here, since we allow different symbols of this form to represent the same element. For example,

\begin{aligned} \frac{3}{6} & = \frac{1}{2}, & \frac{2}{- 9} & = \frac{- 2}{9}, & \frac{0}{n} & = \frac{0}{1} (any n \neq 0). \end{aligned}

🔗

We really should make this element form duplication explicit in the definition of the set, but to do this would be really cumbersome and would be expressing something that is learned in grade school, so it is usually omitted.

🔗

Subsection 9.2.4 Empty set

🔗

There is one special set, the elements of which are very easy to list.

empty set: 🔗
the set which has no elements
$\emptyset$: 🔗
the empty set

🔗

Remark 9.2.6.

🔗

The empty set is defined by requiring that the statement “

x

is an element of

\emptyset

” is always false, for every object

x .

🔗

Warning 9.2.7.

🔗

Be careful not to inadvertently try to prove some property of members of the empty set! You will be proving a vacuously true statement. (See Section 4.3.)

Elementary Foundations: An introduction to topics in discrete mathematics

Search Results: