Scribd
Upload
14 views5 pages

Worksheet #3

Uploaded by

Phung Vuong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views5 pages

Worksheet #3

Uploaded by

Phung Vuong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Math 215 Worksheet 3: Quantified statements and set notation

1. The integers are denoted Z, the positive integers N, the rational numbers Q, and the real
numbers R. The empty set is denoted ∅. Determine whether the following are true or false.
√
(a) {1, −3, 2} ⊂ R
(b) 6 ∈ {5n + 2m : n, m ∈ Z}
(c) {x ∈ R : x2 − x = 6} ⊂ N
(d) Q ⊂ R
(e) {x ∈ R : x2 − x = 2} ⊂ Z
(f) {x ∈ R : x2 − x = −2} ⊂ Z

Solution:

(a) This is true.


(b) We can write 6 = 10 − 4 = 5(2) + 2(−2), so this is true.
(c) The equation x2 − x − 6 has solution set {−2, 3}. These are both integers but only
one is positive, so it’s false.
(d) This is true.
(e) The equation x2 − x = 2 has solution set {−1, 2}, which are integers so it’s true.
√
(f) The equation x2 − x = −2 has no real solutions; its solutions are 1± 2 −7 , which are
complex. This means the set {x ∈ R : x2 − x = −2} is actually the empty set ∅,
which is a subset of Z (every set contains the empty set as a subset). The statement
is true.

2. Negate each of the following quantified statements, and determine which is true: the original
statement, or its negation.

(a) There exists x ∈ R such that x2 + 1 = 0.


(b) For all real numbers x, x3 ≥ x2 .
(c) For all real numbers x, if x > 1 then x2 > x (conditional statement with quantifiers)
(d) For each integer n, there exists an integer m such that n + m = 0 (multiple quantifiers)
(e) There exists an integer n such that for all integers m, n + m = m.

1
Solution:

(a) This has the form


(∃x ∈ R) P (x),
so its negation is
(∀x ∈ R) ¬P (x),
or “for all real numbers x, x2 + 1 ̸= 0.” The negation is true.
(b) This has the form
(∀x ∈ R) P (x),
with the negation
(∃x ∈ R) ¬P (x),
or “there exists a real number x such that x3 < x2 .” The negation is true, because
−1 is such a number.
(c) This statement has the form

(∀x ∈ R) [P (x) ⇒ Q(x)],

so the negation is

(∃x ∈ R) ¬[P (x) ⇒ Q(x)] = (∃x ∈ R) [P (x) ∧ ¬Q(x)],

(remembering that the negation of a conditional P ⇒ Q is P ∧ ¬Q). In English this


negation reads “there exists x ∈ R such that x > 1 and x2 < x. In this case, the
original statement is true (why?).
(d) Put formally,
(∀n ∈ Z) (∃m ∈ Z) P (n, m)
which has the negation

(∃n ∈ Z) (∀m ∈ Z) ¬P (n, m),

or “there exists an integer n such that for all integers m, n + m ̸= 0. The original
statement is true (every integer has a negative).
(e) This is the doubly quantified statement

(∃n ∈ Z) (∀m ∈ Z) P (n, m)

with negation
(∀n ∈ Z) (∃m ∈ Z) ¬P (n, m),
or “for each integer n there exists an integer m such that n + m ̸= m. The original
statement is true (zero is the claimed integer n).

3. Write out some elements of the set {7a + 3b : a, b ∈ Z} (what your textbook calls the “roster

Page 2
method”), and identify this as a well-known set.

Solution: Clearly Z ⊂ {7a + 3b : a, b ∈ Z}; let’s see which integers are in this set.

0 = 7(0) + 3(0),
1 = 7(1) + 3(−2),
2 = 7(2) + 3(−4),
3 = 7(0) + 3(1),
4 = 7(4) + 3(−8),
5 = 7(5) + 3(−10),

We can also get all the negatives of these numbers, simply by switching signs on a and b;
for instance, since 2 = 7(2) + 3(−4), we can write −2 = 7(−2) + 3(4). It appears that we
can get all integers this way! Indeed this is the case: for any integer n,

n = 7(n) + 3(−2n).

This shows that {7a + 3b : a, b ∈ Z} ⊂ Z. Since the opposite inclusion also holds, we
conclude that {7a + 3b : a, b ∈ Z} = Z.

4. Write the following sets in set-builder notation.

(a) {2, 4, 8, 16, 32, . . .}


(b) {1, 5, 9, 13, . . .}
1 1 1
(c) {. . . , 27 , 9 , 3 , 1, 3, 9, 27, . . .}
(d) {. . . , − 32 , − 34 , 0, 43 , 23 , 49 , 3, 15 9
4 , 2 , . . .}

Solution:

(a) {2n : n ∈ N}
(b) {1 + 4n : n ∈ N}
(c) {3n : n ∈ Z}
(d) It’s a little tricky to see the pattern, because the fractions are all in lowest terms.
Writing all with a denominator of 4 gives
 
6 3 0 3 6 9 12 15 18
...,− ,− , , , , , , , ,... .
4 4 4 4 4 4 4 4 4

Now it’s easier to recognize: 3n



4 :n∈Z .

Page 3
5. Each set is given in set-builder notation; list out several elements of the set (the “roster
method”). Try to recognize it as a common set, if it is.

(a) {2n − 5 : n ∈ Z}
(b) {x ∈ R : sin πx = 0}
(c) {x ∈ R : cos x = 1}
(d) {x ∈ Z : |2x| < 5}

Solution:

(a) {. . . , −5, −3, −1, 1, 3, 5, . . .} = the odd integers


(b) The function f (x) = sin x crosses the x-axis at every integer multiple of π, so this set
is = Z.
(c) The function g(x) = cos x crosses the x-axis at all odd multiples of π2 , such as
π 3π 5π π 3π 5π
2 , 2 , 2 , . . . and all negatives of these as well: − 2 , − 2 , − 2 , . . .. Using the ros-
ter method, this set is
 
5π 3π π π 3π 5π
...,− ,− ,− , , , ,...
2 2 2 2 2 2

We can also write this cleanly in set-builder notation as


 
(2n − 1)π
:n∈Z .
2

(d) {−2, −1, 0, 1, 2}

6. Determine if the following are true or false (hint: use the roster method).

(a) {n : n ∈ Z} = {n + 1 : n ∈ Z}
(b) {n : n ∈ N} = {n + 1 : n ∈ N}

Solution:

(a) If we use the roster method for the left side and run the index n from -3 to 3, we get

{. . . , −3, −2, −1, 0, 1, 2, 3, . . .}

Doing the same on the right side gives

{. . . , −2, −1, 0, 1, 2, 3, 4, . . .}.

These appear to be different, but we’re only showing a finite “window” of each. Both

Page 4
of these are the same, and = Z, so the statement is true. The only difference is
notational; on the left, we’re “starting” the index at 0, and on the right, at 1.
(b) The left set is
{1, 2, 3, 4, . . .} = N
using the roster method, but the right set is

{2, 3, 4, 5, . . .}.

These sets are not equal, because the left set contains 1 but the right set does not.
The containment ⊃ holds, but the equality statement is false.

Page 5

You might also like