The space $(C[a,b],rho_{p})$ is Incomplete proof











up vote
2
down vote

favorite












I have difficulty understanding this proof of Shilov's book, Elementary Functional Analysis Elementary Functional Analysis by Georgi E. Shilov. P.35



Here is my trial to understand the proof.
Given an $epsilon > 0$ and a sequence ${ y_n}$ where $y_n(x) rightarrow 0$ uniformally on $[a,c-epsilon]$ and $y_n(x) rightarrow 1$ uniformly on $[c+epsilon,b]$ then,
consider the distance between $y_m(x)$ and $y_n(x)$ and for sufficiently large $m,n$ we have $rho^{p}(y_m(x),y_n(x)) = int_{a}^{c-epsilon} 0 dx +int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} dx + int_{c+epsilon}^{b}0 dx = int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} leq int_{c-epsilon}^{c+epsilon} 1 dx = 2epsilon$ then indeed ${y_n(x)}$ is a cauchy sequence on $[a,b]$.



Question. Why $rho^{p}(y_m(x),y_n(x)) leq 4epsilon$?










share|cite|improve this question




















  • 2




    $y_m,y_n$ need not equal on $[a,c-epsilon]$ (and $[c+epsilon,b]$), so you need two $epsilon$s to help you there.
    – user10354138
    Nov 9 at 9:29















up vote
2
down vote

favorite












I have difficulty understanding this proof of Shilov's book, Elementary Functional Analysis Elementary Functional Analysis by Georgi E. Shilov. P.35



Here is my trial to understand the proof.
Given an $epsilon > 0$ and a sequence ${ y_n}$ where $y_n(x) rightarrow 0$ uniformally on $[a,c-epsilon]$ and $y_n(x) rightarrow 1$ uniformly on $[c+epsilon,b]$ then,
consider the distance between $y_m(x)$ and $y_n(x)$ and for sufficiently large $m,n$ we have $rho^{p}(y_m(x),y_n(x)) = int_{a}^{c-epsilon} 0 dx +int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} dx + int_{c+epsilon}^{b}0 dx = int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} leq int_{c-epsilon}^{c+epsilon} 1 dx = 2epsilon$ then indeed ${y_n(x)}$ is a cauchy sequence on $[a,b]$.



Question. Why $rho^{p}(y_m(x),y_n(x)) leq 4epsilon$?










share|cite|improve this question




















  • 2




    $y_m,y_n$ need not equal on $[a,c-epsilon]$ (and $[c+epsilon,b]$), so you need two $epsilon$s to help you there.
    – user10354138
    Nov 9 at 9:29













up vote
2
down vote

favorite









up vote
2
down vote

favorite











I have difficulty understanding this proof of Shilov's book, Elementary Functional Analysis Elementary Functional Analysis by Georgi E. Shilov. P.35



Here is my trial to understand the proof.
Given an $epsilon > 0$ and a sequence ${ y_n}$ where $y_n(x) rightarrow 0$ uniformally on $[a,c-epsilon]$ and $y_n(x) rightarrow 1$ uniformly on $[c+epsilon,b]$ then,
consider the distance between $y_m(x)$ and $y_n(x)$ and for sufficiently large $m,n$ we have $rho^{p}(y_m(x),y_n(x)) = int_{a}^{c-epsilon} 0 dx +int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} dx + int_{c+epsilon}^{b}0 dx = int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} leq int_{c-epsilon}^{c+epsilon} 1 dx = 2epsilon$ then indeed ${y_n(x)}$ is a cauchy sequence on $[a,b]$.



Question. Why $rho^{p}(y_m(x),y_n(x)) leq 4epsilon$?










share|cite|improve this question















I have difficulty understanding this proof of Shilov's book, Elementary Functional Analysis Elementary Functional Analysis by Georgi E. Shilov. P.35



Here is my trial to understand the proof.
Given an $epsilon > 0$ and a sequence ${ y_n}$ where $y_n(x) rightarrow 0$ uniformally on $[a,c-epsilon]$ and $y_n(x) rightarrow 1$ uniformly on $[c+epsilon,b]$ then,
consider the distance between $y_m(x)$ and $y_n(x)$ and for sufficiently large $m,n$ we have $rho^{p}(y_m(x),y_n(x)) = int_{a}^{c-epsilon} 0 dx +int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} dx + int_{c+epsilon}^{b}0 dx = int_{c-epsilon}^{c+epsilon} | y_m(x)-y_n(x)|^{p} leq int_{c-epsilon}^{c+epsilon} 1 dx = 2epsilon$ then indeed ${y_n(x)}$ is a cauchy sequence on $[a,b]$.



Question. Why $rho^{p}(y_m(x),y_n(x)) leq 4epsilon$?







real-analysis functional-analysis analysis proof-explanation banach-spaces






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 21 at 18:48

























asked Nov 9 at 9:24









HybridAlien

2008




2008








  • 2




    $y_m,y_n$ need not equal on $[a,c-epsilon]$ (and $[c+epsilon,b]$), so you need two $epsilon$s to help you there.
    – user10354138
    Nov 9 at 9:29














  • 2




    $y_m,y_n$ need not equal on $[a,c-epsilon]$ (and $[c+epsilon,b]$), so you need two $epsilon$s to help you there.
    – user10354138
    Nov 9 at 9:29








2




2




$y_m,y_n$ need not equal on $[a,c-epsilon]$ (and $[c+epsilon,b]$), so you need two $epsilon$s to help you there.
– user10354138
Nov 9 at 9:29




$y_m,y_n$ need not equal on $[a,c-epsilon]$ (and $[c+epsilon,b]$), so you need two $epsilon$s to help you there.
– user10354138
Nov 9 at 9:29










1 Answer
1






active

oldest

votes

















up vote
2
down vote



accepted










