Homework #2

Exercises

1. Mark each statement True or False. Justify each answer.

(a) The symbol ∀ means ”for every.”
True, this is one of the replacements for ∀.
(b) The negation of a universal statement is another universal statement.
False the negation of ∀ is ∃ and the negation of ∃ is ∀.

2. Mark each statement True or False. Justify each answer.

(a) The symbol ”∃” means ”there exist several”
False, ”∃” means ”there exist at least one”
(b) If a variable is used in the antecedent of an implication without being quantified, then
the universal quantifier is assumed to apply.
True, if you are working with a proposition that has variables and the an-
tecedent has no quantifier then you apply the universal quantifier.
(c) The order in which quantifiers are used affects the truth value.
True, since the ∀ and ∃ quantifiers have different definitions the order in which
they are used affects the truth value.
Example:
∀x ∈R ∃y ∈R such that ∀ > 0, |x − y| < , True
∃y ∈R such that ∀x ∈R, ∀ > 0 |x − y| < , False

3. Write the negation of each statement.

(a) Some pencils are red.
Statement in mathematics: At least one pencil is red.
All pencils are not red.
(b) All chairs have four legs.
There exist a chair that does not have four legs.
(c) No one one the basketball team is over 6 feet 4 inches tall.
Statement in mathematics: For all members of the basketball team no one is 6 feet 4 inches
tall.
There exist a member of the basketball team such that he/she is 6 feet 4 inches

1
tall.
(d) ∃ x > 2 such that f (x) = 7.
∀ x> 2, f (x)= / 7.
(e) ∀ x ∈ A, ∃ y > 2 such that 0 < f(y) < f(x).
∃ x ∈ A such that ∀ y > 2 f(y) ≥ 0 or f(y) ≥ f(x).
(f) If x > 3, then ∃ E > 0 such that x2 > 9+ E.
x > 3, and ∀ E > 0, x2 ≤ 9+ E.

4. Write the negation of each statement.

(a) Everyone likes Robert.
Statement in mathematics: All members like Robert.
At least one student does not like Robert.
(b) Some students work part time.
Statement in mathematics: At least one student works part time
All Students do not work part time.
(c) No square matrices are triangular.
Statement in mathematics: All square matrices are not triangular.
There exist a square matrix that is triangular.
(d) ∃ x in B such that f(x) > k.
∀ x ∈ B, f(x) ≤ k.
(e) If x > 5, then f(x) < 3 or f(x) > 7.
x > 5 and f(x) ≥ 3 and f(x) ≤ 7.
(f) x is in A, then ∃ y in B such that f(x) < f(y).
if x ∈ A, and ∀ y ∈ B, f(x) ≥ f(y).

5. Determine the truth value of each statement, assuming x is a real number. Justify
your answer.
(a) ∃ x in the interval [2, 4] such that x < 7.
What is this statement saying in English? There is at least one x in the interval [2,4] and
x <7.
True, Take x:=3, x:=3 satisfies x ∈ [2, 4] and x <7.
(b) ∀ x in the interval [2, 4], x < 7.
What is this saying in English? For all x’s in the interval [2,4] x < 7
True, Let x in the interval [2, 4] 2 ≤ x ≤ 4 < 7, x < 7
(c) ∃ x ∈ R such that x2 = 5.
What is this statement saying in English? There exist a least one x such that if you solve
for x in x2 = 5, x ∈
√ R. √
True, Take x:= 5, x:= 5 satisfies x∈ R and x2 = 5
(d) ∀ x ∈ R , x2 = 5.
What is this statement saying in English? For all x, you can solve x2 = 5, x ∈ R.
False, take x:=2, x2 =4, x:=2 satisfies x ∈ R and x2 6= 5.

