Register to reply 
Prove N X N is countable and provide a bijective function 
Share this thread: 
#1
Apr311, 11:03 PM

P: 17

1. The problem statement, all variables and given/known data
Prove that N X N is denumerable and provide a bijective function (also prove that the function is bijective) 2. Relevant equations Cantor's Diagonalization argument 3. The attempt at a solution My teacher provided a full solution, but it is in coming up with the function which is where I get stumped. He provides this algorithm: For (a,b) proceeding (c,d) in the list, we list (a,b) following this algorithm i) Either a + b < c + d ii) or if a + b = c + d, a < c note if a + b = c + d, and a = c, then b = d. He goes on to list the pairs following the algorithm: (1,1); (1,2),(2,1); (1,3),(2,2),(3,1); ... (1,a+b  2),(2,a+b3),...,(a+b2,1); (1,a+b1),(2,a+b2),...(a1,b+1),(a,b); Then if k is the step belonging to where the pair is in the list (with k belonging to N), then k = 1 + 2 + 3 + ... + a + b  2 + a = (a + b  2)(a + b  1)/2 + a I get that induction is used in the last point, and we are summing all the pairs. The only thing I don't understand is how we know that a + b  2 is always the number of terms in the "group" of numbers following the "group" containing (a,b). I can see when I plug in some arbitrary a,b, that yes, it does end up that way. But I want it to be a bit more rigorous than that. Any insights? Thanks! 


#2
Apr411, 12:18 AM

Sci Advisor
P: 3,245

The set preceding those that sum to a+b are the (x,y) such that x+y = a + b 1. For a sum of N, there are N1 ordered pairs of numbers with that sum since the first number can be any of 1,2...N1. So the number of (x,y) pairs is (a+b1)1 = a + b 2. 


#3
Apr411, 12:35 AM

P: 17

Sorry for the confusing wording, I meant preceding. That makes more sense, but I am still not sure why there is the condition that x + y = a + b  1. For the set of paired numbers before the set containing (a,b), there are a + b  2 members. For the set containing (a,b), there are a members, since it stops at that pair. So why wouldn't it be a + b  3? Making k = 1 + 2 + ... + a + b  3 + a ?
Also, how do we know that it goes (1,1) (1,2)(2,1) ... (1,a + b  2).. ? Meaning, is it just observation that b would be a + b  2 in the set of numbers preceding the set containing (a,b)? Thanks for your help 


#4
Apr411, 12:51 AM

P: 17

Prove N X N is countable and provide a bijective function
Actually I get what you mean, and that would work with the conditions of the algorithm as well. But how do we know that the set preceding the set which has the pairs satisfying a + b contain the pair (a,b)?
Ps. This is a great way to practice talking about this stuff correctly (or at least trying to). Thanks for the practice! 


#5
Apr411, 12:59 AM

Sci Advisor
P: 3,245

(1,1) (those that sum to 2) (1,2)(2,1) (those that sum to 3) .... (1,a+b2)(2,a+b3)(3,a+b4)....(a+b2,1) (those that sum to a+b1) (1,a+b1)(2,a+b2)...(a,b) (some of those that sum to a+b) 


#6
Apr411, 11:16 AM

P: 17

Okay that makes sense. Thanks for your help.



Register to reply 
Related Discussions  
Prove set S is countable iff there exists a surjective/injective function  Set Theory, Logic, Probability, Statistics  2  
Figuring out if a 3d function is bijective  Calculus & Beyond Homework  0  
Prove a map of a space onto itself is bijective  Set Theory, Logic, Probability, Statistics  7  
Bijective function  Calculus & Beyond Homework  2  
Bijective function  Set Theory, Logic, Probability, Statistics  1 