Limit of a univariate function

Let f(x) be a function. Suppose we move xR towards a while keeping xa. If in this case f(x) approaches a constant value α irrespective of the way how x approaches a, we say that f(x) converges to α as xa and write limxaf(x)=α or f(x)α as xa.



Remarka needs not belong to dom(f) (the domain of f) as long as x can approach a arbitrarily closely. □

But what does this mean exactly? Here's a rigorous definition in terms of what is called the εδ argument.

Definition (Limit of a function)

We say that the function f(x) converges to α as xa and write

limxaf(x)=α

if the following condition is satisfied.

  • For any ε>0,  there exists δ>0 such that, for all xdom(f), if 0<|xa|<δ then |f(x)α|<ε.
In a logical form,
ε>0,δ>0,xdom(f) (0<|xa|<δ|f(x)α|<ε).
Remark. We are implicitly assuming ε,δR. □

Here's how this definition works. Suppose f(x)α as xa. Let us pick any positive real number ε. However small this ε may be, if x is sufficiently close to a, we can always have |f(x)α|<ε. Here ``sufficiently close'' means that we can pick some sufficiently small positive real number δ such that |xa|<δ implies |f(x)α|<ε. In other words, we move x closer and closer to a until |f(x)α|<ε holds. Conversely, if this operation is possible for any ε, it makes sense to say that f(x) converges to α as xa.

Example. Consider f(x)=x2+1. We have
limx1f(x)=2.
Let ε=0.1. Let us find δ>0 such that 0<|x1|<δ implies |f(x)2|<ε. Suppose
|f(x)2|<0.1.
Then, since f(x)2=(x2+1)2=x21,
0.1<x21<0.1
so
0.9<x2<1.1.
If x>0, then
0.9<x<1.1.
Since 0.91=0.0513 and 1.11=0.0488, if
|x1|<1.11,
then we have
|f(x)2|<0.1=ε.
So δ can be any positive number less than 1.11. For example, let δ=0.04. Then |x1|<0.04 implies 0.96<x<1.04, which implies 0.0784<x21<0.0816 so
|f(x)2|=|x21|<0.0816<0.1=ε.

Example. Let us show that limx12x=2 by using the ϵδ argument.
Let ε>0 be any positive real number. Define δ=ε2. Then, if 0<|x1|<δ, then we have |f(x)2|=|2x2|=2|x1|<2δ=ε. Therefore limx1f(x)=2. □

Comments

Popular posts from this blog

Birth process

Branching processes: Mean and variance

Informal introduction to formal logic