Exploring the Countable Infinity of Disjoint Sets and their Cartesian Product

In summary, the conversation discusses how to prove that the Cartesian product of two countably infinite sets is also countably infinite. This can be done by defining a bijection between the natural numbers and the two sets, and then using a function to map the ordered pairs from the Cartesian product to the natural numbers. This function is also a bijection, proving that the Cartesian product is countable. It is important to note that the function must be defined as a function from N X N to A X B, not just N to A X B, in order for it to be surjective.
  • #1
zeebo17
41
0
Hi,

I was wondering if two sets are disjoint countably infinite sets why is their Cartesian product also countably infinite?

Thanks!
 
Physics news on Phys.org
  • #2
You can order your two sets a_1,a_2,a_3,... and b_1,b_2,b_3 mapping them onto the set of natural numbers.

Then, you can form a triangular mapping recursively (like you do to prove that the set of rational numbers is countably infinite)... so:
(a_1,b_1) maps to 1,
(a_1,b_2) maps to 2,
(a_2,b_1) maps to 3,
(a_1,b_3) maps to 4,
(a_2,b_2) maps to 5, etc. etc.
 
  • #3
Another way to think about the problem...

Since we have two countably infinite sets call them A , B we can define two bijections:

[tex]\alpha[/tex]: N [tex]\rightarrow[/tex] A and [tex]\varphi[/tex]: N [tex]\rightarrow[/tex] B.

We can then define another function [tex]\zeta[/tex]: N [tex]\rightarrow[/tex] A X B as [tex]\zeta[/tex](n) = ( [tex]\alpha[/tex](n) , [tex]\varphi[/tex](n) ).

[tex]\zeta[/tex] is a bijection since [tex]\alpha[/tex] and [tex]\varphi[/tex] are bijections and therefore A X B is countable.
 
  • #4
CharmedQuark, what you said isn't exactly correct, since your constructed function from N to AxB won't be surjective.
 
  • #5
Good point, in fact, it is very badly non surjective!

For example, if [itex]\alpha(2)= p[/itex] and [itex]\beta(2)= q[/itex], then [itex]\zeta(2)= (p, q)[/itex] but there is NO other [itex]\zeta(n)[/itex] giving a pair having p as its first member nor is there any other n so that [itex]\zeta(n)[/itex] is pair having q as its second member.
 
  • #6
HallsofIvy said:
Good point, in fact, it is very badly non surjective!

For example, if [itex]\alpha(2)= p[/itex] and [itex]\beta(2)= q[/itex], then [itex]\zeta(2)= (p, q)[/itex] but there is NO other [itex]\zeta(n)[/itex] giving a pair having p as its first member nor is there any other n so that [itex]\zeta(n)[/itex] is pair having q as its second member.

Yeah I wrote it last night and wasn't paying attention to what I was writing. The function should instead be a function from N X N [tex]\rightarrow[/tex] A X B. Other than that little error the principle is the same. [tex]\zeta[/tex]( n[tex]_{1}[/tex] , n[tex]_{2}[/tex] ) = ( [tex]\alpha[/tex]( n[tex]_{1}[/tex] ) , [tex]\varphi[/tex]( n[tex]_{2}[/tex] ) ). This function is a bijection and N X N is countable so any cartesian product of two countably infinite sets is countable.
 

What is a countably infinite set?

A countably infinite set is a set with an infinite number of elements that can be placed into a one-to-one correspondence with the natural numbers (1, 2, 3, ...). This means that all the elements of the set can be counted and listed in a systematic way.

How is a countably infinite set different from an uncountable set?

A countably infinite set can be counted and listed, while an uncountable set cannot. This means that there is no way to assign a unique natural number to each element of an uncountable set.

Can there be different sizes of countably infinite sets?

No, all countably infinite sets have the same size or cardinality. This means that any two countably infinite sets can be put into one-to-one correspondence with each other.

What are some examples of countably infinite sets?

The set of natural numbers (1, 2, 3, ...) and the set of even numbers (2, 4, 6, ...) are both countably infinite. Other examples include the set of integers and the set of rational numbers.

Why are countably infinite sets important in mathematics?

Countably infinite sets play a crucial role in understanding the concept of infinity and in many areas of mathematics, including analysis, topology, and number theory. They also have practical applications in computer science and physics.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
16
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
702
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
3K
  • Set Theory, Logic, Probability, Statistics
Replies
11
Views
2K
  • Set Theory, Logic, Probability, Statistics
2
Replies
35
Views
495
  • Set Theory, Logic, Probability, Statistics
Replies
8
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
2K
Replies
15
Views
1K
Back
Top