Proof of Generalised ratio test












1














Is the following argument correct?



Proposition. Suppose ${x_n}$ is a sequence and suppose for some $xinmathbf{R}$, the limit
$$L:=lim_{ntoinfty}frac{|x_{n+1}-x|}{|x_n-x|}$$
exists and $L<1$. Show that ${x_n}$ converges to $x$.




Proof. We choose an $r$ such that $L<r<1$, then in particular for $epsilon = r-L$, there exists an $Minmathbf{N}$, such that
$left|frac{|x_{n+1}-x|}{|x_n-x|}-Lright|<r-L,forall nge M$ and by
extension $frac{|x_{n+1}-x|}{|x_n-x|}-L<r-L,forall nge M$. We may
therefore surmise that $$frac{|x_{n+1}-x|}{|x_n-x|}<r,forall nge
M$$
Now given an arbitrary $n>M$, the above proposition implies the
following begin{align*} |x_n-x| &= |x_M-x|frac{|x_{M+1}-x|}{|x_{M}-x|}frac{|x_{M+2}-x|}{|x_{M+1}-x|}cdotsfrac{|x_n-x|}{|x_{n-1}-x|}\ &<|x_M-x|rrcdots r = |x_M-x|r^{n-M} = (|x_M-x|r^{-M})r^{n}.
end{align*}
consequently the sequence ${x_{n+M}}_{n=1}^{infty}$ is
such that we have $$|x_{n+M}-x|< (|x_M-x|r^{-M})r^{n},forall nin N$$
Now since $r<1$, $lim_{ntoinfty}r^n = 0$ and by extension
$lim_{ntoinfty}(|x_M-x|r^{-M})r^{n}= 0$. Finally appealing to
proposition $textbf{2.2.4}$ implies that ${x_{n+M}}_{n=1}^{infty}$
and by extension ${x_n}$ converge to $x$.



$blacksquare$




Note: Proposition $textbf{2.2.4}$ is the result that if $xinmathbf{R}$
and we have a sequence ${a_n}$ such that $lim_{ntoinfty}a_n = 0$,and we have a sequence $|x_n-x|<a_n,forall ninmathbf{N}$, then $lim_{ntoinfty}x_n = x$.










share|cite|improve this question






















  • Yes, the proof is correct. Good job!
    – Saad
    Oct 17 '18 at 2:40
















1














Is the following argument correct?



Proposition. Suppose ${x_n}$ is a sequence and suppose for some $xinmathbf{R}$, the limit
$$L:=lim_{ntoinfty}frac{|x_{n+1}-x|}{|x_n-x|}$$
exists and $L<1$. Show that ${x_n}$ converges to $x$.




Proof. We choose an $r$ such that $L<r<1$, then in particular for $epsilon = r-L$, there exists an $Minmathbf{N}$, such that
$left|frac{|x_{n+1}-x|}{|x_n-x|}-Lright|<r-L,forall nge M$ and by
extension $frac{|x_{n+1}-x|}{|x_n-x|}-L<r-L,forall nge M$. We may
therefore surmise that $$frac{|x_{n+1}-x|}{|x_n-x|}<r,forall nge
M$$
Now given an arbitrary $n>M$, the above proposition implies the
following begin{align*} |x_n-x| &= |x_M-x|frac{|x_{M+1}-x|}{|x_{M}-x|}frac{|x_{M+2}-x|}{|x_{M+1}-x|}cdotsfrac{|x_n-x|}{|x_{n-1}-x|}\ &<|x_M-x|rrcdots r = |x_M-x|r^{n-M} = (|x_M-x|r^{-M})r^{n}.
end{align*}
consequently the sequence ${x_{n+M}}_{n=1}^{infty}$ is
such that we have $$|x_{n+M}-x|< (|x_M-x|r^{-M})r^{n},forall nin N$$
Now since $r<1$, $lim_{ntoinfty}r^n = 0$ and by extension
$lim_{ntoinfty}(|x_M-x|r^{-M})r^{n}= 0$. Finally appealing to
proposition $textbf{2.2.4}$ implies that ${x_{n+M}}_{n=1}^{infty}$
and by extension ${x_n}$ converge to $x$.



