Showing a sequence is decreasing and bounded

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











up vote
3
down vote

favorite












I need to show that the sequence given by
$$a_1=2$$
$$a_n=frac12Bigg(a_n-1+frac2a_n-1Bigg)$$
is monotonically decreasing and bounded. But every time I try, I can't make the bounds tight enough to prove it. How would I solve this?






real-analysis sequences-and-series recursion







share|cite|improve this question









New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.



















  • iirc it alternates between being above the limit and below the limit
    – mathworker21
    1 hour ago










  • The lower bound is easy to find by AM-GM inequality. The monotonicity is determined by directly compute $a_n+1-a_n$.
    – xbh
    1 hour ago














up vote
3
down vote

favorite












I need to show that the sequence given by
$$a_1=2$$
$$a_n=frac12Bigg(a_n-1+frac2a_n-1Bigg)$$
is monotonically decreasing and bounded. But every time I try, I can't make the bounds tight enough to prove it. How would I solve this?






real-analysis sequences-and-series recursion







share|cite|improve this question









New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.



















  • iirc it alternates between being above the limit and below the limit
    – mathworker21
    1 hour ago










  • The lower bound is easy to find by AM-GM inequality. The monotonicity is determined by directly compute $a_n+1-a_n$.
    – xbh
    1 hour ago












up vote
3
down vote

favorite









up vote
3
down vote

favorite











I need to show that the sequence given by
$$a_1=2$$
$$a_n=frac12Bigg(a_n-1+frac2a_n-1Bigg)$$
is monotonically decreasing and bounded. But every time I try, I can't make the bounds tight enough to prove it. How would I solve this?






real-analysis sequences-and-series recursion







share|cite|improve this question









New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











I need to show that the sequence given by
$$a_1=2$$
$$a_n=frac12Bigg(a_n-1+frac2a_n-1Bigg)$$
is monotonically decreasing and bounded. But every time I try, I can't make the bounds tight enough to prove it. How would I solve this?






real-analysis sequences-and-series recursion




real-analysis sequences-and-series recursion






share|cite|improve this question









New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 1 hour ago









Chinnapparaj R

2,325520




2,325520






New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 1 hour ago









arow257

161




161




New contributor




arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






arow257 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











  • iirc it alternates between being above the limit and below the limit
    – mathworker21
    1 hour ago










  • The lower bound is easy to find by AM-GM inequality. The monotonicity is determined by directly compute $a_n+1-a_n$.
    – xbh
    1 hour ago
















  • iirc it alternates between being above the limit and below the limit
    – mathworker21
    1 hour ago










  • The lower bound is easy to find by AM-GM inequality. The monotonicity is determined by directly compute $a_n+1-a_n$.
    – xbh
    1 hour ago















iirc it alternates between being above the limit and below the limit
– mathworker21
1 hour ago




iirc it alternates between being above the limit and below the limit
– mathworker21
1 hour ago












The lower bound is easy to find by AM-GM inequality. The monotonicity is determined by directly compute $a_n+1-a_n$.
– xbh
1 hour ago




The lower bound is easy to find by AM-GM inequality. The monotonicity is determined by directly compute $a_n+1-a_n$.
– xbh
1 hour ago










3 Answers
3






active

oldest

votes

















up vote
2
down vote













The limit is $sqrt2$. In fact, the convergence is quite fast, about doubling the number of digits each iteration:
$$a_n-sqrt2=frac12a_n-1left(a_n-1-sqrt2right)^2$$






