Академический Документы
Профессиональный Документы
Культура Документы
7) = 1.
(ii) Use your answer to part (i) to write down a formal proof of this limit.
Solution
We are asked for a number C such that |x + 4| < C whenever 0 <
|x 2| < 1. Well think about this in two ways. First, consider a graph
of the function f (x) = |x + 4| restricted to the interval (1, 3)/ {2} (in other
words, restricted to the set {x 2 R|0 < |x 2| < 1}).
We can read from this graph that C = 7 will be a choice. (In fact, any
number C 7 is a correct choice.)
A more algebraic way to get the same answer is to use the triangle
inequality to deduce:
|x + 4| = |x
|x
2 + 6|
2| + 6
< 1+6
= 7.
2| < 1.)
7) = 1.
7)
1| =
=
=
<
|x2 + 2x 8|
|(x + 4)(x 2)|
|x + 4||x 2|
|x + 4|
2| < .
(??)
< 7
( 1, so 0 < |x 2| < 1,
so we can use our answer
to part (i).)
9| < .
9| < .
9| < .
We could do all three parts at once, but in the interest of simplicity we will
separate them. At the start of each part we will estimate the term |x + 3|.
This estimation will be used in the deduction that follows.
Proof of (i).
Let x satisfy 0 < |x
3| < min 1, 7 .
This implies that |x 3| < 1, so we can deduce (using the triangle inequality)
that:
|x + 3| = |x 3 + 6| |x 3| + 6 < 1 + 6 = 7 (?).
Thus:
|x2
9| =
<
<
=
|x 3||x + 3|
|x 3| 7
7 7
.
Proof of (ii).
Let x satisfy 0 < |x
3| < min 2, 8 .
This implies that |x 3| < 2, so we can deduce (using the triangle inequality)
that:
|x + 3| = |x 3 + 6| |x 3| + 6 < 2 + 6 = 8 (?).
Thus:
|x2
9| =
<
<
=
|x 3||x + 3|
|x 3| 8
8 8
.
Proof of (iii).
Let x satisfy 0 < |x
(?).
Thus:
|x2
9| =
<
<
=
|x 3||x + 3|
|x 3| 2018
2018 2018
.
Set = min( 19
, 1).
Let x be an arbitrary real such that 0 < |x
Then:
|f (x)
8| =
=
<
|x3 8|
|x 2||x2 + 2x + 22 |
|x 2|(|x|2 + 2|x| + 4)
(32 + 2 3 + 4)|x 2|
< (19)
.
2| < .
x=
a.
Proof
Let be a positive real number.
p
Set = a .
Let x be an arbitrary number from the domain of
Then:
p
| x
a| =
p
( x
a)
p
p
( x)2 ( a)2
p p
x+ a
p 1 p |x
a|
x+ a
p1 |x
a|
a
<
p1
a
=
=
x with 0 < |x
a| < .
p p
px+pa
x+ a
= .
Problem 5? :
1
1
x 4 a 4 (Some expression.) = (x a).
The trick is to exploit the following standard identity, which is true for any
reals a, b 2 R and any integer p > 0:
b)(ap + ap
(a
b + ap
2 2
b + . . . + abp
+ bp ) = ap+1
bp+1 .
Set
= a 4 .
1
a| < .
Then:
x
1
4
1
4
=
=
<
1
4
1 3
x4
a4
|x
1
4
1 3
1 2 1 1 1 2 1 3
+ x4
a4 + x4 a4 + a4
1 3 1 2 1 1 1 2 1 3
x4 + x4
a4 + x4 a4 + a4
x4
1 2 1 1 1 2 1 3
+ x4
a4 + x4 a4 + a4
x4
a4
a|
a4
= .
1
3 (x+3)4
= 1.
Proof
Let M be an arbitrary positive real number.
Set = 11 .
M4
( 3)| < .
1
(x + 3)4
1
|x ( 3)|4
1
4
1
1
M4
= M.
5
(x+1)3
1.
Solution
According to the definition of a limit from the left, the x we will need to
test during the proof will be the set of x satisfying 1
< x < 1. The
challenging thing will be to use this information to find some inequality
5
relating the expression f (x) = (x+1)
. One
3 to some expression involving
approach is to make the following deductions:
1
)
)
)
)
)
)
<x<
1,
< 1 + x < 0,
>
(1 + x) > 0,
1
1
> > 0,
(1 + x)
3 3
1
1
>
> 0,
1+x
5
5
> 3 > 0,
3
(x + 1)
5
5
<
< 0. (?).
3
3
(x + 1)
Proof:
Let N be an arbitrary negative real number.
1
3
Set = 5N
(??).
Let x be an arbitrary real number such that 1
Then:
f (x) =
<x<
1.
5
,
(x + 1)3
<
= N
5
3
|x| x |x|
|y| y |y|
y + y|
|x
y| + |y|.
|x|
y|
|y|.
y| = |y
x|
|y|
|x|.
Now | |x| |y| | either equals |x| |y| or |y| |x| (depending on whether
|x|
|y| or |y|
|x|), so together the previous two equations imply the
required fact:
|x y| | |x| |y| | .