Limit: Difference between revisions

From Calculus
No edit summary
No edit summary
Line 1: Line 1:
==Definition for finite limit of functions of one variable==
==Definition for finite limit for function of one variable==


===Two-sided limit===
===Two-sided limit===

Revision as of 23:41, 12 April 2012

Definition for finite limit for function of one variable

Two-sided limit

Suppose f is a function of one variable and cR is a point such that f is defined to the immediate left and immediate right of c (note that f may or may not be defined at c). In other words, there exists some value t>0 such that f is defined on (ct,c)(c,c+t).

For a given value LR, we say that:

limxcf(x)=L

if the following holds (the single sentence is broken down into multiple points to make it clearer):

  • For every ϵ>0
  • there exists δ>0 such that
  • for all xR satisfying 0<|xc|<δ (explicitly, x(cδ,c)(c,c+δ)),
  • we have |f(x)L|<ϵ (explicitly, f(x)(Lϵ,L+ϵ)).

The limit (also called the two-sided limit) limxcf(x) is defined as a value LR such that limxcf(x)=L. By the uniqueness theorem for limits, there is at most one value of LR for which limxcf(x)=L. Hence, it makes sense to talk of the limit when it exists.

Left hand limit

Suppose f is a function of one variable and cR is a point such that f is defined to the immediate left of c (note that f may or may not be defined at c). In other words, there exists some value t>0 such that f is defined on (ct,c).

For a given value LR, we say that:

limxcf(x)=L

if the following holds (the single sentence is broken down into multiple points to make it clearer):

  • For every ϵ>0
  • there exists δ>0 such that
  • for all xR satisfying 0<cx<δ (explicitly, x(cδ,c)),
  • we have |f(x)L|<ϵ (explicitly, f(x)(Lϵ,L+ϵ).

The left hand limit (acronym LHL) limxcf(x) is defined as a value LR such that limxcf(x)=L. By the uniqueness theorem for limits (one-sided version), there is at most one value of LR for which limxcf(x)=L. Hence, it makes sense to talk of the left hand limit when it exists.

Right hand limit

Suppose f is a function of one variable and cR is a point such that f is defined to the immediate right of c (note that f may or may not be defined at c). In other words, there exists some value t>0 such that f is defined on (c,c+t).

For a given value LR, we say that:

limxc+f(x)=L

if the following holds (the single sentence is broken down into multiple points to make it clearer):

  • For every ϵ>0
  • there exists δ>0 such that
  • for all xR satisfying 0<xc<δ (explicitly, x(c,c+δ)),
  • we have |f(x)L|<ϵ (explicitly, f(x)(Lϵ,L+ϵ).

The right hand limit (acronym RHL) limxc+f(x) is defined as a value LR such that limxc+f(x)=L. By the uniqueness theorem for limits (one-sided version), there is at most one value of LR for which limxc+f(x)=L. Hence, it makes sense to talk of the right hand limit when it exists.

Relation between the limit notions

The two-sided limit exists if and only if (both the left hand limit and right hand limit exist and they are equal to each other).

Definition of finite limit for function of one variable in terms of a game

The formal definitions of limit, as well as of one-sided limit, can be reframed in terms of a game. This is a special instance of an approach that turns any statement with existential and universal quantifiers into a game.

Two-sided limit

Consider the limit statement, with specified numerical values of c and L and a specified function f:

limxcf(x)=L

The game is between two players, a Prover whose goal is to prove that the limit statement is true, and a Skeptic (also called a Verifier or sometimes a Disprover) whose goal is to show that the statement is false. The game has three moves:

  1. First, the skeptic chooses ϵ>0, or equivalently, chooses the target interval (Lϵ,L+ϵ).
  2. Then, the prover chooses δ>0, or equivalently, chooses the interval (cδ,c+δ){c}.
  3. Then, the skeptic chooses a value x satisfying 0<|xc|<δ, or equivalently, x(cδ,c+δ){c}, which is the same as (cδ,c)(c,c+δ).

Now, if |f(x)L|<ϵ (i.e., f(x)(Lϵ,L+ϵ)), the prover wins. If |f(x)L|ϵ, the skeptic wins.

We say that the limit statement

limxcf(x)=L

is true if the prover has a winning strategy for this game. The winning strategy for the prover basically constitutes a strategy to choose an appropriate δ in terms of the ϵ chosen by the skeptic. Thus, it is an expression of δ as a function of ϵ.

We say that the limit statement

limxcf(x)=L

is false if the skeptic has a winning strategy for this game. the winning strategy for the skeptic involves a choice of ϵ, and a strategy that chooses a value of x (constrained in the specified interval) based on the prover's choice of δ.

Conceptual definition and various cases

Formulation of conceptual definition

Below is the conceptual definition of limit. Suppose f is a function defined in a neighborhood of the point c, except possibly at the point c itself. We say that:

limxcf(x)=L

if:

  • For every choice of neighborhood of L (where the term neighborhood is suitably defined)
  • there exists a choice of neighborhood of c (where the term neighborhood is suitably defined) such that
  • for all xc that are in the chosen neighborhood of c
  • f(x) is in the chosen neighborhood of L.

Functions of one variable case

The following definitions of neighborhood are good enough to define limits.

  • For points in the interior of the domain, for functions of one variable: We can take an open interval centered at the point. For a point c, such an open interval is of the form (ct,c+t),t>0. Note that if we exclude the point c itself, we get (ct,c)(c,c+t).
  • For the point +, for functions of one variable: We take intervals of the form (a,), where aR.
  • For the point , for functions of one variable: We can take interval of the form (,a), where aR.

We can now list the nine cases of limits, combining finite and infinite possibilities:

Case Definition
limxcf(x)=L For every ϵ>0, there exists δ>0 such that for all x satisfying 0<|xc|<δ (i.e., x(cδ,c)(c,c+δ)), we have |f(x)L|<ϵ (i.e., f(x)(Lϵ,L+ϵ)).
limxcf(x)= For every aR, there exists δ>0 such that for all x satisfying 0<|xc|<δ (i.e., x(cδ,c)(c,c+δ)), we have f(x)<a (i.e., f(x)(,a)).
limxcf(x)= For every aR, there exists δ>0 such that for all x satisfying 0<|xc|<δ (i.e., x(cδ,c)(c,c+δ)), we have f(x)>a (i.e., f(x)(a,)).
limxf(x)=L For every ϵ>0, there exists aR such that for all x satisfying x<a (i.e., x(,a)), we have |f(x)L|<ϵ (i.e., f(x)(Lϵ,L+ϵ)).
limxf(x)= For every bR, there exists aR such that for all x satisfying x<a (i.e., x(,a)), we have f(x)<b (i.e., f(x)(,b)).
limxf(x)= For every bR, there exists aR such that for all x satisfying x<a (i.e., x(,a)), we have f(x)>b (i.e., f(x)(b,)).
limxf(x)=L For every ϵ>0, there exists aR such that for all x satisfying x>a (i.e., x(a,)), we have |f(x)L|<ϵ (i.e., f(x)(Lϵ,L+ϵ)).
limxf(x)= For every bR, there exists aR such that for all x satisfying x>a (i.e., x(a,)), we have f(x)<b (i.e., f(x)(,b)).
limxf(x)= For every bR, there exists aR such that for all x satisfying x>a (i.e., x(a,)), we have f(x)>b (i.e., f(x)(b,)).