all of the sets En is exactly the set of subsequential limits of the sequence f.











up vote
0
down vote

favorite












Let $f : N rightarrow R$ be a sequence and let $E_{n} = {f(k) | k > n}$. Prove of disprove that the intersection of the closures of all the sets $E_{n}$ is exactly the set of subsequential limits of the sequence $f$.










share|cite|improve this question




















  • 1




    Have you made an attempt? The statement is true and you can show your attempt to prove this. We will be glad to help if you get stuck.
    – Kavi Rama Murthy
    yesterday










  • The tag algebraic-topology is inappropriate. I suggest you look for a different one. Algebaric topology is the name for an advanced subject.
    – DanielWainfleet
    yesterday















up vote
0
down vote

favorite












Let $f : N rightarrow R$ be a sequence and let $E_{n} = {f(k) | k > n}$. Prove of disprove that the intersection of the closures of all the sets $E_{n}$ is exactly the set of subsequential limits of the sequence $f$.










share|cite|improve this question




















  • 1




    Have you made an attempt? The statement is true and you can show your attempt to prove this. We will be glad to help if you get stuck.
    – Kavi Rama Murthy
    yesterday










  • The tag algebraic-topology is inappropriate. I suggest you look for a different one. Algebaric topology is the name for an advanced subject.
    – DanielWainfleet
    yesterday













up vote
0
down vote

favorite









up vote
0
down vote

favorite











Let $f : N rightarrow R$ be a sequence and let $E_{n} = {f(k) | k > n}$. Prove of disprove that the intersection of the closures of all the sets $E_{n}$ is exactly the set of subsequential limits of the sequence $f$.










share|cite|improve this question















Let $f : N rightarrow R$ be a sequence and let $E_{n} = {f(k) | k > n}$. Prove of disprove that the intersection of the closures of all the sets $E_{n}$ is exactly the set of subsequential limits of the sequence $f$.







general-topology






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday









freakish

10.1k1526




10.1k1526










asked yesterday









Aldol

1




1








  • 1




    Have you made an attempt? The statement is true and you can show your attempt to prove this. We will be glad to help if you get stuck.
    – Kavi Rama Murthy
    yesterday










  • The tag algebraic-topology is inappropriate. I suggest you look for a different one. Algebaric topology is the name for an advanced subject.
    – DanielWainfleet
    yesterday














  • 1




    Have you made an attempt? The statement is true and you can show your attempt to prove this. We will be glad to help if you get stuck.
    – Kavi Rama Murthy
    yesterday










  • The tag algebraic-topology is inappropriate. I suggest you look for a different one. Algebaric topology is the name for an advanced subject.
    – DanielWainfleet
    yesterday








1




1




Have you made an attempt? The statement is true and you can show your attempt to prove this. We will be glad to help if you get stuck.
– Kavi Rama Murthy
yesterday




Have you made an attempt? The statement is true and you can show your attempt to prove this. We will be glad to help if you get stuck.
– Kavi Rama Murthy
yesterday












The tag algebraic-topology is inappropriate. I suggest you look for a different one. Algebaric topology is the name for an advanced subject.
– DanielWainfleet
yesterday




The tag algebraic-topology is inappropriate. I suggest you look for a different one. Algebaric topology is the name for an advanced subject.
– DanielWainfleet
yesterday










1 Answer
1






active

oldest

votes

















up vote
0
down vote













I assume that $R$ stands for "real numbers". Anyway everything that follows is true for any first-countable space.



Let $A$ be the set of all limits of all convergent subsequences of $(f_n)$ and let $B=bigcap_m overline{E_m}$.
As usual you have to show two inclusions:



"$A subseteq B$" Pick a convergent subsequence $(f_{n_k})$. By the definition of $E_m$ it follows that $(f_{n_k})$ eventually falls into $E_m$ regardless of $m$. Therefore $lim_{k}f_{n_k}inoverline{E_m}$ for each $m$. In particular $lim_{k}f_{n_k}inbigcap_moverline{E_m}$.



"$A supseteq B$" Let $ainbigcap_moverline{E_m}$. Since $ainoverline{E_m}$ for each $m$ then it follows that $a=lim a_n$ for some sequence $(a_n)subseteq E_m$. The sequence $(a_n)$ depends on $m$ though, so lets denote it as $(a_n^m)$. Also note that it need not be a subsequence of $(f_n)$ even though it is composed of $f_n$'s. For all we know is that it can be for example constant.



So we get a sequence of sequences



