How to prove a sequence of a function converges uniformly? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Evaluating $lim _n rightarrow infty (2n+1) int_0 ^1 x^n e^x dx$To prove that $f_n(x) = fracnx1+n^2x^2$ does not uniformly converge to $f(x) = 0$ on $[0,1]$uniform convergence of few sequence of functionsUniform convergence of functions and intervalsSuppose $f_n(x)=x^n - x^2n$ , $x in [0,1]$. Dose the sequence of functions $lbrace f_n rbrace$ converge uniformly?Uniform convergence of $f_n = (n^a x^2)/(n^2 +x^3)$Prove that $f_n(x) = 1 - cos(fracxn)$ is uniformly convergentChecking for uniform convergence $f_n(x)$ $=$ $n^2x (1-x)^n$Does $f_n(x)=(1+x^2n)^1/2n$ converge uniformly on $mathbbR$.Checking $f_n(x) = fracnxn+1$ for uniform convergenceDoes $(f_n(x))= (fracnx1+nx^2)$ converge pointwise/uniformly on $I= [0,1]$?Show $f_n(x)_ n=1, cdots, infty$ converges to $0$ uniformly on $(0,1)$Showing that $f_n(x) = fracnx1+n^2x^2$ does not converge uniformlyDoes $f_n(x)=nxe^-nxsin(x)$ converges uniformly on $mathbbR^+$?Which of the following sequences $(f_n)$ converge uniformly on [0,1]?testing uniform convergence on [0,1]Proving if $f_n$ converges uniformly.Prove $f_n(x) = n^2 x (1-x)^n$ does not converges uniformlyDeciding convergence of a sequence of functionsUsing proof by contradiction to prove Dini's theorem

Did Deadpool rescue all of the X-Force?

What is the meaning of 'breadth' in breadth first search?

Is it fair for a professor to grade us on the possession of past papers?

What's the meaning of "fortified infraction restraint"?

Do any jurisdictions seriously consider reclassifying social media websites as publishers?

What order were files/directories outputted in dir?

Why do we bend a book to keep it straight?

What is the difference between globalisation and imperialism?

Why wasn't DOSKEY integrated with COMMAND.COM?

How to write this math term? with cases it isn't working

Why are the trig functions versine, haversine, exsecant, etc, rarely used in modern mathematics?

Disembodied hand growing fangs

How were pictures turned from film to a big picture in a picture frame before digital scanning?

How can I reduce the gap between left and right of cdot with a macro?

Why is Nikon 1.4g better when Nikon 1.8g is sharper?

How does the math work when buying airline miles?

How to tell that you are a giant?

Take 2! Is this homebrew Lady of Pain warlock patron balanced?

ArcGIS Pro Python arcpy.CreatePersonalGDB_management

Chinese Seal on silk painting - what does it mean?

How to write the following sign?

I am having problem understanding the behavior of below code in JavaScript

Why does the remaining Rebel fleet at the end of Rogue One seem dramatically larger than the one in A New Hope?

Hangman Game with C++



How to prove a sequence of a function converges uniformly?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Evaluating $lim _n rightarrow infty (2n+1) int_0 ^1 x^n e^x dx$To prove that $f_n(x) = fracnx1+n^2x^2$ does not uniformly converge to $f(x) = 0$ on $[0,1]$uniform convergence of few sequence of functionsUniform convergence of functions and intervalsSuppose $f_n(x)=x^n - x^2n$ , $x in [0,1]$. Dose the sequence of functions $lbrace f_n rbrace$ converge uniformly?Uniform convergence of $f_n = (n^a x^2)/(n^2 +x^3)$Prove that $f_n(x) = 1 - cos(fracxn)$ is uniformly convergentChecking for uniform convergence $f_n(x)$ $=$ $n^2x (1-x)^n$Does $f_n(x)=(1+x^2n)^1/2n$ converge uniformly on $mathbbR$.Checking $f_n(x) = fracnxn+1$ for uniform convergenceDoes $(f_n(x))= (fracnx1+nx^2)$ converge pointwise/uniformly on $I= [0,1]$?Show $f_n(x)_ n=1, cdots, infty$ converges to $0$ uniformly on $(0,1)$Showing that $f_n(x) = fracnx1+n^2x^2$ does not converge uniformlyDoes $f_n(x)=nxe^-nxsin(x)$ converges uniformly on $mathbbR^+$?Which of the following sequences $(f_n)$ converge uniformly on [0,1]?testing uniform convergence on [0,1]Proving if $f_n$ converges uniformly.Prove $f_n(x) = n^2 x (1-x)^n$ does not converges uniformlyDeciding convergence of a sequence of functionsUsing proof by contradiction to prove Dini's theorem










15












$begingroup$


For $n in mathbbN$, define the formula, $$f_n(x)= fracx2n^2x^2+8,quad x in [0,1].$$ Prove that the sequence $f_n$ converges uniformly on $[0,1]$, as $n to infty$.



I know that the definition says $f_n$ converges uniformly to $f$ if given $forall epsilon gt 0$, $forall n geq N$, such that $|f_n(x) - f(x)| lt epsilon, forall n geq N$ and $forall x in [0,1].$



I looked first at the pointwise convergence and found that $$lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1].$$



So how do I use this to choose an $n geq N$ such that $|f_n(x) - f(x)| lt epsilon$ ?



Right now, I have



"proof: Let $epsilon > 0, exists N in mathbbN$ such that, n $geq N Rightarrow frac12n^2+8 lt epsilon$,



by $|f_n(x) - 0| = |fracx2n^2x^2+8| leq |fracx^22n^2x^2+8| leq frac12n^2x^2+8 ;;;; forall x in [0,1].$



Since $lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1]$, $f_n(x)$ will converge uniformly to $0$ on $[0,1]$."



Is this correct? Am I missing something? Is something not correct? I'm unsure about my choice of $N$. Please & thanks!










share|cite|improve this question











$endgroup$











  • $begingroup$
    Hi Jamie, you seemed to have proved the sequence converges pointwise, but not uniformly.
    $endgroup$
    – Suugaku
    Apr 23 '13 at 4:37










  • $begingroup$
    What is missing from my proof to make it uniform? I thought if I proved it pointwise, and then showed that it converges $forall n geq N$ and $forall x in [0,1]$, then that implies uniform convergence?
    $endgroup$
    – Jaime
    Apr 23 '13 at 5:24
















15












$begingroup$


For $n in mathbbN$, define the formula, $$f_n(x)= fracx2n^2x^2+8,quad x in [0,1].$$ Prove that the sequence $f_n$ converges uniformly on $[0,1]$, as $n to infty$.



I know that the definition says $f_n$ converges uniformly to $f$ if given $forall epsilon gt 0$, $forall n geq N$, such that $|f_n(x) - f(x)| lt epsilon, forall n geq N$ and $forall x in [0,1].$



I looked first at the pointwise convergence and found that $$lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1].$$



So how do I use this to choose an $n geq N$ such that $|f_n(x) - f(x)| lt epsilon$ ?



Right now, I have



"proof: Let $epsilon > 0, exists N in mathbbN$ such that, n $geq N Rightarrow frac12n^2+8 lt epsilon$,



by $|f_n(x) - 0| = |fracx2n^2x^2+8| leq |fracx^22n^2x^2+8| leq frac12n^2x^2+8 ;;;; forall x in [0,1].$



Since $lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1]$, $f_n(x)$ will converge uniformly to $0$ on $[0,1]$."



Is this correct? Am I missing something? Is something not correct? I'm unsure about my choice of $N$. Please & thanks!










share|cite|improve this question











$endgroup$











  • $begingroup$
    Hi Jamie, you seemed to have proved the sequence converges pointwise, but not uniformly.
    $endgroup$
    – Suugaku
    Apr 23 '13 at 4:37










  • $begingroup$
    What is missing from my proof to make it uniform? I thought if I proved it pointwise, and then showed that it converges $forall n geq N$ and $forall x in [0,1]$, then that implies uniform convergence?
    $endgroup$
    – Jaime
    Apr 23 '13 at 5:24














15












15








15


21



$begingroup$


For $n in mathbbN$, define the formula, $$f_n(x)= fracx2n^2x^2+8,quad x in [0,1].$$ Prove that the sequence $f_n$ converges uniformly on $[0,1]$, as $n to infty$.



I know that the definition says $f_n$ converges uniformly to $f$ if given $forall epsilon gt 0$, $forall n geq N$, such that $|f_n(x) - f(x)| lt epsilon, forall n geq N$ and $forall x in [0,1].$



I looked first at the pointwise convergence and found that $$lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1].$$



So how do I use this to choose an $n geq N$ such that $|f_n(x) - f(x)| lt epsilon$ ?



Right now, I have



"proof: Let $epsilon > 0, exists N in mathbbN$ such that, n $geq N Rightarrow frac12n^2+8 lt epsilon$,



by $|f_n(x) - 0| = |fracx2n^2x^2+8| leq |fracx^22n^2x^2+8| leq frac12n^2x^2+8 ;;;; forall x in [0,1].$



Since $lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1]$, $f_n(x)$ will converge uniformly to $0$ on $[0,1]$."



Is this correct? Am I missing something? Is something not correct? I'm unsure about my choice of $N$. Please & thanks!










share|cite|improve this question











$endgroup$




For $n in mathbbN$, define the formula, $$f_n(x)= fracx2n^2x^2+8,quad x in [0,1].$$ Prove that the sequence $f_n$ converges uniformly on $[0,1]$, as $n to infty$.



I know that the definition says $f_n$ converges uniformly to $f$ if given $forall epsilon gt 0$, $forall n geq N$, such that $|f_n(x) - f(x)| lt epsilon, forall n geq N$ and $forall x in [0,1].$



I looked first at the pointwise convergence and found that $$lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1].$$



So how do I use this to choose an $n geq N$ such that $|f_n(x) - f(x)| lt epsilon$ ?



Right now, I have



"proof: Let $epsilon > 0, exists N in mathbbN$ such that, n $geq N Rightarrow frac12n^2+8 lt epsilon$,



by $|f_n(x) - 0| = |fracx2n^2x^2+8| leq |fracx^22n^2x^2+8| leq frac12n^2x^2+8 ;;;; forall x in [0,1].$



Since $lim_n rightarrow infty fracx2n^2x^2+8 = 0, forall x in [0,1]$, $f_n(x)$ will converge uniformly to $0$ on $[0,1]$."



Is this correct? Am I missing something? Is something not correct? I'm unsure about my choice of $N$. Please & thanks!







real-analysis uniform-convergence






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 27 at 16:48









user639631

547




547










asked Apr 23 '13 at 4:26









JaimeJaime

113116




113116











  • $begingroup$
    Hi Jamie, you seemed to have proved the sequence converges pointwise, but not uniformly.
    $endgroup$
    – Suugaku
    Apr 23 '13 at 4:37










  • $begingroup$
    What is missing from my proof to make it uniform? I thought if I proved it pointwise, and then showed that it converges $forall n geq N$ and $forall x in [0,1]$, then that implies uniform convergence?
    $endgroup$
    – Jaime
    Apr 23 '13 at 5:24

















  • $begingroup$
    Hi Jamie, you seemed to have proved the sequence converges pointwise, but not uniformly.
    $endgroup$
    – Suugaku
    Apr 23 '13 at 4:37










  • $begingroup$
    What is missing from my proof to make it uniform? I thought if I proved it pointwise, and then showed that it converges $forall n geq N$ and $forall x in [0,1]$, then that implies uniform convergence?
    $endgroup$
    – Jaime
    Apr 23 '13 at 5:24
















$begingroup$
Hi Jamie, you seemed to have proved the sequence converges pointwise, but not uniformly.
$endgroup$
– Suugaku
Apr 23 '13 at 4:37




$begingroup$
Hi Jamie, you seemed to have proved the sequence converges pointwise, but not uniformly.
$endgroup$
– Suugaku
Apr 23 '13 at 4:37












$begingroup$
What is missing from my proof to make it uniform? I thought if I proved it pointwise, and then showed that it converges $forall n geq N$ and $forall x in [0,1]$, then that implies uniform convergence?
$endgroup$
– Jaime
Apr 23 '13 at 5:24





$begingroup$
What is missing from my proof to make it uniform? I thought if I proved it pointwise, and then showed that it converges $forall n geq N$ and $forall x in [0,1]$, then that implies uniform convergence?
$endgroup$
– Jaime
Apr 23 '13 at 5:24











4 Answers
4






active

oldest

votes


















20












$begingroup$

related problem: (I), (II), (III). Here is a systematic technique. In order to find $sup_0leq xleq 1 |f_n(x)-f(x)| $, you need to maximize the function $Big|fracx2n^2x^2+8Big|$ over the interval $[0,1]$. Now, let



$$ g(x)=fracx2n^2x^2+8 implies g'(x) = frac4-n^2 x^2(2n^2x^2+8)^2=0 implies x=frac2n$$



gives the max of the function $g(x)$ which is $g(2/n)=1/8n$. You can check this by checking the sign of $g''(x)$ which should be $< 0$. Hence we have



$$ sup_0leq xleq 1 |f_n(x)-f(x)|= sup_0leq xleq 1 Big|fracx2n^2x^2+8Big|=frac18n < epsilon. $$






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
    $endgroup$
    – funmath
    May 5 '18 at 19:06



















7












$begingroup$

You can write
$$f_n(x)=1over n g(n>x)qquad(0leq xleq 1)$$
with
$$g(t)=tover 2t^2+8qquad(0leq t<infty) .$$
Since $g(t)$ converges to $0$ for $ttoinfty$ we already can say that $g$ is bounded. A quantitative estimate can be obtained as follows: For $t>0$ one has
$$0<g(t)=1over 8 2overtover 2+2over tleq1over 8 .$$
Therefore we now have
$$|f_n(x)|leq1over 8nqquad(ngeq1, 0leq xleq1) ,$$
which shows that the $f_n$ converge uniformly to $0$ on $[0,1]$.






share|cite|improve this answer