$blacksquare$




Note: Proposition $textbf{2.2.4}$ is the result that if $xinmathbf{R}$
and we have a sequence ${a_n}$ such that $lim_{ntoinfty}a_n = 0$,and we have a sequence $|x_n-x|<a_n,forall ninmathbf{N}$, then $lim_{ntoinfty}x_n = x$.










share|cite|improve this question






















  • Yes, the proof is correct. Good job!
    – Saad
    Oct 17 '18 at 2:40














1












1








1







Is the following argument correct?



Proposition. Suppose ${x_n}$ is a sequence and suppose for some $xinmathbf{R}$, the limit
$$L:=lim_{ntoinfty}frac{|x_{n+1}-x|}{|x_n-x|}$$
exists and $L<1$. Show that ${x_n}$ converges to $x$.




Proof. We choose an $r$ such that $L<r<1$, then in particular for $epsilon = r-L$, there exists an $Minmathbf{N}$, such that
$left|frac{|x_{n+1}-x|}{|x_n-x|}-Lright|<r-L,forall nge M$ and by
extension $frac{|x_{n+1}-x|}{|x_n-x|}-L<r-L,forall nge M$. We may
therefore surmise that $$frac{|x_{n+1}-x|}{|x_n-x|}<r,forall nge
M$$
Now given an arbitrary $n>M$, the above proposition implies the
following begin{align*} |x_n-x| &= |x_M-x|frac{|x_{M+1}-x|}{|x_{M}-x|}frac{|x_{M+2}-x|}{|x_{M+1}-x|}cdotsfrac{|x_n-x|}{|x_{n-1}-x|}\ &<|x_M-x|rrcdots r = |x_M-x|r^{n-M} = (|x_M-x|r^{-M})r^{n}.
end{align*}
consequently the sequence ${x_{n+M}}_{n=1}^{infty}$ is
such that we have $$|x_{n+M}-x|< (|x_M-x|r^{-M})r^{n},forall nin N$$
Now since $r<1$, $lim_{ntoinfty}r^n = 0$ and by extension
$lim_{ntoinfty}(|x_M-x|r^{-M})r^{n}= 0$. Finally appealing to
proposition $textbf{2.2.4}$ implies that ${x_{n+M}}_{n=1}^{infty}$
and by extension ${x_n}$ converge to $x$.



$blacksquare$




Note: Proposition $textbf{2.2.4}$ is the result that if $xinmathbf{R}$
and we have a sequence ${a_n}$ such that $lim_{ntoinfty}a_n = 0$,and we have a sequence $|x_n-x|<a_n,forall ninmathbf{N}$, then $lim_{ntoinfty}x_n = x$.










share|cite|improve this question













Is the following argument correct?



Proposition. Suppose ${x_n}$ is a sequence and suppose for some $xinmathbf{R}$, the limit
$$L:=lim_{ntoinfty}frac{|x_{n+1}-x|}{|x_n-x|}$$
exists and $L<1$. Show that ${x_n}$ converges to $x$.




Proof. We choose an $r$ such that $L<r<1$, then in particular for $epsilon = r-L$, there exists an $Minmathbf{N}$, such that
$left|frac{|x_{n+1}-x|}{|x_n-x|}-Lright|<r-L,forall nge M$ and by
extension $frac{|x_{n+1}-x|}{|x_n-x|}-L<r-L,forall nge M$. We may
therefore surmise that $$frac{|x_{n+1}-x|}{|x_n-x|}<r,forall nge
M$$
Now given an arbitrary $n>M$, the above proposition implies the
following begin{align*} |x_n-x| &= |x_M-x|frac{|x_{M+1}-x|}{|x_{M}-x|}frac{|x_{M+2}-x|}{|x_{M+1}-x|}cdotsfrac{|x_n-x|}{|x_{n-1}-x|}\ &<|x_M-x|rrcdots r = |x_M-x|r^{n-M} = (|x_M-x|r^{-M})r^{n}.
end{align*}
consequently the sequence ${x_{n+M}}_{n=1}^{infty}$ is
such that we have $$|x_{n+M}-x|< (|x_M-x|r^{-M})r^{n},forall nin N$$
Now since $r<1$, $lim_{ntoinfty}r^n = 0$ and by extension
$lim_{ntoinfty}(|x_M-x|r^{-M})r^{n}= 0$. Finally appealing to
proposition $textbf{2.2.4}$ implies that ${x_{n+M}}_{n=1}^{infty}$
and by extension ${x_n}$ converge to $x$.



