Proof Unbounded Sequence: Real Sequence |x_n|>1/n

[y_lindsay]

if the real sequence {x_n} satisfies that for every m>n, |x_n-x_m|>\frac{1}{n}, can we prove it's unbounded?

here is what i thought:
let's suppose the sequence is bounded, then there is its sub-sequence who converges to some real number L. now the problem is converted to this: can a sequence converge if for every m>n, |x_n-x_m|>\frac{1}{n}? i guess such sequence doesn't converge, yet i don't know how to put it in solid proof.
can anyone help?

 

[sutupidmath]

well such a sequence that |x_n-x_m|>\frac{1}{n}
does not converge, it is sufficient to take epsylon = 1/n
From the Cauchy theorem for the convergence of a sequence we have that:
A sequence (x_n) is a convergent sequence if and only if for every epsylon >0, there exists some number N(epsylon)>0 such that for every two numbers n,m>N we have
|x_n-x_m|<e, let e=epsylon,
now if we take m>n, or n>m, whichever we want, we get a more convinient theorem, or whatever, for the convergence of a sequence. it goes like this
A sequence (a_n) converges if and only if for every e>o there exists some N(e)>0 such that for every n>N, and for every p from naturals the following is fullfilled:
|x_(_n+_p)-x_n|<e,
here we basically have only taken m=n+p, or we could take n=m+p.
Now the reason why a sequence of the form |x_n-x_m|>\frac{1}{n}
cannot converge is that according to cauchy's theoreme a convergent sequence should fulfill these requirements for any e, and also for e=\frac{1}{n}. But since in you case it does not hold for e=1/n , consequently the sequence does not converge. Because from this notation |x_n-x_m|>\frac{1}{n} we can read that we indeed cannot choose the terms of this sequence (x_n) to be arbitrarly close to one another, in other words we cannot make them as close as we want. This in particular is somehow the contrary(negation) of a cauchy sequence(of what cauchy theorem states) so the sequence diverges, and hence is not bounded.
i hope i was clear enough.

 

[y_lindsay]

thanks, sutupidmath.
but there is a question about the Cauchy's theorem for convergence. as you've mentioned, N(e) is determined by an arbitrary e>0, which we take here e=1/n, so N(e)+1 need not to be necessarily smaller than 1/e=n.
thus the fact |x_{N(e)+p+1}-x_{N(e)+1}|>\frac{1}{N(e)+1} does not necessariy contradicts the fact |x_{N(e)+p+1}-x_{N(e)+1}|<e, since it's possible that \frac{1}{N(e)+1}<e=\frac{1}{n}.
so I still can't prove anything.
can you tell me where I've got wrong? thanks.

 

[sutupidmath]

thanks, sutupidmath.
but there is a question about the Cauchy's theorem for convergence. as you've mentioned, N(e) is determined by an arbitrary e>0, which we take here e=1/n, so N(e)+1 need not to be necessarily smaller than 1/e=n.
thus the fact |x_{N(e)+p+1}-x_{N(e)+1}|>\frac{1}{N(e)+1} does not necessariy contradicts the fact |x_{N(e)+p+1}-x_{N(e)+1}|<e, since it's possible that \frac{1}{N(e)+1}<e=\frac{1}{n}.
so I still can't prove anything.
can you tell me where I've got wrong? thanks.

well, i don't actually know if i am getting you right, but this last part
\frac{1}{N(e)+1}<e=\frac{1}{n} defenitely cannot hold, and the reason is this, because the very first requirment is that n be rigorously greater than N(e).It is true that N(e)+1, need not necessarly be smaller than n=1/e, but it cannot defenitely be greater than it.
Look at the definition of cauchy's sequence:
A sequence converges if and only if for every e>o there exists some N(e)>0 such that for every n>N(e), and for every p from naturals the following is fullfilled:
|x_(_n+_p)-x_n|< e. So, from here n can only be equal or greater than N(e)+1, hence:\frac{1}{N(e)+1}>=e=\frac{1}{n}. Now you might as well say, what if we take N(e)+100, than will this be true: :\frac{1}{N(e)+100}<e=\frac{1}{n}?? I again argue that this cannot hold, since it should hold for all values of n greater than N(e), so it must also hold for let's say n=N(e)+200 which is not true. I do not know if i am gettin you right. But if the answer to this problem is really crucial to you, i mean if you really need it for an exam or something that plays an importan role, wait until somebody else who has more experience and knowledge here comments on this.

P.S. This is how i would go about this.

 

[birulami]

