Can we approximate a $C_0(mathbb R)$-function by $C_c^infty(mathbb R)$-functions?











up vote
1
down vote

favorite












Let $C_0(mathbb R)$ denote the closure of $C_c(mathbb R)$ with respect to the supremum norm.



Are we able to show that the closure of $C_c^infty(mathbb R)$ with respect to the supremum norm is $C_0(mathbb R)$?










share|cite|improve this question




















  • 1




    Functions in $C_c(mathbb R)$ can be approximated uniformly by smooth functions via mollification.
    – gerw
    Nov 23 at 11:50










  • This is related
    – Giuseppe Negro
    Nov 23 at 11:55















up vote
1
down vote

favorite












Let $C_0(mathbb R)$ denote the closure of $C_c(mathbb R)$ with respect to the supremum norm.



Are we able to show that the closure of $C_c^infty(mathbb R)$ with respect to the supremum norm is $C_0(mathbb R)$?










share|cite|improve this question




















  • 1




    Functions in $C_c(mathbb R)$ can be approximated uniformly by smooth functions via mollification.
    – gerw
    Nov 23 at 11:50










  • This is related
    – Giuseppe Negro
    Nov 23 at 11:55













up vote
1
down vote

favorite









up vote
1
down vote

favorite











Let $C_0(mathbb R)$ denote the closure of $C_c(mathbb R)$ with respect to the supremum norm.



Are we able to show that the closure of $C_c^infty(mathbb R)$ with respect to the supremum norm is $C_0(mathbb R)$?










share|cite|improve this question















Let $C_0(mathbb R)$ denote the closure of $C_c(mathbb R)$ with respect to the supremum norm.



Are we able to show that the closure of $C_c^infty(mathbb R)$ with respect to the supremum norm is $C_0(mathbb R)$?







functional-analysis analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 23 at 12:43

























asked Nov 23 at 11:40









0xbadf00d

1,71041429




1,71041429








  • 1




    Functions in $C_c(mathbb R)$ can be approximated uniformly by smooth functions via mollification.
    – gerw
    Nov 23 at 11:50










  • This is related
    – Giuseppe Negro
    Nov 23 at 11:55














  • 1




    Functions in $C_c(mathbb R)$ can be approximated uniformly by smooth functions via mollification.
    – gerw
    Nov 23 at 11:50










  • This is related
    – Giuseppe Negro
    Nov 23 at 11:55








1




1




Functions in $C_c(mathbb R)$ can be approximated uniformly by smooth functions via mollification.
– gerw
Nov 23 at 11:50




Functions in $C_c(mathbb R)$ can be approximated uniformly by smooth functions via mollification.
– gerw
Nov 23 at 11:50












This is related
– Giuseppe Negro
Nov 23 at 11:55




