# 2.3: Open Sentences and Sets

- Page ID
- 7041

The theory of sets is fundamental to mathematics in the sense that many areas of mathematics use set theory and its language and notation. This language and notation must be understood if we are to communicate effectively in mathematics. At this point, we will give a very brief introduction to some of the terminology used in set theory.

A **set** is a well-defined collection of objects that can be thought of as a single entity itself. For example, we can think of the set of integers that are greater than 4. Even though we cannot write down all the integers that are in this set, it is still a perfectly well-defined set. This means that if we are given a specific integer, we can tell whether or not it is in the set of all even integers.

The most basic way of specifying the elements of a set is to list the elements of that set. This works well when the set contains only a small number of objects. The usual practice is to list these elements between braces. For example, if the set \(C\) consists of the integer solutions of the equation \(x^2 = 9\), we would write

\(C\) = {-3, 3}.

For larger sets, it is sometimes inconvenient to list all of the elements of the set. In this case, we often list several of them and then write a series of three dots (...) to indicate that the pattern continues. For example,

\(D\) = {1, 3, 5, 7, ... 49}

is the set of all odd natural numbers from 1 to 49, inclusive.

For some sets, it is not possible to list all of the elements of a set; we then list several of the elements in the set and again use a series of three dots (...) to indicate that the pattern continues. For example, if F is the set of all even natural numbers, we could write

\(F\) = {2, 4, 6, ...}.

We can also use the three dots before listing specific elements to indicate the pattern prior to those elements. For example, if E is the set of all even integers, we could write

\(E\) = {... -6, -4, -2, 0, 2, 4, 6, ...}.

Listing the elements of a set inside braces is called the **roster method** of specifying the elements of the set. We will learn other ways of specifying the elements of a set later in this section.

- Use the roster method to specify the elements of each of the following sets:

(a) The set of real numbers that are solutions of the equation \(x^2 -5x =0\).

(b) The set of natural numbers that are less than or equal to 10.

(c) The set of integers that are greater than -2. - Each of the following sets is defined using the roster method. For each set, determine four elements of the set other than the ones listed using the roster method.

\(A\) = {1, 4, 7, 10, ...}

\(B\) = {2, 4, 8, 16, ...}

\(C\) = {..., -8, -6, -4, -2, 0}

\(D\) = {..., -9, -6, -3, 0, 3, 6, 9, ...}

Not all mathematical sentences are statements. For example, an equation such as

\(x^2 -5 = 0\)

is not a statement. In this sentence, the symbol \(x\) is a **variable**. It represents a number that may be chosen from some specified set of numbers. The sentence (equation) becomes true or false when a specific number is substituted for \(x\).

- (a) Does the equation \(x^2 - 25 = 0\) become a true statement if -5 is substituted for \(x\)?

(b) Does the equation \(x^2 - 25 = 0\) become a true statement if \(\sqrt 5\) is substituted for \(x\)?A

**variable**is a symbol representing an unspecified object that can be chosen from a given set \(U\). The set \(U\) is called the**universal set for the variable**. It is the set of specified objects from which objects may be chosen to substitute for the variable. A**constant**is a specific member of the universal set.Some sets that we will use frequently are the usual number systems. Recall that we use the symbol \(\mathbb{R}\) to stand for the set of all

**real numbers**, the symbol \(\mathbb{Q}\) to stand for the set of all**rational numbers**, the symbol \(\mathbb{Z}\) to stand for the set of all**integers**, and the symbol \(\mathbb{N}\) to stand for the set of all**natural numbers**.A

**variable**is a symbol representing an unspecified object that can be chosen from some specified set of objects. This specified set of objects is agreed to in advance and is frequently called the**universal set**. - What real numbers will make the sentence “\(y^2 - 2y - 15 = 0\)” a true statement when substituted for \(y\)?
- What natural numbers will make the sentence “\(y^2 - 2y - 15 = 0\)” a true statement when substituted for \(y\)?
- What real numbers will make the sentence "\(\sqrt x\) is a real number" a true statement when substituted for \(x\)?
- What real numbers will make the sentence "\(sin^2 x +cos^2 x = 1\)" a true statement when substituted for \(x\)?
- What natural numbers will make the sentence "\(\sqrt n\) is a natural number" a true statement when substituted for \(n\)?
- What real numbers will make the sentence

