show $limlimits_(x,y)to(0,0)fracy^c+$ exists and equals $0$? [duplicate]

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
6
down vote

favorite
1













This question already has an answer here:



  • Show that $ lim_(x,y) to 0 frac ^ beta text exists iff alpha/gamma + beta/delta > 1.$

    1 answer



suppose $f(x,y)=frac^ay$ and $a,b,c,d >0$ how would you show that if $fracac + fracbd >1$ then $limlimits_(x,y)to(0,0)frac^ay$ exists and equals $0$?



I've been trying to use the squeeze theorem and set up an inequality but im really struggling.










share|cite|improve this question













marked as duplicate by mechanodroid, Theoretical Economist, Adrian Keister, user99914, Xander Henderson Sep 11 at 1:43


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.


















    up vote
    6
    down vote

    favorite
    1













    This question already has an answer here:



    • Show that $ lim_(x,y) to 0 frac ^ beta text exists iff alpha/gamma + beta/delta > 1.$

      1 answer



    suppose $f(x,y)=frac^ay$ and $a,b,c,d >0$ how would you show that if $fracac + fracbd >1$ then $limlimits_(x,y)to(0,0)frac^ay$ exists and equals $0$?



    I've been trying to use the squeeze theorem and set up an inequality but im really struggling.










    share|cite|improve this question













    marked as duplicate by mechanodroid, Theoretical Economist, Adrian Keister, user99914, Xander Henderson Sep 11 at 1:43


    This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
















      up vote
      6
      down vote

      favorite
      1









      up vote
      6
      down vote

      favorite
      1






      1






      This question already has an answer here:



      • Show that $ lim_(x,y) to 0 frac ^ beta text exists iff alpha/gamma + beta/delta > 1.$

        1 answer



      suppose $f(x,y)=frac^ay$ and $a,b,c,d >0$ how would you show that if $fracac + fracbd >1$ then $limlimits_(x,y)to(0,0)frac^ay$ exists and equals $0$?



      I've been trying to use the squeeze theorem and set up an inequality but im really struggling.










      share|cite|improve this question














      This question already has an answer here:



      • Show that $ lim_(x,y) to 0 frac ^ beta text exists iff alpha/gamma + beta/delta > 1.$

        1 answer



      suppose $f(x,y)=frac^ay$ and $a,b,c,d >0$ how would you show that if $fracac + fracbd >1$ then $limlimits_(x,y)to(0,0)frac^ay$ exists and equals $0$?



      I've been trying to use the squeeze theorem and set up an inequality but im really struggling.





      This question already has an answer here:



      • Show that $ lim_(x,y) to 0 frac ^ beta text exists iff alpha/gamma + beta/delta > 1.$

        1 answer







      calculus limits multivariable-calculus






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Sep 10 at 19:11









      user524644

      1116




      1116




      marked as duplicate by mechanodroid, Theoretical Economist, Adrian Keister, user99914, Xander Henderson Sep 11 at 1:43


      This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.






      marked as duplicate by mechanodroid, Theoretical Economist, Adrian Keister, user99914, Xander Henderson Sep 11 at 1:43


      This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.






















          3 Answers
          3






          active

          oldest

          votes

















          up vote
          5
          down vote













          Young's inequality states that for $x,y>0$ and $p,q>0$ with $frac1p+frac1q=1$ we have
          $xyle fracx^pp+fracy^qq$ so $|x|^a|y|^ble frac1p|x|^ap+frac1q|y|^bq$. We can choose $p$ and $q$ such that $ap>c$ and $bq>d$:



          Assume for a contradiction that for all $p,q$ with $frac1p+frac1q=1$ we have $aple c$ and $bqle d$ then $frac a c +frac bd le frac1p+frac 1q=1$.



          Now
          $$frac^ay le fracx+ fracyy le |x|^ap-c+|y|^bq-d,
          $$
          which tends to $0$ as $(x,y)to (0,0)$.






          share|cite|improve this answer





























            up vote
            0
            down vote













            The appropriate general technique is Lagrange multipliers. Because of the absolute value signs, we may ask for the largest value, with both $x,y > 0,$ of
            $$ fracx^a y^bx^c + y^d $$
            The multiplier condition is that the ratio $a x^a-1 y^b ::: c x^c-1$ is the same as $b x^a y^b-1 ::: d y^d-1.$ Using cross-multiplication for fractions that are supposed to be equal gives
            $$ adx^a-1 y^b+d-1 = bc x^a+c-1 y^b-1. $$ The first cancellation gives
            $$ ad y^b+d-1 = bc x^c y^b-1. $$ The next gives
            $$ ad y^d = bc x^c . $$
            That is, the largest value for fixed $x^c + y^d$ occurs when
            $$ y = lambda x^c/d $$
            and $lambda$ is a positive constant.
            $$ fracx^a y^bx^c + y^d leq fraclambda_2 x^a x^fracbcdx^c + lambda_3 x^c leq lambda_4 x^a x^fracbcd x^-c$$
            The resulting limit as $x$ goes to $0$ is also $0$ when
            $$ a + fracbcd - c > 0 ; , ; $$
            $$ a + fracbcd > c ; , ; $$
            or, as $c>0,$
            $$ fracac + fracbd > 1 ; . ; $$






            share|cite|improve this answer



























              up vote
              0
              down vote













              Let consider



              • $|x|=|u|^1/c$

              • $|y|=|v|^1/d$

              then we have that



              $$frac^ay=fracu=r^frac a c+frac b d-1cdot f(theta)to 0$$



              since $f(theta)=frac$ is bounded and for $frac a c+frac b d>1 iff frac a c+frac b d-1>0$ we have that $r^frac a c+frac b d-1to 0$.






              share|cite|improve this answer





























                3 Answers
                3






                active

                oldest

                votes








                3 Answers
                3






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes








                up vote
                5
                down vote













                Young's inequality states that for $x,y>0$ and $p,q>0$ with $frac1p+frac1q=1$ we have
                $xyle fracx^pp+fracy^qq$ so $|x|^a|y|^ble frac1p|x|^ap+frac1q|y|^bq$. We can choose $p$ and $q$ such that $ap>c$ and $bq>d$:



                Assume for a contradiction that for all $p,q$ with $frac1p+frac1q=1$ we have $aple c$ and $bqle d$ then $frac a c +frac bd le frac1p+frac 1q=1$.



                Now
                $$frac^ay le fracx+ fracyy le |x|^ap-c+|y|^bq-d,
                $$
                which tends to $0$ as $(x,y)to (0,0)$.






                share|cite|improve this answer


























                  up vote
                  5
                  down vote













                  Young's inequality states that for $x,y>0$ and $p,q>0$ with $frac1p+frac1q=1$ we have
                  $xyle fracx^pp+fracy^qq$ so $|x|^a|y|^ble frac1p|x|^ap+frac1q|y|^bq$. We can choose $p$ and $q$ such that $ap>c$ and $bq>d$:



                  Assume for a contradiction that for all $p,q$ with $frac1p+frac1q=1$ we have $aple c$ and $bqle d$ then $frac a c +frac bd le frac1p+frac 1q=1$.



                  Now
                  $$frac^ay le fracx+ fracyy le |x|^ap-c+|y|^bq-d,
                  $$
                  which tends to $0$ as $(x,y)to (0,0)$.






                  share|cite|improve this answer
























                    up vote
                    5
                    down vote










                    up vote
                    5
                    down vote









                    Young's inequality states that for $x,y>0$ and $p,q>0$ with $frac1p+frac1q=1$ we have
                    $xyle fracx^pp+fracy^qq$ so $|x|^a|y|^ble frac1p|x|^ap+frac1q|y|^bq$. We can choose $p$ and $q$ such that $ap>c$ and $bq>d$:



                    Assume for a contradiction that for all $p,q$ with $frac1p+frac1q=1$ we have $aple c$ and $bqle d$ then $frac a c +frac bd le frac1p+frac 1q=1$.



                    Now
                    $$frac^ay le fracx+ fracyy le |x|^ap-c+|y|^bq-d,
                    $$
                    which tends to $0$ as $(x,y)to (0,0)$.






                    share|cite|improve this answer














                    Young's inequality states that for $x,y>0$ and $p,q>0$ with $frac1p+frac1q=1$ we have
                    $xyle fracx^pp+fracy^qq$ so $|x|^a|y|^ble frac1p|x|^ap+frac1q|y|^bq$. We can choose $p$ and $q$ such that $ap>c$ and $bq>d$:



                    Assume for a contradiction that for all $p,q$ with $frac1p+frac1q=1$ we have $aple c$ and $bqle d$ then $frac a c +frac bd le frac1p+frac 1q=1$.



                    Now
                    $$frac^ay le fracx+ fracyy le |x|^ap-c+|y|^bq-d,
                    $$
                    which tends to $0$ as $(x,y)to (0,0)$.







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    edited Sep 10 at 20:07

























                    answered Sep 10 at 19:49









                    Kusma

                    3,440219




                    3,440219




















                        up vote
                        0
                        down vote













                        The appropriate general technique is Lagrange multipliers. Because of the absolute value signs, we may ask for the largest value, with both $x,y > 0,$ of
                        $$ fracx^a y^bx^c + y^d $$
                        The multiplier condition is that the ratio $a x^a-1 y^b ::: c x^c-1$ is the same as $b x^a y^b-1 ::: d y^d-1.$ Using cross-multiplication for fractions that are supposed to be equal gives
                        $$ adx^a-1 y^b+d-1 = bc x^a+c-1 y^b-1. $$ The first cancellation gives
                        $$ ad y^b+d-1 = bc x^c y^b-1. $$ The next gives
                        $$ ad y^d = bc x^c . $$
                        That is, the largest value for fixed $x^c + y^d$ occurs when
                        $$ y = lambda x^c/d $$
                        and $lambda$ is a positive constant.
                        $$ fracx^a y^bx^c + y^d leq fraclambda_2 x^a x^fracbcdx^c + lambda_3 x^c leq lambda_4 x^a x^fracbcd x^-c$$
                        The resulting limit as $x$ goes to $0$ is also $0$ when
                        $$ a + fracbcd - c > 0 ; , ; $$
                        $$ a + fracbcd > c ; , ; $$
                        or, as $c>0,$
                        $$ fracac + fracbd > 1 ; . ; $$






                        share|cite|improve this answer
























                          up vote
                          0
                          down vote













                          The appropriate general technique is Lagrange multipliers. Because of the absolute value signs, we may ask for the largest value, with both $x,y > 0,$ of
                          $$ fracx^a y^bx^c + y^d $$
                          The multiplier condition is that the ratio $a x^a-1 y^b ::: c x^c-1$ is the same as $b x^a y^b-1 ::: d y^d-1.$ Using cross-multiplication for fractions that are supposed to be equal gives
                          $$ adx^a-1 y^b+d-1 = bc x^a+c-1 y^b-1. $$ The first cancellation gives
                          $$ ad y^b+d-1 = bc x^c y^b-1. $$ The next gives
                          $$ ad y^d = bc x^c . $$
                          That is, the largest value for fixed $x^c + y^d$ occurs when
                          $$ y = lambda x^c/d $$
                          and $lambda$ is a positive constant.
                          $$ fracx^a y^bx^c + y^d leq fraclambda_2 x^a x^fracbcdx^c + lambda_3 x^c leq lambda_4 x^a x^fracbcd x^-c$$
                          The resulting limit as $x$ goes to $0$ is also $0$ when
                          $$ a + fracbcd - c > 0 ; , ; $$
                          $$ a + fracbcd > c ; , ; $$
                          or, as $c>0,$
                          $$ fracac + fracbd > 1 ; . ; $$






                          share|cite|improve this answer






















                            up vote
                            0
                            down vote










                            up vote
                            0
                            down vote









                            The appropriate general technique is Lagrange multipliers. Because of the absolute value signs, we may ask for the largest value, with both $x,y > 0,$ of
                            $$ fracx^a y^bx^c + y^d $$
                            The multiplier condition is that the ratio $a x^a-1 y^b ::: c x^c-1$ is the same as $b x^a y^b-1 ::: d y^d-1.$ Using cross-multiplication for fractions that are supposed to be equal gives
                            $$ adx^a-1 y^b+d-1 = bc x^a+c-1 y^b-1. $$ The first cancellation gives
                            $$ ad y^b+d-1 = bc x^c y^b-1. $$ The next gives
                            $$ ad y^d = bc x^c . $$
                            That is, the largest value for fixed $x^c + y^d$ occurs when
                            $$ y = lambda x^c/d $$
                            and $lambda$ is a positive constant.
                            $$ fracx^a y^bx^c + y^d leq fraclambda_2 x^a x^fracbcdx^c + lambda_3 x^c leq lambda_4 x^a x^fracbcd x^-c$$
                            The resulting limit as $x$ goes to $0$ is also $0$ when
                            $$ a + fracbcd - c > 0 ; , ; $$
                            $$ a + fracbcd > c ; , ; $$
                            or, as $c>0,$
                            $$ fracac + fracbd > 1 ; . ; $$






                            share|cite|improve this answer












                            The appropriate general technique is Lagrange multipliers. Because of the absolute value signs, we may ask for the largest value, with both $x,y > 0,$ of
                            $$ fracx^a y^bx^c + y^d $$
                            The multiplier condition is that the ratio $a x^a-1 y^b ::: c x^c-1$ is the same as $b x^a y^b-1 ::: d y^d-1.$ Using cross-multiplication for fractions that are supposed to be equal gives
                            $$ adx^a-1 y^b+d-1 = bc x^a+c-1 y^b-1. $$ The first cancellation gives
                            $$ ad y^b+d-1 = bc x^c y^b-1. $$ The next gives
                            $$ ad y^d = bc x^c . $$
                            That is, the largest value for fixed $x^c + y^d$ occurs when
                            $$ y = lambda x^c/d $$
                            and $lambda$ is a positive constant.
                            $$ fracx^a y^bx^c + y^d leq fraclambda_2 x^a x^fracbcdx^c + lambda_3 x^c leq lambda_4 x^a x^fracbcd x^-c$$
                            The resulting limit as $x$ goes to $0$ is also $0$ when
                            $$ a + fracbcd - c > 0 ; , ; $$
                            $$ a + fracbcd > c ; , ; $$
                            or, as $c>0,$
                            $$ fracac + fracbd > 1 ; . ; $$







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Sep 10 at 22:26









                            Will Jagy

                            98.4k596196




                            98.4k596196




















                                up vote
                                0
                                down vote













                                Let consider



                                • $|x|=|u|^1/c$

                                • $|y|=|v|^1/d$

                                then we have that



                                $$frac^ay=fracu=r^frac a c+frac b d-1cdot f(theta)to 0$$



                                since $f(theta)=frac$ is bounded and for $frac a c+frac b d>1 iff frac a c+frac b d-1>0$ we have that $r^frac a c+frac b d-1to 0$.






                                share|cite|improve this answer


























                                  up vote
                                  0
                                  down vote













                                  Let consider



                                  • $|x|=|u|^1/c$

                                  • $|y|=|v|^1/d$

                                  then we have that



                                  $$frac^ay=fracu=r^frac a c+frac b d-1cdot f(theta)to 0$$



                                  since $f(theta)=frac$ is bounded and for $frac a c+frac b d>1 iff frac a c+frac b d-1>0$ we have that $r^frac a c+frac b d-1to 0$.






                                  share|cite|improve this answer
























                                    up vote
                                    0
                                    down vote










                                    up vote
                                    0
                                    down vote









                                    Let consider



                                    • $|x|=|u|^1/c$

                                    • $|y|=|v|^1/d$

                                    then we have that



                                    $$frac^ay=fracu=r^frac a c+frac b d-1cdot f(theta)to 0$$



                                    since $f(theta)=frac$ is bounded and for $frac a c+frac b d>1 iff frac a c+frac b d-1>0$ we have that $r^frac a c+frac b d-1to 0$.






                                    share|cite|improve this answer














                                    Let consider



                                    • $|x|=|u|^1/c$

                                    • $|y|=|v|^1/d$

                                    then we have that



                                    $$frac^ay=fracu=r^frac a c+frac b d-1cdot f(theta)to 0$$



                                    since $f(theta)=frac$ is bounded and for $frac a c+frac b d>1 iff frac a c+frac b d-1>0$ we have that $r^frac a c+frac b d-1to 0$.







                                    share|cite|improve this answer














                                    share|cite|improve this answer



                                    share|cite|improve this answer








                                    edited Sep 10 at 22:28

























                                    answered Sep 10 at 20:52









                                    gimusi

                                    74.8k73889




                                    74.8k73889












                                        這個網誌中的熱門文章

                                        How to combine Bézier curves to a surface?

                                        Why am i infinitely getting the same tweet with the Twitter Search API?

                                        Carbon dioxide