Prove that $(f_n)_{ninmathbb{N}},f_n:mathbb{R}rightarrowmathbb{R}$ with $f_n(x)=frac{n+1}{n}x$ is uniformly...












0












$begingroup$


Maybe the Statement of the Question is also false, I am trying to come up with an easy example for uniform convergence.



It is clear that $lim_{nrightarrowinfty}(f_n)_{ninmathbb{N}}=$id,id$(x)=x$
To Show that the functionsequence is uniformly convergent I have to show



$forallepsilon>0forall xin mathbb{R} exists n_0inmathbb{N}forall n geq n_0:|frac{n}{n+1}x-x|<epsiloniff |-frac{1}{n+1}x|<epsilon$



Now if I I Claim that I have found such a $n_0in mathbb{N}$ If I would pick an $epsilon>1$ and $x=n_0+1$ I would get $1<1$



What am I doing wrong here?










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    Maybe the Statement of the Question is also false, I am trying to come up with an easy example for uniform convergence.



    It is clear that $lim_{nrightarrowinfty}(f_n)_{ninmathbb{N}}=$id,id$(x)=x$
    To Show that the functionsequence is uniformly convergent I have to show



    $forallepsilon>0forall xin mathbb{R} exists n_0inmathbb{N}forall n geq n_0:|frac{n}{n+1}x-x|<epsiloniff |-frac{1}{n+1}x|<epsilon$



    Now if I I Claim that I have found such a $n_0in mathbb{N}$ If I would pick an $epsilon>1$ and $x=n_0+1$ I would get $1<1$



    What am I doing wrong here?










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Maybe the Statement of the Question is also false, I am trying to come up with an easy example for uniform convergence.



      It is clear that $lim_{nrightarrowinfty}(f_n)_{ninmathbb{N}}=$id,id$(x)=x$
      To Show that the functionsequence is uniformly convergent I have to show



      $forallepsilon>0forall xin mathbb{R} exists n_0inmathbb{N}forall n geq n_0:|frac{n}{n+1}x-x|<epsiloniff |-frac{1}{n+1}x|<epsilon$



      Now if I I Claim that I have found such a $n_0in mathbb{N}$ If I would pick an $epsilon>1$ and $x=n_0+1$ I would get $1<1$



      What am I doing wrong here?










      share|cite|improve this question









      $endgroup$




      Maybe the Statement of the Question is also false, I am trying to come up with an easy example for uniform convergence.



      It is clear that $lim_{nrightarrowinfty}(f_n)_{ninmathbb{N}}=$id,id$(x)=x$
      To Show that the functionsequence is uniformly convergent I have to show



      $forallepsilon>0forall xin mathbb{R} exists n_0inmathbb{N}forall n geq n_0:|frac{n}{n+1}x-x|<epsiloniff |-frac{1}{n+1}x|<epsilon$



      Now if I I Claim that I have found such a $n_0in mathbb{N}$ If I would pick an $epsilon>1$ and $x=n_0+1$ I would get $1<1$



      What am I doing wrong here?







      real-analysis






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 9 at 19:20









      RM777RM777

      38312




      38312






















          3 Answers
          3






          active

          oldest

          votes


















          1












          $begingroup$


          I am trying to come up with an easy example for uniform convergence.




          It is very hard for a sequence of polynomials to converge uniformly on all of $mathbb{R}$. Because all non-constant polynomials go to $pminfty$ at $pminfty$, a sequence of polynomials $p_n(x)$ can converge uniformly to $p(x)$ if and only if there is some $N$ such that $p_n(x)-p(x)$ is a constant for each $n>N$, and these constants go to zero. It isn't good enough to have the polynomial's coefficients converge - we need everything but the constant term to be equal after some point.



          So, two options. Either we run the whole thing on some smaller interval, or we use examples that aren't polynomials. Here's one: $f_n(x)=frac1{(x+frac1n)^2+1}$.






          share|cite|improve this answer









          $endgroup$





















            2












            $begingroup$

            Note that $|f_n(n)-f(n)| = 1$ for all $n$. Hence the convergence is not uniform.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
              $endgroup$
              – RM777
              Jan 9 at 19:31










            • $begingroup$
              @RM777: I don't understand what you mean by limesfunction...
              $endgroup$
              – copper.hat
              Jan 9 at 19:56



















            0












            $begingroup$

            Your second last line;



            $|x|(frac{n_0+1}{n_0}-1)= |x|frac{1}{n_0} < epsilon$.



            Let $epsilon =1$, and choose $x =n_0+1$.



            $1>1$; Contradiction .






            share|cite|improve this answer









            $endgroup$














              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%2f3067854%2fprove-that-f-n-n-in-mathbbn-f-n-mathbbr-rightarrow-mathbbr-with-f%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              1












              $begingroup$


              I am trying to come up with an easy example for uniform convergence.




              It is very hard for a sequence of polynomials to converge uniformly on all of $mathbb{R}$. Because all non-constant polynomials go to $pminfty$ at $pminfty$, a sequence of polynomials $p_n(x)$ can converge uniformly to $p(x)$ if and only if there is some $N$ such that $p_n(x)-p(x)$ is a constant for each $n>N$, and these constants go to zero. It isn't good enough to have the polynomial's coefficients converge - we need everything but the constant term to be equal after some point.



              So, two options. Either we run the whole thing on some smaller interval, or we use examples that aren't polynomials. Here's one: $f_n(x)=frac1{(x+frac1n)^2+1}$.






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$


                I am trying to come up with an easy example for uniform convergence.




                It is very hard for a sequence of polynomials to converge uniformly on all of $mathbb{R}$. Because all non-constant polynomials go to $pminfty$ at $pminfty$, a sequence of polynomials $p_n(x)$ can converge uniformly to $p(x)$ if and only if there is some $N$ such that $p_n(x)-p(x)$ is a constant for each $n>N$, and these constants go to zero. It isn't good enough to have the polynomial's coefficients converge - we need everything but the constant term to be equal after some point.



                So, two options. Either we run the whole thing on some smaller interval, or we use examples that aren't polynomials. Here's one: $f_n(x)=frac1{(x+frac1n)^2+1}$.






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$


                  I am trying to come up with an easy example for uniform convergence.




                  It is very hard for a sequence of polynomials to converge uniformly on all of $mathbb{R}$. Because all non-constant polynomials go to $pminfty$ at $pminfty$, a sequence of polynomials $p_n(x)$ can converge uniformly to $p(x)$ if and only if there is some $N$ such that $p_n(x)-p(x)$ is a constant for each $n>N$, and these constants go to zero. It isn't good enough to have the polynomial's coefficients converge - we need everything but the constant term to be equal after some point.



                  So, two options. Either we run the whole thing on some smaller interval, or we use examples that aren't polynomials. Here's one: $f_n(x)=frac1{(x+frac1n)^2+1}$.






                  share|cite|improve this answer









                  $endgroup$




                  I am trying to come up with an easy example for uniform convergence.




                  It is very hard for a sequence of polynomials to converge uniformly on all of $mathbb{R}$. Because all non-constant polynomials go to $pminfty$ at $pminfty$, a sequence of polynomials $p_n(x)$ can converge uniformly to $p(x)$ if and only if there is some $N$ such that $p_n(x)-p(x)$ is a constant for each $n>N$, and these constants go to zero. It isn't good enough to have the polynomial's coefficients converge - we need everything but the constant term to be equal after some point.



                  So, two options. Either we run the whole thing on some smaller interval, or we use examples that aren't polynomials. Here's one: $f_n(x)=frac1{(x+frac1n)^2+1}$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 9 at 19:49









                  jmerryjmerry

                  17k11633




                  17k11633























                      2












                      $begingroup$

                      Note that $|f_n(n)-f(n)| = 1$ for all $n$. Hence the convergence is not uniform.






                      share|cite|improve this answer









                      $endgroup$













                      • $begingroup$
                        Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
                        $endgroup$
                        – RM777
                        Jan 9 at 19:31










                      • $begingroup$
                        @RM777: I don't understand what you mean by limesfunction...
                        $endgroup$
                        – copper.hat
                        Jan 9 at 19:56
















                      2












                      $begingroup$

                      Note that $|f_n(n)-f(n)| = 1$ for all $n$. Hence the convergence is not uniform.






                      share|cite|improve this answer









                      $endgroup$













                      • $begingroup$
                        Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
                        $endgroup$
                        – RM777
                        Jan 9 at 19:31










                      • $begingroup$
                        @RM777: I don't understand what you mean by limesfunction...
                        $endgroup$
                        – copper.hat
                        Jan 9 at 19:56














                      2












                      2








                      2





                      $begingroup$

                      Note that $|f_n(n)-f(n)| = 1$ for all $n$. Hence the convergence is not uniform.






                      share|cite|improve this answer









                      $endgroup$



                      Note that $|f_n(n)-f(n)| = 1$ for all $n$. Hence the convergence is not uniform.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Jan 9 at 19:23









                      copper.hatcopper.hat

                      128k561161




                      128k561161












                      • $begingroup$
                        Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
                        $endgroup$
                        – RM777
                        Jan 9 at 19:31










                      • $begingroup$
                        @RM777: I don't understand what you mean by limesfunction...
                        $endgroup$
                        – copper.hat
                        Jan 9 at 19:56


















                      • $begingroup$
                        Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
                        $endgroup$
                        – RM777
                        Jan 9 at 19:31










                      • $begingroup$
                        @RM777: I don't understand what you mean by limesfunction...
                        $endgroup$
                        – copper.hat
                        Jan 9 at 19:56
















                      $begingroup$
                      Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
                      $endgroup$
                      – RM777
                      Jan 9 at 19:31




                      $begingroup$
                      Okey so the uniform convergence is a Statement About the sequence of functions but not About the limesfunction itself.
                      $endgroup$
                      – RM777
                      Jan 9 at 19:31












                      $begingroup$
                      @RM777: I don't understand what you mean by limesfunction...
                      $endgroup$
                      – copper.hat
                      Jan 9 at 19:56




                      $begingroup$
                      @RM777: I don't understand what you mean by limesfunction...
                      $endgroup$
                      – copper.hat
                      Jan 9 at 19:56











                      0












                      $begingroup$

                      Your second last line;



                      $|x|(frac{n_0+1}{n_0}-1)= |x|frac{1}{n_0} < epsilon$.



                      Let $epsilon =1$, and choose $x =n_0+1$.



                      $1>1$; Contradiction .






                      share|cite|improve this answer









                      $endgroup$


















                        0












                        $begingroup$

                        Your second last line;



                        $|x|(frac{n_0+1}{n_0}-1)= |x|frac{1}{n_0} < epsilon$.



                        Let $epsilon =1$, and choose $x =n_0+1$.



                        $1>1$; Contradiction .






                        share|cite|improve this answer









                        $endgroup$
















                          0












                          0








                          0





                          $begingroup$

                          Your second last line;



                          $|x|(frac{n_0+1}{n_0}-1)= |x|frac{1}{n_0} < epsilon$.



                          Let $epsilon =1$, and choose $x =n_0+1$.



                          $1>1$; Contradiction .






                          share|cite|improve this answer









                          $endgroup$



                          Your second last line;



                          $|x|(frac{n_0+1}{n_0}-1)= |x|frac{1}{n_0} < epsilon$.



                          Let $epsilon =1$, and choose $x =n_0+1$.



                          $1>1$; Contradiction .







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Jan 9 at 19:42









                          Peter SzilasPeter Szilas

                          11.7k2822




                          11.7k2822






























                              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.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067854%2fprove-that-f-n-n-in-mathbbn-f-n-mathbbr-rightarrow-mathbbr-with-f%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

                              Bressuire

                              Cabo Verde

                              Gyllenstierna