What Soboblev embedding i could use in this case?Sobolev spaces doubtSobelev inequalityHölder's inequality and log convexity of $L^p$ normWhat is the norm of the pre-multiplication by a fixed matrix operator?Sobolev embedding theorem, inequalitiesRelation between Besov and Sobolev spaces (Littlewood-Paley-theory)Equivalence of norms on $W^1, p(I)$If $uin W^1,2(mathbb R^n)$, then $L^2^*-$norm of $u$ controlled by $L^2-$norm of $nabla u$?Comparison of Sobolev embedding for $mathbbR^n$ and a compact manifold $X^n$.An inequality in Sobolev spaces

Am I breaking OOP practice with this architecture?

How obscure is the use of 令 in 令和?

How can saying a song's name be a copyright violation?

Is it a bad idea to plug the other end of ESD strap to wall ground?

Notepad++ delete until colon for every line with replace all

files created then deleted at every second in tmp directory

How seriously should I take size and weight limits of hand luggage?

Are British MPs missing the point, with these 'Indicative Votes'?

How to travel to Japan while expressing milk?

What do you call someone who asks many questions?

What is required to make GPS signals available indoors?

What's the meaning of "Sollensaussagen"?

Do Iron Man suits sport waste management systems?

How to Prove P(a) → ∀x(P(x) ∨ ¬(x = a)) using Natural Deduction

Does int main() need a declaration on C++?

Avoiding the "not like other girls" trope?

OP Amp not amplifying audio signal

How does a dynamic QR code work?

Forgetting the musical notes while performing in concert

Was the old ablative pronoun "med" or "mēd"?

Unlock My Phone! February 2018

How do I exit BASH while loop using modulus operator?

How can a day be of 24 hours?

Why was the shrink from 8″ made only to 5.25″ and not smaller (4″ or less)



What Soboblev embedding i could use in this case?


Sobolev spaces doubtSobelev inequalityHölder's inequality and log convexity of $L^p$ normWhat is the norm of the pre-multiplication by a fixed matrix operator?Sobolev embedding theorem, inequalitiesRelation between Besov and Sobolev spaces (Littlewood-Paley-theory)Equivalence of norms on $W^1, p(I)$If $uin W^1,2(mathbb R^n)$, then $L^2^*-$norm of $u$ controlled by $L^2-$norm of $nabla u$?Comparison of Sobolev embedding for $mathbbR^n$ and a compact manifold $X^n$.An inequality in Sobolev spaces













3












$begingroup$


I'm trying to understand why this inequality is true



$$ Vert fVert_L^2^pcdot hleft(Vert fVert_inftyright) leq c Vert fVert_k+1^p cdot hleft(Vert fVert_k+1right), $$



where $ Vert cdotVert_k+1 $ denotes the usual norm of the Sobolev Space $ H^k+1(R^n) $, $ h(y) $ denotes a nondecreasing nonnegative and continuous function, c is a costant, $k geq 0 $ and $ p> 1$.