\(\int_{0}^{y} t^2 dt > 9\)

a true statement when substituted for \(y\)?

## Some Set Notation

In Preview Activity \(\PageIndex{1}\), we indicated that a set is a well-defined collection of objects that can be thought of as an entity itself.

- If \(A\)is a set and \(y\) is one of the objects in the set \(A\), we write \(y \in A\) and read this as “\(y\) is an element of \(A\)” or “\(y\) is a member of \(A\).” For example, if \(B\) is the set of all integers greater than 4, then we could write \(5 \in B\) and \(10 \in B\).
- If an object \(z\) is not an element in the set \(A\), we write \(z \notin A\) and read this as “\(z\) is not an element of \(A\).” For example, if \(B\) is the set of all integers greater than 4, then we could write \(2 \notin B\) and \(4 \notin B\).

When working with a mathematical object, such as set, we need to define when two of these objects are equal. We are also often interested in whether or not one set is contained in another set.

Two sets, \(A\) and \(B\), are *equal *when they have precisely the same elements. In this case, we write \(A = B\). When the sets A and B are not equal, we write \(A \notin B\).

The set \(A\) is a *subset *of a set \(B\) provided that each element of \(A\) is an element of \(B\). In this case, we write \(A \subseteq B\) and also say that \(A\) is *contained *in \(B\). When \(A\) is not a subset of \(B\), we write \(A \nsubseteq B\).

Using these definitions, we see that for any set \(A\), \(A = A\) and since it is true that for each \(x \in U\), if \(x \in A\), then \(x \in A\), we also see that \(A \subseteq A\). That is, any set is equal to itself and any set is a subset of itself. For some specific examples, we see that:

- {1, 3, 5} = {3, 5, 1}
- {5, 10} = {5, 10, 5}
- {4, 8, 12} = {4, 4, 8, 12, 12}
- {5, 10} \(\ne\) {5, 10, 15} but {5,10} \(\subseteq\) {5, 10, 15} and {5, 10, 15} \(\nsubseteq\) {5, 10}.

In each of the first three examples, the two sets have exactly the same elements even though the elements may be repeated or written in a different order.

- Let \(A\) = {-4, -2, 0, 2, 4, 6, 8, ...}. Use correct set notation to indicate which of the following integers are in the set \(A\) and which are not in the set \(A\). For example, we could write \(6 \in A\) and \(5 \notin A\).

10 22 13 -3 0 -12 - Use correct set notation (using = or \(\subseteq\)) to indicate which of the following sets are equal and which are subsets of one of the other sets.

\(A\) = {3, 6, 9}. \(B\) = {6, 9, 3, 6}

\(C\) = {3, 6, 9, ... } \(D\) = {3, 6, 7, 9}

\(E\) = {9, 12, 15, ... } \(F\) = {9, 7, 6, 2}

**Answer**-
Add texts here. Do not delete this text first.

## Variables and Open Sentences

As we have seen in the Preview Activities, not all mathematical sentences are statements. This is often true if the sentence contains a variable. The following terminology is useful in working with sentences and statements.

An **open sentence** is a sentence \(P(x_1, x_2, ... , x_n)\) involving variables \(x_1, x_2, ... , x_n\) with the property that when specific values from the universal set are assigned to \(x_1, x_2, ... , x_n\), then the resulting sentence is either true or false. That is, the resulting sentence is a statement. An open sentence is also called a **predicate** or a **propositional function**.

**Notation**: One reason an open sentence is sometimes called a *propositional function* is the fact that we use function notation \(P(x_1, x_2, ... , x_n)\) for an open sentence in \(n\) variables. When there is only one variable, such as \(x\), we write \(P(X)\), which is read “\(P\) of \(x\).” In this notation, \(x\) represents an arbitrary element of the universal set, and \(P(x)\) represents a sentence. When we substitute a specific element of the universal set for \(x\), the resulting sentence becomes a statement. This is illustrated in the next example.

