Prove that an infinite chain contains a chain isomorphic to N or to -N

  • Thread starter Thread starter mahler1
  • Start date Start date
  • Tags Tags
    Chain Infinite
mahler1
Messages
217
Reaction score
0
1. Homework Statement .
Prove that an infinite chain contains an a chain isomorphic (with the order) to N (the natural numbers) or to -N (negative integers).

3. The Attempt at a Solution .

I think I know how to solve the problem but I have problems to write a formal proof. I want to construct a numerable chain (call it Y) from the original one (call it X) in order to have a bijection that preserves the order.

I choose an arbitrary element x from X. As the set X is an infinite chain, then, then there must be infinite elements that are greater than x or x must be greater that infinite elements of X. If I'm in case 1, then I choose the first element x_1 such that x<x_1. I apply the same argument to x_1 and following the same step for for xn, I get a strictly increasing sequence of elements. I have the bijection I was looking for: {x_n} is stricly increasing, so x_i<x_j then i<j. If I'm in case 2, then there are infinite elements x' such that x'<x. I choose the first (first in terms of order) element x' such that x'<x. I call it x_1. I apply the same step for x_n in order to get a decreasing sequence {x_n}. If x_i<x_j, then i>j and -i<-j. The function from -N to {x_n} where f(i)=x_(-i) is a bijective function that preserves the order

Now, I don't know if my idea is correct or even comprehensible. In this case, I need help to write it formally, I feel that this is just the sketch of a proof but I have problems to justify all my steps and arguments.
 
Physics news on Phys.org
The argument of the proof looks fine to me. Indeed showing that there is a bijection between the sets you're constructing and the positive and negative natural numbers is the idea here (Isomorphisms must preserve).
 
  • Like
Likes 1 person
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