2
(e) ∃ x ∈ R such that x2 = / -3.
What is this statement saying in English? There exist at least one value in x ∈ R such
that x2 =/ -3
True, take x := 2, x2 =4, x := 2 satisfies x ∈ R and x2 = / -3
2
(f) ∀ x, x = / -3.
What is this statement saying in English? For all values of x ∈ R, x2 = / -3
True, Let x ∈ R, x2 ≥ 0 so since x2 = −3 < 0 we can not have any solution in R
(g) ∃ x ∈ R 3 x ÷ x =1
What is this statement saying in English? There is at least one x ∈ R such that if you
divide it by itself it will give you one
True, Take x:=5, x:=5 satisfies x ∈ R and x÷x =1 .
(h) ∀ x, x x =1
For all x’s x ∈ R you can divide the number by itself and get one
False, Take x=0, x:=0 satisfies that x ∈ R and x ÷ x = / 1
To determine the truth value of the following statements using the definition of quantifiers
and negation. If its true for ∃ you find one particular example that makes it true. If its
false for ∃, you do the negation so that means you prove it for ∀. If its true for ∀, you just
prove the statement using Let. If it is false for ∀, you prove by doing the negation ∃ and
finding a particular example which makes it false. This is seen throughout these examples.

6. Determine the truth value of each statement, assuming x is a real number. Justify
your answer.
(a) ∃x in the interval [3,5] such that x ≥ 4.
English Translation: There is at least one x ∈ R, x ∈ [3,5] such that x ≥ 4.
True, Take x := 4, x := 4 satisfies x ∈ [3,5] and x ≥ 4
(b) ∀x in the interval [3,5], x ≥ 4.
For all x’s in the interval [3,5], x ≥ 4
False, Take x := 3, x := 3 satisfies x ∈ [3,5] and x < 4
(c) ∃x ∈ R such that x2 = / 3.
English Translation: There is at least one x ∈ R that makes x2 = / 3 is true.
2
True, take x:=2, x =4, x:=2 satisfies x ∈ R and x = 2 / 3
(d) ∀x ∈ R , x2 = / 3.
English translation: 2 / 3 is true.
√ For all√x’s in the R x =
False, Take x:= 3, x:= 3 sastisfies x ∈ R, and x2 = 3.
(e) ∃ x ∈ R such that x2 = -5.
English translation: There is at least on x in the R that makes this equation true.
False, Let x ∈ R, x2 > 0, x2 = −5 < 0. Therefore we cannot have a solution in R
(f) ∀ x ∈ R, x2 = -5.
For all x ∈ R this equation is true
False, Take x:=2, x2 = 4 x:=2 satisfies x ∈ R , and x2 = / -5
(g) ∃ x ∈ R such that x-x=0.

3
There is at least one element in th R that makes x − x = 0 true
True, Take x:=5, x:=5 satisfies x ∈ R and x − x=0
(h) ∀ x ∈ R , x-x=0.
English translation: For all x’s in the R, this equation is true.
True, Let x ∈ R, whenever x > 0, x < 0, or x=0, x − x = 0

7. Below are two strategies for determining the truth value of a statement involving a
positive number x and another statement P(x).
For each statement below, indicate which strategy is appropriate.
(i) Find some x>0 such that P(x) is true.
(ii) Let x be the name for any number greater than 0 and show that P(x) is true.
(a) ∀x > 0, P(x). (ii)
(b) ∃ x > 0 such that P(x). (i)
(c) ∃ x > 0 such that ¬ P(x). (ii)
(d) ∀x > 0, ¬ P(x). (i)

8. Which of the following best identifies f as a constant function where x and y are real
numbers.
Constant Function: The output value is the same no matter what the input
value is.
(a) ∃x ∈ R such that ∀y ∈ R f (x) = y No
This is telling us that the image of x of R, which is not compatible with the definition of a
map from R
(b) ∀x ∈ R ∃y ∈ R such that f (x) = y No
This is just telling you that f is a map from R to R
(c) ∃y ∈ R such that ∀x ∈ R, f (x) = y Yes
(d) ∀y ∈ R ∃x ∈ R such that f (x) = y No
This is the definition of subjectivity.

9. Determine the truth value of each statement, assuming that x and y are real num-
bers. Justify your answer.
(a) ∀ x,y ∈ R y, x ≤ y.
False, since the original statement is false we will prove the negation of the
original statement.
The negation is: ∃ x,y ∈ R y, x > y.
Take: x:=5
Take y:=4
x and y both satisfy that x ∈ R and that x > y. This is contradictory to the
original statement.
(b) ∃ x and y ∈ R such that x ≤ y.
True

4
Take x:=3
Take y:=4
x and y both satisfy that x,y ∈ R and that x ≤ y
(c) ∀ x R, ∃ y R such that x ≤ y.
True
Draft:
Let x ∈ R
We can find a y ∈ R
such that x ≤ y
Proof:
Let x ∈ R
Take y:=x+1
Therefore x ≤ y. Notice how the above problem could’ve been solved by taking
y:=x because both values ca be equal. It is easier to equate the variables when
possible instead of finding another example.
The difference between this problem and the problems we have done before is that this one
involves two different quantifiers. As a result, it is easy to get confused on what you are
evaluating. It is essential to do a draft before the proof.
(d) ∃ x ∈ R such that ∀ y ∈ R x ≤ y.
False, the original statement is false because x is independent and this is not
true for all y’s if x is set beforehand.
Since the original statement is false we will prove the negation of the original
statement.
The negation is: ∀ x ∈ R ∃ y ∈ R such that x > y
Proof:
Let x ∈ R
Take y:=x-1
Then x > y
Which is contradictory to the original statement we started with.

10. Determine the truth value of each statement, assuming that x and y are real num-
bers. Justify your answer.
(a) ∀ x ∈ R, ∃ y ∈ R such that xy = 0
True
Draft:
For all x ∈ R
We can find a y ∈ R such that xy=0
Proof:
Let x ∈ R
Take y:=0
then clearly xy=0

5
(b) ∀ x ∈ R, ∃ y ∈ R such that xy = 1
The original statement is false because when 0 is multiplied with another R
the product can never be equal to one.
Since the original statement is false we will prove the negation of the original
statement.
The negation is: ∃ x ∈ R such that ∀ y ∈ R xy 6= 1
Draft:
Given an x
For all y’s this statement xy 6= 0 is true
Proof:
Take x:=0
Let y ∈ R
then clearly xy 6= 1
(c) ∃ y ∈ R such that ∀ x ∈ R, xy = 1
False, the original statement is False. Since the origin; statement is false we
will prove the negation of the original statement.
The negation is: ∀ y ∈ R ∃ x ∈ R such that xy 6= 1
Proof:
Let y ∈ R
Take x:=0
Then clearly xy 6= 1
(d) ∀ x ∈ R, ∃ y ∈ R such that xy = x
False, the original statement is false. Since the original statement is false we
will prove the negation of the original statement.
The negation is: ∃ x ∈ R ∀ y ∈ R such that xy 6= x
Proof:
Take x:=1
Let y ∈ R
then clearly xy 6= x

11. Determine the truth value of each statement, assuming that x,y, and z are real
numbers. Justify your answer.
(a) ∃ x ∈ R such that ∀ y ∈ R ∃ z ∈ R such that x + y = z
True,
Proof:
Take x:=0
Let y ∈ R
Take z:=y
Then clearly x+y=z
(b) ∃ x and y ∈ R such that ∀ z ∈ R , x + y = z
False, the original statement is false. Since the original statement is false we

6
will prove the negation of the original statement.
The Negation is: ∀ x and y ∈ R ∃ z ∈ R , x+y 6= z
Proof:
True
Proof: Let x,y ∈ R
Take x:= x+y+1
then clearly x+y 6= z
(c) ∀ x and y ∈ R, ∃ z ∈ R such that y − z = x
Let x,y ∈ R
Take z:=-x+y
Then clearly y-z=x
(d) ∀ x and y ∈ R, ∃ z ∈ R such that xz=y
False, The original statement is false. Since the original statement is false so
we will prove the negation of the original statement.
The negation is: ∃ x and y ∈ R such that ∀ z ∈ R xz 6= y
Proof
Take x:=0
Take y:=2
Let z ∈ R
Then clearly xz 6= y
(e) ∃ x ∈ R such that ∀ y,z ∈ R, z > y implies that z > x+y.
True,
Draft:
We want to find an x R such that
For all y,z ∈ R
Suppose z > y
We want to prove that z > x+y
Proof:
Take x:= 0
Let x, y ∈ R
Suppose z > y
Then clearly z > x+y.
(f)∀ x ∈ R , ∃ y,z ∈ R such that z > y implies that z > x+y.
True,
Draft:
For all x ∈ R
We want to find a y, z ∈ R
Suppose z > y
We want to prove that z > x+y
Proof:
Let x ∈ R

7
Take y:=0
Take z:= x+1
Suppose z > y
Then clearly z > x+y.

