Points of Discussion Sheet & Problems – 3 ::: MTH202A – 2023-24

1. Define a countable (or countably infinite) set. Also, define an uncountable set.
2. Show that a set is countable iff its elements can be arranged as (x1 , x2 , x3 , . . . . . .).
3. Let A be a countable set and let B be a finite set. Show that A ∪ B is countable.
4. Let A and B be countable sets. Show that A ∪ B is countable. (Hint: A ∪ B = A ∪ (B \ A).)
5. Show that Z is countable.
6. Let A be a countable set and B ⊆ A be nonempty. Show that B is either finite or countable.
7. Let A be a countable set and let B be a nonempty set. Let f : A −→ B be onto. Show that B is
either finite or countable.
8. Let A be a countable set and let B be a nonempty set which is either finite or countable. Show
that A × B is countable. Hence show that Q is countable.
9. Let A1 , A2 , A3 , . . . . . . be countable sets. Show that ∪∞
n=1 An is countable.
10. Let A be an infinite set. Show that A contains a countable set.
11. Let A be an infinite set and let B be a finite set. Show that card(A) = card(A ∪ B).
12. Let A be an infinite set and let B be a countable set. Show that card(A) = card(A ∪ B).
13. Let A be an infinite set and let B be a nonempty set such that card(B) < card(A). Show that
card(A) = card(A ∪ B).
14. Let A be an infinite set. Show that card(A × A) = card(A).
15. Let A be an infinite set and let B be a countable set. Show that card(A × B) = card(A).
16. Let a, b ∈ R such that a < b. Show that
b−x
(a) the map f : (a, b) −→ (0, 1) given by f (x) = is a bijection.
b−a
 
1 x
(b) the map f : R −→ (0, 1) given by f (x) = 1− is a bijection.
2 1 + |x||
a−x
(c) the map f : (−∞, a) −→ (0, 1) given by f (x) = is a bijection.
1+a−x
x−a
(d) the map f : (a, ∞) −→ (0, 1) given by f (x) = is a bijection.
1+x−a

(e) card((0, 1)) = card(R) = card((−∞, a)) = card((a, ∞)) = card((a, b)) = card([a, b)) =
card([a, b]) = card((a, b]).
17. Let A be set having at least two elements. Show that B = A × A × A × . . . . . . is uncountable.
18. Show that the set (0, 1) is uncountable.
19. Show that R is uncountable.
20. Define the powerset P (A) for a set A.
21. Let A be a nonempty set. Show that there exists a one-one map from A to P (A).
22. Let A be a countable set. Show that P (A) is uncountable.
23. Let A be a set having at least two elements. Show that card(A) < card(P (A)).
24. Define the universal set. Show that there exists no universal set.