Exercise 4.2.1

(a)
Supply the details for how Corollary 4.2.4 part (ii) follows from the Sequential Criterion for Functional Limits in Theorem 4.2.3 and the Algebraic Limit Theorem for sequences proved in Chapter 2.
(b)
Now, write another proof of Corollary 4.2.4 part (ii) directly from Definition 4.2.1 without using the sequential criterion in Theorem 4.2.3.
(c)
Repeat (a) and (b) for Corollary 4.2.4 part (iii).

Answers

(a)
By the Sequential Criterion for Functional Limits, since lim x c f ( x ) = L , lim x c g ( x ) = M , all sequences ( x n ) c (where every x n c ) have f ( x n ) L and g ( x n ) M , which implies that f ( x n ) + g ( x n ) L + M by the Algebraic Limit Theorem, which implies that lim x c [ f ( x ) + g ( x ) ] = L + M .
(b)
Let 𝜖 > 0 , set δ 1 such that 0 < | x c | < δ 1 implies | f ( x ) f ( c ) | < 𝜖 2 and set δ 2 such that 0 < | x c | < δ 2 implies | g ( x ) g ( c ) | < 𝜖 2 . Now let δ = min { δ 1 , δ 2 } and use the triangle inequality to get | f ( x ) + g ( x ) ( f ( c ) + g ( c ) ) | | f ( x ) f ( c ) | + | g ( x ) g ( c ) | < 𝜖 2 + 𝜖 2 = 𝜖

for all 0 < | x c | < δ .

(c)
(a) is the same, if f ( x n ) L and g ( x n ) M then ( f ( x n ) g ( x n ) ) LM by the sequential criterion for functional limits.

For (b) we add and subtract f ( c ) g ( x ) then factor and use the triangle inequality (this is a common trick)

| f ( x ) g ( x ) f ( c ) g ( c ) | = | g ( x ) ( f ( x ) f ( c ) ) f ( c ) ( g ( c ) g ( x ) ) | | g ( x ) | | f ( x ) f ( c ) | | f ( c ) | | g ( c ) g ( x ) |

Now we want a few things, (1) to bound | g ( x ) | (2) to make | f ( x ) f ( c ) | small and (3) to make | g ( x ) g ( c ) | small. Whenever you want multiple things start thinking min/max!

In this case, set δ 1 so | g ( x ) g ( c ) | < 1 giving the bound | g ( x ) | < M + 1 . Set δ 2 so | g ( x ) g ( c ) | < 𝜖 2 M + 1 and set δ 3 so | f ( x ) f ( c ) | < 𝜖 2 f ( c ) . Finally set δ = min { δ 1 , δ 2 , δ 3 } to get

| f ( x ) g ( x ) f ( c ) g ( c ) | < 𝜖 2 + 𝜖 2 = 𝜖

as desired.

User profile picture
2022-01-27 00:00
Comments