Prove that $f(x) = sum_{n=1}^{infty} x^n/n^2$ is continuous on $[0,1]$












5












$begingroup$


I have a general idea of how to prove this but I could use some help with the details.



Basically I see that $f(x)$ is the uniform limit of $f_k(x) = sum_{n=1}^{k} x^n/n^2$ on $[0,1]$.



Each $f_k$ is continuous, so $f$ is as well since uniform convergence preserves continuity.



Is this proof correct/does it seem sufficient?



Thanks ahead of time.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    The convergence is uniform, by the Weierstrass M-test. I don't see that Weierstrass's approximation theorem is useful here.
    $endgroup$
    – Lord Shark the Unknown
    Nov 30 '18 at 4:53
















5












$begingroup$


I have a general idea of how to prove this but I could use some help with the details.



Basically I see that $f(x)$ is the uniform limit of $f_k(x) = sum_{n=1}^{k} x^n/n^2$ on $[0,1]$.



Each $f_k$ is continuous, so $f$ is as well since uniform convergence preserves continuity.



Is this proof correct/does it seem sufficient?



Thanks ahead of time.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    The convergence is uniform, by the Weierstrass M-test. I don't see that Weierstrass's approximation theorem is useful here.
    $endgroup$
    – Lord Shark the Unknown
    Nov 30 '18 at 4:53














5












5








5


2



$begingroup$


I have a general idea of how to prove this but I could use some help with the details.



Basically I see that $f(x)$ is the uniform limit of $f_k(x) = sum_{n=1}^{k} x^n/n^2$ on $[0,1]$.



Each $f_k$ is continuous, so $f$ is as well since uniform convergence preserves continuity.



Is this proof correct/does it seem sufficient?



Thanks ahead of time.










share|cite|improve this question











$endgroup$




I have a general idea of how to prove this but I could use some help with the details.



Basically I see that $f(x)$ is the uniform limit of $f_k(x) = sum_{n=1}^{k} x^n/n^2$ on $[0,1]$.



Each $f_k$ is continuous, so $f$ is as well since uniform convergence preserves continuity.



Is this proof correct/does it seem sufficient?



Thanks ahead of time.







real-analysis proof-verification proof-writing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 30 '18 at 4:53







user591271

















asked Nov 30 '18 at 4:49









user591271user591271

826




826








  • 2




    $begingroup$
    The convergence is uniform, by the Weierstrass M-test. I don't see that Weierstrass's approximation theorem is useful here.
    $endgroup$
    – Lord Shark the Unknown
    Nov 30 '18 at 4:53














  • 2




    $begingroup$
    The convergence is uniform, by the Weierstrass M-test. I don't see that Weierstrass's approximation theorem is useful here.
    $endgroup$
    – Lord Shark the Unknown
    Nov 30 '18 at 4:53








2




2




$begingroup$
The convergence is uniform, by the Weierstrass M-test. I don't see that Weierstrass's approximation theorem is useful here.
$endgroup$
– Lord Shark the Unknown
Nov 30 '18 at 4:53




$begingroup$
The convergence is uniform, by the Weierstrass M-test. I don't see that Weierstrass's approximation theorem is useful here.
$endgroup$
– Lord Shark the Unknown
Nov 30 '18 at 4:53










2 Answers
2






active

oldest

votes


















5












$begingroup$

Note that $|x^n/n^2|leq 1/n^2$ on $[0,1]$ and $sum_{n=1}^{infty} 1/n^2 lt infty$. Then by Weierstrass M-test,$sum_{n=1}^{infty} x^n/n^2$ converges uniformly. Hence $f$ is continuous.






share|cite|improve this answer