$endgroup$




















    6












    $begingroup$

    Another way to maximize :



    $dfracx2n^2x^2+8leq dfracx8nx=dfrac18n$ where we used the AM-GM inequality
    :http://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means to show



    $dfrac2n^2x^2+82 geq sqrt 2n^2x^2 cdot 8 $ Applying this easy inequality is often a good first way to find a supremum for the function if you have a summation involved.
    So since the function converges pointwise to $f(x)=0$ We have the following result:



    $lim_n to inftysup_0leq xleq 1 |f_n(x)-f(x)|=lim_n to infty|dfrac18n|=0$






    share|cite|improve this answer









    $endgroup$




















      0












      $begingroup$

      Pointwise convergence is not enough to say that the function converges uniformly. Here, $$f_n(x)= fracx2n^2x^2+8,x in [0,1]$$ has pointwise convergence to $f(x)=0$, so by definition $$|f_n(x)-f(x)|=bigg|fracx2n^2x^2+8-0bigg|= bigg|fracx2n^2x^2+8bigg|< frac12n$$
      This shows that that the function is not uniformly convergent.






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        Please read this tutorial on how to typeset mathematics on this site.
        $endgroup$
        – N. F. Taussig
        Jan 19 '16 at 17:00











      Your Answer








      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%2f370023%2fhow-to-prove-a-sequence-of-a-function-converges-uniformly%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      4 Answers
      4






      active

      oldest

      votes








      4 Answers
      4






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      20












      $begingroup$

      related problem: (I), (II), (III). Here is a systematic technique. In order to find $sup_0leq xleq 1 |f_n(x)-f(x)| $, you need to maximize the function $Big|fracx2n^2x^2+8Big|$ over the interval $[0,1]$. Now, let



      $$ g(x)=fracx2n^2x^2+8 implies g'(x) = frac4-n^2 x^2(2n^2x^2+8)^2=0 implies x=frac2n$$



      gives the max of the function $g(x)$ which is $g(2/n)=1/8n$. You can check this by checking the sign of $g''(x)$ which should be $< 0$. Hence we have



      $$ sup_0leq xleq 1 |f_n(x)-f(x)|= sup_0leq xleq 1 Big|fracx2n^2x^2+8Big|=frac18n < epsilon. $$






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
        $endgroup$
        – funmath
        May 5 '18 at 19:06
















      20












      $begingroup$

      related problem: (I), (II), (III). Here is a systematic technique. In order to find $sup_0leq xleq 1 |f_n(x)-f(x)| $, you need to maximize the function $Big|fracx2n^2x^2+8Big|$ over the interval $[0,1]$. Now, let



      $$ g(x)=fracx2n^2x^2+8 implies g'(x) = frac4-n^2 x^2(2n^2x^2+8)^2=0 implies x=frac2n$$



      gives the max of the function $g(x)$ which is $g(2/n)=1/8n$. You can check this by checking the sign of $g''(x)$ which should be $< 0$. Hence we have



      $$ sup_0leq xleq 1 |f_n(x)-f(x)|= sup_0leq xleq 1 Big|fracx2n^2x^2+8Big|=frac18n < epsilon. $$






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
        $endgroup$
        – funmath
        May 5 '18 at 19:06














      20












      20








      20





      $begingroup$

      related problem: (I), (II), (III). Here is a systematic technique. In order to find $sup_0leq xleq 1 |f_n(x)-f(x)| $, you need to maximize the function $Big|fracx2n^2x^2+8Big|$ over the interval $[0,1]$. Now, let



      $$ g(x)=fracx2n^2x^2+8 implies g'(x) = frac4-n^2 x^2(2n^2x^2+8)^2=0 implies x=frac2n$$



      gives the max of the function $g(x)$ which is $g(2/n)=1/8n$. You can check this by checking the sign of $g''(x)$ which should be $< 0$. Hence we have



      $$ sup_0leq xleq 1 |f_n(x)-f(x)|= sup_0leq xleq 1 Big|fracx2n^2x^2+8Big|=frac18n < epsilon. $$






      share|cite|improve this answer











      $endgroup$



      related problem: (I), (II), (III). Here is a systematic technique. In order to find $sup_0leq xleq 1 |f_n(x)-f(x)| $, you need to maximize the function $Big|fracx2n^2x^2+8Big|$ over the interval $[0,1]$. Now, let



      $$ g(x)=fracx2n^2x^2+8 implies g'(x) = frac4-n^2 x^2(2n^2x^2+8)^2=0 implies x=frac2n$$



      gives the max of the function $g(x)$ which is $g(2/n)=1/8n$. You can check this by checking the sign of $g''(x)$ which should be $< 0$. Hence we have



      $$ sup_0leq xleq 1 |f_n(x)-f(x)|= sup_0leq xleq 1 Big|fracx2n^2x^2+8Big|=frac18n < epsilon. $$







      share|cite|improve this answer














      share|cite|improve this answer



      share|cite|improve this answer








      edited Aug 23 '17 at 5:20









      Mathlover

      3,6381122




      3,6381122










      answered Apr 23 '13 at 5:47









      Mhenni BenghorbalMhenni Benghorbal

      43.3k63775




      43.3k63775











      • $begingroup$
        Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
        $endgroup$
        – funmath
        May 5 '18 at 19:06

















      • $begingroup$
        Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
        $endgroup$
        – funmath
        May 5 '18 at 19:06
















      $begingroup$
      Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
      $endgroup$
      – funmath
      May 5 '18 at 19:06





      $begingroup$
      Using your technique, which I have seen in three posts already, how would you apply it to a sequence of functions of this form: $f_n(x)=x^1+frac12n-1$
      $endgroup$
      – funmath
      May 5 '18 at 19:06












      7












      $begingroup$

      You can write
      $$f_n(x)=1over n g(n>x)qquad(0leq xleq 1)$$
      with
      $$g(t)=tover 2t^2+8qquad(0leq t<infty) .$$
      Since $g(t)$ converges to $0$ for $ttoinfty$ we already can say that $g$ is bounded. A quantitative estimate can be obtained as follows: For $t>0$ one has
      $$0<g(t)=1over 8 2overtover 2+2over tleq1over 8 .$$
      Therefore we now have
      $$|f_n(x)|leq1over 8nqquad(ngeq1, 0leq xleq1) ,$$
      which shows that the $f_n$ converge uniformly to $0$ on $[0,1]$.






      share|cite|improve this answer









      $endgroup$

















        7












        $begingroup$

        You can write
        $$f_n(x)=1over n g(n>x)qquad(0leq xleq 1)$$
        with
        $$g(t)=tover 2t^2+8qquad(0leq t<infty) .$$
        Since $g(t)$ converges to $0$ for $ttoinfty$ we already can say that $g$ is bounded. A quantitative estimate can be obtained as follows: For $t>0$ one has
        $$0<g(t)=1over 8 2overtover 2+2over tleq1over 8 .$$
        Therefore we now have
        $$|f_n(x)|leq1over 8nqquad(ngeq1, 0leq xleq1) ,$$
        which shows that the $f_n$ converge uniformly to $0$ on $[0,1]$.






        share|cite|improve this answer









        $endgroup$















          7












          7








          7





          $begingroup$

          You can write
          $$f_n(x)=1over n g(n>x)qquad(0leq xleq 1)$$
          with
          $$g(t)=tover 2t^2+8qquad(0leq t<infty) .$$
          Since $g(t)$ converges to $0$ for $ttoinfty$ we already can say that $g$ is bounded. A quantitative estimate can be obtained as follows: For $t>0$ one has
          $$0<g(t)=1over 8 2overtover 2+2over tleq1over 8 .$$
          Therefore we now have
          $$|f_n(x)|leq1over 8nqquad(ngeq1, 0leq xleq1) ,$$
          which shows that the $f_n$ converge uniformly to $0$ on $[0,1]$.






          share|cite|improve this answer









          $endgroup$



          You can write
          $$f_n(x)=1over n g(n>x)qquad(0leq xleq 1)$$
          with
          $$g(t)=tover 2t^2+8qquad(0leq t<infty) .$$
          Since $g(t)$ converges to $0$ for $ttoinfty$ we already can say that $g$ is bounded. A quantitative estimate can be obtained as follows: For $t>0$ one has
          $$0<g(t)=1over 8 2overtover 2+2over tleq1over 8 .$$
          Therefore we now have
          $$|f_n(x)|leq1over 8nqquad(ngeq1, 0leq xleq1) ,$$
          which shows that the $f_n$ converge uniformly to $0$ on $[0,1]$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Aug 4 '13 at 11:58









          Christian BlatterChristian Blatter

          176k9115328




          176k9115328





















              6












              $begingroup$

              Another way to maximize :



              $dfracx2n^2x^2+8leq dfracx8nx=dfrac18n$ where we used the AM-GM inequality
              :http://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means to show



              $dfrac2n^2x^2+82 geq sqrt 2n^2x^2 cdot 8 $ Applying this easy inequality is often a good first way to find a supremum for the function if you have a summation involved.
              So since the function converges pointwise to $f(x)=0$ We have the following result:



              $lim_n to inftysup_0leq xleq 1 |f_n(x)-f(x)|=lim_n to infty|dfrac18n|=0$






              share|cite|improve this answer









              $endgroup$

















                6












                $begingroup$

                Another way to maximize :



                $dfracx2n^2x^2+8leq dfracx8nx=dfrac18n$ where we used the AM-GM inequality
                :http://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means to show



                $dfrac2n^2x^2+82 geq sqrt 2n^2x^2 cdot 8 $ Applying this easy inequality is often a good first way to find a supremum for the function if you have a summation involved.
                So since the function converges pointwise to $f(x)=0$ We have the following result:



                $lim_n to inftysup_0leq xleq 1 |f_n(x)-f(x)|=lim_n to infty|dfrac18n|=0$






                share|cite|improve this answer









                $endgroup$















                  6












                  6








                  6





                  $begingroup$

                  Another way to maximize :



                  $dfracx2n^2x^2+8leq dfracx8nx=dfrac18n$ where we used the AM-GM inequality
                  :http://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means to show



                  $dfrac2n^2x^2+82 geq sqrt 2n^2x^2 cdot 8 $ Applying this easy inequality is often a good first way to find a supremum for the function if you have a summation involved.
                  So since the function converges pointwise to $f(x)=0$ We have the following result:



                  $lim_n to inftysup_0leq xleq 1 |f_n(x)-f(x)|=lim_n to infty|dfrac18n|=0$






                  share|cite|improve this answer









                  $endgroup$



                  Another way to maximize :



                  $dfracx2n^2x^2+8leq dfracx8nx=dfrac18n$ where we used the AM-GM inequality
                  :http://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means to show



                  $dfrac2n^2x^2+82 geq sqrt 2n^2x^2 cdot 8 $ Applying this easy inequality is often a good first way to find a supremum for the function if you have a summation involved.
                  So since the function converges pointwise to $f(x)=0$ We have the following result:



                  $lim_n to inftysup_0leq xleq 1 |f_n(x)-f(x)|=lim_n to infty|dfrac18n|=0$







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jul 20 '13 at 12:48









                  sigmatausigmatau

                  1,7551924




                  1,7551924





















                      0












                      $begingroup$

                      Pointwise convergence is not enough to say that the function converges uniformly. Here, $$f_n(x)= fracx2n^2x^2+8,x in [0,1]$$ has pointwise convergence to $f(x)=0$, so by definition $$|f_n(x)-f(x)|=bigg|fracx2n^2x^2+8-0bigg|= bigg|fracx2n^2x^2+8bigg|< frac12n$$
                      This shows that that the function is not uniformly convergent.






                      share|cite|improve this answer











                      $endgroup$












                      • $begingroup$
                        Please read this tutorial on how to typeset mathematics on this site.
                        $endgroup$
                        – N. F. Taussig
                        Jan 19 '16 at 17:00















                      0












                      $begingroup$

                      Pointwise convergence is not enough to say that the function converges uniformly. Here, $$f_n(x)= fracx2n^2x^2+8,x in [0,1]$$ has pointwise convergence to $f(x)=0$, so by definition $$|f_n(x)-f(x)|=bigg|fracx2n^2x^2+8-0bigg|= bigg|fracx2n^2x^2+8bigg|< frac12n$$
                      This shows that that the function is not uniformly convergent.






                      share|cite|improve this answer











                      $endgroup$












                      • $begingroup$
                        Please read this tutorial on how to typeset mathematics on this site.
                        $endgroup$
                        – N. F. Taussig
                        Jan 19 '16 at 17:00













                      0












                      0








                      0





                      $begingroup$

                      Pointwise convergence is not enough to say that the function converges uniformly. Here, $$f_n(x)= fracx2n^2x^2+8,x in [0,1]$$ has pointwise convergence to $f(x)=0$, so by definition $$|f_n(x)-f(x)|=bigg|fracx2n^2x^2+8-0bigg|= bigg|fracx2n^2x^2+8bigg|< frac12n$$
                      This shows that that the function is not uniformly convergent.






                      share|cite|improve this answer











                      $endgroup$



                      Pointwise convergence is not enough to say that the function converges uniformly. Here, $$f_n(x)= fracx2n^2x^2+8,x in [0,1]$$ has pointwise convergence to $f(x)=0$, so by definition $$|f_n(x)-f(x)|=bigg|fracx2n^2x^2+8-0bigg|= bigg|fracx2n^2x^2+8bigg|< frac12n$$
                      This shows that that the function is not uniformly convergent.







                      share|cite|improve this answer














                      share|cite|improve this answer



                      share|cite|improve this answer








                      edited Nov 27 '16 at 2:01









                      Antinous

                      5,85342453




                      5,85342453










                      answered Jan 19 '16 at 16:54









                      Umer SharifUmer Sharif

                      1




                      1











                      • $begingroup$
                        Please read this tutorial on how to typeset mathematics on this site.
                        $endgroup$
                        – N. F. Taussig
                        Jan 19 '16 at 17:00
















                      • $begingroup$
                        Please read this tutorial on how to typeset mathematics on this site.
                        $endgroup$
                        – N. F. Taussig
                        Jan 19 '16 at 17:00















                      $begingroup$
                      Please read this tutorial on how to typeset mathematics on this site.
                      $endgroup$
                      – N. F. Taussig
                      Jan 19 '16 at 17:00




                      $begingroup$
                      Please read this tutorial on how to typeset mathematics on this site.
                      $endgroup$
                      – N. F. Taussig
                      Jan 19 '16 at 17:00

















                      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%2f370023%2fhow-to-prove-a-sequence-of-a-function-converges-uniformly%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

                      How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

                      random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

                      Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye