Prove Disjoint Union of Countable Sets is Countable

  • Thread starter Thread starter the_kid
  • Start date Start date
  • Tags Tags
    Proof Union
Click For Summary

Homework Help Overview

The discussion revolves around proving that the disjoint union of countable sets, indexed by positive integers, is countable. Participants are exploring the implications of the definition of disjoint union and how it relates to establishing a bijection with the natural numbers.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants are attempting to understand how to demonstrate the countability of the disjoint union by establishing a bijection from the natural numbers to the union. There is mention of using the definition of disjoint union and indexing elements according to their originating sets. Some participants suggest visualizing the elements in an infinite square array and considering diagonal movement as a potential approach.

Discussion Status

The discussion is ongoing, with participants sharing insights and prompting further exploration of the relationship between the disjoint union and known countable sets. There is a suggestion to draw parallels with the proof of the countability of rational numbers, indicating a productive direction in reasoning.

Contextual Notes

Participants are referencing the definition of disjoint union from external sources and are grappling with how to express their ideas within the constraints of the forum interface. There is an implicit understanding that the proof may involve adapting known results about countable sets.

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?
 

Similar threads

Replies
1
Views
2K
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K