Uniform convergence of $f_n(x) = sqrt{x^2 + frac{1}{n^2}}$, solution verification












0












$begingroup$


Is my reasoning right? I have $f_n(x) = sqrt{x^2 + frac{1}{n^2}}$ for $x in mathbb{R}$, so I conclude that it's pointwise convergent $f_n to |x|$, and moreover it's uniformly convergent to $|x|$, because $left | sqrt{x^2 + frac{1}{n^2}}- |x| right | = frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2} to 0$



That's because $sqrt{x^2 + frac{1}{n^2}} to |x|$ and it's decreasing for any $x in mathbb{R}$, therefore I can make denominator smaller by $sqrt{x^2 + frac{1}{n^2}} leq |x|$, so I'd get in denominator $n^2 2|x|$ and if $|x| > frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{1}{n^2}$, otherwise if $|x| leq frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{2|x|}{n^22|x|} = frac{1}{n^2}$










share|cite|improve this question









$endgroup$












  • $begingroup$
    Yes, correct. $quad quad quad$
    $endgroup$
    – Rebellos
    Dec 18 '18 at 21:21






  • 1




    $begingroup$
    There is a mistake, note that $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n}$$ That is: you want to make the denominator as small as possible to bound the fraction above. The maximum happen when $x=0$, hence the above inequality
    $endgroup$
    – Masacroso
    Dec 18 '18 at 21:23








  • 2




    $begingroup$
    The bounds $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2}$$ and, if $|x| leq frac{1}{2}$, $$frac{1}{n^22|x|} leq frac{1}{n^2}$$ both fail to hold.
    $endgroup$
    – Did
    Dec 18 '18 at 21:25










  • $begingroup$
    @Did Right, when $|x| leq frac{1}{2}$, then $2|x| leq 1$, so $frac{1}{n^2 2|x|} = frac{1}{n} cdot frac{1}{n2|x|} leq frac{1}{n} to 0$, because $n2|x| geq 1$ for fixed $n$ and for every $|x| leq frac{1}{2}$ without $0$, we can check as a special case that for $x=0$ boundary holds too, daym I did it too fast and got that mistake
    $endgroup$
    – chandx
    Dec 18 '18 at 22:11










  • $begingroup$
    "because n2|x|≥1 for fixed n and for every |x|≤12 without 0" ?? Well, no.
    $endgroup$
    – Did
    Dec 18 '18 at 22:15
















0












$begingroup$


Is my reasoning right? I have $f_n(x) = sqrt{x^2 + frac{1}{n^2}}$ for $x in mathbb{R}$, so I conclude that it's pointwise convergent $f_n to |x|$, and moreover it's uniformly convergent to $|x|$, because $left | sqrt{x^2 + frac{1}{n^2}}- |x| right | = frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2} to 0$



That's because $sqrt{x^2 + frac{1}{n^2}} to |x|$ and it's decreasing for any $x in mathbb{R}$, therefore I can make denominator smaller by $sqrt{x^2 + frac{1}{n^2}} leq |x|$, so I'd get in denominator $n^2 2|x|$ and if $|x| > frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{1}{n^2}$, otherwise if $|x| leq frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{2|x|}{n^22|x|} = frac{1}{n^2}$










share|cite|improve this question









$endgroup$












  • $begingroup$
    Yes, correct. $quad quad quad$
    $endgroup$
    – Rebellos
    Dec 18 '18 at 21:21






  • 1




    $begingroup$
    There is a mistake, note that $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n}$$ That is: you want to make the denominator as small as possible to bound the fraction above. The maximum happen when $x=0$, hence the above inequality
    $endgroup$
    – Masacroso
    Dec 18 '18 at 21:23








  • 2




    $begingroup$
    The bounds $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2}$$ and, if $|x| leq frac{1}{2}$, $$frac{1}{n^22|x|} leq frac{1}{n^2}$$ both fail to hold.
    $endgroup$
    – Did
    Dec 18 '18 at 21:25










  • $begingroup$
    @Did Right, when $|x| leq frac{1}{2}$, then $2|x| leq 1$, so $frac{1}{n^2 2|x|} = frac{1}{n} cdot frac{1}{n2|x|} leq frac{1}{n} to 0$, because $n2|x| geq 1$ for fixed $n$ and for every $|x| leq frac{1}{2}$ without $0$, we can check as a special case that for $x=0$ boundary holds too, daym I did it too fast and got that mistake
    $endgroup$
    – chandx
    Dec 18 '18 at 22:11










  • $begingroup$
    "because n2|x|≥1 for fixed n and for every |x|≤12 without 0" ?? Well, no.
    $endgroup$
    – Did
    Dec 18 '18 at 22:15














0












0








0





$begingroup$


Is my reasoning right? I have $f_n(x) = sqrt{x^2 + frac{1}{n^2}}$ for $x in mathbb{R}$, so I conclude that it's pointwise convergent $f_n to |x|$, and moreover it's uniformly convergent to $|x|$, because $left | sqrt{x^2 + frac{1}{n^2}}- |x| right | = frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2} to 0$



That's because $sqrt{x^2 + frac{1}{n^2}} to |x|$ and it's decreasing for any $x in mathbb{R}$, therefore I can make denominator smaller by $sqrt{x^2 + frac{1}{n^2}} leq |x|$, so I'd get in denominator $n^2 2|x|$ and if $|x| > frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{1}{n^2}$, otherwise if $|x| leq frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{2|x|}{n^22|x|} = frac{1}{n^2}$










share|cite|improve this question









$endgroup$




Is my reasoning right? I have $f_n(x) = sqrt{x^2 + frac{1}{n^2}}$ for $x in mathbb{R}$, so I conclude that it's pointwise convergent $f_n to |x|$, and moreover it's uniformly convergent to $|x|$, because $left | sqrt{x^2 + frac{1}{n^2}}- |x| right | = frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2} to 0$



That's because $sqrt{x^2 + frac{1}{n^2}} to |x|$ and it's decreasing for any $x in mathbb{R}$, therefore I can make denominator smaller by $sqrt{x^2 + frac{1}{n^2}} leq |x|$, so I'd get in denominator $n^2 2|x|$ and if $|x| > frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{1}{n^2}$, otherwise if $|x| leq frac{1}{2}$ then $frac{1}{n^22|x|} leq frac{2|x|}{n^22|x|} = frac{1}{n^2}$







proof-verification uniform-convergence sequence-of-function






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 18 '18 at 21:16









chandxchandx

628




628












  • $begingroup$
    Yes, correct. $quad quad quad$
    $endgroup$
    – Rebellos
    Dec 18 '18 at 21:21






  • 1




    $begingroup$
    There is a mistake, note that $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n}$$ That is: you want to make the denominator as small as possible to bound the fraction above. The maximum happen when $x=0$, hence the above inequality
    $endgroup$
    – Masacroso
    Dec 18 '18 at 21:23








  • 2




    $begingroup$
    The bounds $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2}$$ and, if $|x| leq frac{1}{2}$, $$frac{1}{n^22|x|} leq frac{1}{n^2}$$ both fail to hold.
    $endgroup$
    – Did
    Dec 18 '18 at 21:25










  • $begingroup$
    @Did Right, when $|x| leq frac{1}{2}$, then $2|x| leq 1$, so $frac{1}{n^2 2|x|} = frac{1}{n} cdot frac{1}{n2|x|} leq frac{1}{n} to 0$, because $n2|x| geq 1$ for fixed $n$ and for every $|x| leq frac{1}{2}$ without $0$, we can check as a special case that for $x=0$ boundary holds too, daym I did it too fast and got that mistake
    $endgroup$
    – chandx
    Dec 18 '18 at 22:11










  • $begingroup$
    "because n2|x|≥1 for fixed n and for every |x|≤12 without 0" ?? Well, no.
    $endgroup$
    – Did
    Dec 18 '18 at 22:15


















  • $begingroup$
    Yes, correct. $quad quad quad$
    $endgroup$
    – Rebellos
    Dec 18 '18 at 21:21






  • 1




    $begingroup$
    There is a mistake, note that $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n}$$ That is: you want to make the denominator as small as possible to bound the fraction above. The maximum happen when $x=0$, hence the above inequality
    $endgroup$
    – Masacroso
    Dec 18 '18 at 21:23








  • 2




    $begingroup$
    The bounds $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2}$$ and, if $|x| leq frac{1}{2}$, $$frac{1}{n^22|x|} leq frac{1}{n^2}$$ both fail to hold.
    $endgroup$
    – Did
    Dec 18 '18 at 21:25










  • $begingroup$
    @Did Right, when $|x| leq frac{1}{2}$, then $2|x| leq 1$, so $frac{1}{n^2 2|x|} = frac{1}{n} cdot frac{1}{n2|x|} leq frac{1}{n} to 0$, because $n2|x| geq 1$ for fixed $n$ and for every $|x| leq frac{1}{2}$ without $0$, we can check as a special case that for $x=0$ boundary holds too, daym I did it too fast and got that mistake
    $endgroup$
    – chandx
    Dec 18 '18 at 22:11










  • $begingroup$
    "because n2|x|≥1 for fixed n and for every |x|≤12 without 0" ?? Well, no.
    $endgroup$
    – Did
    Dec 18 '18 at 22:15
















$begingroup$
Yes, correct. $quad quad quad$
$endgroup$
– Rebellos
Dec 18 '18 at 21:21




