Proving that $lim_{ntoinfty}s_n=0$











up vote
1
down vote

favorite













Prove: If $lim_{ntoinfty}s_n=s$ and ${s_n}$ has a subsequence ${s_{n_k}}$ such that $(-1)^ks_{n_k}geq0$ then $s=0$.




Proof. Since ${s_n}$ converges to $s$ then so does its subsequence ${s_{n_k}}$ . Again, if it is convergent then $liminf=limsup$, but for $k$ even the subsequence assumes the form $s_{n_{2k}}$, instead for odd the form $-s_{n_{2k+1}}$. For these to be equal, for large $n$, both limits $s$ and $-s$ must be equal to $0$. Since $liminf=limsup=0$ then $s=0$.










share|cite|improve this question
























  • "For these to be equal" -> the sequences are not equal. Their limits (respectively $s$ and $-s$) have to be.
    – Clement C.
    Nov 20 at 14:45










  • Sorry, that is what I intended to write
    – DMH16
    Nov 20 at 14:46















up vote
1
down vote

favorite













Prove: If $lim_{ntoinfty}s_n=s$ and ${s_n}$ has a subsequence ${s_{n_k}}$ such that $(-1)^ks_{n_k}geq0$ then $s=0$.




Proof. Since ${s_n}$ converges to $s$ then so does its subsequence ${s_{n_k}}$ . Again, if it is convergent then $liminf=limsup$, but for $k$ even the subsequence assumes the form $s_{n_{2k}}$, instead for odd the form $-s_{n_{2k+1}}$. For these to be equal, for large $n$, both limits $s$ and $-s$ must be equal to $0$. Since $liminf=limsup=0$ then $s=0$.










share|cite|improve this question
























  • "For these to be equal" -> the sequences are not equal. Their limits (respectively $s$ and $-s$) have to be.
    – Clement C.
    Nov 20 at 14:45










  • Sorry, that is what I intended to write
    – DMH16
    Nov 20 at 14:46













up vote
1
down vote

favorite









up vote
1
down vote

favorite












Prove: If $lim_{ntoinfty}s_n=s$ and ${s_n}$ has a subsequence ${s_{n_k}}$ such that $(-1)^ks_{n_k}geq0$ then $s=0$.




Proof. Since ${s_n}$ converges to $s$ then so does its subsequence ${s_{n_k}}$ . Again, if it is convergent then $liminf=limsup$, but for $k$ even the subsequence assumes the form $s_{n_{2k}}$, instead for odd the form $-s_{n_{2k+1}}$. For these to be equal, for large $n$, both limits $s$ and $-s$ must be equal to $0$. Since $liminf=limsup=0$ then $s=0$.










share|cite|improve this question
















Prove: If $lim_{ntoinfty}s_n=s$ and ${s_n}$ has a subsequence ${s_{n_k}}$ such that $(-1)^ks_{n_k}geq0$ then $s=0$.




Proof. Since ${s_n}$ converges to $s$ then so does its subsequence ${s_{n_k}}$ . Again, if it is convergent then $liminf=limsup$, but for $k$ even the subsequence assumes the form $s_{n_{2k}}$, instead for odd the form $-s_{n_{2k+1}}$. For these to be equal, for large $n$, both limits $s$ and $-s$ must be equal to $0$. Since $liminf=limsup=0$ then $s=0$.







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








edited Nov 20 at 14:47

























asked Nov 20 at 14:43









DMH16

561217




561217












  • "For these to be equal" -> the sequences are not equal. Their limits (respectively $s$ and $-s$) have to be.
    – Clement C.
    Nov 20 at 14:45










  • Sorry, that is what I intended to write
    – DMH16
    Nov 20 at 14:46


















  • "For these to be equal" -> the sequences are not equal. Their limits (respectively $s$ and $-s$) have to be.
    – Clement C.
    Nov 20 at 14:45










  • Sorry, that is what I intended to write
    – DMH16
    Nov 20 at 14:46
















"For these to be equal" -> the sequences are not equal. Their limits (respectively $s$ and $-s$) have to be.
– Clement C.
Nov 20 at 14:45




"For these to be equal" -> the sequences are not equal. Their limits (respectively $s$ and $-s$) have to be.
– Clement C.
Nov 20 at 14:45