If the universal set is \(\mathbb{R}\), then the sentence “\(x^2 - 3x - 10 = 0\)” is an open sentence involving the one variable \(x\).

- If we substitute \(x = 2\), we obtain the false statement "\(2^2 -3 \cdot 2 - 10 = 0\)."
- If we substitute \(x = 5\), we obtain the true statement "\(5^2 -3 \cdot 5 - 10 = 0\)."

In this example, we can let \(P(x)\) be the predicate “\(x^2 - 3x - 10 = 0\)” and then say that \(P(2)\) is false and \(P(5)\) is true.

Using similar notation, we can let \(Q(x,y)\) be the predicate "\(x + 2y = 7\)." This predicate involves two variables. Then,

- \(Q(1,1)\) is false since "\(1 + 2 \cdot 1 = 7\)" is false; and
- \(Q(3,2)\) is true since "\(3 + 2 \cdot 2 = 7\)" is false.

- Assume the universal set for all variable is \(\mathbb{Z}\) and let \(P(x)\) be the predicate "\(x^2 \le 4\)."

(a) Find two values of \(x\) for which \(P(x)\) is false.

(b) Find two values of \(x\) for which \(P(x)\) is true.

(c) Use the roster method to specify the set of all \(x\) for which \(P(x)\) is true. - Assume the universal set for all variable is \(\mathbb{Z}\) and let \(R(x, y, z)\) be the predicate "\(x^2 + y^2 = z^2\)."

(a) Find two different examples for which \(R(x, y, z)\) is false.

(b) Find two different examples for which \(R(x, y, z)\) is true.

**Answer**-
Add texts here. Do not delete this text first.

Without using the term, Example 2.10 and Progress Check 2.11 (and Preview Activity \(\PageIndex{2}\)) dealt with a concept called the truth set of a predicate.

The *truth set of an open sentence with one variable* is the collection of objects in the universal set that can be substituted for the variable to make the predicate a true statement.

One part of elementary mathematics consists of learning how to solve equations. In more formal terms, the process of solving an equation is a way to determine the truth set for the equation, which is an open sentence. In this case, we often call the truth set the **solution set**. Following are three examples of truth sets.

- If the universal set is \(\mathbb{R}\), then the truth set of the equation \(3x - 8 = 10\) is the set {6}.
- If the universal set is \(\mathbb{R}\), then the truth set of the equation \(x^2 - 3x - 10 = 0\) is {-2, 5}.
- If the universal set is \(\mathbb{N}\), then the truth set of the open sentence "\(\sqrt n \in \mathbb{N}\)" is {1, 4, 9, 16, ...}.

## Set Builder Notation

Sometimes it is not possible to list all the elements of a set. For example, if the universal set is \(\mathbb{R}\), we cannot list all the elements of the truth set of “\(x^2 < 4\).” In this case, it is sometimes convenient to use the so-called **set builder notation** in which the set is defined by stating a rule that all elements of the set must satisfy. If \(P(x)\) is a predicate in the variable \(x\), then the notation

{\(x \in U | P(x)\)}

stands for the set of all elements \(x\) in the universal set \(U\) for which \(P(x)\) is true. If it is clear what set is being used for the universal set, this notation is sometimes shortened to {\(x | P(x)\)}. This is usually read as “the set of all \(x\) such that \(P(x)\).” The vertical bar stands for the phrase “such that.” Some writers will use a colon (:) instead of the vertical bar.

For a non-mathematical example, \(P\) could be the property that a college student is a mathematics major. Then {\(x | P(x)\)} denotes the set of all college students who are mathematics majors. This could be written as

{\(x\) | \(x\) is a college student who is a mathematics major}.

Assume the universal set is \(\mathbb{R}\) and \(P(x)\) is "\(x^2 < 4\)." We can describe the truth set of \(P(x)\) as the set of all real numbers whose square is less than 4. We can also use set builder notation to write the truth set of \(P(x)\) as

{\(x \in \mathbb{R} | x^2 < 4\)}

