Does Young's inequality hold only for conjugate exponents?












6












$begingroup$


Suppose that $ab leq frac{1}{p}a^p+frac{1}{q}b^q$ holds for every real numbers $a,bge 0$. (where $p,q>0$ are some fixed numbers).



Is it true that $ frac{1}{p}+frac{1}{q}=1$?



I guess so, and I would like to find an easy proof of that fact. Plugging in $a=b=1$, we get $ frac{1}{p}+frac{1}{q}ge1$. Is there an easy way to see that the converse inequality must hold?



To be clear, I am not looking for proofs of Young's inequality; only for a way to see why the relation between the conjugate exponents is the only possible option.



Edit:



Here is a comment to help future readers (including future me) to see how can one come with Nicolás's nice idea to apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$.



The idea is that it is inconvenient to compare a sum with another number; By using the specific choice of $a,b$ above, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical.





Comment: I know that the relation $ frac{1}{p}+frac{1}{q}=1$ is necessary for Holder's inequality in general; this can be seen by scaling the measure. However, I don't think this approach is applicable here.










share|cite|improve this question











$endgroup$

















    6












    $begingroup$


    Suppose that $ab leq frac{1}{p}a^p+frac{1}{q}b^q$ holds for every real numbers $a,bge 0$. (where $p,q>0$ are some fixed numbers).



    Is it true that $ frac{1}{p}+frac{1}{q}=1$?



    I guess so, and I would like to find an easy proof of that fact. Plugging in $a=b=1$, we get $ frac{1}{p}+frac{1}{q}ge1$. Is there an easy way to see that the converse inequality must hold?



    To be clear, I am not looking for proofs of Young's inequality; only for a way to see why the relation between the conjugate exponents is the only possible option.



    Edit:



    Here is a comment to help future readers (including future me) to see how can one come with Nicolás's nice idea to apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$.



    The idea is that it is inconvenient to compare a sum with another number; By using the specific choice of $a,b$ above, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical.





    Comment: I know that the relation $ frac{1}{p}+frac{1}{q}=1$ is necessary for Holder's inequality in general; this can be seen by scaling the measure. However, I don't think this approach is applicable here.










    share|cite|improve this question











    $endgroup$















      6












      6








      6


      0



      $begingroup$


      Suppose that $ab leq frac{1}{p}a^p+frac{1}{q}b^q$ holds for every real numbers $a,bge 0$. (where $p,q>0$ are some fixed numbers).



      Is it true that $ frac{1}{p}+frac{1}{q}=1$?



      I guess so, and I would like to find an easy proof of that fact. Plugging in $a=b=1$, we get $ frac{1}{p}+frac{1}{q}ge1$. Is there an easy way to see that the converse inequality must hold?



      To be clear, I am not looking for proofs of Young's inequality; only for a way to see why the relation between the conjugate exponents is the only possible option.



      Edit:



      Here is a comment to help future readers (including future me) to see how can one come with Nicolás's nice idea to apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$.



      The idea is that it is inconvenient to compare a sum with another number; By using the specific choice of $a,b$ above, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical.





      Comment: I know that the relation $ frac{1}{p}+frac{1}{q}=1$ is necessary for Holder's inequality in general; this can be seen by scaling the measure. However, I don't think this approach is applicable here.










      share|cite|improve this question











      $endgroup$




      Suppose that $ab leq frac{1}{p}a^p+frac{1}{q}b^q$ holds for every real numbers $a,bge 0$. (where $p,q>0$ are some fixed numbers).



      Is it true that $ frac{1}{p}+frac{1}{q}=1$?



      I guess so, and I would like to find an easy proof of that fact. Plugging in $a=b=1$, we get $ frac{1}{p}+frac{1}{q}ge1$. Is there an easy way to see that the converse inequality must hold?



      To be clear, I am not looking for proofs of Young's inequality; only for a way to see why the relation between the conjugate exponents is the only possible option.



      Edit:



      Here is a comment to help future readers (including future me) to see how can one come with Nicolás's nice idea to apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$.



      The idea is that it is inconvenient to compare a sum with another number; By using the specific choice of $a,b$ above, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical.





      Comment: I know that the relation $ frac{1}{p}+frac{1}{q}=1$ is necessary for Holder's inequality in general; this can be seen by scaling the measure. However, I don't think this approach is applicable here.







      real-analysis inequality symmetry young-inequality






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 16 at 9:33







      Asaf Shachar

















      asked Jan 16 at 7:38









      Asaf ShacharAsaf Shachar

      5,53431141




      5,53431141






















          3 Answers
          3






          active

          oldest

          votes


















          11












          $begingroup$

          If you apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$, you get something like
          $$ lambda^{frac{1}{p}+frac{1}{q}}leq left( frac{1}{p}+frac{1}{q} right)lambda, qquad forall lambda>0. $$
          If you take $lambda to infty$, it's clear that $frac{1}{p}+frac{1}{q}leq 1$. Otherwise, after dividing by $lambda$ you get
          $$ lambda^{frac{1}{p}+frac{1}{q}-1} leq frac{1}{p}+frac{1}{q}, $$
          which is false for $lambda$ large enough, as the right side is constant. Taking $lambda to 0$ gets the other inequality.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
            $endgroup$
            – Asaf Shachar
            Jan 18 at 10:51












          • $begingroup$
            What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
            $endgroup$
            – Asaf Shachar
            Jan 18 at 10:55








          • 1




            $begingroup$
            Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
            $endgroup$
            – Nicolás Vilches
            Jan 19 at 14:39





















          2












          $begingroup$

          I think the following can help.



          By AM-GM $$frac{1}{p}a^p+frac{1}{q}b^qgeqleft(frac{1}{p}+frac{1}{q}right)left(left(a^pright)^{frac{1}{p}}left(b^qright)^{frac{1}{q}}right)^{frac{1}{frac{1}{p}+frac{1}{q}}}=left(frac{1}{p}+frac{1}{q}right)(ab)^{frac{1}{frac{1}{p}+frac{1}{q}}}.$$
          The equality occurs, of course.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
            $endgroup$
            – Asaf Shachar
            Jan 16 at 13:19










          • $begingroup$
            @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
            $endgroup$
            – Michael Rozenberg
            Jan 16 at 13:27



















          0












          $begingroup$

          I found an argument that works for $p,qge 1$, since I need convexity of $xto x^p,x^q$.
          Assume by contradiction that $1/p+1/q>1$. Then, if $p'$ is the conjugate of $q$ we know that $p'>p$.



          Now, for any $a>0$ we have
          $$
          a^{p'}/p'=maxlimits_{b>0}{ab-b^q/q}
          $$

          (just because $ato a^{p'}/p'$ is the conjugate (Legendre transform) of $bto b^q/q$). Then we can pick $a$ large enough such that
          $$
          frac{a^p}{p}<frac{a^{p'}}{p'}
          $$

          and for such $a$ we would have
          $$
          a^{p}/p<maxlimits_{b>0}{ab-b^q/q}
          $$

          which implies that for some $b>0$ (and the given $a$) Young's inequality is violated.



          Hope this helps.






          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%2f3075429%2fdoes-youngs-inequality-hold-only-for-conjugate-exponents%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            3 Answers
            3






            active

            oldest

            votes








            3 Answers
            3






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            11












            $begingroup$

            If you apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$, you get something like
            $$ lambda^{frac{1}{p}+frac{1}{q}}leq left( frac{1}{p}+frac{1}{q} right)lambda, qquad forall lambda>0. $$
            If you take $lambda to infty$, it's clear that $frac{1}{p}+frac{1}{q}leq 1$. Otherwise, after dividing by $lambda$ you get
            $$ lambda^{frac{1}{p}+frac{1}{q}-1} leq frac{1}{p}+frac{1}{q}, $$
            which is false for $lambda$ large enough, as the right side is constant. Taking $lambda to 0$ gets the other inequality.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:51












            • $begingroup$
              What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:55








            • 1




              $begingroup$
              Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
              $endgroup$
              – Nicolás Vilches
              Jan 19 at 14:39


















            11












            $begingroup$

            If you apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$, you get something like
            $$ lambda^{frac{1}{p}+frac{1}{q}}leq left( frac{1}{p}+frac{1}{q} right)lambda, qquad forall lambda>0. $$
            If you take $lambda to infty$, it's clear that $frac{1}{p}+frac{1}{q}leq 1$. Otherwise, after dividing by $lambda$ you get
            $$ lambda^{frac{1}{p}+frac{1}{q}-1} leq frac{1}{p}+frac{1}{q}, $$
            which is false for $lambda$ large enough, as the right side is constant. Taking $lambda to 0$ gets the other inequality.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:51












            • $begingroup$
              What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:55








            • 1




              $begingroup$
              Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
              $endgroup$
              – Nicolás Vilches
              Jan 19 at 14:39
















            11












            11








            11





            $begingroup$

            If you apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$, you get something like
            $$ lambda^{frac{1}{p}+frac{1}{q}}leq left( frac{1}{p}+frac{1}{q} right)lambda, qquad forall lambda>0. $$
            If you take $lambda to infty$, it's clear that $frac{1}{p}+frac{1}{q}leq 1$. Otherwise, after dividing by $lambda$ you get
            $$ lambda^{frac{1}{p}+frac{1}{q}-1} leq frac{1}{p}+frac{1}{q}, $$
            which is false for $lambda$ large enough, as the right side is constant. Taking $lambda to 0$ gets the other inequality.






            share|cite|improve this answer









            $endgroup$



            If you apply the inequality for $a=lambda^{frac{1}{p}}, b=lambda^{frac{1}{q}}$, you get something like
            $$ lambda^{frac{1}{p}+frac{1}{q}}leq left( frac{1}{p}+frac{1}{q} right)lambda, qquad forall lambda>0. $$
            If you take $lambda to infty$, it's clear that $frac{1}{p}+frac{1}{q}leq 1$. Otherwise, after dividing by $lambda$ you get
            $$ lambda^{frac{1}{p}+frac{1}{q}-1} leq frac{1}{p}+frac{1}{q}, $$
            which is false for $lambda$ large enough, as the right side is constant. Taking $lambda to 0$ gets the other inequality.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 16 at 8:09









            Nicolás VilchesNicolás Vilches

            53638




            53638












            • $begingroup$
              Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:51












            • $begingroup$
              What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:55








            • 1




              $begingroup$
              Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
              $endgroup$
              – Nicolás Vilches
              Jan 19 at 14:39




















            • $begingroup$
              Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:51












            • $begingroup$
              What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
              $endgroup$
              – Asaf Shachar
              Jan 18 at 10:55








            • 1




              $begingroup$
              Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
              $endgroup$
              – Nicolás Vilches
              Jan 19 at 14:39


















            $begingroup$
            Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
            $endgroup$
            – Asaf Shachar
            Jan 18 at 10:51






            $begingroup$
            Thank you for this nice answer. Can you say something on "how did you came to think about this approach"? I thought of one possible motivation-the one I added to the question's body, which is the following: It is inconvenient to compare a sum with another number; By using your specific choice of $a$ and $b$, the sum is simplified, since the scales of the auxiliary parameter $lambda$ in both summands are now identical. I wonder whether this was your line of thinking as well, or did you have a different "inspiration" on your mind?
            $endgroup$
            – Asaf Shachar
            Jan 18 at 10:51














            $begingroup$
            What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
            $endgroup$
            – Asaf Shachar
            Jan 18 at 10:55






            $begingroup$
            What interests me is the fact that by scaling the measure, one can see that in general, Holder's inequality (whose proof crucially relies upon Young's inequality) can only hold when $p,q$ are conjugates. Is there a connection between your approach and that story? (For the Holder's story you can see here: math.stackexchange.com/a/2757556/104576)
            $endgroup$
            – Asaf Shachar
            Jan 18 at 10:55






            1




            1




            $begingroup$
            Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
            $endgroup$
            – Nicolás Vilches
            Jan 19 at 14:39






            $begingroup$
            Yeah, my idea was almost what you said. I didn't recall Hölder's proof, but I read your comment saying "you can show the necessity of $frac{1}{p}+frac{1}{q}=1$ by scalling the measure", so I tried to do the same. Here, "scalling the measure" was "multiply by an appropiate factor". Starting with Young's inequality for $a, b in mathbb{R}^+$, I tried to multiply by a factor that allowed my to factor at the right side (as $a mapsto alambda^{1/p}, b mapsto blambda^{1/q}$). Then $a$ and $b$ weren't important, so I set $a=b=1$ and we have the solution above.
            $endgroup$
            – Nicolás Vilches
            Jan 19 at 14:39













            2












            $begingroup$

            I think the following can help.



            By AM-GM $$frac{1}{p}a^p+frac{1}{q}b^qgeqleft(frac{1}{p}+frac{1}{q}right)left(left(a^pright)^{frac{1}{p}}left(b^qright)^{frac{1}{q}}right)^{frac{1}{frac{1}{p}+frac{1}{q}}}=left(frac{1}{p}+frac{1}{q}right)(ab)^{frac{1}{frac{1}{p}+frac{1}{q}}}.$$
            The equality occurs, of course.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
              $endgroup$
              – Asaf Shachar
              Jan 16 at 13:19










            • $begingroup$
              @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
              $endgroup$
              – Michael Rozenberg
              Jan 16 at 13:27
















            2












            $begingroup$

            I think the following can help.



            By AM-GM $$frac{1}{p}a^p+frac{1}{q}b^qgeqleft(frac{1}{p}+frac{1}{q}right)left(left(a^pright)^{frac{1}{p}}left(b^qright)^{frac{1}{q}}right)^{frac{1}{frac{1}{p}+frac{1}{q}}}=left(frac{1}{p}+frac{1}{q}right)(ab)^{frac{1}{frac{1}{p}+frac{1}{q}}}.$$
            The equality occurs, of course.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
              $endgroup$
              – Asaf Shachar
              Jan 16 at 13:19










            • $begingroup$
              @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
              $endgroup$
              – Michael Rozenberg
              Jan 16 at 13:27














            2












            2








            2





            $begingroup$

            I think the following can help.



            By AM-GM $$frac{1}{p}a^p+frac{1}{q}b^qgeqleft(frac{1}{p}+frac{1}{q}right)left(left(a^pright)^{frac{1}{p}}left(b^qright)^{frac{1}{q}}right)^{frac{1}{frac{1}{p}+frac{1}{q}}}=left(frac{1}{p}+frac{1}{q}right)(ab)^{frac{1}{frac{1}{p}+frac{1}{q}}}.$$
            The equality occurs, of course.






            share|cite|improve this answer











            $endgroup$



            I think the following can help.



            By AM-GM $$frac{1}{p}a^p+frac{1}{q}b^qgeqleft(frac{1}{p}+frac{1}{q}right)left(left(a^pright)^{frac{1}{p}}left(b^qright)^{frac{1}{q}}right)^{frac{1}{frac{1}{p}+frac{1}{q}}}=left(frac{1}{p}+frac{1}{q}right)(ab)^{frac{1}{frac{1}{p}+frac{1}{q}}}.$$
            The equality occurs, of course.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Jan 16 at 8:50

























            answered Jan 16 at 8:29









            Michael RozenbergMichael Rozenberg

            102k1591195




            102k1591195












            • $begingroup$
              Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
              $endgroup$
              – Asaf Shachar
              Jan 16 at 13:19










            • $begingroup$
              @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
              $endgroup$
              – Michael Rozenberg
              Jan 16 at 13:27


















            • $begingroup$
              Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
              $endgroup$
              – Asaf Shachar
              Jan 16 at 13:19










            • $begingroup$
              @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
              $endgroup$
              – Michael Rozenberg
              Jan 16 at 13:27
















            $begingroup$
            Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
            $endgroup$
            – Asaf Shachar
            Jan 16 at 13:19




            $begingroup$
            Thanks, but I do not understand; How exactly do you deduce from that something on the sum $frac{1}{p}+frac{1}{q}$? I tried putting $a^p=b^q$ (this is when we have equality in the AM-GM inequality) but I don't see how it helps.
            $endgroup$
            – Asaf Shachar
            Jan 16 at 13:19












            $begingroup$
            @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
            $endgroup$
            – Michael Rozenberg
            Jan 16 at 13:27




            $begingroup$
            @Asaf Shachar The equality, which I got is true for all positives $a$, $b$, $p$ and $q$. If we'll assume that $frac{1}{p}+frac{1}{q}neq1$ then your inequality would wrong.
            $endgroup$
            – Michael Rozenberg
            Jan 16 at 13:27











            0












            $begingroup$

            I found an argument that works for $p,qge 1$, since I need convexity of $xto x^p,x^q$.
            Assume by contradiction that $1/p+1/q>1$. Then, if $p'$ is the conjugate of $q$ we know that $p'>p$.



            Now, for any $a>0$ we have
            $$
            a^{p'}/p'=maxlimits_{b>0}{ab-b^q/q}
            $$

            (just because $ato a^{p'}/p'$ is the conjugate (Legendre transform) of $bto b^q/q$). Then we can pick $a$ large enough such that
            $$
            frac{a^p}{p}<frac{a^{p'}}{p'}
            $$

            and for such $a$ we would have
            $$
            a^{p}/p<maxlimits_{b>0}{ab-b^q/q}
            $$

            which implies that for some $b>0$ (and the given $a$) Young's inequality is violated.



            Hope this helps.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              I found an argument that works for $p,qge 1$, since I need convexity of $xto x^p,x^q$.
              Assume by contradiction that $1/p+1/q>1$. Then, if $p'$ is the conjugate of $q$ we know that $p'>p$.



              Now, for any $a>0$ we have
              $$
              a^{p'}/p'=maxlimits_{b>0}{ab-b^q/q}
              $$

              (just because $ato a^{p'}/p'$ is the conjugate (Legendre transform) of $bto b^q/q$). Then we can pick $a$ large enough such that
              $$
              frac{a^p}{p}<frac{a^{p'}}{p'}
              $$

              and for such $a$ we would have
              $$
              a^{p}/p<maxlimits_{b>0}{ab-b^q/q}
              $$

              which implies that for some $b>0$ (and the given $a$) Young's inequality is violated.



              Hope this helps.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                I found an argument that works for $p,qge 1$, since I need convexity of $xto x^p,x^q$.
                Assume by contradiction that $1/p+1/q>1$. Then, if $p'$ is the conjugate of $q$ we know that $p'>p$.



                Now, for any $a>0$ we have
                $$
                a^{p'}/p'=maxlimits_{b>0}{ab-b^q/q}
                $$

                (just because $ato a^{p'}/p'$ is the conjugate (Legendre transform) of $bto b^q/q$). Then we can pick $a$ large enough such that
                $$
                frac{a^p}{p}<frac{a^{p'}}{p'}
                $$

                and for such $a$ we would have
                $$
                a^{p}/p<maxlimits_{b>0}{ab-b^q/q}
                $$

                which implies that for some $b>0$ (and the given $a$) Young's inequality is violated.



                Hope this helps.






                share|cite|improve this answer









                $endgroup$



                I found an argument that works for $p,qge 1$, since I need convexity of $xto x^p,x^q$.
                Assume by contradiction that $1/p+1/q>1$. Then, if $p'$ is the conjugate of $q$ we know that $p'>p$.



                Now, for any $a>0$ we have
                $$
                a^{p'}/p'=maxlimits_{b>0}{ab-b^q/q}
                $$

                (just because $ato a^{p'}/p'$ is the conjugate (Legendre transform) of $bto b^q/q$). Then we can pick $a$ large enough such that
                $$
                frac{a^p}{p}<frac{a^{p'}}{p'}
                $$

                and for such $a$ we would have
                $$
                a^{p}/p<maxlimits_{b>0}{ab-b^q/q}
                $$

                which implies that for some $b>0$ (and the given $a$) Young's inequality is violated.



                Hope this helps.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 16 at 8:23









                GReyesGReyes

                1,0795




                1,0795






























                    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%2f3075429%2fdoes-youngs-inequality-hold-only-for-conjugate-exponents%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

                    Mario Kart Wii

                    Understanding the size os this class of aleatory events

                    Partial Derivative Guidance.