$$begin{matrix}
(a_n^1)=& a_1^1 & a_2^1 & a_3^1 & a_4^1 & cdots \
(a_n^2)=& a_1^2 & a_2^2 & a_3^2 & a_4^2 & cdots \
(a_n^3)=& a_1^3 & a_2^3 & a_3^3 & a_4^3 & cdots \
(a_n^4)=& a_1^4 & a_2^4 & a_3^4 & a_4^4 & cdots \
vdots& vdots & vdots & vdots & vdots & ddots
end{matrix}$$



Now pick the diagonal: $b_n=a_n^n$. You can easily check that $b_n$ still converges to $a$. And by the definition of $E_m$ it follows that $b_m=f_k$ for some $k>m$. This property is enough to ensure that $b_m$ and $f_n$ have a common subsequence. This subsequence is what we were looking for and it completes the proof.






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: 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%2f2996395%2fall-of-the-sets-en-is-exactly-the-set-of-subsequential-limits-of-the-sequence-f%23new-answer', 'question_page');
    }
    );

    Post as a guest
































    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    0
    down vote













    I assume that $R$ stands for "real numbers". Anyway everything that follows is true for any first-countable space.



    Let $A$ be the set of all limits of all convergent subsequences of $(f_n)$ and let $B=bigcap_m overline{E_m}$.
    As usual you have to show two inclusions:



    "$A subseteq B$" Pick a convergent subsequence $(f_{n_k})$. By the definition of $E_m$ it follows that $(f_{n_k})$ eventually falls into $E_m$ regardless of $m$. Therefore $lim_{k}f_{n_k}inoverline{E_m}$ for each $m$. In particular $lim_{k}f_{n_k}inbigcap_moverline{E_m}$.



    "$A supseteq B$" Let $ainbigcap_moverline{E_m}$. Since $ainoverline{E_m}$ for each $m$ then it follows that $a=lim a_n$ for some sequence $(a_n)subseteq E_m$. The sequence $(a_n)$ depends on $m$ though, so lets denote it as $(a_n^m)$. Also note that it need not be a subsequence of $(f_n)$ even though it is composed of $f_n$'s. For all we know is that it can be for example constant.



    So we get a sequence of sequences



    $$begin{matrix}
    (a_n^1)=& a_1^1 & a_2^1 & a_3^1 & a_4^1 & cdots \
    (a_n^2)=& a_1^2 & a_2^2 & a_3^2 & a_4^2 & cdots \
    (a_n^3)=& a_1^3 & a_2^3 & a_3^3 & a_4^3 & cdots \
    (a_n^4)=& a_1^4 & a_2^4 & a_3^4 & a_4^4 & cdots \
    vdots& vdots & vdots & vdots & vdots & ddots
    end{matrix}$$



    Now pick the diagonal: $b_n=a_n^n$. You can easily check that $b_n$ still converges to $a$. And by the definition of $E_m$ it follows that $b_m=f_k$ for some $k>m$. This property is enough to ensure that $b_m$ and $f_n$ have a common subsequence. This subsequence is what we were looking for and it completes the proof.






    share|cite|improve this answer



























      up vote
      0
      down vote













      I assume that $R$ stands for "real numbers". Anyway everything that follows is true for any first-countable space.



      Let $A$ be the set of all limits of all convergent subsequences of $(f_n)$ and let $B=bigcap_m overline{E_m}$.
      As usual you have to show two inclusions:



      "$A subseteq B$" Pick a convergent subsequence $(f_{n_k})$. By the definition of $E_m$ it follows that $(f_{n_k})$ eventually falls into $E_m$ regardless of $m$. Therefore $lim_{k}f_{n_k}inoverline{E_m}$ for each $m$. In particular $lim_{k}f_{n_k}inbigcap_moverline{E_m}$.



      "$A supseteq B$" Let $ainbigcap_moverline{E_m}$. Since $ainoverline{E_m}$ for each $m$ then it follows that $a=lim a_n$ for some sequence $(a_n)subseteq E_m$. The sequence $(a_n)$ depends on $m$ though, so lets denote it as $(a_n^m)$. Also note that it need not be a subsequence of $(f_n)$ even though it is composed of $f_n$'s. For all we know is that it can be for example constant.



      So we get a sequence of sequences



      $$begin{matrix}
      (a_n^1)=& a_1^1 & a_2^1 & a_3^1 & a_4^1 & cdots \
      (a_n^2)=& a_1^2 & a_2^2 & a_3^2 & a_4^2 & cdots \
      (a_n^3)=& a_1^3 & a_2^3 & a_3^3 & a_4^3 & cdots \
      (a_n^4)=& a_1^4 & a_2^4 & a_3^4 & a_4^4 & cdots \
      vdots& vdots & vdots & vdots & vdots & ddots
      end{matrix}$$



      Now pick the diagonal: $b_n=a_n^n$. You can easily check that $b_n$ still converges to $a$. And by the definition of $E_m$ it follows that $b_m=f_k$ for some $k>m$. This property is enough to ensure that $b_m$ and $f_n$ have a common subsequence. This subsequence is what we were looking for and it completes the proof.






      share|cite|improve this answer

























        up vote
        0
        down vote










        up vote
        0
        down vote









        I assume that $R$ stands for "real numbers". Anyway everything that follows is true for any first-countable space.



        Let $A$ be the set of all limits of all convergent subsequences of $(f_n)$ and let $B=bigcap_m overline{E_m}$.
        As usual you have to show two inclusions:



        "$A subseteq B$" Pick a convergent subsequence $(f_{n_k})$. By the definition of $E_m$ it follows that $(f_{n_k})$ eventually falls into $E_m$ regardless of $m$. Therefore $lim_{k}f_{n_k}inoverline{E_m}$ for each $m$. In particular $lim_{k}f_{n_k}inbigcap_moverline{E_m}$.



        "$A supseteq B$" Let $ainbigcap_moverline{E_m}$. Since $ainoverline{E_m}$ for each $m$ then it follows that $a=lim a_n$ for some sequence $(a_n)subseteq E_m$. The sequence $(a_n)$ depends on $m$ though, so lets denote it as $(a_n^m)$. Also note that it need not be a subsequence of $(f_n)$ even though it is composed of $f_n$'s. For all we know is that it can be for example constant.



        So we get a sequence of sequences



        $$begin{matrix}
        (a_n^1)=& a_1^1 & a_2^1 & a_3^1 & a_4^1 & cdots \
        (a_n^2)=& a_1^2 & a_2^2 & a_3^2 & a_4^2 & cdots \
        (a_n^3)=& a_1^3 & a_2^3 & a_3^3 & a_4^3 & cdots \
        (a_n^4)=& a_1^4 & a_2^4 & a_3^4 & a_4^4 & cdots \
        vdots& vdots & vdots & vdots & vdots & ddots
        end{matrix}$$



        Now pick the diagonal: $b_n=a_n^n$. You can easily check that $b_n$ still converges to $a$. And by the definition of $E_m$ it follows that $b_m=f_k$ for some $k>m$. This property is enough to ensure that $b_m$ and $f_n$ have a common subsequence. This subsequence is what we were looking for and it completes the proof.






        share|cite|improve this answer














        I assume that $R$ stands for "real numbers". Anyway everything that follows is true for any first-countable space.



        Let $A$ be the set of all limits of all convergent subsequences of $(f_n)$ and let $B=bigcap_m overline{E_m}$.
        As usual you have to show two inclusions:



        "$A subseteq B$" Pick a convergent subsequence $(f_{n_k})$. By the definition of $E_m$ it follows that $(f_{n_k})$ eventually falls into $E_m$ regardless of $m$. Therefore $lim_{k}f_{n_k}inoverline{E_m}$ for each $m$. In particular $lim_{k}f_{n_k}inbigcap_moverline{E_m}$.



        "$A supseteq B$" Let $ainbigcap_moverline{E_m}$. Since $ainoverline{E_m}$ for each $m$ then it follows that $a=lim a_n$ for some sequence $(a_n)subseteq E_m$. The sequence $(a_n)$ depends on $m$ though, so lets denote it as $(a_n^m)$. Also note that it need not be a subsequence of $(f_n)$ even though it is composed of $f_n$'s. For all we know is that it can be for example constant.



        So we get a sequence of sequences



        $$begin{matrix}
        (a_n^1)=& a_1^1 & a_2^1 & a_3^1 & a_4^1 & cdots \
        (a_n^2)=& a_1^2 & a_2^2 & a_3^2 & a_4^2 & cdots \
        (a_n^3)=& a_1^3 & a_2^3 & a_3^3 & a_4^3 & cdots \
        (a_n^4)=& a_1^4 & a_2^4 & a_3^4 & a_4^4 & cdots \
        vdots& vdots & vdots & vdots & vdots & ddots
        end{matrix}$$



        Now pick the diagonal: $b_n=a_n^n$. You can easily check that $b_n$ still converges to $a$. And by the definition of $E_m$ it follows that $b_m=f_k$ for some $k>m$. This property is enough to ensure that $b_m$ and $f_n$ have a common subsequence. This subsequence is what we were looking for and it completes the proof.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited yesterday

























        answered yesterday









        freakish

        10.1k1526




        10.1k1526






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996395%2fall-of-the-sets-en-is-exactly-the-set-of-subsequential-limits-of-the-sequence-f%23new-answer', 'question_page');
            }
            );

            Post as a guest




















































































            Popular posts from this blog

            How do I know what Microsoft account the skydrive app is syncing to?

            When does type information flow backwards in C++?

            Grease: Live!