12. 11. Determine the truth value of each statement, assuming that x,y, and z are real
numbers. Justify your answer.
(a) ∀ x and y ∈ R, ∃ z ∈ R such that ∈ R x + y = z
True,
Let x, y ∈ R
Take z:=x+y
Then clearly x+y=z
(b) ∀ x ∈ R ∃ y ∈ R such that ∀ z ∈ R , x + y = z
False, The original statement is false. Since the original statement is false we
will prove by negating the original statement.
The negation is: ∃ x ∈ R such that ∀ y ∈ R ∃ z ∈ R such that x+y 6= z
Take x:=0
Let y ∈ R
Take z:=y+1
then clearly x+y 6= z
(c) ∃ x ∈ R such that ∀ y ∈ R , ∃ z ∈ R such that xz = y
True,
Take x:=1
Let y ∈ R
Take z:=y
Then clearly xz=y
(d) ∀ x and y ∈ R, ∃ z ∈ R such that yz = x
False, the original statement is false. Since the original statement is false we
will prove the negation of the original statement.
The negation is: ∃ x and y ∈ R such that ∀ z ∈ R yz=6= x
Proof: Take x:=1
Take y:=0
Let z ∈ R
Then clearly yz=6= x
(e) ∀ x ∈ R , ∃ y ∈ R such that ∀ z ∈ R, z > y implies that z > x+y.
False, the original statement is false. Since the original statement is false we
will prove the negation of the original statement.
The negation is: ∃ x ∈ R such that ∀ y ∈ R ∃ z ∈ R, z > y and z ≤ x+y.
Proof: Take x:=0
Let y ∈ R
Take z:=y+1

8
Then z > y and z ≤ x+y. So both statements not true at the same time.
(f) ∀ x,y ∈ R, ∃ z ∈ R such that z > y implies that z > x+y.
True
Draft:
For all x, y ∈ R
We can find a z ∈ R
Suppose that z > y
We want to prove that z > x+y
Proof:
Let x, y ∈ R
Take z: =x+y+1
Suppose z > y

For the next few questions

(a) Rewrite the defining conditions in logical symbolism using ∀, ∃ ⇒
(b) Write the negation

13. A function f is even if for every x, f (−x) = f (x)

(a) ∀ x ∈ R, f(-x)=f(x)
(b) ∃ x ∈ R such that f(-x)= / f(x)
14. A function f is periodic if there exists a k > 0 such that for every x, f (x + k) = f (x)
(a) ∃ k > 0 such that ∀ x ∈ R, f (x + k) = f (x)
(b) ∀ k > 0, ∃ x ∈ R such that f (x + k)= / f (x)
15. A function f is increasing if for every x and y, if x ≤ y, then f(x) ≤ f(y)
(a) ∀ x,y ∈ R, x ≤ y ⇒ f(x) ≤ f(y)
(b) ∃ x,y ∈ R, x ≤ y and f(x) > f(y)
(16) A function f is strictly decreasing if for every x and y, if x< y, then f(x) > f(y)
(a)∀ x,y ∈ R, x < y ⇒ f(x) > f(y)
(b)∃ x,y ∈ R x < y and f(x) ≤ f(y)
(17) A function f: A → B is injective if for every x and y in A, iff (x) = f (y), then x=y
(a) ∀ x,y ∈ A, f(x)=f(y) ⇒ x=y
(b) ∃ x,y ∈ A, f(x)=f(y) and x = /y
(18) A function f: A → B is surjective if for every y in B there exists an x in A, such that
f (x) = y.
(a) ∀ y ∈ B, ∃ x ∈ A such that f (x) = y
(b) ∃ y ∈ B, such that ∀ x ∈ A, f (x)= /y
(19) A function f: D → R is continuous at c ∈ D if for every E > 0 there is a δ > 0 such
that |f (x) − f (c)| < E whenever |x − c| < δ and x ∈ D.
(a) ∀ E > 0, ∃ δ > 0 such that |f (x) − f (c)| < E ⇒ |x − c| < δ and x ∈ D.
(b) ∃ E > 0, such that ∀ δ > 0 such that |f (x) − f (c)| < E and |x − c| ≥ δ or x ∈ / D.
(20) A function f is uniformly continuous at a set S if for every E> 0 there is a δ > 0 such

9
that |f (x) − f (y)| < E whenever x and y are in S and |x − y| < δ
(a) ∀ E> 0 ∃ δ > 0 such that |f (x) − f (y)| < E ⇒ x,y ∈S and |x − y| < δ
(b) ∃ E > 0 such that ∀ δ > 0 such that |f (x) − f (y)| < E and x,y ∈S / or |x − y| ≥ δ
(21) The real number L is the limit of the function f: D → R at the point c if for each E>
0 there exists a δ > 0 such that |f (x) − L| < E whenever x ∈ D and 0 < |x − c| < δ
(a) ∀ E> 0 , ∃ δ > 0 such that |f (x) − L| < E ⇒ x ∈ D and 0 < |x − c| < δ
(b) ∃ E> 0 such that ∀ δ > 0 |f (x) − L| < E and x ∈ / D or |x − c| ≥ 0 or |x − c| ≥ δ
∗ Using negation to understand mathematical definitions

Part II

Find the logic connector between the sentences

(a) All men are mortal ∀ x ∈ M, x ∈/I
(b) All men are immortal ∀ x ∈ M x ∈ I
(c) None of the men are mortal ∀ x ∈ M, x ∈ I
(d) None of the men are immortal ∀ x ∈ M, x ∈ /I
(e) There exist a man that is immortal ∃ x ∈ M x ∈ I
(f) There exist a man that is mortal ∃ x ∈ M x ∈/I
a ⇔ d, b ⇔ c

Let C be the set of cats, c ∈ C

M(c) be the proposition ”c has whiskers”
P(c) be the proposition ”c likes fish”
S(c) be the proposition ”c fears mice”

Write the sentence with quantifiers and the set defined

(1) The cats with whiskers always likes fish. ∀ c ∈ C, M(c) ⇒ P(c)
(2) It is wrong that the cats which likes fish has whiskers. ∃ c ∈ C, P(c) ∧ ¬ M(c)
(3) None of the cats which like fish fear the mice. ∀ c ∈ C, ¬ P(c) ⇒ ¬ S(c)
(4) The cats that have whiskers fear the mice. ∀ c ∈ C, M(c) ⇒, S(c)
(5) The cats which fear the mice have no whiskers. ∀ c ∈ C, S(c) ⇒ ¬ M(c)

Suppose 1, 2, 3 is true. Make a picture presenting the set of cats. The sentences (1,
2, 3) are true. What can you say about statements 4 and 5? Statements 4 and 5 are
inverses of each other.

Let H be the set of men.

We propose the two math translations for the sentence. ”All men are happy and quiet.”
(1) ∀ x ∈ H. (x is happy ∧ x is quiet)
All men are happy and quiet.
Is these statement the same as the first: Yes

10
(2) (∀ x ∈ H, x is happy) ∧ (∀ x ∈ H, x is quiet)
All men are happy and all men are quiet. Is these statement the same as the first:
Yes
(-) Are the 3 propositions the same: Yes

”Happy men are quiet”

(1) ∀ x ∈ H, (x is happy ⇒ x is quiet)
Happy men are quiet
Is these statement the same as the first: Yes
(2) (∀ x ∈ H, x is happy) ⇒ (∀ x ∈ H, x is quiet)
All men are happy then all men are quiet, which has a different meaning than
all men are quiet.
Is these statement the same as the first: No
(-) Are the 3 propositions the same: No

”There exist a man happy and quiet.”

(1) (∃ x ∈ H, x is happy) ∧ (∃ x ∈ H, x is quiet)
There exists a man that is happy and there exist a man that is quiet.
Is these statement the same as the first: No
(2) ∃ x ∈ H,[ (x is happy) ∧ (q is quiet)]
There exist a man that is happy and quiet.
Is these statement the same as the first: Yes
(-) Are the 3 propositions the same: No

”All men are not happy”

(1) ∀ x ∈ H, ¬ (x is happy)
All men are not happy
Is these statement the same as the first: Yes
(2) ∃ x ∈ H, ¬ (x is not happy)
There exist a man that is happy Is these statement the same as the first: No
(3) ¬ (∀ x ∈ H, x is happy)
There exist a man that is not happy.
Is these statement the same as the first: No
(-) Are the 3 propositions the same: No

Write the negation of the following proposition:

(a) p: All men are kind.
There exist a man that is not kind.
(b) p: All interval of R contains an element of the interval [0,1].
There exists an interval of R that does not contains an element of the interval
[0,1]

