How to Prove a Multivariable Calculus Limit Involving Powers and Inequalities?

_Steve_
Messages
19
Reaction score
0
I need to show that

limit (|x|^a*|y|^b) / (|x|^c+|y|^d) = 0
(x,y)->(0,0)

when a,b>=0; c,d>0; with a/c + b/d > 1

Does anyone have some tips for starting off the proof?
 
Physics news on Phys.org
Show that if a, b \geq 0 and c, d > 0, with \frac{a}{c} + \frac{b}{d} > 1, then:

lim_{\vec{x}\rightarrow\vec{0}} \frac{|x|^{a}|y|^{b}}{|x|^{c}+|y|^{d}} = 0

Sorry guys, totally forgot about latex! Here's a more readable version...
 
Do you mean \lim_{x\to 0} or \lim_{(x,y)\to 0}. If the former, it is pretty easy! As x goes to 0, for any y, the numerator goes to 0. If y is not 0, the denominator goes to |y|^d and, of course, 0/|y|^d= 0. If y is 0, then the function is 0 for all x so its limit is still 0.

If the problem is \lim_{(x,y)\to 0},l that's a bit harder.
 
It's the second one. I tried to put the vector lines over the x and 0 lol.

Yeah I'm not sure how to start this! Should I try using Squeeze theorem with something? Or the definition of a limit?
 
I figured it out, decided to post the answer just in case someone else has the same kind of question sometime...
basically just change the numerator to:
(|x|^c)^(a/c) (|y|^d)^(b/d)
and use the inequalities:
|x|^c <= |x|^c + |y|^d
|y|^d <= |x|^c + |y|^d
then cancel out and use squeeze theorem
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top