However, if we solve the inequality \(x^2 < 4\), we obtain \(-2 < x < 2\). So we could also write the truth set as

{\(x \in \mathbb{R} | -2 < x < 4\)}

We could read this as the set of all real numbers that are greater than -2 and less than 2. We can also write

{\(x \in \mathbb{R} | x^2 < 4\)} = {\(x \in \mathbb{R} | -2 < x < 4\)}

Let \(P(x)\) be the predicate "\(x^2 \le 9\)."

- If the universal set is \(\mathbb{R}\), describe the truth set of \(P(x)\) using English and write the truth set of \(P(x)\) using set builder notation.
- If the universal set is \(\mathbb{Z}\), then what is the truth set of \(P(x)\)? Describe this set using English and then use the roster method to specify all the elements of this truth set.
- Are the truth sets in Parts (1) and (2) equal? Explain.

**Answer**-
Add texts here. Do not delete this text first.

So far, our standard form for set builder notation has been {\(x \in U | P(x)\)}. It is sometimes possible to modify this form and put the predicate first. For example, the set

{\(A = 3n+1 | n \in \mathbb{N}\)}

describes the set of all natural numbers of the form \(3n + 1\) for some natural number.

By substituting 1, 2, 3, 4, and so on, for n, we can use the roster method to write

\(A\) = {\(3n+1 | n \in \mathbb{N}\)} = {4, 7, 10, 13, ... }.

We can sometimes “reverse this process” by starting with a set specified by the roster method and then writing the same set using set builder notation.

Let \(B\) = {..., -11. -7, -3, 1, 5, 9, 13, ...}. The key to writing this set using set builder notation is to recognize the pattern involved. We see that once we have an integer in \(B\), we can obtain another integer in \(B\) by adding 4. This suggests that the predicate we will use will involve multiplying by 4.

Since it is usually easier to work with positive numbers, we notice that \(1 \in B\) and \(5 \in B\). Notice that

\(1 = 4 \cdot 0 + 1\) and \(5 = 4 \cdot 1 + 1\).

This suggests that we might try \({4n + 1 | n \in \mathbb{z}}\). In fact, by trying other integers for \(n\), we can see that

\(B\) = {..., -11, -7, -3, 1, 5, 9, 13, ...} = {\(4n + 1 | n \in \mathbb{Z}\)}.

Each of the following sets is defined using the roster method.

\(A\) = {1, 5, 9, 13, ...} \(C\) = { \(\sqrt 2\), \((\sqrt 2)^3\), \((\sqrt 2)^5\), ... }

\(B\) = {..., -8, -6, -4, -2, 0} \(D\) = {1, 3, 9, 27, ...}

- Determine four elements of each set other than the ones listed using the roster method.
- Use set builder notation to describe each set.

**Answer**-
Add texts here. Do not delete this text first.

## The Empty Set

When a set contains no elements, we say that the set is the empty set. For example, the set of all rational numbers that are solutions of the equation \(x^2 = -��2\) is the empty set since this equation has no solutions that are rational numbers.

In mathematics, the empty set is usually designated by the symbol \(\emptyset\). We usually read the symbol \(\emptyset\) as “the empty set” or “the null set.” (The symbol \(\emptyset\) is actually the last letter in the Danish-Norwegian alphabet.)

## When the Truth Set Is the Universal Set

The truth set of a predicate can be the universal set. For example, if the universal set is the set of real numbers \(\mathbb{R}\), then the truth set of the predicate “\(x + 0 = x\)” is \(\mathbb{R}\).

Notice that the sentence “\(x + 0 = x\)” has not been quantified and a particular element of the universal set has not been substituted for the variable \(x\). Even though the truth set for this sentence is the universal set, we will adopt the convention that unless the quantifier is stated explicitly, we will consider the sentence to be a predicate or open sentence. So, with this convention, if the universal set is \(\mathbb{R}\), then

- \(x + 0 = x\) is a predicate;
- For each real number \(x\), \(x + 0 = x\) is a statement.

- Use the roster method to specify the elements in each of the following sets and then write a sentence in English describing the set.

