Logic and Set Theory, 2024
Exercise 3
Due Date: April 21, 2024
April 10, 2024
In all exercises you may use claims proven in class, in recitations, and in previous homework
assignments.
1. Let A and B be sets. Prove or disprove:
(a) If A is infinite and not countable, then A ∪ B is infinite and not countable.
(b) If A is infinite and not countable, and B ̸= A is infinite and not countable, then
A \ B is infinite.
(c) If A is infinite and not countable and B is countable, then A \ B is infinite and
not countable.
2. What is the cardinality of the following sets? Prove your answer.
(a) A - The set of all total functions f : R → R that are polynomials with rational
coefficients, meaning of the form:
a0 + a1 x + a2 x2 + · · · + an xn , a0 , . . . an ∈ Q
(b) B - The set of all total functions f : R → R such that f (x) = x for every
/ {1, 32 , e, −7}.
x∈
3. Give an example of a bijection between the set of all total functions f : R+ → {0, 1}
+
such that ∀x ∈/ Q+ , f (x) = 0 and the set {0, 1}Q . Justify your answer. Note that
Q+ , R+ are the sets of positive rational and real numbers respectively.
4. Let A ⊆ R be a countable set. Let B = {x ∗ y| x, y ∈ A}.
(a) Prove that it is possible that B = Q.
(b) Prove that it is impossible that B = R.
5. Prove or disprove: There exists a set B of cardinality ℵ that is a set of subsets of N
(namely, B ⊆ P (N), such that for every A1 , A2 ∈ B, if A1 ̸= A2 , then A1 ∩ A2 = ∅.
6. Given k ∈ R such that 0 < k < 0.5, we say a set A is k − integer − avoidant if for
every z ∈ Z, (z − k, z + k) ∩ A = ∅. Let B be the set of all k − integer − avoidant
sets. Prove B ∼ P (P (N)) for every k ∈ R such that 0 < k < 0.5.