11
(c)p:∀ p ∈ N ∀ n ∈ Z, p ≥ m
∃ p ∈ N such that ∃ n ∈ Z such that p < m
(d) (x2 ≥ 1 ∧ x3 < 1 ∨ (x2 ≤ g ∧ x > 0)
(x2 < 1 ∨ x3 ≥ 1) ∧ (x2 > g ∨ x ≤ 0)
(e) ∀ x ∈ R, [(x < 1) ⇒ (x2 < 1)]
∃ x ∈ R, [(x < 1) ∧ (x2 ≥ 1)

Let E be a set and A, B, subsets in E. The definition of A ⊆ B is ”All elements of A is

an element of B”
Which of these proposition(s) below does it correspond to?
(1) ∀ x ∈ A, x ∈ B
Yes
(2) ∀ x ∈ E, (x ∈ A ⇒ x ∈ B)
Yes
(3) ∀ y ∈ E, (y ∈ A ⇒ y∈ B)
Yes
(4) (∀ x ∈ E, x ∈ A) ⇒ (∀ x ∈ E, x ∈ B)
It is not the definition, but still is a consequence of the definition. [E ⊆ A] ⇒ [E ⊆ B]
(A ⊆ B ∧ B ⊆ A) ⇒ A=B
No

If f is a function from R to R the definition of ”f is bounded” is ∃ M ∈ R, ∀ x ∈ R,

|f (x)| ≤ M
Give the definition ”f is not bounded”
∀ M ∈ R, ∃ x ∈ R such that |f (x)| > M

The definition of ”f is increasing” is (∀ (x, y) ∈ R, x ≥ y ⇒ f(x) ≥ f(y)

Give the definition of ”f is not increasing”
∃ (x, y) ∈ R such that (x ≥ y ) ∧( f(x) < f(y))

Give the definition of f is decreasing

∀ (x, y) ∈ R such that x ≥ y ⇒ f(y) ≥ f(x)

Let f be a function from {0, 1, 2} to {−1, 3, 5} defined by f(0)=3, f(1)=-1, and f(2)=5
For all these propositions give the negation and say which are true or false. (Justify your
answer)
(a) ∀ i ∈ {0, 1, 2}, f(i) ≥ 0
Negation: ∃ i ∈ {0, 1, 2}, f(i) < 0
The negated statement is True so we will prove the negated statement.

12
 Proof:
Take i=1
f (i) = −1 < 0
(b) ∃ i ∈ {0, 1, 2}, f(i) ≥ 0
Negation: ∀ i ∈ {0, 1, 2}, f(i) < 0
The negated statement is false so we will prove the original statement.
Proof:
True, Take i=0, f (i) = 3 ≥ 0
(c) ∀ j ∈ {−1, 3, 5}, ∃ i ∈ {0, 1, 2} f(i)=j
Negation: ∃ j ∈ {−1, 3, 5} such that ∀ i ∈ {0, 1, 2} f(i) 6= j
The negated statement is false so we will prove the original statement.
Proof: Let j ∈ {−1, 3, 5}. If j= -1 then i=1, f (1) = −1, If j=3 then i=2, f (2) = 3,
If j=5 then i=2, f (2) = 5
(d) ∀ j ∈ {−1, 3}, ∃ i ∈ { 0,1,2 } f(i) =j
Negation: ∃ j ∈ {−1, 3} such that ∀ i ∈ { 0,1,2 } f(i) 6= j
Proof: Let j ∈ {−1, 3, 5}
If j=-1, Take i:=1 therefore f(1)=-1
If j=3, Take i:=0 therefore f(0)=3
If j=5, Take i:=2 therefore f(2)=5
(e) ∃ j ∈ {−1, 3, 5} such that ∀ i ∈ {0, 1, 2} f (i) = j.
Negation: ∀ j ∈ {−1, 3, 5} ∃ i ∈ {0, 1, 2} such that f(i) 6= j
, The negated statement is true so we will prove it.
Proof:
If j=-1, Take i=0 then f(0) 6= -1
If j=3, Take i=2 then f(2) 6= 3
If j- 5, Take i=1, then f(1) 6= 5

For all the propositions below. Give the negation and say if the statement is false.
Justify your answer.
(a) ∀ x ∈ R, x2 > 0
Negation: ∃ x ∈ R such x2 ≤ 0
True, The negated statement is true so we will prove it. Take x=0, x=0 satis-
fies that x ∈ R and x2 = 0 ≤ 0
(b) ∃ x ∈ R, x2 > 0
Negation: ∀ x ∈ R, x2 ≤ 0
False, This negated statement is false so we will prove the original statement.
Take x:=2, √ x2 = 4, x:=2 satisfies that x ∈ R and x2 = 4 > 0
(c) ∀ x ∈ R, x2 = x √
Negation:∃ x ∈ R such that x2 = /x
True, The negated statement √ is true so we will prove it. Take x=-5, x=-5
satisfies that x ∈ R and x2 = 5= / −5

13
(d) (∀ x ∈ R), (∃ y ∈ R), x + y = 0
Negation:(∃ x ∈ R) such that (∀ y ∈ R), x + y= /0
False, This negated statement is false so we will prove the original statement.
Let x ∈ R
Take: y = −x
Then clearly x + y = 0
(e) (∃ y ∈ R), (∀ x ∈ R), x + y = 0
Negation: (∀ y ∈ R), (∃ x ∈ R) such that x + y= /0
The negated statement is True so we will prove it.
Let y ∈ R
Take x=-y+1
then clearly x + y= /0
Explain if there is a difference between e and f and why?
Yes, there is a difference between both statements because we intertwine the quantifier,
in the first statement y can be chosen in terms of z while in the second statement y is
independent of x.

Write with quantifiers.

(a) All natural numbers have a real square root.
∀ n ∈ N, ∃ x ∈ R such that x2 = m
(b) All natural numbers have a positive real number greater than them.
∀ n ∈ N ∃ x ∈ R (positive) such that n < x
(c) ∃ a real number smaller than all the integers.
∃ x ∈ R such that ∀ n ∈ Z x < n
(d) The interval I is included in [1,2]
∀ x ∈ I, x ∈ [1,2]

Let F be the of French. We denote, ∀ ∈ F,

P(x), the proposition ”x has brown hats”
Q(x), the proposition ”x is tall”
Answer the following questions
(1) In a picture, represent in F the set of elements of F such that P(x) is true then the set
of elements such that Q is true.
(2) Consider the following sentence:
(∀ x ∈ F) [P-[(x) or Q(x)]
and (∀ x ∈ F, P(x)) or (∀ x ∈ F, Q(x))
Tell if the propositions are true or fall in the case of the picture.
(∀ x ∈ F) [P(x) or Q(x)]
True
(∀ x ∈ F, P(x)) or (∀ x ∈ F, Q(x))
True

14
If you worked to represent when each of the sentence us true how would you represent if
they are the same?
You can represent if they are the same by seeing if their pictures are equivalent
or seeing if they all mean the same.
The first statement is saying All men have brown hats or are tall. While the
second statement is saying all men have brown hats or all men kill. Both state-
ments are equivalent.

Let E be a nonempty set. Denote P(x) and Q(x) as 2 propositions. Consider the fol-
lowing propositions.

∃ x ∈ E, P(x) and Q(x)

(∃ x ∈ E, P(x)) and (∃ x ∈ E, Q(x))
Interpret the formulas P(x) and Q(x) to be pawns of the chess game. P(x) is ”x is black”
and Q(x), ”x is white”
Express in english the two sentences
∃ x ∈ E, P(x) and Q(x)
There exists a pawn that is black and white
(∃ x ∈ E, P(x)) and (∃ x ∈ E, Q(x))
There exist a pawn that is white and there exist a pawn that is black.
Tell me if you think the two propositions are the same or not.
These propositions are not the same. For the first proposition you are stating
that there exist a pawn that is white and black simultaneously. While the
second statement is stating that there are two different pawns one of which is
black and the other one which is white. This condition does not have to be
met simultaneously.

Write the negation of the two propositions

∃ x ∈ E, P(x) and Q(x)
Negation:¬ ∀ x ∈ E, ¬ P(x) or ¬ Q(x)
(∃ x ∈ E, P(x))and (∃ x ∈ E, Q(x))
Negation:∀ x ∈ E, ¬ P(x) or ∀ x ∈ E, ¬ Q(x)
Give the logic relation between these two propositions.
∃ x ∈ E, P(x) and Q(x) ⇒ (∃ x ∈ E, P(x)) and (∃ x ∈ E, Q(x))

15