Now the reason why a sequence of the form |x_n-x_m|>\frac{1}{n}
cannot converge is that according to cauchy's theoreme a convergent sequence should fulfill these requirements for any e, and also for e=\frac{1}{n}. But since in you case it does not hold for e=1/n

In such a proof of a contradiction of the Cauchy theorem, you are free to chose any e you want, i.e. your choice of 1/n is valid one. But now you have to show also that for all N, in particular very large ones, there is a pair k, l>N such that |x_k-x_l|>1/n. But for large N the condition on the sequence |x_k-x_l|>1/k is too weak to beat 1/n.

 

[birulami]

Here is my sketch of a proof. I leave out some technical details which (I think) I have correctly on paper, but they are too tedious to type in here.

First we define the intervals u_n:=[x_n, x_n+1/n) and d_n:=(x_n-1/n, x_n] where the round brackets denote an open side of an interval, and u and d stand for up-interval and down-interval.

The techical bit left out is to show that each up-interval intersects at most with one down-interval as well as the other way around, independent of the order of the n and m indices involved (of course n\neq m).

Now we want to show that despite some possible overlap of the intervals, their union is not bounded. To do so, we construct a sequence of values v_i the sum of which is no larger than the "area" covered by the intervals. And we will see that this sum does not converge.

We start by initializing all v_i with zero. For each i we perform the following for l_i\in\{d_i, u_i\}, i.e. we iterate over the two intervals indexed with i:

• If l_i does not overlap with any interval, add 1/i to v_i.
• If l_i overlaps with a smaller l_k, i.e. i<k then add 1/(2i) to both, v_i and v_k. Note that we distributed no more than the size of the interval to the two v. See below that we don't distribute anything from the overlapping partner to not overrepresent the union of the two intervals. Together they may cover much more "area", but they certainly cover not less then 1/i.
• If l_i overlaps only with a larger other interval, leave v_i alone. We know that it got already a value assigned that is greater than 1/(2i).

Now we have a sequence v_i bounded from below by 1/(2i) and the sum of the sequence is certainly smaller than the "area" covered by the union of all up- and down-intervals. But the sum is 1/2\sum_{i=1}^{\infty} 1/i which is not bounded.

Consequently the union of the up- and down-intervals is not bounded. I consider it another technicality to show that this suffices for x_i to be unbounded.

Harald.

 

[sutupidmath]

In such a proof of a contradiction of the Cauchy theorem, you are free to chose any e you want, i.e. your choice of 1/n is valid one. But now you have to show also that for all N, in particular very large ones, there is a pair k, l>N such that |x_k-x_l|>1/n. But for large N the condition on the sequence |x_k-x_l|>1/k is too weak to beat 1/n.

Can't that pair be n+p, and n, where p is from naturals?

 

[sutupidmath]

Here is my sketch of a proof. I leave out some technical details which (I think) I have correctly on paper, but they are too tedious to type in here.

First we define the intervals u_n:=[x_n, x_n+1/n) and d_n:=(x_n-1/n, x_n] where the round brackets denote an open side of an interval, and u and d stand for up-interval and down-interval.

The techical bit left out is to show that each up-interval intersects at most with one down-interval as well as the other way around, independent of the order of the n and m indices involved (of course n\neq m).

Now we want to show that despite some possible overlap of the intervals, their union is not bounded. To do so, we construct a sequence of values v_i the sum of which is no larger than the "area" covered by the intervals. And we will see that this sum does not converge.

We start by initializing all v_i with zero. For each i we perform the following for l_i\in\{d_i, u_i\}, i.e. we iterate over the two intervals indexed with i:

• If l_i does not overlap with any interval, add 1/i to v_i.
• If l_i overlaps with a smaller l_k, i.e. i<k then add 1/(2i) to both, v_i and v_k. Note that we distributed no more than the size of the interval to the two v. See below that we don't distribute anything from the overlapping partner to not overrepresent the union of the two intervals. Together they may cover much more "area", but they certainly cover not less then 1/i.
• If l_i overlaps only with a larger other interval, leave v_i alone. We know that it got already a value assigned that is greater than 1/(2i).

Now we have a sequence v_i bounded from below by 1/(2i) and the sum of the sequence is certainly smaller than the "area" covered by the union of all up- and down-intervals. But the sum is 1/2\sum_{i=1}^{\infty} 1/i which is not bounded.

Consequently the union of the up- and down-intervals is not bounded. I consider it another technicality to show that this suffices for x_i to be unbounded.

Harald.

Does this proof include a little bit of topology (or sth that is done in real analysis) or i just got a wrong impression?

P.S. I am going to have a close look at this, because i just skipped it and did not quite understand it. (my ignorance what can i do!).