(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

A[itex]_{1}[/itex], A[itex]_{2}[/itex], A[itex]_{3}[/itex],... are countable sets indexed by positive integers. I'm looking to prove that the disjoint union of these sets is countable.

2. Relevant equations

3. 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 Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Disjoint Union Proof

**Physics Forums | Science Articles, Homework Help, Discussion**