Question

In: Advanced Math

1) a) Prove that the union of two countable sets is countable. b) Prove that the...

1) a) Prove that the union of two countable sets is countable.

b) Prove that the union of a finite collection of countable sets is countable.

Solutions

Expert Solution

a)   Let A and B be countable sets. We will consider four cases.

case 1 Suppose both A and B are finite. Then A ∪ B is finite, and hence countable.

case 2   Suppose one of A and B is finite and the other is countably infinite. Assume without loss of generality that A is finite. Since B is countably infinite, there exists a function f: B 7→ Z + which is a one-to-one correspondence. Say that f(bi) = i, for bi ∈ B and i ∈ Z +. Let C = A − B. Thus A ∪ B = B ∪ C.

If C = ∅, then A ∪ B = B which is countably infinite. Thus assume that C 6= ∅. Suppose that C = {c1, c2, ...cn}.

Let f : B ∪ C → Z + be defined as follows: f ' (cj) = j and f ' (bi) = n + i.

Clearly, f ' is one-to-one and onto. Thus B ∪ C is countable. But B ∪ C = A ∪ B, so A ∪ B is countable.

case 3   Suppose that both A and B are infinite and that A ∩ B = ∅. Given that A and B are both

countable, there exists functions f : Z+ → A and g : Z+ → B that are one-to-one correspondences. Consider the function h : Z+ → A ∪ B where h(n) = f(n/2) if n is even and h(n) = g((n + 1)/2) if n is odd. Since both f and g are one-to-one, then so is h. Similarly, since f is onto, every element in A is covered and since g is onto, every element in B is coverd, so h is onto. Therefore, h is a one-to-one correspondence, and hence h is countable.

case 4   Suppose that both A and B are infinite and that A ∩ B ≠ ∅. Let C = B − A. Then A∪B = A∪C and

A∩C = ∅. If C is countably infinite, then A∪B = A∪C is countable by the previous case. If C is finite,

then A ∪ B A ∪ C is countable by the second case. In any case, A ∪ B is countable.

b) to show that union of a finite collection of a countable set is countable

suppose A1 , A2.........., AK  is countable set

to show A1 U A2U.........U AK is countable  

by induction

A1 U A2   is countable by part ( a)

let B1 = A1UA2

than B1UA1 is also countable

suppose A1 U A2U.........U AK-1 is countable

let B2 =A1 U A2U.........U AK-1

B2UAK is countable again by part (a)


Related Solutions

Prove that the union of infinitely many countable sets is countable.
Prove that the union of infinitely many countable sets is countable.
(11) Prove that a union of two countable sets is countable. (Hint: the same idea used...
(11) Prove that a union of two countable sets is countable. (Hint: the same idea used to show that Z is countable might be useful.) (Don’t forget that countable sets can be finite.) (12) We saw in class that N × N ∼ N is countable. Prove that A × B is is countable for any countable sets A, B. (Hint: If you can prove that A × B ∼ N × N then you can use what has already...
4: \textbf{Proof} Prove that if $A$ and $B$ are countable sets, then $A \cup B$ is...
4: \textbf{Proof} Prove that if $A$ and $B$ are countable sets, then $A \cup B$ is countable. 5: Use induction and problem 4 to prove that if $A_1, A_2, ..., A_m$ are each countable sets, then the union $A_1 \cup A_2 \cup ... \cup A_m$ is countable. #5 please
Prove the following statements! 1. If A and B are sets then (a) |A ∪ B|...
Prove the following statements! 1. If A and B are sets then (a) |A ∪ B| = |A| + |B| − |A ∩ B| and (b) |A × B| = |A||B|. 2. If the function f : A→B is (a) injective then |A| ≤ |B|. (b) surjective then |A| ≥ |B|. 3. For each part below, there is a function f : R→R that is (a) injective and surjective. (b) injective but not surjective. (c) surjective but not injective. (d)...
Consider any two finite sets A and B. Prove that |A×B|=|A||B|
Consider any two finite sets A and B. Prove that |A×B|=|A||B|
Let f be a one-to-one function from A into b with B countable. Prove that A...
Let f be a one-to-one function from A into b with B countable. Prove that A is countable. Section on Cardinality
Prove the following Theorems: 1. A finite union of compact sets is compact. 2. Any intersection...
Prove the following Theorems: 1. A finite union of compact sets is compact. 2. Any intersection of compact set is compact. 3. A closed subset of a compact set is compact. 4. Every finite set in IRn is compact.
Given two sets A,B prove A<---> B either using the definition of the schroeder-bernstein theorem
Given two sets A,B prove A<---> B either using the definition of the schroeder-bernstein theorem
Prove whether or not the set S is countable a. S= {irrationals} b. S= {terminating decimals}...
Prove whether or not the set S is countable a. S= {irrationals} b. S= {terminating decimals} c. S= [0, .001) d. S= Q(rationals) x Q(rationals) e. S= R(real numbers) x Z(integers)
Prove or disprove that the union of two subspaces is a subspace. If it is not...
Prove or disprove that the union of two subspaces is a subspace. If it is not true, what is the smallest subspace containing the union of the two subspaces.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT