Show that $lim_{rto s} |D_rf-D_sf|_p = 0,,r,,s > 0$












0














Full Question: Let $D_r$ be the dilation operator $D_rf(x) = f(rx)$ on $L^p(mathbb{R}^d),, 1 leq p < infty$. Show that $lim_{rto s} |D_rf-D_sf|_p = 0,,r,,s > 0$



I was told to use $int f(rx)dlambda^d(x) = |r|^{-d}int f(x)dlambda^d(x)$.



So I was thinking that set $s=1$, and prove $lim_{rto 1}|D_rf-D_1f|_p = lim_{rto 1}|f(rx)- f(x)| = 0$, then show this scales for all $s$. To show this I was thinking that since we know $|f-g|_p < epsilon$, where $g$ vanishes to $0$ outside a bound, then do something along the lines of $|D_rf - f|_p leq |D_rf-D_rg|_p+|D_rg-g|_p+|g-f|_p$, and $|D_rf-D_rg| = int(f(rx)-g(rx)^pdlambda^{1/p} to |r|^{-d/p}|f-g|_p < epsilon$, but I've been stuck here.










share|cite|improve this question



























    0














    Full Question: Let $D_r$ be the dilation operator $D_rf(x) = f(rx)$ on $L^p(mathbb{R}^d),, 1 leq p < infty$. Show that $lim_{rto s} |D_rf-D_sf|_p = 0,,r,,s > 0$



    I was told to use $int f(rx)dlambda^d(x) = |r|^{-d}int f(x)dlambda^d(x)$.



    So I was thinking that set $s=1$, and prove $lim_{rto 1}|D_rf-D_1f|_p = lim_{rto 1}|f(rx)- f(x)| = 0$, then show this scales for all $s$. To show this I was thinking that since we know $|f-g|_p < epsilon$, where $g$ vanishes to $0$ outside a bound, then do something along the lines of $|D_rf - f|_p leq |D_rf-D_rg|_p+|D_rg-g|_p+|g-f|_p$, and $|D_rf-D_rg| = int(f(rx)-g(rx)^pdlambda^{1/p} to |r|^{-d/p}|f-g|_p < epsilon$, but I've been stuck here.










    share|cite|improve this question

























      0












      0








      0







      Full Question: Let $D_r$ be the dilation operator $D_rf(x) = f(rx)$ on $L^p(mathbb{R}^d),, 1 leq p < infty$. Show that $lim_{rto s} |D_rf-D_sf|_p = 0,,r,,s > 0$



      I was told to use $int f(rx)dlambda^d(x) = |r|^{-d}int f(x)dlambda^d(x)$.



      So I was thinking that set $s=1$, and prove $lim_{rto 1}|D_rf-D_1f|_p = lim_{rto 1}|f(rx)- f(x)| = 0$, then show this scales for all $s$. To show this I was thinking that since we know $|f-g|_p < epsilon$, where $g$ vanishes to $0$ outside a bound, then do something along the lines of $|D_rf - f|_p leq |D_rf-D_rg|_p+|D_rg-g|_p+|g-f|_p$, and $|D_rf-D_rg| = int(f(rx)-g(rx)^pdlambda^{1/p} to |r|^{-d/p}|f-g|_p < epsilon$, but I've been stuck here.










      share|cite|improve this question













      Full Question: Let $D_r$ be the dilation operator $D_rf(x) = f(rx)$ on $L^p(mathbb{R}^d),, 1 leq p < infty$. Show that $lim_{rto s} |D_rf-D_sf|_p = 0,,r,,s > 0$



      I was told to use $int f(rx)dlambda^d(x) = |r|^{-d}int f(x)dlambda^d(x)$.



      So I was thinking that set $s=1$, and prove $lim_{rto 1}|D_rf-D_1f|_p = lim_{rto 1}|f(rx)- f(x)| = 0$, then show this scales for all $s$. To show this I was thinking that since we know $|f-g|_p < epsilon$, where $g$ vanishes to $0$ outside a bound, then do something along the lines of $|D_rf - f|_p leq |D_rf-D_rg|_p+|D_rg-g|_p+|g-f|_p$, and $|D_rf-D_rg| = int(f(rx)-g(rx)^pdlambda^{1/p} to |r|^{-d/p}|f-g|_p < epsilon$, but I've been stuck here.







      measure-theory lp-spaces






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 29 '18 at 3:00









      jefe_16jefe_16

      113




      113






















          1 Answer
          1






          active

          oldest

          votes


















          0














          Given $epsilon >0$ there exists $g in C_c(mathbb R^{d})$ such that $|f-g|<epsilon$. DCT tells you that the result is true with $g$ in place of $f$. Now $|f(rx)-f(x)| leq |g(rx)-g(x)|+|f(x)-g(x)|+|f(rx)-g(rx)|$ and $|f(rx)-g(rx)|=r^{-d} |f(x)-g(x)|$.






          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%2f3018094%2fshow-that-lim-r-to-s-d-rf-d-sf-p-0-r-s-0%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









            0














            Given $epsilon >0$ there exists $g in C_c(mathbb R^{d})$ such that $|f-g|<epsilon$. DCT tells you that the result is true with $g$ in place of $f$. Now $|f(rx)-f(x)| leq |g(rx)-g(x)|+|f(x)-g(x)|+|f(rx)-g(rx)|$ and $|f(rx)-g(rx)|=r^{-d} |f(x)-g(x)|$.






            share|cite|improve this answer


























              0














              Given $epsilon >0$ there exists $g in C_c(mathbb R^{d})$ such that $|f-g|<epsilon$. DCT tells you that the result is true with $g$ in place of $f$. Now $|f(rx)-f(x)| leq |g(rx)-g(x)|+|f(x)-g(x)|+|f(rx)-g(rx)|$ and $|f(rx)-g(rx)|=r^{-d} |f(x)-g(x)|$.






              share|cite|improve this answer
























                0












                0








                0






                Given $epsilon >0$ there exists $g in C_c(mathbb R^{d})$ such that $|f-g|<epsilon$. DCT tells you that the result is true with $g$ in place of $f$. Now $|f(rx)-f(x)| leq |g(rx)-g(x)|+|f(x)-g(x)|+|f(rx)-g(rx)|$ and $|f(rx)-g(rx)|=r^{-d} |f(x)-g(x)|$.






                share|cite|improve this answer












                Given $epsilon >0$ there exists $g in C_c(mathbb R^{d})$ such that $|f-g|<epsilon$. DCT tells you that the result is true with $g$ in place of $f$. Now $|f(rx)-f(x)| leq |g(rx)-g(x)|+|f(x)-g(x)|+|f(rx)-g(rx)|$ and $|f(rx)-g(rx)|=r^{-d} |f(x)-g(x)|$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 29 '18 at 6:09









                Kavi Rama MurthyKavi Rama Murthy

                51.8k32055




                51.8k32055






























                    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%2f3018094%2fshow-that-lim-r-to-s-d-rf-d-sf-p-0-r-s-0%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

                    Quarter-circle Tiles

                    build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

                    Mont Emei