Sorry, that is what I intended to write
– DMH16
Nov 20 at 14:46




Sorry, that is what I intended to write
– DMH16
Nov 20 at 14:46










2 Answers
2






active

oldest

votes

















up vote
2
down vote



accepted










Your proof is fine. Here a proof without $ lim inf$ and $lim sup$:



Suppose that $s ne 0$. WLOG we assume thatb $s>0$. Since $s_{n_k} to s$ as $ k to infty$, there is $K$ such that $s_{n_k}>0$ for all $k>K$. If $k>K$ and $k$ is odd, we get $(-1)^ks_{n_k}<0$, a contradiction.






share|cite|improve this answer




























    up vote
    0
    down vote













    $lim_{n rightarrow infty} s_n=s.$



    Then every subsequence converges to $s$.



    Given:



    $s_{n_k}$ converges to $s$, and $(-1)^k s_{n_k} ge 0$.



    1) $k =2m$ then $s_{n_{2m}} ge 0$, and this subsequence of $s_{n_k}$ converges to $s$:



    $lim_{m rightarrow infty} s_{n_{2m}} =s ge 0.$



    Similarly;



    2)$ k=(2m+1)$ then $s_{n_{2m+1}} le 0$, and this subsequence of $s_{n_k}$ converges to $s$.



    $lim_{ m rightarrow infty}s_{n_{2m+1}}=s le 0.$



    Hence?



    Used : If every term of a convergent sequence is $ge 0,$ then the limit is $ge 0$.






    share|cite|improve this answer





















    • I am not sure how your answer differs from mine
      – DMH16
      Nov 21 at 4:11










    • DMH16.Same idea, without limsup,liminf.
      – Peter Szilas
      Nov 21 at 8:36











    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: 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%2f3006388%2fproving-that-lim-n-to-inftys-n-0%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    2
    down vote



    accepted










    Your proof is fine. Here a proof without $ lim inf$ and $lim sup$:



    Suppose that $s ne 0$. WLOG we assume thatb $s>0$. Since $s_{n_k} to s$ as $ k to infty$, there is $K$ such that $s_{n_k}>0$ for all $k>K$. If $k>K$ and $k$ is odd, we get $(-1)^ks_{n_k}<0$, a contradiction.






    share|cite|improve this answer

























      up vote
      2
      down vote



      accepted










      Your proof is fine. Here a proof without $ lim inf$ and $lim sup$:



      Suppose that $s ne 0$. WLOG we assume thatb $s>0$. Since $s_{n_k} to s$ as $ k to infty$, there is $K$ such that $s_{n_k}>0$ for all $k>K$. If $k>K$ and $k$ is odd, we get $(-1)^ks_{n_k}<0$, a contradiction.






      share|cite|improve this answer























        up vote
        2
        down vote



        accepted







        up vote
        2
        down vote



        accepted






        Your proof is fine. Here a proof without $ lim inf$ and $lim sup$:



        Suppose that $s ne 0$. WLOG we assume thatb $s>0$. Since $s_{n_k} to s$ as $ k to infty$, there is $K$ such that $s_{n_k}>0$ for all $k>K$. If $k>K$ and $k$ is odd, we get $(-1)^ks_{n_k}<0$, a contradiction.






        share|cite|improve this answer












        Your proof is fine. Here a proof without $ lim inf$ and $lim sup$:



        Suppose that $s ne 0$. WLOG we assume thatb $s>0$. Since $s_{n_k} to s$ as $ k to infty$, there is $K$ such that $s_{n_k}>0$ for all $k>K$. If $k>K$ and $k$ is odd, we get $(-1)^ks_{n_k}<0$, a contradiction.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 20 at 14:50









        Fred

        43.3k1644




        43.3k1644






















            up vote
            0
            down vote













            $lim_{n rightarrow infty} s_n=s.$



            Then every subsequence converges to $s$.



            Given:



            $s_{n_k}$ converges to $s$, and $(-1)^k s_{n_k} ge 0$.



            1) $k =2m$ then $s_{n_{2m}} ge 0$, and this subsequence of $s_{n_k}$ converges to $s$:



            $lim_{m rightarrow infty} s_{n_{2m}} =s ge 0.$



            Similarly;



            2)$ k=(2m+1)$ then $s_{n_{2m+1}} le 0$, and this subsequence of $s_{n_k}$ converges to $s$.



            $lim_{ m rightarrow infty}s_{n_{2m+1}}=s le 0.$



            Hence?



            Used : If every term of a convergent sequence is $ge 0,$ then the limit is $ge 0$.






            share|cite|improve this answer





















            • I am not sure how your answer differs from mine
              – DMH16
              Nov 21 at 4:11










            • DMH16.Same idea, without limsup,liminf.
              – Peter Szilas
              Nov 21 at 8:36















            up vote
            0
            down vote













            $lim_{n rightarrow infty} s_n=s.$



            Then every subsequence converges to $s$.



            Given:



            $s_{n_k}$ converges to $s$, and $(-1)^k s_{n_k} ge 0$.



            1) $k =2m$ then $s_{n_{2m}} ge 0$, and this subsequence of $s_{n_k}$ converges to $s$:



            $lim_{m rightarrow infty} s_{n_{2m}} =s ge 0.$



            Similarly;



            2)$ k=(2m+1)$ then $s_{n_{2m+1}} le 0$, and this subsequence of $s_{n_k}$ converges to $s$.



            $lim_{ m rightarrow infty}s_{n_{2m+1}}=s le 0.$



            Hence?



            Used : If every term of a convergent sequence is $ge 0,$ then the limit is $ge 0$.






            share|cite|improve this answer





















            • I am not sure how your answer differs from mine
              – DMH16
              Nov 21 at 4:11










            • DMH16.Same idea, without limsup,liminf.
              – Peter Szilas
              Nov 21 at 8:36













            up vote
            0
            down vote










            up vote
            0
            down vote









            $lim_{n rightarrow infty} s_n=s.$



            Then every subsequence converges to $s$.



            Given:



            $s_{n_k}$ converges to $s$, and $(-1)^k s_{n_k} ge 0$.



            1) $k =2m$ then $s_{n_{2m}} ge 0$, and this subsequence of $s_{n_k}$ converges to $s$:



            $lim_{m rightarrow infty} s_{n_{2m}} =s ge 0.$



            Similarly;



            2)$ k=(2m+1)$ then $s_{n_{2m+1}} le 0$, and this subsequence of $s_{n_k}$ converges to $s$.



            $lim_{ m rightarrow infty}s_{n_{2m+1}}=s le 0.$



            Hence?



            Used : If every term of a convergent sequence is $ge 0,$ then the limit is $ge 0$.






            share|cite|improve this answer












            $lim_{n rightarrow infty} s_n=s.$



            Then every subsequence converges to $s$.



            Given:



            $s_{n_k}$ converges to $s$, and $(-1)^k s_{n_k} ge 0$.



            1) $k =2m$ then $s_{n_{2m}} ge 0$, and this subsequence of $s_{n_k}$ converges to $s$:



            $lim_{m rightarrow infty} s_{n_{2m}} =s ge 0.$



            Similarly;



            2)$ k=(2m+1)$ then $s_{n_{2m+1}} le 0$, and this subsequence of $s_{n_k}$ converges to $s$.



            $lim_{ m rightarrow infty}s_{n_{2m+1}}=s le 0.$



            Hence?



            Used : If every term of a convergent sequence is $ge 0,$ then the limit is $ge 0$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Nov 20 at 16:18









            Peter Szilas

            10.4k2720




            10.4k2720












            • I am not sure how your answer differs from mine
              – DMH16
              Nov 21 at 4:11










            • DMH16.Same idea, without limsup,liminf.
              – Peter Szilas
              Nov 21 at 8:36


















            • I am not sure how your answer differs from mine
              – DMH16
              Nov 21 at 4:11










            • DMH16.Same idea, without limsup,liminf.
              – Peter Szilas
              Nov 21 at 8:36
















            I am not sure how your answer differs from mine
            – DMH16
            Nov 21 at 4:11




            I am not sure how your answer differs from mine
            – DMH16
            Nov 21 at 4:11












            DMH16.Same idea, without limsup,liminf.
            – Peter Szilas
            Nov 21 at 8:36




            DMH16.Same idea, without limsup,liminf.
            – Peter Szilas
            Nov 21 at 8:36


















            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%2f3006388%2fproving-that-lim-n-to-inftys-n-0%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

            Quarter-circle Tiles

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Mont Emei