A Limit Proof Technique

One of the most difficult tasks students face in beginning calculus is writing formal proofs for limits. The concluding line in all such proofs is that k0 B Pk % where the original limit problem is to show that lim 0 B P
B+

In many cases, but not in all cases, we can sometimes factor 0 (B P as a product in the form B + 1B where 1B is just another function comprising the second factor. Note the first factor must be of the form B + where the limit is being taken as B approaches +. When such a factorization exists, then all that needs to be shown is that the function 1B is bounded over some open interval containing +. When 1B is bounded for B near + we can guarantee that k0 B Pk % by making the equivalent product B + 1B sufficiently small. If k1Bk F we can make the product B + 1B small because we can make the first factor B + very small, even when 1B is as large as F , by insuring B is sufficiently close to +. More formally, let's suppose for some positive constant F that we can show that for all B on both sides of +, but near +, that k1Bk F . When we say for B near + we just mean B is within some neighborhood of +, say B is within - unit= of +. + - B + - i.e. kB +k - For many functions we can take - ", but otherwise - need only be some small positive number Then we can construct a formal proof for the limit as follows. % Assume ! kB +k $ . Then we can write F kB +k - and with B restricted by this last inequality we should be able to derive that k1Bk F Let % 0 be given. Choose $ 73837?7- Furthermore, we can write kB +k

% % . Now since ! kB +k and since ! k1Bk F , we F F can multiply the middle and right parts of these two inequalities and compare the smaller product with the larger product. % kB + k F kB +k k1Bk % % k1Bk F % F F

kB + 1Bk % k0 B Pk %

UIH

89>+ ,/8/ In actual practice, you will want to find the 1B function first, and then try to establish the upper bound F for that function. Establishing the value of F may naturally lead to other restictions on either B or + or both that may also influence the cases in your proof and may influence your choice of $ .

Example 1: Prove that lim B% +% where + may be positive or zero or negative

Let % ! be given. Choose $ 73837?7 " Assume ! kB +k $

%ak+k "b$

Finally, B% +% B + eB$ +B# +# B +$ f and so we can derive an upper bound for the second factor by writing: kB$ +B# +# B +$ k kB$ k k+B# k k+# Bk k+$ k kBk$ k+kkBk# k+k# kBk k+k$ ak+k "b$ ak+k "b$ ak+k "b$ ak+k "b$ %ak+k "b$ We have just shown that kB$ +B# +# B +$ k %ak+k "b$ . We also have that kB +k %ak+k "b$ %

Then kB +k " so that " B + " or + " B + " Since k+ "k k+k " and since k+ "k k+k " we know k+k " 7+B37?7ek+ "k k+ "kf Thus we know kBk k+k " We also know that k+k k+k "

Now multiplying these last two inequalities we can write kB +k kB$ +B# +# B +$ k %ak+k "b %
$

%ak+k "b$

kB + eB$ +B# +# B +$ fk % B% +% % UIH

kB +k kB$ +B# +# B +$ k %

$ $ Example 2: Prove that lim B + where + !

Let % ! be given. Choose $ 73837?7 Then kB +k

B+

k+ k k+ k k+k k+k k +k so that B+ or + B+ # # # # # Now regardless of the sign of +, we claim that B and + have the same sign. k+ k + + For if + ! then the inequality that B + means B + ! # # # k+ k + + If + ! then the inequality that + B means ! + B # # # $ Since B and + have the same sign we know B+ ! " Now we can write that ! B # B + + # $ $ $ $
# # $ $ $ B B+ +

k+ k $ %+# Assume ! kB +k $ #

"

" " # $ $ $ $ B B+ + + #
#

We dropped the first two positive denominator values in order to establish this last inequality. Now multiplying the middle and right parts of the two inequalities that " " $ ! kB +k %+# and ! $ B # B + + # + # $ $ $ $ " " $ we have kB +k %+# # # $ B B + + $ $ $ $ + # " kB + k % # # B B + + $ $ $ $

$ $ B + " kB + k % # # B + B B + + $ $ $ $ $ $
$ $ B + kB + k % kB + k $ $ B + %

UIH

$ Example 3: Prove that lim B !

B!

If we try the factoring technique we would write B This implies the 1B function is
$ B

$ B

for B + a0 B Pb

B B " Unfortunately, the function $ is not bounded within any neighborhood of !. B# This is an example where the technique explained before Example 1 cannot be applied. However, both Example 2 and Example 3 can be solved more easily and more directly by $ giving a more geometric argument based on the graph of the function C B
$ We can prove the limit in Example 3 by letting % ! be given and choosing $ % Then assume ! kBk $ $ $ $ Then kBk % . This implies that % B %

"
# $

" $ B#

Because the function 2B B$ is monotonically increasing we can apply this function to all three parts of this last inequality to establish that
$ $ % $ B$ % $ i.e., % B$ %

This means kB$ !k % which is what we needed to establish. An easier proof for Example 2 can also be given. However, looking back at Example 2 we can k+ k understand that the expression was used as a possible first choice for $ just to insure that B # and + have the same sign. When + !, and B is very close to + then B and + have the same sign $ $ and this property insures that the middle term in the denominator, namely B + is positive. In Example 2, we first found the 1B function was
$ $ $ $ B B + + #

"

and then we decided we could drop the first two positive terms in the denominator and just use " as the upper bound F for k1Bk. Dividing by a fraction is accomplished by multiplying $ +# $ by its reciprocal, so we came up with %+# as our second choice for $ in Example 2. John Kennedy Mathematics Department Santa Monica College