Prove Disjoint Union of Countable Sets is Countable

  • Thread starter Thread starter the_kid
  • Start date Start date
  • Tags Tags
    Proof Union
the_kid
Messages
114
Reaction score
0

Homework Statement


A_{1}, A_{2}, A_{3},... are countable sets indexed by positive integers. I'm looking to prove that the disjoint union of these sets is countable.


Homework Equations





The Attempt at a Solution


I can't figure out how to enter the form of the disjoint union in this interface, but I'm using the one listed on Wikipedia (http://en.wikipedia.org/wiki/Disjoint_union). So, I understand that when looking to prove that a single set, S, is countable, one must show that there exists a bijection from the N-->S. However, I'm confused about how I'd show this for the disjoint union. It seems to me that this bijection is almost implicit in the definition of the disjoint union. I.e. the disjoint union indexes each element according to which set it came from. I'm looking for some help getting started with this.
 
Physics news on Phys.org
Did you prove that the rational numbers are countable? It's essentially the same proof with some changes of notation.
 
the_kid said:

Homework Statement


A_{1}, A_{2}, A_{3},... are countable sets indexed by positive integers. I'm looking to prove that the disjoint union of these sets is countable.

The Attempt at a Solution


I can't figure out how to enter the form of the disjoint union in this interface, but I'm using the one listed on Wikipedia (http://en.wikipedia.org/wiki/Disjoint_union). So, I understand that when looking to prove that a single set, S, is countable, one must show that there exists a bijection from the N-->S. However, I'm confused about how I'd show this for the disjoint union. It seems to me that this bijection is almost implicit in the definition of the disjoint union. I.e. the disjoint union indexes each element according to which set it came from. I'm looking for some help getting started with this.

I would try thinking about listing the elements of the sets in an infinite square array and moving along diagonals.
 
Thanks for the replies! So, from the definition, the disjoint union gives pairs (x, i) : x\inS_{i}. I'm looking at my proof of why Q is countable: It begins with showing that if S and T are countable sets, then so is S X T. What would be the analogous argument for the disjoint union?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top