Maybe i can use an embedding theorem? which one? Can anyone please help me?










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    Looks like a key comparison needed here is between $||f||_infty$ and $||f||_k+1$. This should allow a comparison between $h ( ||f||_infty) $ and (a constant times) $h ($||f||_k+1)$. Although I am not sure why $h$ needs to be continuous. Cursorily (haven't checked the details), a candidate embedding theorem is Rellich-Kondrashov.
    $endgroup$
    – avs
    Mar 28 at 16:29







  • 2




    $begingroup$
    This can only be correct if $k+1 > n/2$ since otherwise $H^k+1$ cannot be embedded into $L^infty$. Even then it can only be true if $h$ has polynomial growth, since otherwise there are scaling problems.
    $endgroup$
    – Hans Engler
    Mar 28 at 19:25
















3












$begingroup$


I'm trying to understand why this inequality is true



$$ Vert fVert_L^2^pcdot hleft(Vert fVert_inftyright) leq c Vert fVert_k+1^p cdot hleft(Vert fVert_k+1right), $$



where $ Vert cdotVert_k+1 $ denotes the usual norm of the Sobolev Space $ H^k+1(R^n) $, $ h(y) $ denotes a nondecreasing nonnegative and continuous function, c is a costant, $k geq 0 $ and $ p> 1$.



Maybe i can use an embedding theorem? which one? Can anyone please help me?










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    Looks like a key comparison needed here is between $||f||_infty$ and $||f||_k+1$. This should allow a comparison between $h ( ||f||_infty) $ and (a constant times) $h ($||f||_k+1)$. Although I am not sure why $h$ needs to be continuous. Cursorily (haven't checked the details), a candidate embedding theorem is Rellich-Kondrashov.
    $endgroup$
    – avs
    Mar 28 at 16:29







  • 2




    $begingroup$
    This can only be correct if $k+1 > n/2$ since otherwise $H^k+1$ cannot be embedded into $L^infty$. Even then it can only be true if $h$ has polynomial growth, since otherwise there are scaling problems.
    $endgroup$
    – Hans Engler
    Mar 28 at 19:25














3












3








3


1



$begingroup$


I'm trying to understand why this inequality is true



$$ Vert fVert_L^2^pcdot hleft(Vert fVert_inftyright) leq c Vert fVert_k+1^p cdot hleft(Vert fVert_k+1right), $$



where $ Vert cdotVert_k+1 $ denotes the usual norm of the Sobolev Space $ H^k+1(R^n) $, $ h(y) $ denotes a nondecreasing nonnegative and continuous function, c is a costant, $k geq 0 $ and $ p> 1$.



Maybe i can use an embedding theorem? which one? Can anyone please help me?










share|cite|improve this question









$endgroup$




I'm trying to understand why this inequality is true



$$ Vert fVert_L^2^pcdot hleft(Vert fVert_inftyright) leq c Vert fVert_k+1^p cdot hleft(Vert fVert_k+1right), $$



where $ Vert cdotVert_k+1 $ denotes the usual norm of the Sobolev Space $ H^k+1(R^n) $, $ h(y) $ denotes a nondecreasing nonnegative and continuous function, c is a costant, $k geq 0 $ and $ p> 1$.



Maybe i can use an embedding theorem? which one? Can anyone please help me?







real-analysis inequality sobolev-spaces






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 28 at 15:56









C. BishopC. Bishop

398




398







  • 1




    $begingroup$
    Looks like a key comparison needed here is between $||f||_infty$ and $||f||_k+1$. This should allow a comparison between $h ( ||f||_infty) $ and (a constant times) $h ($||f||_k+1)$. Although I am not sure why $h$ needs to be continuous. Cursorily (haven't checked the details), a candidate embedding theorem is Rellich-Kondrashov.
    $endgroup$
    – avs
    Mar 28 at 16:29







  • 2




    $begingroup$
    This can only be correct if $k+1 > n/2$ since otherwise $H^k+1$ cannot be embedded into $L^infty$. Even then it can only be true if $h$ has polynomial growth, since otherwise there are scaling problems.
    $endgroup$
    – Hans Engler
    Mar 28 at 19:25













  • 1




    $begingroup$
    Looks like a key comparison needed here is between $||f||_infty$ and $||f||_k+1$. This should allow a comparison between $h ( ||f||_infty) $ and (a constant times) $h ($||f||_k+1)$. Although I am not sure why $h$ needs to be continuous. Cursorily (haven't checked the details), a candidate embedding theorem is Rellich-Kondrashov.
    $endgroup$
    – avs
    Mar 28 at 16:29







  • 2




    $begingroup$
    This can only be correct if $k+1 > n/2$ since otherwise $H^k+1$ cannot be embedded into $L^infty$. Even then it can only be true if $h$ has polynomial growth, since otherwise there are scaling problems.
    $endgroup$
    – Hans Engler
    Mar 28 at 19:25








1




1




$begingroup$
Looks like a key comparison needed here is between $||f||_infty$ and $||f||_k+1$. This should allow a comparison between $h ( ||f||_infty) $ and (a constant times) $h ($||f||_k+1)$. Although I am not sure why $h$ needs to be continuous. Cursorily (haven't checked the details), a candidate embedding theorem is Rellich-Kondrashov.
$endgroup$
– avs
Mar 28 at 16:29





$begingroup$
Looks like a key comparison needed here is between $||f||_infty$ and $||f||_k+1$. This should allow a comparison between $h ( ||f||_infty) $ and (a constant times) $h ($||f||_k+1)$. Although I am not sure why $h$ needs to be continuous. Cursorily (haven't checked the details), a candidate embedding theorem is Rellich-Kondrashov.
$endgroup$
– avs
Mar 28 at 16:29





2




2




$begingroup$
This can only be correct if $k+1 > n/2$ since otherwise $H^k+1$ cannot be embedded into $L^infty$. Even then it can only be true if $h$ has polynomial growth, since otherwise there are scaling problems.
$endgroup$
– Hans Engler
Mar 28 at 19:25





$begingroup$
This can only be correct if $k+1 > n/2$ since otherwise $H^k+1$ cannot be embedded into $L^infty$. Even then it can only be true if $h$ has polynomial growth, since otherwise there are scaling problems.
$endgroup$
– Hans Engler
Mar 28 at 19:25











1 Answer
1






active

oldest

votes


















0












$begingroup$

Using a bit of Fourier analysis, one can show that, for $s>fracd2$,
$$H^s(mathbbR^d) hookrightarrow L^infty(mathbbR^d).$$
In particular, consider
$$|f|_L^infty leq |hatf|_L^1 leq |langle xirangle ^-s|_L^2 |langle xirangle ^shatf|_L^2 lesssim |f|_H^s,
$$

where the first inequality follows, pretty much directly, from the Fourier inversion formula.



Now, $|f|_L^2 leq|f|_H^k+1$ for every $kgeq 0$, so that part is fine, too. But, you still have some work to do. In particular, you have
$$h(|f|_L^infty) leq h(c|f|_H^s),$$
but you need to get to
$$h(|f|_L^infty) lesssim h(|f|_H^s).$$
You may need some additional assumptions on $h$ (particularly on how $h$ scales) to do this.



As a bit of a tangent, it's actually the case that for $s > fracd2 + k$, we have $H^s(mathbbR^d) hookrightarrow C^k(mathbbR^d) cap L^infty(mathbbR^d)$.






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%2f3166080%2fwhat-soboblev-embedding-i-could-use-in-this-case%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












    $begingroup$

    Using a bit of Fourier analysis, one can show that, for $s>fracd2$,
    $$H^s(mathbbR^d) hookrightarrow L^infty(mathbbR^d).$$
    In particular, consider
    $$|f|_L^infty leq |hatf|_L^1 leq |langle xirangle ^-s|_L^2 |langle xirangle ^shatf|_L^2 lesssim |f|_H^s,
    $$

    where the first inequality follows, pretty much directly, from the Fourier inversion formula.



    Now, $|f|_L^2 leq|f|_H^k+1$ for every $kgeq 0$, so that part is fine, too. But, you still have some work to do. In particular, you have
    $$h(|f|_L^infty) leq h(c|f|_H^s),$$
    but you need to get to
    $$h(|f|_L^infty) lesssim h(|f|_H^s).$$
    You may need some additional assumptions on $h$ (particularly on how $h$ scales) to do this.



    As a bit of a tangent, it's actually the case that for $s > fracd2 + k$, we have $H^s(mathbbR^d) hookrightarrow C^k(mathbbR^d) cap L^infty(mathbbR^d)$.






    share|cite|improve this answer











    $endgroup$

















      0












      $begingroup$

      Using a bit of Fourier analysis, one can show that, for $s>fracd2$,
      $$H^s(mathbbR^d) hookrightarrow L^infty(mathbbR^d).$$
      In particular, consider
      $$|f|_L^infty leq |hatf|_L^1 leq |langle xirangle ^-s|_L^2 |langle xirangle ^shatf|_L^2 lesssim |f|_H^s,
      $$

      where the first inequality follows, pretty much directly, from the Fourier inversion formula.



      Now, $|f|_L^2 leq|f|_H^k+1$ for every $kgeq 0$, so that part is fine, too. But, you still have some work to do. In particular, you have
      $$h(|f|_L^infty) leq h(c|f|_H^s),$$
      but you need to get to
      $$h(|f|_L^infty) lesssim h(|f|_H^s).$$
      You may need some additional assumptions on $h$ (particularly on how $h$ scales) to do this.



      As a bit of a tangent, it's actually the case that for $s > fracd2 + k$, we have $H^s(mathbbR^d) hookrightarrow C^k(mathbbR^d) cap L^infty(mathbbR^d)$.






      share|cite|improve this answer











      $endgroup$















        0












        0








        0





        $begingroup$

        Using a bit of Fourier analysis, one can show that, for $s>fracd2$,
        $$H^s(mathbbR^d) hookrightarrow L^infty(mathbbR^d).$$
        In particular, consider
        $$|f|_L^infty leq |hatf|_L^1 leq |langle xirangle ^-s|_L^2 |langle xirangle ^shatf|_L^2 lesssim |f|_H^s,
        $$

        where the first inequality follows, pretty much directly, from the Fourier inversion formula.



        Now, $|f|_L^2 leq|f|_H^k+1$ for every $kgeq 0$, so that part is fine, too. But, you still have some work to do. In particular, you have
        $$h(|f|_L^infty) leq h(c|f|_H^s),$$
        but you need to get to
        $$h(|f|_L^infty) lesssim h(|f|_H^s).$$
        You may need some additional assumptions on $h$ (particularly on how $h$ scales) to do this.



        As a bit of a tangent, it's actually the case that for $s > fracd2 + k$, we have $H^s(mathbbR^d) hookrightarrow C^k(mathbbR^d) cap L^infty(mathbbR^d)$.






        share|cite|improve this answer











        $endgroup$



        Using a bit of Fourier analysis, one can show that, for $s>fracd2$,
        $$H^s(mathbbR^d) hookrightarrow L^infty(mathbbR^d).$$
        In particular, consider
        $$|f|_L^infty leq |hatf|_L^1 leq |langle xirangle ^-s|_L^2 |langle xirangle ^shatf|_L^2 lesssim |f|_H^s,
        $$

        where the first inequality follows, pretty much directly, from the Fourier inversion formula.



        Now, $|f|_L^2 leq|f|_H^k+1$ for every $kgeq 0$, so that part is fine, too. But, you still have some work to do. In particular, you have
        $$h(|f|_L^infty) leq h(c|f|_H^s),$$
        but you need to get to
        $$h(|f|_L^infty) lesssim h(|f|_H^s).$$
        You may need some additional assumptions on $h$ (particularly on how $h$ scales) to do this.



        As a bit of a tangent, it's actually the case that for $s > fracd2 + k$, we have $H^s(mathbbR^d) hookrightarrow C^k(mathbbR^d) cap L^infty(mathbbR^d)$.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Mar 28 at 19:40

























        answered Mar 28 at 18:58









        Gary MoonGary Moon

        92127




        92127



























            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%2f3166080%2fwhat-soboblev-embedding-i-could-use-in-this-case%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

            Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

            Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

            Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