share|cite|improve this answer



























    up vote
    2
    down vote













    Here $a_n$ satisfies the quadratic equation $$a_n^2-(2a_n+1)a_n+2=0$$ This equation has a real root and hence the discriminant $$4(a_n+1^2-2) geq 0$$ That is, $$a_n+1^2 geq 2$$ for $n geq 1$.



    Now,
    $a_n-a_n+1=a_n-frac12Bigg( a_n+frac2a_n Bigg)=frac12Bigg(fraca_n^2-2a_n Bigg)geq 0$



    for all $n geq 1$.



    Hence $$a_n+1 leq a_n, forall n geq 2$$



    and so by MCT it converges to its glb!






    share|cite|improve this answer





























      up vote
      1
      down vote













      $a_n+1-a_n=frac12left(a_n+frac2a_nright)-a_n=-frac12left (a_n-frac2a_nright) =-frac12left(fraca_n^2-2a_nright)le0$, as $a_1=2$.
      Hence $(a_n)$ is monotonically decreasing.



      The limit $a$, if it exists, satisfies $$a=frac12left(a+frac2aright)implies 2a^2=a^2+2implies a^2=2$$.



      Now we can easily see that $a_nge0$ (it is the average of two positive numbers).



      Hence $a_ntosqrt2$.






      share|cite|improve this answer






















        Your Answer




        StackExchange.ifUsing("editor", function ()
        return StackExchange.using("mathjaxEditing", function ()
        StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
        StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
        );
        );
        , "mathjax-editing");

        StackExchange.ready(function()
        var channelOptions =
        tags: "".split(" "),
        id: "69"
        ;
        initTagRenderer("".split(" "), "".split(" "), channelOptions);

        StackExchange.using("externalEditor", function()
        // Have to fire editor after snippets, if snippets enabled
        if (StackExchange.settings.snippets.snippetsEnabled)
        StackExchange.using("snippets", function()
        createEditor();
        );

        else
        createEditor();

        );

        function createEditor()
        StackExchange.prepareEditor(
        heartbeatType: 'answer',
        convertImagesToLinks: true,
        noModals: false,
        showLowRepImageUploadWarning: true,
        reputationToPostImages: 10,
        bindNavPrevention: true,
        postfix: "",
        noCode: true, onDemand: true,
        discardSelector: ".discard-answer"
        ,immediatelyShowMarkdownHelp:true
        );



        );






        arow257 is a new contributor. Be nice, and check out our Code of Conduct.









         

        draft saved


        draft discarded


















        StackExchange.ready(
        function ()
        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2938915%2fshowing-a-sequence-is-decreasing-and-bounded%23new-answer', 'question_page');

        );

        Post as a guest

















        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes








        up vote
        2
        down vote













        The limit is $sqrt2$. In fact, the convergence is quite fast, about doubling the number of digits each iteration:
        $$a_n-sqrt2=frac12a_n-1left(a_n-1-sqrt2right)^2$$






        share|cite|improve this answer
























          up vote
          2
          down vote













          The limit is $sqrt2$. In fact, the convergence is quite fast, about doubling the number of digits each iteration:
          $$a_n-sqrt2=frac12a_n-1left(a_n-1-sqrt2right)^2$$






          share|cite|improve this answer






















            up vote
            2
            down vote










            up vote
            2
            down vote









            The limit is $sqrt2$. In fact, the convergence is quite fast, about doubling the number of digits each iteration:
            $$a_n-sqrt2=frac12a_n-1left(a_n-1-sqrt2right)^2$$






            share|cite|improve this answer












            The limit is $sqrt2$. In fact, the convergence is quite fast, about doubling the number of digits each iteration:
            $$a_n-sqrt2=frac12a_n-1left(a_n-1-sqrt2right)^2$$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 1 hour ago









            robjohn♦

            259k26299616




            259k26299616




















                up vote
                2
                down vote













                Here $a_n$ satisfies the quadratic equation $$a_n^2-(2a_n+1)a_n+2=0$$ This equation has a real root and hence the discriminant $$4(a_n+1^2-2) geq 0$$ That is, $$a_n+1^2 geq 2$$ for $n geq 1$.



                Now,
                $a_n-a_n+1=a_n-frac12Bigg( a_n+frac2a_n Bigg)=frac12Bigg(fraca_n^2-2a_n Bigg)geq 0$



                for all $n geq 1$.



                Hence $$a_n+1 leq a_n, forall n geq 2$$



                and so by MCT it converges to its glb!






                share|cite|improve this answer


























                  up vote
                  2
                  down vote













                  Here $a_n$ satisfies the quadratic equation $$a_n^2-(2a_n+1)a_n+2=0$$ This equation has a real root and hence the discriminant $$4(a_n+1^2-2) geq 0$$ That is, $$a_n+1^2 geq 2$$ for $n geq 1$.



                  Now,
                  $a_n-a_n+1=a_n-frac12Bigg( a_n+frac2a_n Bigg)=frac12Bigg(fraca_n^2-2a_n Bigg)geq 0$



                  for all $n geq 1$.



                  Hence $$a_n+1 leq a_n, forall n geq 2$$



                  and so by MCT it converges to its glb!






                  share|cite|improve this answer
























                    up vote
                    2
                    down vote










                    up vote
                    2
                    down vote









                    Here $a_n$ satisfies the quadratic equation $$a_n^2-(2a_n+1)a_n+2=0$$ This equation has a real root and hence the discriminant $$4(a_n+1^2-2) geq 0$$ That is, $$a_n+1^2 geq 2$$ for $n geq 1$.



                    Now,
                    $a_n-a_n+1=a_n-frac12Bigg( a_n+frac2a_n Bigg)=frac12Bigg(fraca_n^2-2a_n Bigg)geq 0$



                    for all $n geq 1$.



                    Hence $$a_n+1 leq a_n, forall n geq 2$$



                    and so by MCT it converges to its glb!






                    share|cite|improve this answer














                    Here $a_n$ satisfies the quadratic equation $$a_n^2-(2a_n+1)a_n+2=0$$ This equation has a real root and hence the discriminant $$4(a_n+1^2-2) geq 0$$ That is, $$a_n+1^2 geq 2$$ for $n geq 1$.



                    Now,
                    $a_n-a_n+1=a_n-frac12Bigg( a_n+frac2a_n Bigg)=frac12Bigg(fraca_n^2-2a_n Bigg)geq 0$



                    for all $n geq 1$.



                    Hence $$a_n+1 leq a_n, forall n geq 2$$



                    and so by MCT it converges to its glb!







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    edited 1 hour ago

























                    answered 1 hour ago









                    Chinnapparaj R

                    2,325520




                    2,325520




















                        up vote
                        1
                        down vote













                        $a_n+1-a_n=frac12left(a_n+frac2a_nright)-a_n=-frac12left (a_n-frac2a_nright) =-frac12left(fraca_n^2-2a_nright)le0$, as $a_1=2$.
                        Hence $(a_n)$ is monotonically decreasing.



                        The limit $a$, if it exists, satisfies $$a=frac12left(a+frac2aright)implies 2a^2=a^2+2implies a^2=2$$.



                        Now we can easily see that $a_nge0$ (it is the average of two positive numbers).



                        Hence $a_ntosqrt2$.






                        share|cite|improve this answer


























                          up vote
                          1
                          down vote













                          $a_n+1-a_n=frac12left(a_n+frac2a_nright)-a_n=-frac12left (a_n-frac2a_nright) =-frac12left(fraca_n^2-2a_nright)le0$, as $a_1=2$.
                          Hence $(a_n)$ is monotonically decreasing.



                          The limit $a$, if it exists, satisfies $$a=frac12left(a+frac2aright)implies 2a^2=a^2+2implies a^2=2$$.



                          Now we can easily see that $a_nge0$ (it is the average of two positive numbers).



                          Hence $a_ntosqrt2$.






                          share|cite|improve this answer
























                            up vote
                            1
                            down vote










                            up vote
                            1
                            down vote









                            $a_n+1-a_n=frac12left(a_n+frac2a_nright)-a_n=-frac12left (a_n-frac2a_nright) =-frac12left(fraca_n^2-2a_nright)le0$, as $a_1=2$.
                            Hence $(a_n)$ is monotonically decreasing.



                            The limit $a$, if it exists, satisfies $$a=frac12left(a+frac2aright)implies 2a^2=a^2+2implies a^2=2$$.



                            Now we can easily see that $a_nge0$ (it is the average of two positive numbers).



                            Hence $a_ntosqrt2$.






                            share|cite|improve this answer














                            $a_n+1-a_n=frac12left(a_n+frac2a_nright)-a_n=-frac12left (a_n-frac2a_nright) =-frac12left(fraca_n^2-2a_nright)le0$, as $a_1=2$.
                            Hence $(a_n)$ is monotonically decreasing.



                            The limit $a$, if it exists, satisfies $$a=frac12left(a+frac2aright)implies 2a^2=a^2+2implies a^2=2$$.



                            Now we can easily see that $a_nge0$ (it is the average of two positive numbers).



                            Hence $a_ntosqrt2$.







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited 8 mins ago

























                            answered 1 hour ago









                            Chris Custer

                            7,3272623




                            7,3272623




















                                arow257 is a new contributor. Be nice, and check out our Code of Conduct.









                                 

                                draft saved


                                draft discarded


















                                arow257 is a new contributor. Be nice, and check out our Code of Conduct.












                                arow257 is a new contributor. Be nice, and check out our Code of Conduct.











                                arow257 is a new contributor. Be nice, and check out our Code of Conduct.













                                 


                                draft saved


                                draft discarded














                                StackExchange.ready(
                                function ()
                                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2938915%2fshowing-a-sequence-is-decreasing-and-bounded%23new-answer', 'question_page');

                                );

                                Post as a guest
































































                                Comments

                                Post a Comment

                                Popular posts from this blog

                                What does second last employer means? [closed]

                                Image
                                Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote -3 down vote favorite Say, for example I have worked in the following companies, Company A => 2010 - 2011 Company B => 2011 - 2012 Company C => 2012 - Till Date Company D => Have offer Now assume Company D is asking to submit documents from my second last employer. So from the list of companies given, which company would be qualified as second last employer? software-industry employer share | improve this question asked Aug 10 '14 at 5:16 Rajaprabhu Aravindasamy 559 1 6 13 closed as off-topic by Jim G., jmort253 ♦ Aug 11 '14 at 1:58 This question appears to be off-topic. The users who voted to close gave this specific reason: "Questions seeking advice on company-specific regulations, agreements, or policies should be directed to your manager or HR department. Questions that address...
                                Read more

                                Installing NextGIS Connect into QGIS 3?

                                Image
                                Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite Just acquired free version of NEXTGIS and trying to install the plugin for QGIS. It tells me it was not designed for version 3 of QGIS. How do I set up the QGIS-NEXTGIS interface then? qgis qgis-plugins nextgis share | improve this question edited 3 hours ago PolyGeo ♦ 51.9k 17 77 233 asked 4 hours ago IanGS 16 4 New contributor IanGS is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. add a comment  |  up vote 1 down vote favorite Just acquired free version of NEXTGIS and trying to install the plugin for QGIS. It tells me it was not designed for version 3 of QGIS. How do I set up the QGIS-NEXTGIS interface then? qgis qgis-plugin...
                                Read more

                                One-line joke

                                A one-liner is a joke that is delivered in a single line. A good one-liner is said to be pithy - concise and meaningful. [1] Comedians and actors use this comedic method as part of their act, e.g. Jimmy Carr, Tommy Cooper, Rodney Dangerfield, Norm Macdonald, Ken Dodd, Stewart Francis, Zach Galifianakis, Mitch Hedberg, Anthony Jeselnik, Milton Jones, Shappi Khorsandi, Jay London, Mark Linn-Baker, Demetri Martin, Groucho Marx, Dan Mintz, Emo Philips, Tim Vine, Steven Wright and Henny Youngman and Arnold Schwarzenegger. [ citation needed ] Many fictional characters are also known to deliver one-liners, including James Bond, who usually includes pithy and laconic quips after disposing of a villain. [ citation needed ] Examples "A baby seal walks into a club." "A dyslexic man walks into a bra." (Anonymous) "There are three types of people, those who can count and those who can't." "Venison's dear, isn't it?" (Jimmy Carr) "An escala...
                                Read more