Prove for the following:
a. Theorem: (Cantor-Schroder-Bernstein in the 1800s) For any set
S, |S| < |P(S)|.
b. Proposition N×N is countable.
c. Theorem: (Cantor 1873) Q is countable. (Hint: Similar. Prove
for positive rationals first. Then just a union.)
Prove that a disjoint union of any finite set and any countably
infinite set is countably infinite.
Proof: Suppose A is any finite set,
B is any countably infinite set, and A and
B are disjoint. By definition of disjoint, A ∩ B = ∅
In case A = ∅, then A ∪ B = B, which
is countably infinite by hypothesis.
Now suppose A ≠ ∅. Then there is a positive integer
m so that A has m elements...
1. Prove that the Cantor set contains no intervals.
2. Prove: If x is an element of the Cantor set, then there is a
sequence Xn of elements from the Cantor set converging
to x.
Prove that the function defined to be 1 on the Cantor
set and 0 on the complement of the Cantor set is discontinuous at
each point of the Cantor set and continuous at every point of the
complement of the Cantor set.