$endgroup$





















    1












    $begingroup$

    This can be done by a calculus student, actually, and I can even prove the continuity is uniform, provided said calculus student recalls the mean value theorem. No $M$-test needed here!



    Let $x_0, x_1 in [0,1]$, and let $epsilon > 0$ be given. We'll find $delta$ so that $|x_0 - x_1| < delta implies |f(x_0) - f(x_1)| < epsilon$.



    To see this, introduce the auxiliary functions $g_n(x) = x^n$



    We have:



    $$|f(x_1) - f(x_0)| = bigg|sum_{n=1}^infty frac{x_1^n - x_0^n}{n^2} bigg| = bigg| sum_{n=1}^infty frac{g_n(x_1) - g_n(x_0)}{n^2}bigg|$$



    Now $g_n$ are all differentiable, so $g_n(x_1) - g_n(x_0) = g_n'(x)(x_1 - x_0)$ by the Mean Value Theorem, for some $x in (x_0, x_1)$ (assuming without loss of generality $x_1 > x_0$.



    Now we have $g_n'(x) = nx^{n-1}$, so shoving this in to the above equation and observing that now all the terms are positive in the sum, so we drop the bars:



    $$|f(x_1) - f(x_0)| leq bigg[sum_{n=1}^infty frac{x^{n-1}}{n}bigg] |x_1 -x_0|$$



    But now, the first term is a convergent series, since $x < 1$, and $n > 0$, this expression is bounded above by a geometric series. Calling the limit value $S$, taking $delta = 1/S$ suffices.






    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%2f3019664%2fprove-that-fx-sum-n-1-infty-xn-n2-is-continuous-on-0-1%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









      5












      $begingroup$

      Note that $|x^n/n^2|leq 1/n^2$ on $[0,1]$ and $sum_{n=1}^{infty} 1/n^2 lt infty$. Then by Weierstrass M-test,$sum_{n=1}^{infty} x^n/n^2$ converges uniformly. Hence $f$ is continuous.






      share|cite|improve this answer











      $endgroup$


















        5












        $begingroup$

        Note that $|x^n/n^2|leq 1/n^2$ on $[0,1]$ and $sum_{n=1}^{infty} 1/n^2 lt infty$. Then by Weierstrass M-test,$sum_{n=1}^{infty} x^n/n^2$ converges uniformly. Hence $f$ is continuous.






        share|cite|improve this answer











        $endgroup$
















          5












          5








          5





          $begingroup$

          Note that $|x^n/n^2|leq 1/n^2$ on $[0,1]$ and $sum_{n=1}^{infty} 1/n^2 lt infty$. Then by Weierstrass M-test,$sum_{n=1}^{infty} x^n/n^2$ converges uniformly. Hence $f$ is continuous.






          share|cite|improve this answer











          $endgroup$



          Note that $|x^n/n^2|leq 1/n^2$ on $[0,1]$ and $sum_{n=1}^{infty} 1/n^2 lt infty$. Then by Weierstrass M-test,$sum_{n=1}^{infty} x^n/n^2$ converges uniformly. Hence $f$ is continuous.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 30 '18 at 5:10

























          answered Nov 30 '18 at 5:05









          Thomas ShelbyThomas Shelby

          2,260220




          2,260220























              1












              $begingroup$

              This can be done by a calculus student, actually, and I can even prove the continuity is uniform, provided said calculus student recalls the mean value theorem. No $M$-test needed here!



              Let $x_0, x_1 in [0,1]$, and let $epsilon > 0$ be given. We'll find $delta$ so that $|x_0 - x_1| < delta implies |f(x_0) - f(x_1)| < epsilon$.



              To see this, introduce the auxiliary functions $g_n(x) = x^n$



              We have:



              $$|f(x_1) - f(x_0)| = bigg|sum_{n=1}^infty frac{x_1^n - x_0^n}{n^2} bigg| = bigg| sum_{n=1}^infty frac{g_n(x_1) - g_n(x_0)}{n^2}bigg|$$



              Now $g_n$ are all differentiable, so $g_n(x_1) - g_n(x_0) = g_n'(x)(x_1 - x_0)$ by the Mean Value Theorem, for some $x in (x_0, x_1)$ (assuming without loss of generality $x_1 > x_0$.



              Now we have $g_n'(x) = nx^{n-1}$, so shoving this in to the above equation and observing that now all the terms are positive in the sum, so we drop the bars:



              $$|f(x_1) - f(x_0)| leq bigg[sum_{n=1}^infty frac{x^{n-1}}{n}bigg] |x_1 -x_0|$$



              But now, the first term is a convergent series, since $x < 1$, and $n > 0$, this expression is bounded above by a geometric series. Calling the limit value $S$, taking $delta = 1/S$ suffices.






              share|cite|improve this answer











              $endgroup$


















                1












                $begingroup$

                This can be done by a calculus student, actually, and I can even prove the continuity is uniform, provided said calculus student recalls the mean value theorem. No $M$-test needed here!



                Let $x_0, x_1 in [0,1]$, and let $epsilon > 0$ be given. We'll find $delta$ so that $|x_0 - x_1| < delta implies |f(x_0) - f(x_1)| < epsilon$.



                To see this, introduce the auxiliary functions $g_n(x) = x^n$



                We have:



                $$|f(x_1) - f(x_0)| = bigg|sum_{n=1}^infty frac{x_1^n - x_0^n}{n^2} bigg| = bigg| sum_{n=1}^infty frac{g_n(x_1) - g_n(x_0)}{n^2}bigg|$$



                Now $g_n$ are all differentiable, so $g_n(x_1) - g_n(x_0) = g_n'(x)(x_1 - x_0)$ by the Mean Value Theorem, for some $x in (x_0, x_1)$ (assuming without loss of generality $x_1 > x_0$.



                Now we have $g_n'(x) = nx^{n-1}$, so shoving this in to the above equation and observing that now all the terms are positive in the sum, so we drop the bars:



                $$|f(x_1) - f(x_0)| leq bigg[sum_{n=1}^infty frac{x^{n-1}}{n}bigg] |x_1 -x_0|$$



                But now, the first term is a convergent series, since $x < 1$, and $n > 0$, this expression is bounded above by a geometric series. Calling the limit value $S$, taking $delta = 1/S$ suffices.






                share|cite|improve this answer











                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  This can be done by a calculus student, actually, and I can even prove the continuity is uniform, provided said calculus student recalls the mean value theorem. No $M$-test needed here!



                  Let $x_0, x_1 in [0,1]$, and let $epsilon > 0$ be given. We'll find $delta$ so that $|x_0 - x_1| < delta implies |f(x_0) - f(x_1)| < epsilon$.



                  To see this, introduce the auxiliary functions $g_n(x) = x^n$



                  We have:



                  $$|f(x_1) - f(x_0)| = bigg|sum_{n=1}^infty frac{x_1^n - x_0^n}{n^2} bigg| = bigg| sum_{n=1}^infty frac{g_n(x_1) - g_n(x_0)}{n^2}bigg|$$



                  Now $g_n$ are all differentiable, so $g_n(x_1) - g_n(x_0) = g_n'(x)(x_1 - x_0)$ by the Mean Value Theorem, for some $x in (x_0, x_1)$ (assuming without loss of generality $x_1 > x_0$.



                  Now we have $g_n'(x) = nx^{n-1}$, so shoving this in to the above equation and observing that now all the terms are positive in the sum, so we drop the bars:



                  $$|f(x_1) - f(x_0)| leq bigg[sum_{n=1}^infty frac{x^{n-1}}{n}bigg] |x_1 -x_0|$$



                  But now, the first term is a convergent series, since $x < 1$, and $n > 0$, this expression is bounded above by a geometric series. Calling the limit value $S$, taking $delta = 1/S$ suffices.






                  share|cite|improve this answer











                  $endgroup$



                  This can be done by a calculus student, actually, and I can even prove the continuity is uniform, provided said calculus student recalls the mean value theorem. No $M$-test needed here!



                  Let $x_0, x_1 in [0,1]$, and let $epsilon > 0$ be given. We'll find $delta$ so that $|x_0 - x_1| < delta implies |f(x_0) - f(x_1)| < epsilon$.



                  To see this, introduce the auxiliary functions $g_n(x) = x^n$



                  We have:



                  $$|f(x_1) - f(x_0)| = bigg|sum_{n=1}^infty frac{x_1^n - x_0^n}{n^2} bigg| = bigg| sum_{n=1}^infty frac{g_n(x_1) - g_n(x_0)}{n^2}bigg|$$



                  Now $g_n$ are all differentiable, so $g_n(x_1) - g_n(x_0) = g_n'(x)(x_1 - x_0)$ by the Mean Value Theorem, for some $x in (x_0, x_1)$ (assuming without loss of generality $x_1 > x_0$.



                  Now we have $g_n'(x) = nx^{n-1}$, so shoving this in to the above equation and observing that now all the terms are positive in the sum, so we drop the bars:



                  $$|f(x_1) - f(x_0)| leq bigg[sum_{n=1}^infty frac{x^{n-1}}{n}bigg] |x_1 -x_0|$$



                  But now, the first term is a convergent series, since $x < 1$, and $n > 0$, this expression is bounded above by a geometric series. Calling the limit value $S$, taking $delta = 1/S$ suffices.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Nov 30 '18 at 6:54

























                  answered Nov 30 '18 at 6:44









                  Alfred YergerAlfred Yerger

                  10.3k2148




                  10.3k2148






























                      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%2f3019664%2fprove-that-fx-sum-n-1-infty-xn-n2-is-continuous-on-0-1%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

                      Plaza Victoria

                      In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

                      How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...