(a) {\(x \in \mathbb{R} | 2x^2 + 3x -2 = 0\)}

(b) {\(x \in \mathbb{Z} | 2x^2 + 3x -2 = 0\)}

(c) {\(x \in \mathbb{Z} | x^2 < 25\)}

(d) {\(x \in \mathbb{N} | x^2 < 25\)}

(e) {\(y \in \mathbb{Q} | |y - 2| = 2.5\)}

(f) {\(y \in \mathbb{Z} | |y - 2| \le 2.5\)} - Each of the following sets is defined using the roster method.

\(A\)= {1, 4, 9, 16, 25, ...}

\(B\) = {..., -\(\pi^4\), -\(\pi^3\), -\(\pi^2\), -\(\pi\), 0...}

\(C\) = {3, 9, 15, 21, 27, ...}

\(D\) = {0, 4, 8, ..., 96, 100}

(a) Determine four elements of each set other than the ones listed using the roster method.

(b) Use set builder notation to describe each set. - Let \(A\) = {\(x \in \mathbb{R} | x(x + 2)^2(x - \dfrac{3}{2} = 0\)}. Which of the following sets are equal to the set \(A\) and which are subsets of \(A\)?

(a) {\(-2, 0, 3\)}

(b) {\(-2, -2, 0, \dfrac{3}{2}\)}

(c) {\(\dfrac{3}{2}, -2, 0\)}

(d) {\(-2, \dfrac{3}{2}\)} - Use the roster method to specify the truth set for each of the following open sentences. The universal set for each open sentence is the set of integers \(\mathbb{Z}\).

(a) \(n + 7 =4\).

(b) \(n^2 = 64\).

(c) \(\sqrt n \in \mathbb{N}\) and \(n\) is less than 50.

(d) \(n\) is an odd integer that is greater than 2 and less than 14.

(e) \(n\) is an even integer that is greater than 10. - Use set builder notation to specify the following sets:

(a) The set of all integers greater than or equal to 5.

(b) The set of all even integers.

(c) The set of all positive rational numbers.

(d) The set of all real numbers greater than 1 and less than 7.

(e) The set of all real numbers whose square is greater than 10. - For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
(a) {\(x \in \mathbb{R} | -3 \le x \le 5\)}

(b) {\(x \in \mathbb{Z} | -3 \le x \le 5\)}

(c) {\(x \in \mathbb{R} | x^2 = 16\)}

(d) {\(x \in \mathbb{R} | x^2 + 16 = 0\)}

(e) {\(x \in \mathbb{Z} | x\) is odd}

(f) {\(x \in \mathbb{R} | 3x - 4 \ge 17\)}

**Explorations and Activities** **Closure Explorations**. In Section 1.1, we studied some of the closure properties of the standard number systems. (See page 10.) We can extend this idea to other sets of numbers. So we say that:

\(\bullet\) A set \(A\) of numbers is**closed under addition**provided that whenever \(x\) and \(y\) are are in the set \(A\), \(x + y\) is in the set \(A\).

\(\bullet\) A set \(A\) of numbers is**closed under multiplication**provided that whenever \(x\) and \(y\) are are in the set \(A\), \(x \cdot y\) is in the set \(A\).

\(\bullet\) A set \(A\) of numbers is**closed under subtraction**provided that whenever \(x\) and \(y\) are are in the set \(A\), \(x - y\) is in the set \(A\).

For each of the following sets, make a conjecture about whether or not it is closed under addition and whether or not it is closed under multiplication. In some cases, you may be able to find a counterexample that will prove the set is not closed under one of these operations.

(a) The set of all odd natural numbers

(b) The set of all even integers

(c) \(A\) = {1, 4, 7, 10, 13, ...}

(d) \(B\) = {..., -6, -3, 0, 3, 6, 9, ...}

(e) \(C\) = {\(3n + 1 | n \in \mathbb{Z}\)}

(f) \(D\) = {\(\dfrac{1}{2^n} | n \in \mathbb{N}\)}

**Answer**-
Add texts here. Do not delete this text first.