Does an increasing sequence of reals converge if the difference of consecutive terms approaches zero? [duplicate]

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP












31












$begingroup$



This question already has an answer here:



  • Example to the statement that $a_n+1 - a_n rightarrow 0$ as $n rightarrow infty$ does not imply that sequence $a_n$ converges.

    1 answer




If $a_n$ is a sequence such that
$$a_1 leq a_2 leq a_3 leq dotsb$$
and has the property that $a_n+1-a_n to 0$, then can we conclude that $a_n$ is convergent?




I know that without the condition that the sequence is increasing, this is not true, as we could consider the sequence given in this answer to a similar question that does not require the sequence to be increasing.



$$0, 1, frac12, 0, frac13, frac23, 1, frac34, frac12, frac14, 0, frac15, frac25, frac35, frac45, 1, dotsc$$



This oscillates between $0$ and $1$, while the difference of consecutive terms approaches $0$ since the difference is always of the form $pmfrac1m$ and $m$ increases the further we go in this sequence.



So how can we use the condition that $a_n$ is increasing to show that $a_n$ must converge? Or is this still not sufficient?










share|cite|improve this question











$endgroup$



marked as duplicate by stressed out, Xander Henderson, Lord Shark the Unknown, Cesareo, mrtaurho Feb 26 at 8:42


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.













  • 6




    $begingroup$
    Note that while your sequence goes up and down periodically, you could define another sequence with the same step length for each $n$ but with all steps positive. That would be a counterexample to your question.
    $endgroup$
    – Adayah
    Feb 17 at 18:26






  • 15




    $begingroup$
    Have you tried logarithms?
    $endgroup$
    – Mehrdad
    Feb 18 at 6:14






  • 5




    $begingroup$
    Note that by writing $b_1=a_1, b_2=a_2-a_1, b_3=a_3-a_2,...$ the question becomes equivalent to asking whether a positive series with a summation term tending to zero must converge.
    $endgroup$
    – Bar Alon
    Feb 18 at 12:44











  • $begingroup$
    The harmonic series should answer this question for you
    $endgroup$
    – MPW
    Feb 19 at 21:56






  • 1




    $begingroup$
    No it converges iff the difference of consecutive terms forms a summable series, which is stronger than just converging to zero.
    $endgroup$
    – Shalop
    Feb 20 at 2:29
















31












$begingroup$



This question already has an answer here:



  • Example to the statement that $a_n+1 - a_n rightarrow 0$ as $n rightarrow infty$ does not imply that sequence $a_n$ converges.

    1 answer




If $a_n$ is a sequence such that
$$a_1 leq a_2 leq a_3 leq dotsb$$
and has the property that $a_n+1-a_n to 0$, then can we conclude that $a_n$ is convergent?




I know that without the condition that the sequence is increasing, this is not true, as we could consider the sequence given in this answer to a similar question that does not require the sequence to be increasing.



$$0, 1, frac12, 0, frac13, frac23, 1, frac34, frac12, frac14, 0, frac15, frac25, frac35, frac45, 1, dotsc$$



This oscillates between $0$ and $1$, while the difference of consecutive terms approaches $0$ since the difference is always of the form $pmfrac1m$ and $m$ increases the further we go in this sequence.



So how can we use the condition that $a_n$ is increasing to show that $a_n$ must converge? Or is this still not sufficient?










share|cite|improve this question











$endgroup$



marked as duplicate by stressed out, Xander Henderson, Lord Shark the Unknown, Cesareo, mrtaurho Feb 26 at 8:42


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.













  • 6




    $begingroup$
    Note that while your sequence goes up and down periodically, you could define another sequence with the same step length for each $n$ but with all steps positive. That would be a counterexample to your question.
    $endgroup$
    – Adayah
    Feb 17 at 18:26






  • 15




    $begingroup$
    Have you tried logarithms?
    $endgroup$
    – Mehrdad
    Feb 18 at 6:14






  • 5




    $begingroup$
    Note that by writing $b_1=a_1, b_2=a_2-a_1, b_3=a_3-a_2,...$ the question becomes equivalent to asking whether a positive series with a summation term tending to zero must converge.
    $endgroup$
    – Bar Alon
    Feb 18 at 12:44











  • $begingroup$
    The harmonic series should answer this question for you
    $endgroup$
    – MPW
    Feb 19 at 21:56






  • 1




    $begingroup$
    No it converges iff the difference of consecutive terms forms a summable series, which is stronger than just converging to zero.
    $endgroup$
    – Shalop
    Feb 20 at 2:29














31












31








31


7



$begingroup$



This question already has an answer here:



  • Example to the statement that $a_n+1 - a_n rightarrow 0$ as $n rightarrow infty$ does not imply that sequence $a_n$ converges.

    1 answer




If $a_n$ is a sequence such that
$$a_1 leq a_2 leq a_3 leq dotsb$$
and has the property that $a_n+1-a_n to 0$, then can we conclude that $a_n$ is convergent?




I know that without the condition that the sequence is increasing, this is not true, as we could consider the sequence given in this answer to a similar question that does not require the sequence to be increasing.



$$0, 1, frac12, 0, frac13, frac23, 1, frac34, frac12, frac14, 0, frac15, frac25, frac35, frac45, 1, dotsc$$



This oscillates between $0$ and $1$, while the difference of consecutive terms approaches $0$ since the difference is always of the form $pmfrac1m$ and $m$ increases the further we go in this sequence.



So how can we use the condition that $a_n$ is increasing to show that $a_n$ must converge? Or is this still not sufficient?










share|cite|improve this question











$endgroup$





This question already has an answer here:



  • Example to the statement that $a_n+1 - a_n rightarrow 0$ as $n rightarrow infty$ does not imply that sequence $a_n$ converges.

    1 answer




If $a_n$ is a sequence such that
$$a_1 leq a_2 leq a_3 leq dotsb$$
and has the property that $a_n+1-a_n to 0$, then can we conclude that $a_n$ is convergent?




I know that without the condition that the sequence is increasing, this is not true, as we could consider the sequence given in this answer to a similar question that does not require the sequence to be increasing.



$$0, 1, frac12, 0, frac13, frac23, 1, frac34, frac12, frac14, 0, frac15, frac25, frac35, frac45, 1, dotsc$$