$blacksquare$




Note: Proposition $textbf{2.2.4}$ is the result that if $xinmathbf{R}$
and we have a sequence ${a_n}$ such that $lim_{ntoinfty}a_n = 0$,and we have a sequence $|x_n-x|<a_n,forall ninmathbf{N}$, then $lim_{ntoinfty}x_n = x$.







real-analysis sequences-and-series proof-verification






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Oct 17 '18 at 0:47









Atif FarooqAtif Farooq

3,1422825




3,1422825












  • Yes, the proof is correct. Good job!
    – Saad
    Oct 17 '18 at 2:40


















  • Yes, the proof is correct. Good job!
    – Saad
    Oct 17 '18 at 2:40
















Yes, the proof is correct. Good job!
– Saad
Oct 17 '18 at 2:40




Yes, the proof is correct. Good job!
– Saad
Oct 17 '18 at 2:40










1 Answer
1






active

oldest

votes


















1














Yes. Your proof is right, but you also can use another simpler proof. Define $y_n=|x_n-x|$. Then according to Ratio test for $y_n$ we know that $sum y_n$ exists and is bounded since $$0<lim_{nto infty}{y_{n+1}over y_n}=L<1$$because $sum y_n$ exists and is bounded it must be necessarily that $y_nto 0$ or equivalently $x_nto x$






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',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2958688%2fproof-of-generalised-ratio-test%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1














    Yes. Your proof is right, but you also can use another simpler proof. Define $y_n=|x_n-x|$. Then according to Ratio test for $y_n$ we know that $sum y_n$ exists and is bounded since $$0<lim_{nto infty}{y_{n+1}over y_n}=L<1$$because $sum y_n$ exists and is bounded it must be necessarily that $y_nto 0$ or equivalently $x_nto x$






    share|cite|improve this answer


























      1














      Yes. Your proof is right, but you also can use another simpler proof. Define $y_n=|x_n-x|$. Then according to Ratio test for $y_n$ we know that $sum y_n$ exists and is bounded since $$0<lim_{nto infty}{y_{n+1}over y_n}=L<1$$because $sum y_n$ exists and is bounded it must be necessarily that $y_nto 0$ or equivalently $x_nto x$






      share|cite|improve this answer
























        1












        1








        1






        Yes. Your proof is right, but you also can use another simpler proof. Define $y_n=|x_n-x|$. Then according to Ratio test for $y_n$ we know that $sum y_n$ exists and is bounded since $$0<lim_{nto infty}{y_{n+1}over y_n}=L<1$$because $sum y_n$ exists and is bounded it must be necessarily that $y_nto 0$ or equivalently $x_nto x$






        share|cite|improve this answer












        Yes. Your proof is right, but you also can use another simpler proof. Define $y_n=|x_n-x|$. Then according to Ratio test for $y_n$ we know that $sum y_n$ exists and is bounded since $$0<lim_{nto infty}{y_{n+1}over y_n}=L<1$$because $sum y_n$ exists and is bounded it must be necessarily that $y_nto 0$ or equivalently $x_nto x$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 30 '18 at 19:53









        Mostafa AyazMostafa Ayaz

        14.5k3937




        14.5k3937






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2958688%2fproof-of-generalised-ratio-test%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Probability when a professor distributes a quiz and homework assignment to a class of n students.

            Aardman Animations

            Are they similar matrix