$begingroup$
Yes, correct. $quad quad quad$
$endgroup$
– Rebellos
Dec 18 '18 at 21:21




1




1




$begingroup$
There is a mistake, note that $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n}$$ That is: you want to make the denominator as small as possible to bound the fraction above. The maximum happen when $x=0$, hence the above inequality
$endgroup$
– Masacroso
Dec 18 '18 at 21:23






$begingroup$
There is a mistake, note that $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n}$$ That is: you want to make the denominator as small as possible to bound the fraction above. The maximum happen when $x=0$, hence the above inequality
$endgroup$
– Masacroso
Dec 18 '18 at 21:23






2




2




$begingroup$
The bounds $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2}$$ and, if $|x| leq frac{1}{2}$, $$frac{1}{n^22|x|} leq frac{1}{n^2}$$ both fail to hold.
$endgroup$
– Did
Dec 18 '18 at 21:25




$begingroup$
The bounds $$frac{1}{n^2 left ( sqrt{x^2 + frac{1}{n^2}} + |x| right )} leq frac{1}{n^2}$$ and, if $|x| leq frac{1}{2}$, $$frac{1}{n^22|x|} leq frac{1}{n^2}$$ both fail to hold.
$endgroup$
– Did
Dec 18 '18 at 21:25












$begingroup$
@Did Right, when $|x| leq frac{1}{2}$, then $2|x| leq 1$, so $frac{1}{n^2 2|x|} = frac{1}{n} cdot frac{1}{n2|x|} leq frac{1}{n} to 0$, because $n2|x| geq 1$ for fixed $n$ and for every $|x| leq frac{1}{2}$ without $0$, we can check as a special case that for $x=0$ boundary holds too, daym I did it too fast and got that mistake
$endgroup$
– chandx
Dec 18 '18 at 22:11




$begingroup$
@Did Right, when $|x| leq frac{1}{2}$, then $2|x| leq 1$, so $frac{1}{n^2 2|x|} = frac{1}{n} cdot frac{1}{n2|x|} leq frac{1}{n} to 0$, because $n2|x| geq 1$ for fixed $n$ and for every $|x| leq frac{1}{2}$ without $0$, we can check as a special case that for $x=0$ boundary holds too, daym I did it too fast and got that mistake
$endgroup$
– chandx
Dec 18 '18 at 22:11












$begingroup$
"because n2|x|≥1 for fixed n and for every |x|≤12 without 0" ?? Well, no.
$endgroup$
– Did
Dec 18 '18 at 22:15




$begingroup$
"because n2|x|≥1 for fixed n and for every |x|≤12 without 0" ?? Well, no.
$endgroup$
– Did
Dec 18 '18 at 22:15










1 Answer
1






active

oldest

votes


















1












$begingroup$

A simpler way to proceed: If $a,bge 0,$ then $sqrt {a+b}-sqrt a le sqrt b.$ Proof: Move $sqrt a$ to the other side and square. It follows that



$$sqrt {x^2+1/n^2} -sqrt {x^2} le sqrt {1/n^2} = 1/n.$$






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%2f3045709%2funiform-convergence-of-f-nx-sqrtx2-frac1n2-solution-verificat%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    A simpler way to proceed: If $a,bge 0,$ then $sqrt {a+b}-sqrt a le sqrt b.$ Proof: Move $sqrt a$ to the other side and square. It follows that



    $$sqrt {x^2+1/n^2} -sqrt {x^2} le sqrt {1/n^2} = 1/n.$$






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      A simpler way to proceed: If $a,bge 0,$ then $sqrt {a+b}-sqrt a le sqrt b.$ Proof: Move $sqrt a$ to the other side and square. It follows that



      $$sqrt {x^2+1/n^2} -sqrt {x^2} le sqrt {1/n^2} = 1/n.$$






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        A simpler way to proceed: If $a,bge 0,$ then $sqrt {a+b}-sqrt a le sqrt b.$ Proof: Move $sqrt a$ to the other side and square. It follows that



        $$sqrt {x^2+1/n^2} -sqrt {x^2} le sqrt {1/n^2} = 1/n.$$






        share|cite|improve this answer









        $endgroup$



        A simpler way to proceed: If $a,bge 0,$ then $sqrt {a+b}-sqrt a le sqrt b.$ Proof: Move $sqrt a$ to the other side and square. It follows that



        $$sqrt {x^2+1/n^2} -sqrt {x^2} le sqrt {1/n^2} = 1/n.$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 18 '18 at 21:47









        zhw.zhw.

        72.2k43175




        72.2k43175






























            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%2f3045709%2funiform-convergence-of-f-nx-sqrtx2-frac1n2-solution-verificat%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

            Cabo Verde

            Gyllenstierna

            Albrecht Dürer