This oscillates between $0$ and $1$, while the difference of consecutive terms approaches $0$ since the difference is always of the form $pmfrac1m$ and $m$ increases the further we go in this sequence.



So how can we use the condition that $a_n$ is increasing to show that $a_n$ must converge? Or is this still not sufficient?





This question already has an answer here:



  • Example to the statement that $a_n+1 - a_n rightarrow 0$ as $n rightarrow infty$ does not imply that sequence $a_n$ converges.

    1 answer







real-analysis sequences-and-series convergence






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 25 at 21:19









Xander Henderson

14.9k103555




14.9k103555










asked Feb 17 at 16:23









M DM D

32329




32329




marked as duplicate by stressed out, Xander Henderson, Lord Shark the Unknown, Cesareo, mrtaurho Feb 26 at 8:42


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.









marked as duplicate by stressed out, Xander Henderson, Lord Shark the Unknown, Cesareo, mrtaurho Feb 26 at 8:42


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.









  • 6




    $begingroup$
    Note that while your sequence goes up and down periodically, you could define another sequence with the same step length for each $n$ but with all steps positive. That would be a counterexample to your question.
    $endgroup$
    – Adayah
    Feb 17 at 18:26






  • 15




    $begingroup$
    Have you tried logarithms?
    $endgroup$
    – Mehrdad
    Feb 18 at 6:14






  • 5




    $begingroup$
    Note that by writing $b_1=a_1, b_2=a_2-a_1, b_3=a_3-a_2,...$ the question becomes equivalent to asking whether a positive series with a summation term tending to zero must converge.
    $endgroup$
    – Bar Alon
    Feb 18 at 12:44











  • $begingroup$
    The harmonic series should answer this question for you
    $endgroup$
    – MPW
    Feb 19 at 21:56






  • 1




    $begingroup$
    No it converges iff the difference of consecutive terms forms a summable series, which is stronger than just converging to zero.
    $endgroup$
    – Shalop
    Feb 20 at 2:29













  • 6




    $begingroup$
    Note that while your sequence goes up and down periodically, you could define another sequence with the same step length for each $n$ but with all steps positive. That would be a counterexample to your question.
    $endgroup$
    – Adayah
    Feb 17 at 18:26






  • 15




    $begingroup$
    Have you tried logarithms?
    $endgroup$
    – Mehrdad
    Feb 18 at 6:14






  • 5




    $begingroup$
    Note that by writing $b_1=a_1, b_2=a_2-a_1, b_3=a_3-a_2,...$ the question becomes equivalent to asking whether a positive series with a summation term tending to zero must converge.
    $endgroup$
    – Bar Alon
    Feb 18 at 12:44











  • $begingroup$
    The harmonic series should answer this question for you
    $endgroup$
    – MPW
    Feb 19 at 21:56






  • 1




    $begingroup$
    No it converges iff the difference of consecutive terms forms a summable series, which is stronger than just converging to zero.
    $endgroup$
    – Shalop
    Feb 20 at 2:29








6




6




$begingroup$
Note that while your sequence goes up and down periodically, you could define another sequence with the same step length for each $n$ but with all steps positive. That would be a counterexample to your question.
$endgroup$
– Adayah
Feb 17 at 18:26




$begingroup$
Note that while your sequence goes up and down periodically, you could define another sequence with the same step length for each $n$ but with all steps positive. That would be a counterexample to your question.
$endgroup$
– Adayah
Feb 17 at 18:26




15




15




$begingroup$
Have you tried logarithms?
$endgroup$
– Mehrdad
Feb 18 at 6:14




$begingroup$
Have you tried logarithms?
$endgroup$
– Mehrdad
Feb 18 at 6:14




5




5




$begingroup$
Note that by writing $b_1=a_1, b_2=a_2-a_1, b_3=a_3-a_2,...$ the question becomes equivalent to asking whether a positive series with a summation term tending to zero must converge.
$endgroup$
– Bar Alon
Feb 18 at 12:44





$begingroup$
Note that by writing $b_1=a_1, b_2=a_2-a_1, b_3=a_3-a_2,...$ the question becomes equivalent to asking whether a positive series with a summation term tending to zero must converge.
$endgroup$
– Bar Alon
Feb 18 at 12:44













$begingroup$
The harmonic series should answer this question for you
$endgroup$
– MPW
Feb 19 at 21:56




$begingroup$
The harmonic series should answer this question for you
$endgroup$
– MPW
Feb 19 at 21:56




1




1




$begingroup$
No it converges iff the difference of consecutive terms forms a summable series, which is stronger than just converging to zero.
$endgroup$
– Shalop
Feb 20 at 2:29





$begingroup$
No it converges iff the difference of consecutive terms forms a summable series, which is stronger than just converging to zero.
$endgroup$
– Shalop
Feb 20 at 2:29











7 Answers
7






active

oldest

votes


















78












$begingroup$

No. Just consider the case in which $a_n=1+frac12+frac13+cdots+frac1n$. Note that then we would have$$lim_ntoinftya_n+1-a_n=lim_ntoinftyfrac1n+1=0.$$






share|cite|improve this answer











$endgroup$








  • 8




    $begingroup$
    Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
    $endgroup$
    – M D
    Feb 17 at 16:49






  • 5




    $begingroup$
    @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
    $endgroup$
    – Robert Z
    Feb 17 at 16:49







  • 5




    $begingroup$
    I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
    $endgroup$
    – Ister
    Feb 18 at 7:05










  • $begingroup$
    @Ister I've edited my answer. Thank you.
    $endgroup$
    – José Carlos Santos
    Feb 18 at 7:09






  • 2




    $begingroup$
    @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
    $endgroup$
    – Theo Bendit
    Feb 18 at 22:39


















111












$begingroup$

An easy way to visualize why this can't be true is to try putting some points on a number line.



Start with 1 point in [0, 1):



number line showing single point at 0



2 points in [1, 2):



number line showing points at 0, 1, 1.5



And so on:



number line showing points at 0, 1, 1.5, 2, 2.33, 2.67, 3, 3.25, ...



Now you have a sequence that grows to infinity but keeps getting closer together.






share|cite|improve this answer









$endgroup$








  • 22




    $begingroup$
    +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
    $endgroup$
    – Theo Bendit
    Feb 18 at 0:21







  • 7




    $begingroup$
    This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
    $endgroup$
    – gota
    Feb 18 at 12:33






  • 8




    $begingroup$
    Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
    $endgroup$
    – tomasz
    Feb 18 at 12:41






  • 5




    $begingroup$
    The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
    $endgroup$
    – Marc van Leeuwen
    Feb 18 at 14:07










  • $begingroup$
    @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
    $endgroup$
    – Owen
    Feb 18 at 22:49


















31












$begingroup$

Any increasing sequence $a_n_ngeq 1$ has limit in $mathbbRcup+infty$. It is $sup_ngeq 1 a_n$. Such $sup$ or supremum can be a finite number or $+infty$ (even if we know that $a_n+1-a_nto 0$).



An example with a finite limit is $a_n=1-1/nto 1$ and $a_n+1-a_n=frac1n(n+1)to 0$.



On the other hand $a_n=sqrtnto +infty$ and $a_n+1-a_n=sqrtn+1-sqrtn=frac1sqrtn+1+sqrtnto 0$.



So, the answer is NO, the condition $a_n+1-a_nto 0$ is not sufficient for an increasing sequence $a_n_ngeq 1$ to have a FINITE limit.






share|cite|improve this answer











$endgroup$




















    12












    $begingroup$

    Another counterexample is $a_n=ln n$, for $ngeq1$. The difference of successive terms is $ln(n+1)-ln n = ln (1+1/n) rightarrow ln 1 = 0$, as $n rightarrow infty$, yet $ln n$ itself tends to infinity, as $n$ tends to infinity.






    share|cite|improve this answer









    $endgroup$








    • 1




      $begingroup$
      Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
      $endgroup$
      – Roman Odaisky
      Feb 18 at 20:43



















    3












    $begingroup$

    No. Consider the sequence $a_n_n=1^infty$ given by




    • $a_n = sumlimits_k=1^n frac1k$.

    It follows that



    • $a_n > a_n-1$


    • $a_n - a_n-1 = frac1n rightarrow 0$ as $n rightarrow infty$, but


    • $a_n = sumlimits_k=1^n frac1k rightarrow infty$ as $n rightarrow infty$ (by, e.g., integral test).





    share|cite|improve this answer









    $endgroup$




















      2












      $begingroup$

      The condition $a_n+1-a_n to 0$ is not sufficient, as José Carlos Santos pointed out. But, a necessary and sufficient condition, that doesn't require the series to be increasing, is that $limlimits_ntoinfty(a_n+m(n)-a_n)=0$ for all $m(n)in mathbbN$, where $m$ is a function of $n$. Sequences which satisfy this property are called Cauchy sequences.



      Also, if you show that a sequence is monotonically increasing and bounded from above, then it converges. The same applies for monotonically decreasing sequences which are bounded from below.






      share|cite|improve this answer











      $endgroup$








      • 2




        $begingroup$
        Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
        $endgroup$
        – Nate Eldredge
        Feb 17 at 17:05











      • $begingroup$
        @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
        $endgroup$
        – Haris Gusic
        Feb 17 at 17:09










      • $begingroup$
        Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
        $endgroup$
        – Nate Eldredge
        Feb 17 at 17:22










      • $begingroup$
        @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
        $endgroup$
        – Haris Gusic
        Feb 17 at 17:25










      • $begingroup$
        I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
        $endgroup$
        – supercat
        Feb 18 at 19:27



















      2












      $begingroup$

      Note that if we define $b_n=a_n+1-a_n$, then $a_n=a_0+sum_n=0^inftyb_n$. So this question is equivalent to asking whether the terms of an infinite series going to zero is sufficient for the series to converge. There are a variety of examples of series with terms that go to zero, yet do not converge, with the harmonic series ($sum frac 1 n$) being one of the most famous.



      And in fact we can construct a counterexample from any sequence by defining a sequence $c_n$ by simply re-indexing the terms. We set $c_0$ equal to $a_0$. Then set $c_k1$ equal to $a_1$, where $k_1>a_1-a_0$, and fill in the terms $c_1$ to $c_k-1$ with equally spaced terms; this will result in all of the consecutive differences from $c_0$ to $c_k1$ being less than $1$. Then set $c_k2$ equal to $a_2$, where $k_2+k_1>2(a_2-a_1)$, which results in consecutive differences between $c_k1$ to $c_k2$ being less than $frac 1 2$. Just keep re-indexing each term and filling in more and more new terms, and you can drive the consecutive differences arbitrarily low.



      Another approach is to look at a sequence as an approximation of a continuous function, and the difference between successive terms as an approximation of the derivative. Then we just need a function such that $f'(x)$ converges to zero, but $f$ diverges. Two examples of such are the log function, (which gives a sequence very similar to the harmonic sequence) and square root. Note that both of these examples can be obtained by taking the inverse of a function whose derivative is constantly increasing. If $g'$ goes to infinity, then $(g^-1)'$ goes to zero. But if the domain of $g$ is the whole real line, then the range of $g^-1$ is the whole real line, i.e. $g^-1$ goes to infinity.






      share|cite|improve this answer









      $endgroup$



















        7 Answers
        7






        active

        oldest

        votes








        7 Answers
        7






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        78












        $begingroup$

        No. Just consider the case in which $a_n=1+frac12+frac13+cdots+frac1n$. Note that then we would have$$lim_ntoinftya_n+1-a_n=lim_ntoinftyfrac1n+1=0.$$






        share|cite|improve this answer











        $endgroup$








        • 8




          $begingroup$
          Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
          $endgroup$
          – M D
          Feb 17 at 16:49






        • 5




          $begingroup$
          @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
          $endgroup$
          – Robert Z
          Feb 17 at 16:49







        • 5




          $begingroup$
          I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
          $endgroup$
          – Ister
          Feb 18 at 7:05










        • $begingroup$
          @Ister I've edited my answer. Thank you.
          $endgroup$
          – José Carlos Santos
          Feb 18 at 7:09






        • 2




          $begingroup$
          @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
          $endgroup$
          – Theo Bendit
          Feb 18 at 22:39















        78












        $begingroup$

        No. Just consider the case in which $a_n=1+frac12+frac13+cdots+frac1n$. Note that then we would have$$lim_ntoinftya_n+1-a_n=lim_ntoinftyfrac1n+1=0.$$






        share|cite|improve this answer











        $endgroup$








        • 8




          $begingroup$
          Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
          $endgroup$
          – M D
          Feb 17 at 16:49






        • 5




          $begingroup$
          @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
          $endgroup$
          – Robert Z
          Feb 17 at 16:49







        • 5




          $begingroup$
          I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
          $endgroup$
          – Ister
          Feb 18 at 7:05










        • $begingroup$
          @Ister I've edited my answer. Thank you.
          $endgroup$
          – José Carlos Santos
          Feb 18 at 7:09






        • 2




          $begingroup$
          @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
          $endgroup$
          – Theo Bendit
          Feb 18 at 22:39













        78












        78








        78





        $begingroup$

        No. Just consider the case in which $a_n=1+frac12+frac13+cdots+frac1n$. Note that then we would have$$lim_ntoinftya_n+1-a_n=lim_ntoinftyfrac1n+1=0.$$






        share|cite|improve this answer











        $endgroup$



        No. Just consider the case in which $a_n=1+frac12+frac13+cdots+frac1n$. Note that then we would have$$lim_ntoinftya_n+1-a_n=lim_ntoinftyfrac1n+1=0.$$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Feb 18 at 7:09

























        answered Feb 17 at 16:29









        José Carlos SantosJosé Carlos Santos

        167k22132235




        167k22132235







        • 8




          $begingroup$
          Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
          $endgroup$
          – M D
          Feb 17 at 16:49






        • 5




          $begingroup$
          @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
          $endgroup$
          – Robert Z
          Feb 17 at 16:49







        • 5




          $begingroup$
          I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
          $endgroup$
          – Ister
          Feb 18 at 7:05










        • $begingroup$
          @Ister I've edited my answer. Thank you.
          $endgroup$
          – José Carlos Santos
          Feb 18 at 7:09






        • 2




          $begingroup$
          @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
          $endgroup$
          – Theo Bendit
          Feb 18 at 22:39












        • 8




          $begingroup$
          Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
          $endgroup$
          – M D
          Feb 17 at 16:49






        • 5




          $begingroup$
          @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
          $endgroup$
          – Robert Z
          Feb 17 at 16:49







        • 5




          $begingroup$
          I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
          $endgroup$
          – Ister
          Feb 18 at 7:05










        • $begingroup$
          @Ister I've edited my answer. Thank you.
          $endgroup$
          – José Carlos Santos
          Feb 18 at 7:09






        • 2




          $begingroup$
          @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
          $endgroup$
          – Theo Bendit
          Feb 18 at 22:39







        8




        8




        $begingroup$
        Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
        $endgroup$
        – M D
        Feb 17 at 16:49




        $begingroup$
        Rhys: His sequence is $1, frac32, frac116, frac2512,...$. Essentially the sequence of partial sums associated with the harmonic series. This is still a sequence, not a series, since it is a finite sum.
        $endgroup$
        – M D
        Feb 17 at 16:49




        5




        5




        $begingroup$
        @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
        $endgroup$
        – Robert Z
        Feb 17 at 16:49





        $begingroup$
        @RhysHughes $a_n=1+frac12+cdots+frac1n$ IS increasing and $a_n+1-a_n=frac1n+1to 0$.
        $endgroup$
        – Robert Z
        Feb 17 at 16:49





        5




        5




        $begingroup$
        I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
        $endgroup$
        – Ister
        Feb 18 at 7:05




        $begingroup$
        I think adding an explanation from comments into the answer is worth considering and would benefit to the quality of an answer.
        $endgroup$
        – Ister
        Feb 18 at 7:05












        $begingroup$
        @Ister I've edited my answer. Thank you.
        $endgroup$
        – José Carlos Santos
        Feb 18 at 7:09




        $begingroup$
        @Ister I've edited my answer. Thank you.
        $endgroup$
        – José Carlos Santos
        Feb 18 at 7:09




        2




        2




        $begingroup$
        @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
        $endgroup$
        – Theo Bendit
        Feb 18 at 22:39




        $begingroup$
        @wizzwizz4 No, because $a_n neq frac1n$. Instead, $a_n = 1 + frac12 + ldots + frac1n$. So, $$a_n+1 - a_n = left(1 + frac12 + ldots + frac1n + frac1n+1right) - left(1 + frac12 + ldots + frac1nright) = frac1n+1.$$
        $endgroup$
        – Theo Bendit
        Feb 18 at 22:39











        111












        $begingroup$

        An easy way to visualize why this can't be true is to try putting some points on a number line.



        Start with 1 point in [0, 1):



        number line showing single point at 0



        2 points in [1, 2):



        number line showing points at 0, 1, 1.5



        And so on:



        number line showing points at 0, 1, 1.5, 2, 2.33, 2.67, 3, 3.25, ...



        Now you have a sequence that grows to infinity but keeps getting closer together.






        share|cite|improve this answer









        $endgroup$








        • 22




          $begingroup$
          +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
          $endgroup$
          – Theo Bendit
          Feb 18 at 0:21







        • 7




          $begingroup$
          This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
          $endgroup$
          – gota
          Feb 18 at 12:33






        • 8




          $begingroup$
          Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
          $endgroup$
          – tomasz
          Feb 18 at 12:41






        • 5




          $begingroup$
          The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
          $endgroup$
          – Marc van Leeuwen
          Feb 18 at 14:07










        • $begingroup$
          @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
          $endgroup$
          – Owen
          Feb 18 at 22:49















        111












        $begingroup$

        An easy way to visualize why this can't be true is to try putting some points on a number line.



        Start with 1 point in [0, 1):



        number line showing single point at 0



        2 points in [1, 2):



        number line showing points at 0, 1, 1.5



        And so on:



        number line showing points at 0, 1, 1.5, 2, 2.33, 2.67, 3, 3.25, ...



        Now you have a sequence that grows to infinity but keeps getting closer together.






        share|cite|improve this answer









        $endgroup$








        • 22




          $begingroup$
          +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
          $endgroup$
          – Theo Bendit
          Feb 18 at 0:21







        • 7




          $begingroup$
          This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
          $endgroup$
          – gota
          Feb 18 at 12:33






        • 8




          $begingroup$
          Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
          $endgroup$
          – tomasz
          Feb 18 at 12:41






        • 5




          $begingroup$
          The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
          $endgroup$
          – Marc van Leeuwen
          Feb 18 at 14:07










        • $begingroup$
          @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
          $endgroup$
          – Owen
          Feb 18 at 22:49













        111












        111








        111





        $begingroup$

        An easy way to visualize why this can't be true is to try putting some points on a number line.



        Start with 1 point in [0, 1):



        number line showing single point at 0



        2 points in [1, 2):



        number line showing points at 0, 1, 1.5



        And so on:



        number line showing points at 0, 1, 1.5, 2, 2.33, 2.67, 3, 3.25, ...



        Now you have a sequence that grows to infinity but keeps getting closer together.






        share|cite|improve this answer









        $endgroup$



        An easy way to visualize why this can't be true is to try putting some points on a number line.



        Start with 1 point in [0, 1):



        number line showing single point at 0



        2 points in [1, 2):



        number line showing points at 0, 1, 1.5



        And so on:



        number line showing points at 0, 1, 1.5, 2, 2.33, 2.67, 3, 3.25, ...



        Now you have a sequence that grows to infinity but keeps getting closer together.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Feb 17 at 22:36









        OwenOwen

        1,1241610




        1,1241610







        • 22




          $begingroup$
          +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
          $endgroup$
          – Theo Bendit
          Feb 18 at 0:21







        • 7




          $begingroup$
          This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
          $endgroup$
          – gota
          Feb 18 at 12:33






        • 8




          $begingroup$
          Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
          $endgroup$
          – tomasz
          Feb 18 at 12:41






        • 5




          $begingroup$
          The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
          $endgroup$
          – Marc van Leeuwen
          Feb 18 at 14:07










        • $begingroup$
          @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
          $endgroup$
          – Owen
          Feb 18 at 22:49












        • 22




          $begingroup$
          +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
          $endgroup$
          – Theo Bendit
          Feb 18 at 0:21







        • 7




          $begingroup$
          This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
          $endgroup$
          – gota
          Feb 18 at 12:33






        • 8




          $begingroup$
          Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
          $endgroup$
          – tomasz
          Feb 18 at 12:41






        • 5




          $begingroup$
          The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
          $endgroup$
          – Marc van Leeuwen
          Feb 18 at 14:07










        • $begingroup$
          @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
          $endgroup$
          – Owen
          Feb 18 at 22:49







        22




        22




        $begingroup$
        +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
        $endgroup$
        – Theo Bendit
        Feb 18 at 0:21





        $begingroup$
        +1 I'm definitely going to steal that. That's a lovely example, easily understandable even by people who don't know the harmonic series diverges.
        $endgroup$
        – Theo Bendit
        Feb 18 at 0:21





        7




        7




        $begingroup$
        This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
        $endgroup$
        – gota
        Feb 18 at 12:33




        $begingroup$
        This should be the accepted answer as it's counterexample's divergence is obvious whereas the harmonic series divergence (though famous) is not
        $endgroup$
        – gota
        Feb 18 at 12:33




        8




        8




        $begingroup$
        Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
        $endgroup$
        – tomasz
        Feb 18 at 12:41




        $begingroup$
        Note that this is (approximately) the same as the sequence $a_n=sqrtn$.
        $endgroup$
        – tomasz
        Feb 18 at 12:41




        5




        5




        $begingroup$
        The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
        $endgroup$
        – Marc van Leeuwen
        Feb 18 at 14:07




        $begingroup$
        The one small point to note, though admittedly pretty obvious, is that after inserting all those infinitely many points, each point has only a finite number of points to its left, and therefore a finite index (position) in the overall sequence.
        $endgroup$
        – Marc van Leeuwen
        Feb 18 at 14:07












        $begingroup$
        @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
        $endgroup$
        – Owen
        Feb 18 at 22:49




        $begingroup$
        @MarcvanLeeuwen That's a great point. If you think of this as building a set, then you do need to show that each point is preceded by finitely many for it to be a sequence. But if you see it as a recursive definition of a sequence (imagine how you'd write this in code), it follows automatically that each point has an index.
        $endgroup$
        – Owen
        Feb 18 at 22:49











        31












        $begingroup$

        Any increasing sequence $a_n_ngeq 1$ has limit in $mathbbRcup+infty$. It is $sup_ngeq 1 a_n$. Such $sup$ or supremum can be a finite number or $+infty$ (even if we know that $a_n+1-a_nto 0$).



        An example with a finite limit is $a_n=1-1/nto 1$ and $a_n+1-a_n=frac1n(n+1)to 0$.



        On the other hand $a_n=sqrtnto +infty$ and $a_n+1-a_n=sqrtn+1-sqrtn=frac1sqrtn+1+sqrtnto 0$.



        So, the answer is NO, the condition $a_n+1-a_nto 0$ is not sufficient for an increasing sequence $a_n_ngeq 1$ to have a FINITE limit.






        share|cite|improve this answer











        $endgroup$

















          31












          $begingroup$

          Any increasing sequence $a_n_ngeq 1$ has limit in $mathbbRcup+infty$. It is $sup_ngeq 1 a_n$. Such $sup$ or supremum can be a finite number or $+infty$ (even if we know that $a_n+1-a_nto 0$).



          An example with a finite limit is $a_n=1-1/nto 1$ and $a_n+1-a_n=frac1n(n+1)to 0$.



          On the other hand $a_n=sqrtnto +infty$ and $a_n+1-a_n=sqrtn+1-sqrtn=frac1sqrtn+1+sqrtnto 0$.



          So, the answer is NO, the condition $a_n+1-a_nto 0$ is not sufficient for an increasing sequence $a_n_ngeq 1$ to have a FINITE limit.






          share|cite|improve this answer











          $endgroup$















            31












            31








            31





            $begingroup$

            Any increasing sequence $a_n_ngeq 1$ has limit in $mathbbRcup+infty$. It is $sup_ngeq 1 a_n$. Such $sup$ or supremum can be a finite number or $+infty$ (even if we know that $a_n+1-a_nto 0$).



            An example with a finite limit is $a_n=1-1/nto 1$ and $a_n+1-a_n=frac1n(n+1)to 0$.



            On the other hand $a_n=sqrtnto +infty$ and $a_n+1-a_n=sqrtn+1-sqrtn=frac1sqrtn+1+sqrtnto 0$.



            So, the answer is NO, the condition $a_n+1-a_nto 0$ is not sufficient for an increasing sequence $a_n_ngeq 1$ to have a FINITE limit.






            share|cite|improve this answer











            $endgroup$



            Any increasing sequence $a_n_ngeq 1$ has limit in $mathbbRcup+infty$. It is $sup_ngeq 1 a_n$. Such $sup$ or supremum can be a finite number or $+infty$ (even if we know that $a_n+1-a_nto 0$).



            An example with a finite limit is $a_n=1-1/nto 1$ and $a_n+1-a_n=frac1n(n+1)to 0$.



            On the other hand $a_n=sqrtnto +infty$ and $a_n+1-a_n=sqrtn+1-sqrtn=frac1sqrtn+1+sqrtnto 0$.



            So, the answer is NO, the condition $a_n+1-a_nto 0$ is not sufficient for an increasing sequence $a_n_ngeq 1$ to have a FINITE limit.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Feb 18 at 5:18

























            answered Feb 17 at 16:27









            Robert ZRobert Z

            100k1069141




            100k1069141





















                12












                $begingroup$

                Another counterexample is $a_n=ln n$, for $ngeq1$. The difference of successive terms is $ln(n+1)-ln n = ln (1+1/n) rightarrow ln 1 = 0$, as $n rightarrow infty$, yet $ln n$ itself tends to infinity, as $n$ tends to infinity.






                share|cite|improve this answer









                $endgroup$








                • 1




                  $begingroup$
                  Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
                  $endgroup$
                  – Roman Odaisky
                  Feb 18 at 20:43
















                12












                $begingroup$

                Another counterexample is $a_n=ln n$, for $ngeq1$. The difference of successive terms is $ln(n+1)-ln n = ln (1+1/n) rightarrow ln 1 = 0$, as $n rightarrow infty$, yet $ln n$ itself tends to infinity, as $n$ tends to infinity.






                share|cite|improve this answer









                $endgroup$








                • 1




                  $begingroup$
                  Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
                  $endgroup$
                  – Roman Odaisky
                  Feb 18 at 20:43














                12












                12








                12





                $begingroup$

                Another counterexample is $a_n=ln n$, for $ngeq1$. The difference of successive terms is $ln(n+1)-ln n = ln (1+1/n) rightarrow ln 1 = 0$, as $n rightarrow infty$, yet $ln n$ itself tends to infinity, as $n$ tends to infinity.






                share|cite|improve this answer









                $endgroup$



                Another counterexample is $a_n=ln n$, for $ngeq1$. The difference of successive terms is $ln(n+1)-ln n = ln (1+1/n) rightarrow ln 1 = 0$, as $n rightarrow infty$, yet $ln n$ itself tends to infinity, as $n$ tends to infinity.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Feb 18 at 8:15









                SimonSimon

                773513




                773513







                • 1




                  $begingroup$
                  Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
                  $endgroup$
                  – Roman Odaisky
                  Feb 18 at 20:43













                • 1




                  $begingroup$
                  Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
                  $endgroup$
                  – Roman Odaisky
                  Feb 18 at 20:43








                1




                1




                $begingroup$
                Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
                $endgroup$
                – Roman Odaisky
                Feb 18 at 20:43





                $begingroup$
                Which is, in a way, the same counterexample, because $sum_k=1^nfrac1k = ln n + gamma + mathcal Oleft(frac1nright)$.
                $endgroup$
                – Roman Odaisky
                Feb 18 at 20:43












                3












                $begingroup$

                No. Consider the sequence $a_n_n=1^infty$ given by




                • $a_n = sumlimits_k=1^n frac1k$.

                It follows that



                • $a_n > a_n-1$


                • $a_n - a_n-1 = frac1n rightarrow 0$ as $n rightarrow infty$, but


                • $a_n = sumlimits_k=1^n frac1k rightarrow infty$ as $n rightarrow infty$ (by, e.g., integral test).





                share|cite|improve this answer









                $endgroup$

















                  3












                  $begingroup$

                  No. Consider the sequence $a_n_n=1^infty$ given by




                  • $a_n = sumlimits_k=1^n frac1k$.

                  It follows that



                  • $a_n > a_n-1$


                  • $a_n - a_n-1 = frac1n rightarrow 0$ as $n rightarrow infty$, but


                  • $a_n = sumlimits_k=1^n frac1k rightarrow infty$ as $n rightarrow infty$ (by, e.g., integral test).





                  share|cite|improve this answer









                  $endgroup$















                    3












                    3








                    3





                    $begingroup$

                    No. Consider the sequence $a_n_n=1^infty$ given by




                    • $a_n = sumlimits_k=1^n frac1k$.

                    It follows that



                    • $a_n > a_n-1$


                    • $a_n - a_n-1 = frac1n rightarrow 0$ as $n rightarrow infty$, but


                    • $a_n = sumlimits_k=1^n frac1k rightarrow infty$ as $n rightarrow infty$ (by, e.g., integral test).





                    share|cite|improve this answer









                    $endgroup$



                    No. Consider the sequence $a_n_n=1^infty$ given by




                    • $a_n = sumlimits_k=1^n frac1k$.

                    It follows that



                    • $a_n > a_n-1$


                    • $a_n - a_n-1 = frac1n rightarrow 0$ as $n rightarrow infty$, but


                    • $a_n = sumlimits_k=1^n frac1k rightarrow infty$ as $n rightarrow infty$ (by, e.g., integral test).






                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Feb 18 at 3:15









                    24thAlchemist24thAlchemist

                    312




                    312





















                        2












                        $begingroup$

                        The condition $a_n+1-a_n to 0$ is not sufficient, as José Carlos Santos pointed out. But, a necessary and sufficient condition, that doesn't require the series to be increasing, is that $limlimits_ntoinfty(a_n+m(n)-a_n)=0$ for all $m(n)in mathbbN$, where $m$ is a function of $n$. Sequences which satisfy this property are called Cauchy sequences.



                        Also, if you show that a sequence is monotonically increasing and bounded from above, then it converges. The same applies for monotonically decreasing sequences which are bounded from below.






                        share|cite|improve this answer











                        $endgroup$








                        • 2




                          $begingroup$
                          Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:05











                        • $begingroup$
                          @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:09










                        • $begingroup$
                          Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:22










                        • $begingroup$
                          @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:25










                        • $begingroup$
                          I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
                          $endgroup$
                          – supercat
                          Feb 18 at 19:27
















                        2












                        $begingroup$

                        The condition $a_n+1-a_n to 0$ is not sufficient, as José Carlos Santos pointed out. But, a necessary and sufficient condition, that doesn't require the series to be increasing, is that $limlimits_ntoinfty(a_n+m(n)-a_n)=0$ for all $m(n)in mathbbN$, where $m$ is a function of $n$. Sequences which satisfy this property are called Cauchy sequences.



                        Also, if you show that a sequence is monotonically increasing and bounded from above, then it converges. The same applies for monotonically decreasing sequences which are bounded from below.






                        share|cite|improve this answer











                        $endgroup$








                        • 2




                          $begingroup$
                          Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:05











                        • $begingroup$
                          @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:09










                        • $begingroup$
                          Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:22










                        • $begingroup$
                          @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:25










                        • $begingroup$
                          I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
                          $endgroup$
                          – supercat
                          Feb 18 at 19:27














                        2












                        2








                        2





                        $begingroup$

                        The condition $a_n+1-a_n to 0$ is not sufficient, as José Carlos Santos pointed out. But, a necessary and sufficient condition, that doesn't require the series to be increasing, is that $limlimits_ntoinfty(a_n+m(n)-a_n)=0$ for all $m(n)in mathbbN$, where $m$ is a function of $n$. Sequences which satisfy this property are called Cauchy sequences.



                        Also, if you show that a sequence is monotonically increasing and bounded from above, then it converges. The same applies for monotonically decreasing sequences which are bounded from below.






                        share|cite|improve this answer











                        $endgroup$



                        The condition $a_n+1-a_n to 0$ is not sufficient, as José Carlos Santos pointed out. But, a necessary and sufficient condition, that doesn't require the series to be increasing, is that $limlimits_ntoinfty(a_n+m(n)-a_n)=0$ for all $m(n)in mathbbN$, where $m$ is a function of $n$. Sequences which satisfy this property are called Cauchy sequences.



                        Also, if you show that a sequence is monotonically increasing and bounded from above, then it converges. The same applies for monotonically decreasing sequences which are bounded from below.







                        share|cite|improve this answer














                        share|cite|improve this answer



                        share|cite|improve this answer








                        edited Feb 17 at 17:12

























                        answered Feb 17 at 16:46









                        Haris GusicHaris Gusic

                        2,710423




                        2,710423







                        • 2




                          $begingroup$
                          Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:05











                        • $begingroup$
                          @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:09










                        • $begingroup$
                          Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:22










                        • $begingroup$
                          @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:25










                        • $begingroup$
                          I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
                          $endgroup$
                          – supercat
                          Feb 18 at 19:27













                        • 2




                          $begingroup$
                          Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:05











                        • $begingroup$
                          @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:09










                        • $begingroup$
                          Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
                          $endgroup$
                          – Nate Eldredge
                          Feb 17 at 17:22










                        • $begingroup$
                          @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
                          $endgroup$
                          – Haris Gusic
                          Feb 17 at 17:25










                        • $begingroup$
                          I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
                          $endgroup$
                          – supercat
                          Feb 18 at 19:27








                        2




                        2




                        $begingroup$
                        Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
                        $endgroup$
                        – Nate Eldredge
                        Feb 17 at 17:05





                        $begingroup$
                        Your stated condition $lim_n to infty (a_n+m-a_n) = 0$ for each $m$ is not equivalent to the Cauchy property, and it does not imply that the sequence $a_n$ converges. Consider $a_n = log n$. I think what you would want is that $lim_n to infty (a_n+m-a_n) = 0$ uniformly in $m$.
                        $endgroup$
                        – Nate Eldredge
                        Feb 17 at 17:05













                        $begingroup$
                        @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
                        $endgroup$
                        – Haris Gusic
                        Feb 17 at 17:09




                        $begingroup$
                        @NateEldredge But if we take $m=n$, then the condition is not satisfied, is it?
                        $endgroup$
                        – Haris Gusic
                        Feb 17 at 17:09












                        $begingroup$
                        Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
                        $endgroup$
                        – Nate Eldredge
                        Feb 17 at 17:22




                        $begingroup$
                        Okay, the revised condition (where $m$ is a function of $n$) is correct, though it seems awkward to work with in practice.
                        $endgroup$
                        – Nate Eldredge
                        Feb 17 at 17:22












                        $begingroup$
                        @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
                        $endgroup$
                        – Haris Gusic
                        Feb 17 at 17:25




                        $begingroup$
                        @NateEldredge I formulated it that way because I am more familiar with it. Sorry about any confusion I might have caused.
                        $endgroup$
                        – Haris Gusic
                        Feb 17 at 17:25












                        $begingroup$
                        I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
                        $endgroup$
                        – supercat
                        Feb 18 at 19:27





                        $begingroup$
                        I think another way of looking at things would be to say that for any specified positive epsilon, there will be some value of n such that for all i > n, |a[i]-a[n]| will be less than epsilon. Would that be correct?
                        $endgroup$
                        – supercat
                        Feb 18 at 19:27












                        2












                        $begingroup$

                        Note that if we define $b_n=a_n+1-a_n$, then $a_n=a_0+sum_n=0^inftyb_n$. So this question is equivalent to asking whether the terms of an infinite series going to zero is sufficient for the series to converge. There are a variety of examples of series with terms that go to zero, yet do not converge, with the harmonic series ($sum frac 1 n$) being one of the most famous.



                        And in fact we can construct a counterexample from any sequence by defining a sequence $c_n$ by simply re-indexing the terms. We set $c_0$ equal to $a_0$. Then set $c_k1$ equal to $a_1$, where $k_1>a_1-a_0$, and fill in the terms $c_1$ to $c_k-1$ with equally spaced terms; this will result in all of the consecutive differences from $c_0$ to $c_k1$ being less than $1$. Then set $c_k2$ equal to $a_2$, where $k_2+k_1>2(a_2-a_1)$, which results in consecutive differences between $c_k1$ to $c_k2$ being less than $frac 1 2$. Just keep re-indexing each term and filling in more and more new terms, and you can drive the consecutive differences arbitrarily low.



                        Another approach is to look at a sequence as an approximation of a continuous function, and the difference between successive terms as an approximation of the derivative. Then we just need a function such that $f'(x)$ converges to zero, but $f$ diverges. Two examples of such are the log function, (which gives a sequence very similar to the harmonic sequence) and square root. Note that both of these examples can be obtained by taking the inverse of a function whose derivative is constantly increasing. If $g'$ goes to infinity, then $(g^-1)'$ goes to zero. But if the domain of $g$ is the whole real line, then the range of $g^-1$ is the whole real line, i.e. $g^-1$ goes to infinity.






                        share|cite|improve this answer









                        $endgroup$

















                          2












                          $begingroup$

                          Note that if we define $b_n=a_n+1-a_n$, then $a_n=a_0+sum_n=0^inftyb_n$. So this question is equivalent to asking whether the terms of an infinite series going to zero is sufficient for the series to converge. There are a variety of examples of series with terms that go to zero, yet do not converge, with the harmonic series ($sum frac 1 n$) being one of the most famous.



                          And in fact we can construct a counterexample from any sequence by defining a sequence $c_n$ by simply re-indexing the terms. We set $c_0$ equal to $a_0$. Then set $c_k1$ equal to $a_1$, where $k_1>a_1-a_0$, and fill in the terms $c_1$ to $c_k-1$ with equally spaced terms; this will result in all of the consecutive differences from $c_0$ to $c_k1$ being less than $1$. Then set $c_k2$ equal to $a_2$, where $k_2+k_1>2(a_2-a_1)$, which results in consecutive differences between $c_k1$ to $c_k2$ being less than $frac 1 2$. Just keep re-indexing each term and filling in more and more new terms, and you can drive the consecutive differences arbitrarily low.



                          Another approach is to look at a sequence as an approximation of a continuous function, and the difference between successive terms as an approximation of the derivative. Then we just need a function such that $f'(x)$ converges to zero, but $f$ diverges. Two examples of such are the log function, (which gives a sequence very similar to the harmonic sequence) and square root. Note that both of these examples can be obtained by taking the inverse of a function whose derivative is constantly increasing. If $g'$ goes to infinity, then $(g^-1)'$ goes to zero. But if the domain of $g$ is the whole real line, then the range of $g^-1$ is the whole real line, i.e. $g^-1$ goes to infinity.






                          share|cite|improve this answer









                          $endgroup$















                            2












                            2








                            2





                            $begingroup$

                            Note that if we define $b_n=a_n+1-a_n$, then $a_n=a_0+sum_n=0^inftyb_n$. So this question is equivalent to asking whether the terms of an infinite series going to zero is sufficient for the series to converge. There are a variety of examples of series with terms that go to zero, yet do not converge, with the harmonic series ($sum frac 1 n$) being one of the most famous.



                            And in fact we can construct a counterexample from any sequence by defining a sequence $c_n$ by simply re-indexing the terms. We set $c_0$ equal to $a_0$. Then set $c_k1$ equal to $a_1$, where $k_1>a_1-a_0$, and fill in the terms $c_1$ to $c_k-1$ with equally spaced terms; this will result in all of the consecutive differences from $c_0$ to $c_k1$ being less than $1$. Then set $c_k2$ equal to $a_2$, where $k_2+k_1>2(a_2-a_1)$, which results in consecutive differences between $c_k1$ to $c_k2$ being less than $frac 1 2$. Just keep re-indexing each term and filling in more and more new terms, and you can drive the consecutive differences arbitrarily low.



                            Another approach is to look at a sequence as an approximation of a continuous function, and the difference between successive terms as an approximation of the derivative. Then we just need a function such that $f'(x)$ converges to zero, but $f$ diverges. Two examples of such are the log function, (which gives a sequence very similar to the harmonic sequence) and square root. Note that both of these examples can be obtained by taking the inverse of a function whose derivative is constantly increasing. If $g'$ goes to infinity, then $(g^-1)'$ goes to zero. But if the domain of $g$ is the whole real line, then the range of $g^-1$ is the whole real line, i.e. $g^-1$ goes to infinity.






                            share|cite|improve this answer









                            $endgroup$



                            Note that if we define $b_n=a_n+1-a_n$, then $a_n=a_0+sum_n=0^inftyb_n$. So this question is equivalent to asking whether the terms of an infinite series going to zero is sufficient for the series to converge. There are a variety of examples of series with terms that go to zero, yet do not converge, with the harmonic series ($sum frac 1 n$) being one of the most famous.



                            And in fact we can construct a counterexample from any sequence by defining a sequence $c_n$ by simply re-indexing the terms. We set $c_0$ equal to $a_0$. Then set $c_k1$ equal to $a_1$, where $k_1>a_1-a_0$, and fill in the terms $c_1$ to $c_k-1$ with equally spaced terms; this will result in all of the consecutive differences from $c_0$ to $c_k1$ being less than $1$. Then set $c_k2$ equal to $a_2$, where $k_2+k_1>2(a_2-a_1)$, which results in consecutive differences between $c_k1$ to $c_k2$ being less than $frac 1 2$. Just keep re-indexing each term and filling in more and more new terms, and you can drive the consecutive differences arbitrarily low.



                            Another approach is to look at a sequence as an approximation of a continuous function, and the difference between successive terms as an approximation of the derivative. Then we just need a function such that $f'(x)$ converges to zero, but $f$ diverges. Two examples of such are the log function, (which gives a sequence very similar to the harmonic sequence) and square root. Note that both of these examples can be obtained by taking the inverse of a function whose derivative is constantly increasing. If $g'$ goes to infinity, then $(g^-1)'$ goes to zero. But if the domain of $g$ is the whole real line, then the range of $g^-1$ is the whole real line, i.e. $g^-1$ goes to infinity.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Feb 19 at 16:26









                            AcccumulationAcccumulation

                            7,1252619




                            7,1252619












                                Popular posts from this blog

                                How to check contact read email or not when send email to Individual?

                                Bahrain

                                Postfix configuration issue with fips on centos 7; mailgun relay