$f_n(x) = frac1n$ if $x=n$ and $f_n(x) = 0$ if $xneq n$. Is $sum f_n(x)$ uniformly convergent?

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











up vote
3
down vote

favorite













For each $n in mathbbN$ and $x in mathbbR$ define
$$f_n(x) = frac1n;mathrmif;x=nquadmathrmandquad f_n(x) = 0;mathrmif;xneq n.$$
The series $sum f_n(x)$ is uniformly convergent in $mathbbR$?




For each $x in mathbbR$, $f_n(x) = frac1x$ or $f_n(x) = 0$ for every $n in mathbbN$. So, the series converges (pointwise). Now, about uniformly convergence, I'm confuse. I don't see the criterion to apply in this series. I appreciate any hints.







share|cite|improve this question


























    up vote
    3
    down vote

    favorite













    For each $n in mathbbN$ and $x in mathbbR$ define
    $$f_n(x) = frac1n;mathrmif;x=nquadmathrmandquad f_n(x) = 0;mathrmif;xneq n.$$
    The series $sum f_n(x)$ is uniformly convergent in $mathbbR$?




    For each $x in mathbbR$, $f_n(x) = frac1x$ or $f_n(x) = 0$ for every $n in mathbbN$. So, the series converges (pointwise). Now, about uniformly convergence, I'm confuse. I don't see the criterion to apply in this series. I appreciate any hints.







    share|cite|improve this question
























      up vote
      3
      down vote

      favorite









      up vote
      3
      down vote

      favorite












      For each $n in mathbbN$ and $x in mathbbR$ define
      $$f_n(x) = frac1n;mathrmif;x=nquadmathrmandquad f_n(x) = 0;mathrmif;xneq n.$$
      The series $sum f_n(x)$ is uniformly convergent in $mathbbR$?




      For each $x in mathbbR$, $f_n(x) = frac1x$ or $f_n(x) = 0$ for every $n in mathbbN$. So, the series converges (pointwise). Now, about uniformly convergence, I'm confuse. I don't see the criterion to apply in this series. I appreciate any hints.







      share|cite|improve this question















      For each $n in mathbbN$ and $x in mathbbR$ define
      $$f_n(x) = frac1n;mathrmif;x=nquadmathrmandquad f_n(x) = 0;mathrmif;xneq n.$$
      The series $sum f_n(x)$ is uniformly convergent in $mathbbR$?




      For each $x in mathbbR$, $f_n(x) = frac1x$ or $f_n(x) = 0$ for every $n in mathbbN$. So, the series converges (pointwise). Now, about uniformly convergence, I'm confuse. I don't see the criterion to apply in this series. I appreciate any hints.









      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Aug 14 at 8:05









      José Carlos Santos

      116k1699178




      116k1699178










      asked Aug 14 at 7:58









      Lucas Corrêa

      1,173319




      1,173319




















          5 Answers
          5






          active

          oldest

          votes

















          up vote
          4
          down vote



          accepted










          By definition of uniform convergence, You need:
          $$forall epsilon >0exists NinmathbbNspace s.t. space forall n>N.forall xin mathbbR : |f_n(x)-f(x)|<epsilon $$



          Meaning, $N$ is uniform ,depending only on $epsilon$ and not on $x$.



          You can also use Cauchy criterion for uniform convergence:



          $$forall epsilon >0exists NinmathbbNspace s.t. space forall n,m>N.forall xin mathbbR : |f_n(x)-f_m(x)|<epsilon $$



          Note that both of these criterions are equivalent to proving: $sup_xin mathbbR|f_n(x)-f(x)|to0.$



          A way to disprove uniform convergence is to find a series of points $x_nto omegainmathbbRcup+infty,-infty $ such that $|f_n(x_n)-f(x_n)|to aneq0$



          Similar rules apply when dealing with series , only this time you should look at $S_n=sum_k=1^nf_k(x)$






          share|cite|improve this answer



























            up vote
            3
            down vote













            For $x in mathbb R$ and $n in mathbb N$ you have



            $$leftvert sumlimits_k=n+1^infty f_k(x)rightvert le dfrac1n+1$$



            Therefore $sum f_n$ converges uniformly on $mathbb R$: the supremum of the reminder $R_n(x)$ is uniformly bounded by a quantity which vanishes as $n to infty$.






            share|cite|improve this answer





























              up vote
              2
              down vote













              Claim: $|sum_k=j^m f_n (x)|leq frac 1 j$ for all $x in mathbb R$whenever $1leq j leq m$. Once we show this uniform convergnc e follows. Fxi $x$. If $x$ is not in $j,j+1,...,m$ then $sum_k=j^m f_n (x)=0$. If $x=k$ for some $k$ in this range then the sum is exactly $frac 1 k$ which does not exceed$frac 1 j$. This proves teh claim.






              share|cite|improve this answer



























                up vote
                1
                down vote













                Yes, it converges uniformly to the function$$beginarrayrcccfcolon&mathbb R&longrightarrow&mathbb R\&x&mapsto&begincasesfrac1n&text if $x=n$ for some ninmathbb N\0&text otherwise.endcasesendarray$$Just use the definition of uniform convergence and the fact that, for each $varepsilon>0$, $frac1n<varepsilon$ if $ngg1$.






                share|cite|improve this answer



























                  up vote
                  1
                  down vote













                  $f_n (x) rightarrow f(x)=0$ $space asspace n rightarrow space infty$
                  $Nowspace M_n =Sup|f_n| space forall xin R $.
                  Then $M_n =0 space forall nin N$






                  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
                    );



                    );








                     

                    draft saved


                    draft discarded


















                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2882179%2ff-nx-frac1n-if-x-n-and-f-nx-0-if-x-neq-n-is-sum-f-n%23new-answer', 'question_page');

                    );

                    Post as a guest






























                    5 Answers
                    5






                    active

                    oldest

                    votes








                    5 Answers
                    5






                    active

                    oldest

                    votes









                    active

                    oldest

                    votes






                    active

                    oldest

                    votes








                    up vote
                    4
                    down vote



                    accepted










                    By definition of uniform convergence, You need:
                    $$forall epsilon >0exists NinmathbbNspace s.t. space forall n>N.forall xin mathbbR : |f_n(x)-f(x)|<epsilon $$



                    Meaning, $N$ is uniform ,depending only on $epsilon$ and not on $x$.



                    You can also use Cauchy criterion for uniform convergence:



                    $$forall epsilon >0exists NinmathbbNspace s.t. space forall n,m>N.forall xin mathbbR : |f_n(x)-f_m(x)|<epsilon $$



                    Note that both of these criterions are equivalent to proving: $sup_xin mathbbR|f_n(x)-f(x)|to0.$



                    A way to disprove uniform convergence is to find a series of points $x_nto omegainmathbbRcup+infty,-infty $ such that $|f_n(x_n)-f(x_n)|to aneq0$



                    Similar rules apply when dealing with series , only this time you should look at $S_n=sum_k=1^nf_k(x)$






                    share|cite|improve this answer
























                      up vote
                      4
                      down vote



                      accepted










                      By definition of uniform convergence, You need:
                      $$forall epsilon >0exists NinmathbbNspace s.t. space forall n>N.forall xin mathbbR : |f_n(x)-f(x)|<epsilon $$



                      Meaning, $N$ is uniform ,depending only on $epsilon$ and not on $x$.



                      You can also use Cauchy criterion for uniform convergence:



                      $$forall epsilon >0exists NinmathbbNspace s.t. space forall n,m>N.forall xin mathbbR : |f_n(x)-f_m(x)|<epsilon $$



                      Note that both of these criterions are equivalent to proving: $sup_xin mathbbR|f_n(x)-f(x)|to0.$



                      A way to disprove uniform convergence is to find a series of points $x_nto omegainmathbbRcup+infty,-infty $ such that $|f_n(x_n)-f(x_n)|to aneq0$



                      Similar rules apply when dealing with series , only this time you should look at $S_n=sum_k=1^nf_k(x)$






                      share|cite|improve this answer






















                        up vote
                        4
                        down vote



                        accepted







                        up vote
                        4
                        down vote



                        accepted






                        By definition of uniform convergence, You need:
                        $$forall epsilon >0exists NinmathbbNspace s.t. space forall n>N.forall xin mathbbR : |f_n(x)-f(x)|<epsilon $$



                        Meaning, $N$ is uniform ,depending only on $epsilon$ and not on $x$.



                        You can also use Cauchy criterion for uniform convergence:



                        $$forall epsilon >0exists NinmathbbNspace s.t. space forall n,m>N.forall xin mathbbR : |f_n(x)-f_m(x)|<epsilon $$



                        Note that both of these criterions are equivalent to proving: $sup_xin mathbbR|f_n(x)-f(x)|to0.$



                        A way to disprove uniform convergence is to find a series of points $x_nto omegainmathbbRcup+infty,-infty $ such that $|f_n(x_n)-f(x_n)|to aneq0$



                        Similar rules apply when dealing with series , only this time you should look at $S_n=sum_k=1^nf_k(x)$






                        share|cite|improve this answer












                        By definition of uniform convergence, You need:
                        $$forall epsilon >0exists NinmathbbNspace s.t. space forall n>N.forall xin mathbbR : |f_n(x)-f(x)|<epsilon $$



                        Meaning, $N$ is uniform ,depending only on $epsilon$ and not on $x$.



                        You can also use Cauchy criterion for uniform convergence:



                        $$forall epsilon >0exists NinmathbbNspace s.t. space forall n,m>N.forall xin mathbbR : |f_n(x)-f_m(x)|<epsilon $$



                        Note that both of these criterions are equivalent to proving: $sup_xin mathbbR|f_n(x)-f(x)|to0.$



                        A way to disprove uniform convergence is to find a series of points $x_nto omegainmathbbRcup+infty,-infty $ such that $|f_n(x_n)-f(x_n)|to aneq0$



                        Similar rules apply when dealing with series , only this time you should look at $S_n=sum_k=1^nf_k(x)$







                        share|cite|improve this answer












                        share|cite|improve this answer



                        share|cite|improve this answer










                        answered Aug 14 at 8:15









                        Sar

                        45910




                        45910




















                            up vote
                            3
                            down vote













                            For $x in mathbb R$ and $n in mathbb N$ you have



                            $$leftvert sumlimits_k=n+1^infty f_k(x)rightvert le dfrac1n+1$$



                            Therefore $sum f_n$ converges uniformly on $mathbb R$: the supremum of the reminder $R_n(x)$ is uniformly bounded by a quantity which vanishes as $n to infty$.






                            share|cite|improve this answer


























                              up vote
                              3
                              down vote













                              For $x in mathbb R$ and $n in mathbb N$ you have



                              $$leftvert sumlimits_k=n+1^infty f_k(x)rightvert le dfrac1n+1$$



                              Therefore $sum f_n$ converges uniformly on $mathbb R$: the supremum of the reminder $R_n(x)$ is uniformly bounded by a quantity which vanishes as $n to infty$.






                              share|cite|improve this answer
























                                up vote
                                3
                                down vote










                                up vote
                                3
                                down vote









                                For $x in mathbb R$ and $n in mathbb N$ you have



                                $$leftvert sumlimits_k=n+1^infty f_k(x)rightvert le dfrac1n+1$$



                                Therefore $sum f_n$ converges uniformly on $mathbb R$: the supremum of the reminder $R_n(x)$ is uniformly bounded by a quantity which vanishes as $n to infty$.






                                share|cite|improve this answer














                                For $x in mathbb R$ and $n in mathbb N$ you have



                                $$leftvert sumlimits_k=n+1^infty f_k(x)rightvert le dfrac1n+1$$



                                Therefore $sum f_n$ converges uniformly on $mathbb R$: the supremum of the reminder $R_n(x)$ is uniformly bounded by a quantity which vanishes as $n to infty$.







                                share|cite|improve this answer














                                share|cite|improve this answer



                                share|cite|improve this answer








                                edited Aug 14 at 8:15

























                                answered Aug 14 at 8:07









                                mathcounterexamples.net

                                25k21754




                                25k21754




















                                    up vote
                                    2
                                    down vote













                                    Claim: $|sum_k=j^m f_n (x)|leq frac 1 j$ for all $x in mathbb R$whenever $1leq j leq m$. Once we show this uniform convergnc e follows. Fxi $x$. If $x$ is not in $j,j+1,...,m$ then $sum_k=j^m f_n (x)=0$. If $x=k$ for some $k$ in this range then the sum is exactly $frac 1 k$ which does not exceed$frac 1 j$. This proves teh claim.






                                    share|cite|improve this answer
























                                      up vote
                                      2
                                      down vote













                                      Claim: $|sum_k=j^m f_n (x)|leq frac 1 j$ for all $x in mathbb R$whenever $1leq j leq m$. Once we show this uniform convergnc e follows. Fxi $x$. If $x$ is not in $j,j+1,...,m$ then $sum_k=j^m f_n (x)=0$. If $x=k$ for some $k$ in this range then the sum is exactly $frac 1 k$ which does not exceed$frac 1 j$. This proves teh claim.






                                      share|cite|improve this answer






















                                        up vote
                                        2
                                        down vote










                                        up vote
                                        2
                                        down vote









                                        Claim: $|sum_k=j^m f_n (x)|leq frac 1 j$ for all $x in mathbb R$whenever $1leq j leq m$. Once we show this uniform convergnc e follows. Fxi $x$. If $x$ is not in $j,j+1,...,m$ then $sum_k=j^m f_n (x)=0$. If $x=k$ for some $k$ in this range then the sum is exactly $frac 1 k$ which does not exceed$frac 1 j$. This proves teh claim.






                                        share|cite|improve this answer












                                        Claim: $|sum_k=j^m f_n (x)|leq frac 1 j$ for all $x in mathbb R$whenever $1leq j leq m$. Once we show this uniform convergnc e follows. Fxi $x$. If $x$ is not in $j,j+1,...,m$ then $sum_k=j^m f_n (x)=0$. If $x=k$ for some $k$ in this range then the sum is exactly $frac 1 k$ which does not exceed$frac 1 j$. This proves teh claim.







                                        share|cite|improve this answer












                                        share|cite|improve this answer



                                        share|cite|improve this answer










                                        answered Aug 14 at 8:07









                                        Kavi Rama Murthy

                                        22.2k2933




                                        22.2k2933




















                                            up vote
                                            1
                                            down vote













                                            Yes, it converges uniformly to the function$$beginarrayrcccfcolon&mathbb R&longrightarrow&mathbb R\&x&mapsto&begincasesfrac1n&text if $x=n$ for some ninmathbb N\0&text otherwise.endcasesendarray$$Just use the definition of uniform convergence and the fact that, for each $varepsilon>0$, $frac1n<varepsilon$ if $ngg1$.






                                            share|cite|improve this answer
























                                              up vote
                                              1
                                              down vote













                                              Yes, it converges uniformly to the function$$beginarrayrcccfcolon&mathbb R&longrightarrow&mathbb R\&x&mapsto&begincasesfrac1n&text if $x=n$ for some ninmathbb N\0&text otherwise.endcasesendarray$$Just use the definition of uniform convergence and the fact that, for each $varepsilon>0$, $frac1n<varepsilon$ if $ngg1$.






                                              share|cite|improve this answer






















                                                up vote
                                                1
                                                down vote










                                                up vote
                                                1
                                                down vote









                                                Yes, it converges uniformly to the function$$beginarrayrcccfcolon&mathbb R&longrightarrow&mathbb R\&x&mapsto&begincasesfrac1n&text if $x=n$ for some ninmathbb N\0&text otherwise.endcasesendarray$$Just use the definition of uniform convergence and the fact that, for each $varepsilon>0$, $frac1n<varepsilon$ if $ngg1$.






                                                share|cite|improve this answer












                                                Yes, it converges uniformly to the function$$beginarrayrcccfcolon&mathbb R&longrightarrow&mathbb R\&x&mapsto&begincasesfrac1n&text if $x=n$ for some ninmathbb N\0&text otherwise.endcasesendarray$$Just use the definition of uniform convergence and the fact that, for each $varepsilon>0$, $frac1n<varepsilon$ if $ngg1$.







                                                share|cite|improve this answer












                                                share|cite|improve this answer



                                                share|cite|improve this answer










                                                answered Aug 14 at 8:04









                                                José Carlos Santos

                                                116k1699178




                                                116k1699178




















                                                    up vote
                                                    1
                                                    down vote













                                                    $f_n (x) rightarrow f(x)=0$ $space asspace n rightarrow space infty$
                                                    $Nowspace M_n =Sup|f_n| space forall xin R $.
                                                    Then $M_n =0 space forall nin N$






                                                    share|cite|improve this answer


























                                                      up vote
                                                      1
                                                      down vote













                                                      $f_n (x) rightarrow f(x)=0$ $space asspace n rightarrow space infty$
                                                      $Nowspace M_n =Sup|f_n| space forall xin R $.
                                                      Then $M_n =0 space forall nin N$






                                                      share|cite|improve this answer
























                                                        up vote
                                                        1
                                                        down vote










                                                        up vote
                                                        1
                                                        down vote









                                                        $f_n (x) rightarrow f(x)=0$ $space asspace n rightarrow space infty$
                                                        $Nowspace M_n =Sup|f_n| space forall xin R $.
                                                        Then $M_n =0 space forall nin N$






                                                        share|cite|improve this answer














                                                        $f_n (x) rightarrow f(x)=0$ $space asspace n rightarrow space infty$
                                                        $Nowspace M_n =Sup|f_n| space forall xin R $.
                                                        Then $M_n =0 space forall nin N$







                                                        share|cite|improve this answer














                                                        share|cite|improve this answer



                                                        share|cite|improve this answer








                                                        edited Aug 14 at 8:18

























                                                        answered Aug 14 at 8:13









                                                        Sadil Khan

                                                        3297




                                                        3297






















                                                             

                                                            draft saved


                                                            draft discarded


























                                                             


                                                            draft saved


                                                            draft discarded














                                                            StackExchange.ready(
                                                            function ()
                                                            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2882179%2ff-nx-frac1n-if-x-n-and-f-nx-0-if-x-neq-n-is-sum-f-n%23new-answer', 'question_page');

                                                            );

                                                            Post as a guest













































































                                                            這個網誌中的熱門文章

                                                            How to combine Bézier curves to a surface?

                                                            Carbon dioxide

                                                            Why am i infinitely getting the same tweet with the Twitter Search API?