Homework 2
Section 1.2
2. Mark each statement True or False. Justify each answer.
(a) The symbol “∃” means “there exist several.”
False. This symbol means “there exists 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. The universal quantifier is assumed for a variable used in the antecedent of an implication
if it not quantified.
(c) The order in which quantifiers are used affects the truth value.
True. See example in the textbook after 1.2.4 Practice where the order of the quantifiers
changed the truth value.
∀ 𝑥𝑥 ∃ 𝑦𝑦 ∋ 𝑦𝑦 > 𝑥𝑥 is true.
∃ 𝑦𝑦 ∋ ∀ 𝑥𝑥, 𝑦𝑦 > 𝑥𝑥 is false.
6. Determine the truth value of each statement, assuming 𝑥𝑥 is a real number. Justify your answer.
(a) ∃ 𝑥𝑥 in the interval [3, 5] ∋ 𝑥𝑥 ≥ 4.
True. The interval [4, 5] has values that are ≥ 4, therefore there is at least one value that is
greater or equal to 4.
(b) ∀ 𝑥𝑥 in the interval [3, 5], 𝑥𝑥 ≥ 4.
False. The interval [3, 4) has values that are less than 4.
(c) ∃ 𝑥𝑥 ∋ 𝑥𝑥 2 ≠ 3.
True. All 𝑥𝑥 values except 𝑥𝑥 = ±√3 satisfies the condition 𝑥𝑥 2 ≠ 3, therefore there is at least one
value where 𝑥𝑥 2 ≠ 3.
(d) ∀ 𝑥𝑥, 𝑥𝑥 2 ≠ 3.
False. 𝑥𝑥 = ±√3 makes this statement not true.
(e) ∃ 𝑥𝑥 ∋ 𝑥𝑥 2 = −5.
False. Only squares of imaginary numbers can be negative, and unless specified, all quantifiers of
variables are for real numbers.
(f) ∀ 𝑥𝑥, 𝑥𝑥 2 = −5.
False. Variable 𝑥𝑥 represents a real number. The square of a real number cannot be negative.
(g) ∃ 𝑥𝑥 ∋ 𝑥𝑥 − 𝑥𝑥 = 0.
True. Any real number satisfies this equation.
(h) ∀ 𝑥𝑥, 𝑥𝑥 − 𝑥𝑥 = 0.
True. All real numbers satisfy this equation.
Homework 2
12. Determine the truth value of each statement, assuming that 𝑥𝑥, 𝑦𝑦, and 𝑧𝑧 are real numbers. Justify
your answer.
(a) ∀ 𝑥𝑥 and 𝑦𝑦, ∃ 𝑧𝑧 ∋ 𝑥𝑥 + 𝑦𝑦 = 𝑧𝑧.
True. Given 𝑥𝑥 and 𝑦𝑦, we could let 𝑧𝑧 = 𝑥𝑥 + 𝑦𝑦.
(b) ∀ 𝑥𝑥 ∃ 𝑦𝑦 ∋ ∀ 𝑧𝑧, 𝑥𝑥 + 𝑦𝑦 = 𝑧𝑧.
False. Let 𝑥𝑥 = 2, 𝑦𝑦 = 3. Any 𝑧𝑧 value except 𝑧𝑧 = 5 will make 𝑥𝑥 + 𝑦𝑦 ≠ 𝑧𝑧.
(c) ∃ 𝑥𝑥 ∋ ∀ 𝑦𝑦, ∃ 𝑧𝑧 ∋ 𝑥𝑥𝑥𝑥 = 𝑦𝑦.
True. Let 𝑥𝑥 = 3. Then for any 𝑦𝑦, we can let 𝑧𝑧 = 𝑦𝑦/3.
(d) ∀ 𝑥𝑥 and 𝑦𝑦, ∃ 𝑧𝑧 ∋ 𝑦𝑦𝑦𝑦 = 𝑥𝑥.
False. For any given 𝑥𝑥 and 𝑦𝑦, we could let 𝑧𝑧 = 𝑥𝑥/𝑦𝑦 but then 𝑦𝑦 cannot be zero.
(e) ∀ 𝑥𝑥 ∃ 𝑦𝑦 ∋ ∀ 𝑧𝑧, 𝑧𝑧 > 𝑦𝑦 implies that 𝑧𝑧 > 𝑥𝑥 + 𝑦𝑦.
False. For any given 𝑦𝑦, lets 𝑧𝑧 = 𝑦𝑦 + 1 so 𝑧𝑧 > 𝑦𝑦. Let 𝑥𝑥 > 1, now 𝑧𝑧 > 𝑥𝑥 + 𝑦𝑦 is false.
(f) ∀ 𝑥𝑥 and 𝑦𝑦, ∃ 𝑧𝑧 ∋ 𝑧𝑧 > 𝑦𝑦 implies that 𝑧𝑧 > 𝑥𝑥 + 𝑦𝑦.
True. For any given 𝑥𝑥 and 𝑦𝑦, we could let 𝑧𝑧 > 𝑥𝑥 + 𝑦𝑦 making the statement true.
Exercises 13, 17, 19 give certain properties of functions.
(a) Rewrite the defining conditions in logical symbolism using ∀, ∃, ∋, and ⇒, as appropriate;
(b) Write the negation of part (a) using the same symbolism.
13. A function 𝑓𝑓 is even if for every 𝑥𝑥, 𝑓𝑓(−𝑥𝑥) = 𝑓𝑓(𝑥𝑥).
(a) ∀ 𝑥𝑥, 𝑓𝑓(−𝑥𝑥) = 𝑓𝑓(𝑥𝑥)
(b) ∃ 𝑥𝑥, 𝑓𝑓(−𝑥𝑥) ≠ 𝑓𝑓(𝑥𝑥)
17. A function 𝑓𝑓: 𝐴𝐴 → 𝐵𝐵 is injective if for every 𝑥𝑥 and 𝑦𝑦 in 𝐴𝐴, if 𝑓𝑓(𝑥𝑥) = 𝑓𝑓(𝑦𝑦), then 𝑥𝑥 = 𝑦𝑦.
(a) ∀ 𝑥𝑥 and 𝑦𝑦, 𝑓𝑓(𝑥𝑥) = 𝑓𝑓(𝑦𝑦) ⇒ 𝑥𝑥 = 𝑦𝑦
(b) ∃ 𝑥𝑥 and 𝑦𝑦, �𝑓𝑓(𝑥𝑥) = 𝑓𝑓(𝑦𝑦)� ∧ (𝑥𝑥 ≠ 𝑦𝑦)
19. A function 𝑓𝑓: 𝐷𝐷 → 𝑅𝑅 is continuous at 𝑐𝑐 ∈ 𝐷𝐷 if for every 𝜀𝜀 > 0 there is a 𝛿𝛿 > 0 such that
|𝑓𝑓(𝑥𝑥) − 𝑓𝑓(𝑐𝑐)| < 𝜀𝜀 whenever |𝑥𝑥 − 𝑐𝑐| < 𝛿𝛿 and 𝑥𝑥 ∈ 𝐷𝐷.
(a) ∀ 𝜀𝜀 > 0, ∃ 𝛿𝛿 > 0 ∋ ∀ 𝑥𝑥 ∈ 𝐷𝐷, |𝑥𝑥 − 𝑐𝑐| < 𝛿𝛿 ⇒ |𝑓𝑓(𝑥𝑥) − 𝑓𝑓(𝑐𝑐)| < 𝜀𝜀
(b) ∃ 𝜀𝜀 > 0, ∀ 𝛿𝛿 > 0 ∋ ∃ 𝑥𝑥 ∈ 𝐷𝐷 ∋ (|𝑥𝑥 − 𝑐𝑐| < 𝛿𝛿) ∧ (|𝑓𝑓(𝑥𝑥) − 𝑓𝑓(𝑐𝑐)| ≥ 𝜀𝜀)
Homework 2
Section 1.3
2. Mark each statement True or False. Justify each answer.
(a) When an implication 𝑝𝑝 ⇒ 𝑞𝑞 is used as a theorem, we refer to 𝑞𝑞 as the conclusion.
True. “When an implication 𝑝𝑝 ⇒ 𝑞𝑞 is used as a theorem, it is customary to refer to 𝑝𝑝 as the
hypothesis and 𝑞𝑞 as the conclusion.”
(b) A statement that is always false is called a lie.
False. A statement that is always false is called a contradiction.
(c) The converse of 𝑝𝑝 ⇒ 𝑞𝑞 is 𝑞𝑞 ⇒ 𝑝𝑝.
True. “The implication 𝑞𝑞 ⇒ 𝑝𝑝 is called the converse of 𝑝𝑝 ⇒ 𝑞𝑞.”
(d) To prove “∀ 𝑛𝑛, 𝑝𝑝(𝑛𝑛)” is false, it takes only one counterexample.
True. A counterexample is an exception to a generalization and it only takes one to proof the
generalization statement is false.
(e) To prove “∃ 𝑛𝑛 ∋ 𝑝𝑝(𝑛𝑛)” is false, it takes only one counterexample.
False. It takes one example to prove that this statement is true.
3. Write the contrapositive of each implication.
(a) If all roses are red, then some violets are blue.
If all violets are not blue, then some roses are not red.
(b) 𝐴𝐴 is not invertible if there exists a nontrivial solution to 𝐴𝐴𝐱𝐱 = 𝟎𝟎.
If 𝐴𝐴 is invertible then there is no nontrivial solution to 𝐴𝐴𝐱𝐱 = 𝟎𝟎.
(c) If 𝑓𝑓 is continuous and 𝐶𝐶 is connected, then 𝑓𝑓(𝐶𝐶) is connected.
If 𝑓𝑓(𝐶𝐶) is not connected, then either 𝑓𝑓 is not continuous or 𝐶𝐶 is not connected.
Homework 2
Additional Problems
1. Explain the differences between the converse, the contrapositive, and the negation of an
implication. How are the truth values of the converse, the contrapositive, and the negation related
to the truth value of the original implication? Which are equivalent?
The converse of an implication (𝑝𝑝 ⇒ 𝑞𝑞) is formed by reversing the antecedent 𝑝𝑝 and the consequent
𝑞𝑞. The converse is 𝑞𝑞 ⇒ 𝑝𝑝.
Example: The implication is “If the mall is crowded, then it is a Holiday”. The converse is “If it is a
Holiday, then the mall is crowded.” If the implication is true, the converse is not necessarily true.
Therefore, the converse is not logically equivalent to the original implication.
The contrapositive of an implication negates and reverses both the antecedent and the consequent.
The contrapositive is ~𝑞𝑞 ⇒ ~𝑝𝑝. The contrapositive is logically equivalent to the original implication
(both are true or both are false).
Example: The implication is “If the mall is crowded, then it is a Holiday”. The contrapositive is “If it is
not a Holiday, then the mall is not crowded.”
The implication 𝑝𝑝 ⇒ 𝑞𝑞 is equivalent to ~𝑝𝑝 ∨ 𝑞𝑞. The implication statement is only false when the
antecedent is true and the precedent is false. The negation of the implication is equivalent to
𝑝𝑝 ∧ ∼ 𝑞𝑞. The negation of the implication is only true when the antecedent is true and the precedent
is false.
Example: The implication is “If the mall is crowded, then it is a Holiday”. The negation is “The mall is
crowded and is not a Holiday.”
2. Compare and contrast indirect proofs and proofs by contradiction. How are they alike? How are they
different?
The indirect proofs and proofs by contradiction are closely related. The both start by assuming the
consequent 𝑞𝑞 is false.
The indirect proof using the logically equivalency of the contrapositive, tries to prove the antecedent
𝑝𝑝 must be false.
The proof by contradiction tries to prove that 𝑝𝑝 ∧ ∼ 𝑞𝑞 is false since that is the negation of the
implication. If 𝑝𝑝 ∧ ∼ 𝑞𝑞 is false, then the original implication must be true.
Roberto Frontera
September 5, 2024
