MATH 244, PROBLEM SET 1

DUE: WEDNESDAY, SEPTEMBER 14, 11:59 PM EASTERN TIME

Note(s): In the electronic version of this problem set, the text highlighted in purple does not have any
special meaning beyond helping you locate the statements of the problems.
You must justify all your answers. For instance, if a problem asks for an example of something, then you
should both provide the example and explain why it is a suitable example.
See the Course Syllabus on the Canvas Home Page for important information about collaborating with
your classmates (which is strongly encouraged!).
For any two statements A and B, recall we say that “A implies B” if B is True in all
instances where A is True. We often write A ⇒ B instead of “A implies B”. We also write
A ; B to mean that the implication “A implies B” is False.
Problem (1) Let A and B be statements satisfying the assumptions of the “Some Logic (Version
2)” worksheet from Week 1. That is, assume “A implies B”, and assume in addition
that A is True in some instances and False in some instances, and similarly that B
is True in some instances and False in some instances.
An allowable example to keep in mind is A : (Today is Sunday) and B : (It is the weekend).
Indeed, in the instance “Sunday” A is True, and in the instance “Monday” A is False.
And, in the instance “Saturday” B is True, and in the instance “Wednesday” B is
False. Also, A ⇒ B since B is True in the only instance, “Sunday”, where A is True.
(a) (i) Give a different example of allowable statements A and B.
(ii) Give an example of a statement A0 that has only one instance, and is True.
[Update 1: In Problem (1)(a)ii–Problem (1)(a)v, the statement A0 does not need
to be related to A or B.]
(iii) Give an example of a statement A0 that has more than one instance, and
is True in all instances.
(iv) Give an example of a statement A0 that has only one instance, and is False.
(v) Give an example of a statement A0 that has more than one instance, and
is False in all instances.
(b) Prove that the implication “(not B) ⇒ A” is False.
Some things to keep in mind when writing your proof:
• State clearly whether you are or are not writing a proof by contradiction.
You do not need to use a proof by contradiction for this problem, but you
can if you want. If you do, state clearly the Contradiction Hypothesis as
well as the contradiction that you derive.
• State clearly any parts of the proof where you use the Principle of Excluded
Middle, or the Principle of Contradiction.
• State clearly where, if at all, you use the assumptions about the statements
A and B. Did you use the quantifier “there exists” anywhere?
[Update 2: For Problem (1)b and Problem (1)c, I would prefer you not use a
contrapositive argument. Rather, give either a direct proof (a smiley face proof) or a
proof by contradiction (a frowny face proof), as we did in class.]
(c) Similarly, prove B ; (not A).
1
 2 MATH 244

Problem (2) Give examples of statements A and B such that the implications “A ⇒ B” and
“(not A) ⇒ B” are both True. Why does this not violate what we did in class?
Hint: In this problem, we are not assuming the hypotheses of Problem (1).
Problem (3) (a) Consider the hypothesis A: (Triangle T is equilateral), and the conclusion B:
(Triangle T is isosceles).
Is the hypothesis True if and only if the conclusion is True? Is the hypothesis
sufficient for the conclusion? Is the hypothesis necessary for the conclusion?
(b) Repeat Problem (3)a for the hypothesis A: (Polygon P is a parallelogram)
and the conclusion B: (Polygon P is a square).
(c) Repeat Problem (3)a for the hypothesis A : (0 6 x) and the conclusion B :
(0 6 x 6 x2 ). Here, an “instance” is choosing some real number x.
(d) Repeat Problem (3)a for the hypothesis A : (0 6 x) and the conclusion B :
(x 6 x2 ). Here, an “instance” is choosing some real number x.
Problem (4) Let A and B be statements that are True in at least one instance.
Allowable examples include A : (Today is Sunday) or B : (1 + 1 = 2), but not
something like A : (1 + 1 = 3) or B : (x < x − 1).
[Update 1: In the first version of this Problem Set, I had mistakenly written B : (x > x − 1),
which is always True!]
Let us say that A and B are independent if A ; B and B ; A. In other words,
there exists some instance where A is True yet B is False, and there exists some
instance where B is True yet A is False.
Heads up: This might be non-standard terminology.
(a) For each part, Problem (3)a–Problem (3)d, of the previous problem, convince
yourself that A and B satisfy the hypotheses of the current problem; that is,
they are True in at least one instance.
Hint: For your solution, it suffices to write down “I am thoroughly convinced!”
(b) For each part, Problem (3)a–Problem (3)d, of the previous problem, determine
whether A and B are independent.
(c) Come up with your own examples of statements A and B satisfying the hypotheses
of this problem, and which are independent.
Hint: Creativity!
Problem (5) (A little bit of high school linear algebra.) Prove the following equivalence of
systems of linear equations:
 
11 11

 x + 3y + z = 0 − 5 x − 6 = − 2 y + 5

A: and ⇐⇒ B : and .

−2x + 5y = 10 − 11 y + 5 = z

2
Hint: Do one direction at a time. For instance, first show A ⇒ B, then show
B ⇒ A. Or the other way around.