Before you begin
- Absolute-value inequalities, punctured neighborhoods, and elementary limit calculations.
Learning objectives
- State the quantifiers in the definition of a finite limit in their correct order.
- Construct epsilon–delta proofs for linear and quadratic functions.
- Negate the definition and establish uniqueness of a limit.
A numerical table can make a limit plausible. A proof must handle every input sufficiently near the target, including inputs that no table contains. We therefore need a statement that says exactly what “sufficiently near” must accomplish.
Let be defined throughout a punctured neighborhood of . We say if
Here is the requested output tolerance and is the promised input tolerance. We receive an arbitrary positive , then choose a suitable , then guarantee the implication for every permitted . A choice of may depend on , , and the fixed function. It must not depend on an input selected afterward.
A linear proof from start to finish
Prove . The output error is
For a given , choose . If , then . Since this works for every positive tolerance, the proof is complete.
Notice the distinction between scratch work and the proof. We discovered by working backward from the desired inequality. We presented the proof forward, starting with an arbitrary tolerance and the explicit choice. A successful proof does not require the largest possible . Any positive choice that ensures the implication works.
A quadratic needs a local bound
To prove , factor the error:
The second factor depends on . We first arrange , which gives and hence . Now choose
If , then . The final strict inequality comes from the strict bound on . The minimum enforces two requirements simultaneously: remain in a neighborhood where the auxiliary factor is controlled, and make the final error small.
For a general fixed real , implies . Thus proves .
The largest symmetric tolerance for a square
The laboratory uses an exact bound to make the geometry visible. Put . For ,
The supremum of the output error on this open neighborhood is , approached from the outward direction. A sufficient and, for the symmetric neighborhood, maximal choice is
The second form avoids subtracting nearly equal numbers in computation. At , this becomes . At and , it is approximately . Setting is valid: the boundary supremum equals , but boundary inputs are excluded and every interior error is strictly smaller. This is a useful example of why strict and nonstrict inequalities cannot be interchanged casually.
How to show a candidate fails
Negating the definition gives: there exists some such that for every , there is a permitted with and .
For , the candidate fails at zero. Choose . Whatever is offered, choose . Then and . To rule out every candidate, the one-sided disagreement established previously is more economical: any two-sided limit would equal both and .
A finite limit is unique
Suppose two distinct finite limits and existed. Let . There would be neighborhoods in which outputs are within of each limit. Choose a noncentral input inside both neighborhoods. The triangle inequality would give
a contradiction. The existence of nearby domain points matters; our punctured-neighborhood assumption supplies them. This proof establishes uniqueness without relying on a picture.
Exercises
- Prove with an explicit .
- Prove using the largest symmetric tolerance.
- Prove using a local bound of radius one.
- Explain why choosing is not an acceptable construction in the quadratic proof.
- For , , does guarantee the square-function tolerance? Find the supremum error.
- Show that the candidate limit fails for the constant function at zero.
Worked solutions
- Choose . The output error is .
- Choose . Then implies .
- If , then . Choose and factor .
- This choice depends on the later input . We must provide a single radius that works for every input inside it; bounding by a fixed constant accomplishes that.
- The supremum is , greater than , so the guarantee fails. For example, is allowed and produces error .
- Choose . Every nonzero input within every proposed positive radius has error .
Choose a delta that works
For f(x) = x², require |x² − a²| < ε whenever 0 < |x − a| < δ. The guarantee below is analytic for every input in the neighborhood, rather than a check of plotted samples.
Delta 0.1 is too large for epsilon 0.1 at a = 2.
| Quantity | Value |
|---|---|
| Input interval (excluding its center) | (1.9, 2.1), excluding 2 |
| Required output interval | (3.9, 4.1) |
| Supremum formula | 2|a|δ + δ² |
The supremum is approached at the open boundary; it is not an attained maximum inside the neighborhood. Equality of the supremum with ε still guarantees the strict interior inequality. The suggested control value is rounded downward to the slider grid. The general epsilon–delta proof remains in the chapter and in the print edition.