Math 609

Spring 2010
Sample Midterm Test
You have 75 minutes to complete this test. Please use the exam books provided. Point
values of problems are given in parentheses, with a total of 100 points possible. Partial credit
will be awarded for any answer showing some understanding of the problem, so be sure to
show your work!
You may not use books, notes, or any other references. If you have a question about a
problem, raise your hand and Mr. Miller will respond promptly.
Any documented instance of cheating on a test in this section will be considered grounds
for failing the course, in addition to any other penalties the College may impose.
1. (30 points)
Suppose that A ⊆ B, and assume that A is not empty.
T T
(a) Prove that B ⊆ A.
T T
(b) Give an example of nonempty sets A ⊆ B for which A 6⊆ B.
S S
(c) One of A and B must be a subset of the other. Decide which it is, prove your
answer, and give a counterexample for the opposite inclusion.
(Basically this just asks you to S
repeat S
parts (a)
S and (b)
S for unions, except that
you have to figure out whether A ⊆ B or B ⊆ A.)
T T S S
(d) Give an example of sets C 6= D such that C = D and C = D.
2. (20 points)
(a) Show that for every function F and every subset S ⊆ ran(F ), F [[F −1 [[S]]]] = S.
(b) Give an example of a relation R and a subset S ⊆ ran(R) with R[[R−1 [[S]]]] 6= S.
3. (20 points)
Write a formula expressing the idea
[
A = P( B).
Your formula should use only the variables A and B (plus any other variables you might
need for your quantifiers), the symbols =, 6=, ∈, and ∈,
/ parentheses, the quantifiers ∀
and ∃, and the logical symbols =⇒ S , ⇐⇒ , &, and “or.” In particular, you may not
use the defined symbols ⊆, P and , nor the curly brackets { and }.
4. (30 points)
Let A be any set.
(a) Prove that there is a set C which contains precisely those subsets of A having
exactly three elements.
(b) Is the statement in part (a) true even if A itself contains fewer than three elements?
Does your proof still work for such a set A?
(c) Prove that there exists a function f with dom(f ) = C, such that, for every b ∈ C,
f (b) ∈ b.