This is related
– Giuseppe Negro
Nov 23 at 11:55










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Let $f in C_0(mathbb R)$ and $epsilon >0$. There exists $M>0$ such that $|f(x)| <epsilon $ for $|x|>M$. There exists a polynomial $p$ such that $|f(x)-p(x)| <epsilon$ for $|x| leq M+1$. There exists a function $g in C_c(mathbb R)$ such that $0leq g(x)leq 1$ for all $x$ , $g(x)=1$ if $|x| leq M$ and $g(x)=0$ if $|x| >M+epsilon$. Let $h=pg$. Then $h in C_c(mathbb R)$, $$|f(x)-p(x)g(x)|=|f(x)-p(x)|<epsilon$$ for $|x| leq M$. For $|x| >M+epsilon$ we have $$|f(x)-p(x)g(x)|=|f(x)| <epsilon$$. Finally, for $Mleq |x| leq M+epsilon$ we have $$|f(x)-p(x)g(x)|leq epsilon+ |p(x)-p(x)g(x)| leq epsilon+ |p(x)|$$ (because $0leq 1-g(x) leq 1$) and $|p(x)|<epsilon +|f(x)| <2epsilon$. Remark: I just realized that I could have replaced $(M,M+epsilon) $ by $(M,M+1)$ but that is only a minor point).






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',
    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%2f3010257%2fcan-we-approximate-a-c-0-mathbb-r-function-by-c-c-infty-mathbb-r-functi%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
    0
    down vote













    Let $f in C_0(mathbb R)$ and $epsilon >0$. There exists $M>0$ such that $|f(x)| <epsilon $ for $|x|>M$. There exists a polynomial $p$ such that $|f(x)-p(x)| <epsilon$ for $|x| leq M+1$. There exists a function $g in C_c(mathbb R)$ such that $0leq g(x)leq 1$ for all $x$ , $g(x)=1$ if $|x| leq M$ and $g(x)=0$ if $|x| >M+epsilon$. Let $h=pg$. Then $h in C_c(mathbb R)$, $$|f(x)-p(x)g(x)|=|f(x)-p(x)|<epsilon$$ for $|x| leq M$. For $|x| >M+epsilon$ we have $$|f(x)-p(x)g(x)|=|f(x)| <epsilon$$. Finally, for $Mleq |x| leq M+epsilon$ we have $$|f(x)-p(x)g(x)|leq epsilon+ |p(x)-p(x)g(x)| leq epsilon+ |p(x)|$$ (because $0leq 1-g(x) leq 1$) and $|p(x)|<epsilon +|f(x)| <2epsilon$. Remark: I just realized that I could have replaced $(M,M+epsilon) $ by $(M,M+1)$ but that is only a minor point).






    share|cite|improve this answer

























      up vote
      0
      down vote













      Let $f in C_0(mathbb R)$ and $epsilon >0$. There exists $M>0$ such that $|f(x)| <epsilon $ for $|x|>M$. There exists a polynomial $p$ such that $|f(x)-p(x)| <epsilon$ for $|x| leq M+1$. There exists a function $g in C_c(mathbb R)$ such that $0leq g(x)leq 1$ for all $x$ , $g(x)=1$ if $|x| leq M$ and $g(x)=0$ if $|x| >M+epsilon$. Let $h=pg$. Then $h in C_c(mathbb R)$, $$|f(x)-p(x)g(x)|=|f(x)-p(x)|<epsilon$$ for $|x| leq M$. For $|x| >M+epsilon$ we have $$|f(x)-p(x)g(x)|=|f(x)| <epsilon$$. Finally, for $Mleq |x| leq M+epsilon$ we have $$|f(x)-p(x)g(x)|leq epsilon+ |p(x)-p(x)g(x)| leq epsilon+ |p(x)|$$ (because $0leq 1-g(x) leq 1$) and $|p(x)|<epsilon +|f(x)| <2epsilon$. Remark: I just realized that I could have replaced $(M,M+epsilon) $ by $(M,M+1)$ but that is only a minor point).






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        Let $f in C_0(mathbb R)$ and $epsilon >0$. There exists $M>0$ such that $|f(x)| <epsilon $ for $|x|>M$. There exists a polynomial $p$ such that $|f(x)-p(x)| <epsilon$ for $|x| leq M+1$. There exists a function $g in C_c(mathbb R)$ such that $0leq g(x)leq 1$ for all $x$ , $g(x)=1$ if $|x| leq M$ and $g(x)=0$ if $|x| >M+epsilon$. Let $h=pg$. Then $h in C_c(mathbb R)$, $$|f(x)-p(x)g(x)|=|f(x)-p(x)|<epsilon$$ for $|x| leq M$. For $|x| >M+epsilon$ we have $$|f(x)-p(x)g(x)|=|f(x)| <epsilon$$. Finally, for $Mleq |x| leq M+epsilon$ we have $$|f(x)-p(x)g(x)|leq epsilon+ |p(x)-p(x)g(x)| leq epsilon+ |p(x)|$$ (because $0leq 1-g(x) leq 1$) and $|p(x)|<epsilon +|f(x)| <2epsilon$. Remark: I just realized that I could have replaced $(M,M+epsilon) $ by $(M,M+1)$ but that is only a minor point).






        share|cite|improve this answer












        Let $f in C_0(mathbb R)$ and $epsilon >0$. There exists $M>0$ such that $|f(x)| <epsilon $ for $|x|>M$. There exists a polynomial $p$ such that $|f(x)-p(x)| <epsilon$ for $|x| leq M+1$. There exists a function $g in C_c(mathbb R)$ such that $0leq g(x)leq 1$ for all $x$ , $g(x)=1$ if $|x| leq M$ and $g(x)=0$ if $|x| >M+epsilon$. Let $h=pg$. Then $h in C_c(mathbb R)$, $$|f(x)-p(x)g(x)|=|f(x)-p(x)|<epsilon$$ for $|x| leq M$. For $|x| >M+epsilon$ we have $$|f(x)-p(x)g(x)|=|f(x)| <epsilon$$. Finally, for $Mleq |x| leq M+epsilon$ we have $$|f(x)-p(x)g(x)|leq epsilon+ |p(x)-p(x)g(x)| leq epsilon+ |p(x)|$$ (because $0leq 1-g(x) leq 1$) and $|p(x)|<epsilon +|f(x)| <2epsilon$. Remark: I just realized that I could have replaced $(M,M+epsilon) $ by $(M,M+1)$ but that is only a minor point).







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 23 at 12:01









        Kavi Rama Murthy

        47.7k31854




        47.7k31854






























            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%2f3010257%2fcan-we-approximate-a-c-0-mathbb-r-function-by-c-c-infty-mathbb-r-functi%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