Ma · Mathematics

How to Prove a Multivariable Limit with Epsilon and Delta

Published By the 9to5Science editorial team

At a glance

  1. 1. State the definition

    Use the Euclidean distance from (x,y) to the point where the limit is taken.

  2. 2. Rewrite the difference

    Subtract the proposed limit from the function and find a useful upper bound.

  3. 3. Relate distances

    Bound the expression using the distance that appears in the definition.

  4. 4. Choose delta

    Make the upper bound smaller than epsilon by choosing delta accordingly.

A limit of a function of two variables is proved by showing that points sufficiently close to (a,b)(a,b) make the function value sufficiently close to LL. The distance is measured in the plane, usually with the Euclidean norm. The proof follows the same logic as a one-variable ϵ\epsilon-δ\delta proof, but the input can approach the point from any direction.

The definition for two variables

The statement

lim⁡(x,y)→(a,b)f(x,y)=L\lim_{(x,y)\to(a,b)} f(x,y)=L

means that for every ε>0\varepsilon>0, there is a δ>0\delta>0 such that

0<(x−a)2+(y−b)2<δ⟹∣f(x,y)−L∣<ε.0<\sqrt{(x-a)^2+(y-b)^2}<\delta \quad\Longrightarrow\quad |f(x,y)-L|<\varepsilon.

The quantity (x−a)2+(y−b)2\sqrt{(x-a)^2+(y-b)^2} is the Euclidean distance between (x,y)(x,y) and (a,b)(a,b). The condition that this distance is positive excludes the point (a,b)(a,b) itself; a limit concerns nearby points, not necessarily the function’s value at the point.

The order of the choices matters: you are given an arbitrary ε>0\varepsilon>0, and then you must specify a suitable δ\delta. Your choice may depend on ε\varepsilon, but not on the particular point (x,y)(x,y).

A practical proof method

Start by examining ∣f(x,y)−L∣|f(x,y)-L|. Try to rewrite or estimate it in terms of ∣x−a∣|x-a|, ∣y−b∣|y-b|, or the combined distance

r=(x−a)2+(y−b)2.r=\sqrt{(x-a)^2+(y-b)^2}.

Useful inequalities include ∣x−a∣≤r|x-a|\le r and ∣y−b∣≤r|y-b|\le r. If you can show that ∣f(x,y)−L∣≤Cr|f(x,y)-L|\le Cr near (a,b)(a,b) for some constant C>0C>0, then choosing δ=ε/C\delta=\varepsilon/C is often enough. If your estimate only works in a restricted neighborhood, also require δ\delta to be small enough to stay in that neighborhood.

A typical proof therefore has four parts: let ε>0\varepsilon>0 be arbitrary; choose δ\delta; assume 0<r<δ0<r<\delta; and use the estimate to prove ∣f(x,y)−L∣<ε|f(x,y)-L|<\varepsilon.

Worked example: a limit at a nonzero point

Prove that

lim⁡(x,y)→(1,2)(x2+y2)=5.\lim_{(x,y)\to(1,2)}(x^2+y^2)=5.

Let ε>0\varepsilon>0. Factor the difference from the proposed limit:

∣x2+y2−5∣=∣(x2−1)+(y2−4)∣≤∣x−1∣∣x+1∣+∣y−2∣∣y+2∣.\begin{aligned} |x^2+y^2-5| &=|(x^2-1)+(y^2-4)|\\ &\le |x-1||x+1|+|y-2||y+2|. \end{aligned}

We first restrict the points to be within distance 11 of (1,2)(1,2). Then ∣x−1∣<1|x-1|<1 and ∣y−2∣<1|y-2|<1, so 0<x<20<x<2 and 1<y<31<y<3. Consequently, ∣x+1∣<3|x+1|<3 and ∣y+2∣<5|y+2|<5. Thus

∣x2+y2−5∣<3∣x−1∣+5∣y−2∣.|x^2+y^2-5|<3|x-1|+5|y-2|.

Each coordinate difference is no greater than the Euclidean distance r=(x−1)2+(y−2)2r=\sqrt{(x-1)^2+(y-2)^2}. Therefore,

∣x2+y2−5∣<8r.|x^2+y^2-5|<8r.

Choose

δ=min⁡(1,ε8).\delta=\min\left(1,\frac{\varepsilon}{8}\right).

If 0<r<δ0<r<\delta, then the estimates above apply and

∣x2+y2−5∣<8r<8δ≤ε.|x^2+y^2-5|<8r<8\delta\le\varepsilon.

This proves the limit. The minimum in the choice of δ\delta handles two requirements at once: staying within distance 11 for the bounds, and making the final error less than ε\varepsilon.

Using paths to test a proposed limit

A limit must work along every way of approaching (a,b)(a,b). If two paths approaching the point give different limiting function values, the multivariable limit does not exist. For example, consider

f(x,y)=xyx2+y2,(x,y)≠(0,0).f(x,y)=\frac{xy}{x^2+y^2},\qquad (x,y)\ne(0,0).

Along y=xy=x, the function is 1/21/2 for nonzero xx. Along y=0y=0, it is 00. Since these approach different values as (x,y)→(0,0)(x,y)\to(0,0), the limit does not exist. Path checks can disprove a limit, but checking a few paths cannot prove one: a successful epsilon-delta argument must cover all nearby points.

Common mistakes

  • Using separate coordinate conditions without connecting them to the definition. You may work with ∣x−a∣|x-a| and ∣y−b∣|y-b|, but explain how the distance condition controls them. If r<δr<\delta, then both coordinate differences are less than δ\delta.
  • Choosing δ\delta before seeing the needed bound. Derive an estimate for ∣f(x,y)−L∣|f(x,y)-L| first, then choose δ\delta to make that estimate less than ε\varepsilon.
  • Forgetting local restrictions. Factoring expressions often produces terms such as ∣x+a∣|x+a| that need to be bounded. Restricting r<1r<1 (or another convenient radius) can provide those bounds; include that restriction in the choice of δ\delta.
  • Treating path checks as a proof of existence. Agreement along several paths is not enough to control every direction or curved approach.
  • Requiring the function to equal the limit at the point. The definition uses nearby points with positive distance from (a,b)(a,b), so f(a,b)f(a,b) may be different or undefined.

References

  1. Calculus: Early Transcendentals, James Stewart
  2. Calculus, Volume II, Tom M. Apostol

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.