Show that (n+1)/(n-2) is Cauchy using the definition

Ozma

Junior Member
Joined
Oct 14, 2020
Messages
83
I have to show that the sequence {pn}\{p_n\} defined by pn=n+1n2p_n=\frac{n+1}{n-2} for n=3,4,n=3,4,\dots is a Cauchy sequence using the definition. I tried this:
pnpm=n+1n2m+1m2=3n+3m(n2)(m2)=3mn(n2)(m+2)..............edited[COLOR=rgb(0,0,0)]|p_n-p_m|=\left|\frac{n+1}{n-2}-\frac{m+1}{m -2}\right|=\left|\frac{-3n+3m}{(n-2)(m-2)}\right|=\frac{3|m-n|}{(n-2)(m+2)} ..............edited[COLOR=rgb(0, 0, 0)][/COLOR]
Assuming mnm\ge n, it is
3mn(n2)(m+2)=3(mn)(n2)(m2)=3m2+2n(n2)(m2)=3n23m2\frac{3|m-n|}{(n-2)(m+2)}=\frac{3(m-n)}{(n-2)(m-2)}=3\frac{m-2+2-n}{(n-2)(m-2)}=\frac{3}{n-2}-\frac{3}{m-2}Since 3m2<0-\frac{3}{m-2}<0 because m=3,4,m=3,4,\dots, it is
3n23m2<3n2\frac{3}{n-2}-\frac{3}{m-2}<\frac{3}{n-2}Since 3n20\frac{3}{n-2} \to 0 as nn \to \infty, for any ϵ>0\epsilon>0 there exists NNN\in\mathbb{N} such that n,mNn,m \ge N implies pnpm<ϵ|p_n-p_m|<\epsilon.

Is this correct? I am not sure about the assumption mnm \ge n and the inequalities I used.
 
Last edited by a moderator:
It looks good to me. I would have said that 3/(m-2)>0 instead of -3/(m-2)<0 but they are the same.
There is no problem saying that m≥n, since |pm -pn| = |pn-pm| anyways.
 
If (pn)L(p_n)\to L then (α>0)(NN+)[nNpnL<α(\forall \alpha>0)(\exists N\in \mathbb{N}^+)[n\ge N \Rightarrow \left|p_n-L\right|<\alpha. Definition of convergence
pnpmpnL+Lpm<α+α=2α\left|p_n-p_m\right|\le\left|p_n-L\right|+\left|L-p_m\right|<\alpha+\alpha=2\alpha


 
@Steven G Yes there was a typo, thanks for noticing it and thanks for the help! Thanks to the moderator who fixed it too.

@pka: Oh nice solution, thanks. I would have used a similar approach I believe (using the fact that a sequence that converges in a complete space is Cauchy) but I think that my lecturer wanted to make us practice with two indexes.
 
I used two indexes: n & mn~\&~m. I also left it for you to supply those details.
 
@pka: Let ϵ>0\epsilon>0. Since pnLp_n \to L, then there exists n1Nn_1 \in \mathbb{N} such that nn1    pnL<12ϵn \ge n_1 \implies |p_n-L|<\frac{1}{2}\epsilon; so, if n,mn1n,m \ge n_1 it is pnpm=pnL+LpmpnL+pmL<12ϵ+12ϵ=ϵ|p_n-p_m|=|p_n-L+L-p_m|\le|p_n-L|+|p_m-L|<\frac{1}{2}\epsilon+\frac{1}{2}\epsilon=\epsilon. You meant this details? Thanks for the suggestion.

About the two indexes, sorry, I meant: "working with two explicit sequences and make practice with quantities depending on two indexes".
 
I would not accept that proof as being complete as you are being secretive as to what the value of L is.
 
@Steven G: I don't completely get the reason why we should evaluate LL, the problem only asks to show that the sequence is a Cauchy sequence (I specified LRL\in\mathbb{R} because, otherwise, the proof would not work). In any case, it is L=1L=1, because since nn \to \infty I can assume n0n \ne 0 and so n+1n2=1+1n12n\frac{n+1}{n-2}=\frac{1+\frac{1}{n}}{1-\frac{2}{n}}.
 
@Steven G: I don't completely get the reason why we should evaluate L\bf\large L,
I agree. the sequence (pn)\left(p_n\right) is a sequence of real that converges to LL so what else would LL be if not real?

 
If you are going to bother to say that the sequences converges to L, then why not just say that the sequences converges to 1??
 
@Steven G: I was following the hint from pka, so I was coherent with its notation; I don't understand your point. I could even say that, since R\mathbb{R} is complete, every sequence of real numbers is convergent if and only if it is Cauchy and so, since it is easy to show that the limit of {pn}\{p_n\} is 11, solve the problem in this way. But this wasn't the aim of this exercise, as I said the definition of Cauchy sequence must be used and: firstly, the definition is given with a generic limit LL, secondly I don't see how saying explicitly what the limit of {pn}\{p_n\} is can be useful in proving it is Cauchy (if I am constrained to use only the abstract definition of Cauchy sequence).
 
Top