I got that
in the proof he said that $y_n(x)$ is a sequence of functions taking values between $0$ and$1$,that is for each $nin N$ and $xin[a,b]$ we have $$0leq y_n(x)leq 1$$.
therefore $$|y_n(x)-y_m(x)|leq 1$$.
Now since the sequence ${y_n(x)}$ is a converges sequence in $[a,c-e]$ and$[c+e,b]$ ,then there is a natural number $N$ such that for each $n,mgeq N$ and $x in [a,c-e]$ or $xin [c+e,b]$ we have $$|y_n(x)-y_m(x)| lt ({frac{e}{b-a}})^frac 1p=T$$.
Hence $$int_{a}^{c-e}|y_n(x)-y_m(x)|^p lt int_{a}^{c-e}{T}^p=int_{a}^{c-e}frac{e}{b-a}=frac{e}{b-a}((c-e)-a) leq frac{e}{b-a}(b-a)=e$$
Similarlly we have$$int_{c+e}^{b}|y_n(x)-y_m(x)| lt e$$.
Hence
$$int_a^b |y_n(x)-y_m(x)| lt e+2e+e=4e$$






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: 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%2f2991152%2fthe-space-ca-b-rho-p-is-incomplete-proof%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








    up vote
    2
    down vote



    accepted










    I got that
    in the proof he said that $y_n(x)$ is a sequence of functions taking values between $0$ and$1$,that is for each $nin N$ and $xin[a,b]$ we have $$0leq y_n(x)leq 1$$.
    therefore $$|y_n(x)-y_m(x)|leq 1$$.
    Now since the sequence ${y_n(x)}$ is a converges sequence in $[a,c-e]$ and$[c+e,b]$ ,then there is a natural number $N$ such that for each $n,mgeq N$ and $x in [a,c-e]$ or $xin [c+e,b]$ we have $$|y_n(x)-y_m(x)| lt ({frac{e}{b-a}})^frac 1p=T$$.
    Hence $$int_{a}^{c-e}|y_n(x)-y_m(x)|^p lt int_{a}^{c-e}{T}^p=int_{a}^{c-e}frac{e}{b-a}=frac{e}{b-a}((c-e)-a) leq frac{e}{b-a}(b-a)=e$$
    Similarlly we have$$int_{c+e}^{b}|y_n(x)-y_m(x)| lt e$$.
    Hence
    $$int_a^b |y_n(x)-y_m(x)| lt e+2e+e=4e$$






    share|cite|improve this answer

























      up vote
      2
      down vote



      accepted










      I got that
      in the proof he said that $y_n(x)$ is a sequence of functions taking values between $0$ and$1$,that is for each $nin N$ and $xin[a,b]$ we have $$0leq y_n(x)leq 1$$.
      therefore $$|y_n(x)-y_m(x)|leq 1$$.
      Now since the sequence ${y_n(x)}$ is a converges sequence in $[a,c-e]$ and$[c+e,b]$ ,then there is a natural number $N$ such that for each $n,mgeq N$ and $x in [a,c-e]$ or $xin [c+e,b]$ we have $$|y_n(x)-y_m(x)| lt ({frac{e}{b-a}})^frac 1p=T$$.
      Hence $$int_{a}^{c-e}|y_n(x)-y_m(x)|^p lt int_{a}^{c-e}{T}^p=int_{a}^{c-e}frac{e}{b-a}=frac{e}{b-a}((c-e)-a) leq frac{e}{b-a}(b-a)=e$$
      Similarlly we have$$int_{c+e}^{b}|y_n(x)-y_m(x)| lt e$$.
      Hence
      $$int_a^b |y_n(x)-y_m(x)| lt e+2e+e=4e$$






      share|cite|improve this answer























        up vote
        2
        down vote



        accepted







        up vote
        2
        down vote



        accepted






        I got that
        in the proof he said that $y_n(x)$ is a sequence of functions taking values between $0$ and$1$,that is for each $nin N$ and $xin[a,b]$ we have $$0leq y_n(x)leq 1$$.
        therefore $$|y_n(x)-y_m(x)|leq 1$$.
        Now since the sequence ${y_n(x)}$ is a converges sequence in $[a,c-e]$ and$[c+e,b]$ ,then there is a natural number $N$ such that for each $n,mgeq N$ and $x in [a,c-e]$ or $xin [c+e,b]$ we have $$|y_n(x)-y_m(x)| lt ({frac{e}{b-a}})^frac 1p=T$$.
        Hence $$int_{a}^{c-e}|y_n(x)-y_m(x)|^p lt int_{a}^{c-e}{T}^p=int_{a}^{c-e}frac{e}{b-a}=frac{e}{b-a}((c-e)-a) leq frac{e}{b-a}(b-a)=e$$
        Similarlly we have$$int_{c+e}^{b}|y_n(x)-y_m(x)| lt e$$.
        Hence
        $$int_a^b |y_n(x)-y_m(x)| lt e+2e+e=4e$$






        share|cite|improve this answer












        I got that
        in the proof he said that $y_n(x)$ is a sequence of functions taking values between $0$ and$1$,that is for each $nin N$ and $xin[a,b]$ we have $$0leq y_n(x)leq 1$$.
        therefore $$|y_n(x)-y_m(x)|leq 1$$.
        Now since the sequence ${y_n(x)}$ is a converges sequence in $[a,c-e]$ and$[c+e,b]$ ,then there is a natural number $N$ such that for each $n,mgeq N$ and $x in [a,c-e]$ or $xin [c+e,b]$ we have $$|y_n(x)-y_m(x)| lt ({frac{e}{b-a}})^frac 1p=T$$.
        Hence $$int_{a}^{c-e}|y_n(x)-y_m(x)|^p lt int_{a}^{c-e}{T}^p=int_{a}^{c-e}frac{e}{b-a}=frac{e}{b-a}((c-e)-a) leq frac{e}{b-a}(b-a)=e$$
        Similarlly we have$$int_{c+e}^{b}|y_n(x)-y_m(x)| lt e$$.
        Hence
        $$int_a^b |y_n(x)-y_m(x)| lt e+2e+e=4e$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 9 at 10:49









        ehsan eskandari

        985




        985






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f2991152%2fthe-space-ca-b-rho-p-is-incomplete-proof%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

            Ellipse (mathématiques)

            Quarter-circle Tiles

            Mont Emei