Proving Nonexistence of Limits
Consider the function near the origin. Or consider the single-variable function near . Students often try to compute such limits by plugging in a sequence of convenient values. They get a plausible-looking number and declare victory. But the question "does exist?" is fundamentally a universal statement. Every sequence, every path, every approach must agree. Universal statements are refuted by a single counterexample. This article is about the logical structure of nonexistence proofs. It shows how to convert "the limit does not exist" from a vague feeling into an airtight argument. The key tool is the Sequential Characterization of Limits. It converts a statement about the continuum of points near into a statement about sequences. This trade is what makes nonexistence provable in practice. Instead of ruling out uncountably many possible -behaviors directly, we only need less. We exhibit two sequences converging to along which produces two different limits. Or we find one sequence along which has no limit at all. This is a much smaller, much more concrete task. Why does this matter beyond a technical exercise? The distinction between limits that exist and limits that don't is crucial. It is the hinge on which continuity, differentiability, and the entire theory of discontinuities turns. Before you can classify how a function fails to be continuous, you need one thing first. You must first be able to prove, not just suspect, that a limit fails to exist. Classifications include jump, removable, oscillatory, and infinite discontinuities. The techniques here are the standard toolkit used throughout analysis. These include two-sequence divergence, sequences producing unbounded values, and oscillation without convergence. They apply from single-variable calculus to multivariable limits. They also apply to the study of pathological functions like and Dirichlet-type functions. This article develops the divergence criteria rigorously from the sequential characterization. It proves the central theorem carefully. Then it works through two genuinely different nonexistence proofs. One proceeds via disagreement of two sequential limits. The other proceeds via unboundedness. Finally, it addresses common logical traps.
- To disprove existing at all, it suffices to find two sequences , , along which tends to two different limits (or one has no limit).
- This reduces an infinite/uncountable claim ("for all sequences...") to a finite, checkable counterexample (two explicit sequences).
- A single divergent sequence (e.g., oscillating without settling) also suffices to kill existence of the limit.
- The method rests entirely on the Sequential Characterization of Limits, proved independently and just invoked here, not re-derived.
- Common failure mode: computing along one sequence and wrongly concluding the limit is — this proves nothing about existence.
- Key idea: existence of is a universal claim over all sequences, so nonexistence is proved by a single explicit counterexample pair.
Where this lives today
The two-sequence divergence trick is not a toy exercise; it is the working method behind several major areas of analysis and its applications:
- Multivariable calculus: proving does not exist by comparing the path (giving limit ) against the path (giving limit ) is the direct two-dimensional analogue of the technique in this article, and it is the standard bridge to the Classification of Discontinuities in higher dimensions.
- Fourier analysis and signal processing: oscillatory, non-convergent limits (like -type behavior) model high-frequency signal artifacts and are central to understanding Gibbs phenomena and convergence failures of Fourier series at jump discontinuities.
- Numerical analysis: detecting that a computed sequence of approximations does not converge (e.g. in root-finding iterations near a discontinuity or singularity) uses exactly the "exhibit two subsequences with different limits" diagnostic.
- Probability and stochastic processes: almost-sure nonexistence of limits (e.g. non-convergence of certain random walks or oscillating martingale differences) is proved using sequential/path-based divergence arguments structurally identical to the deterministic case.
- Dynamical systems: proving an orbit does not converge to a fixed point (chaotic or periodic behavior) often reduces to finding two subsequences of iterates converging to different points, mirroring the divergence criterion exactly.
- Set-theoretic topology (as a generalization): the sequential characterization and its divergence criterion generalize to nets and filters in general topological spaces, where sequences alone may not suffice — a subtlety that motivates the passage from sequences to nets in more advanced courses.
Ask the tutor: Can you show me how the two-path method extends to prove does not exist?
Let where , and let be a limit point of (so every neighborhood of contains points of ). We say
if for every there exists such that for all with , we have . We say exists if there is some satisfying this. We say the limit does not exist (DNE) if no such exists. The Sequential Characterization of Limits (assumed known, stated for reference) says: if and only if for every sequence in with , we have .
Intuition
The - definition says "no matter how you approach , you land near ." The sequential characterization makes this literal: sequences are the ways of approaching . If the limit truly exists and equals , then absolutely every path of approach — however cleverly chosen — must funnel into . This immediately suggests the logical judo used to prove nonexistence. Existence is a claim of the form "for all sequences , for some fixed ." The negation of a "for all" statement needs only one violation. So to show the limit does not exist, you don't need to analyze all possible approaches — you need to find one pair of approaches that disagree, or one approach that fails to settle down at all. Picture the graph of near . As , , and sweeps through infinitely often, never settling. Two natural sequences — one hitting the peaks, one hitting the troughs — converge to but produce function values converging to and respectively.
The picture makes the proof strategy visible: two red/green sequences, both marching toward , but the function values pile up near two different horizontal lines. That disagreement is the entire proof.
Let , , and let be a limit point of . Suppose there exist two sequences and in such that: 1. and as ; 2. and both exist (as extended real numbers or finite reals), and 3. . Then does not exist. More generally (the single-sequence form): if there exists a sequence in with such that has no limit (fails to converge, including by being unbounded or oscillating), then does not exist.
We prove the two-sequence version; the single-sequence version is proved identically and is in fact a special case of the same underlying logic (see the remark after the proof). We argue by contradiction, using Sequential Characterization of Limits.
Setup. Suppose, for contradiction, that exists for some . We are given sequences in with , , and
Step 1 — Apply the sequential characterization to . Since is a limit point of and exists, the Sequential Characterization of Limits tells us: for every sequence in with , we have . Applying this with (which satisfies , by hypothesis), we conclude
Step 2 — Apply the sequential characterization to . By the identical argument, applying the same biconditional with , we conclude
Step 3 — Uniqueness of sequential limits. By hypothesis, . From Step 1, . A convergent sequence of real numbers has a unique limit (this is a basic property of real sequences, established independently of the theorem at hand: if and , then for every both and hold for all large , so for all , forcing ). Hence .
Step 4 — Same argument for the second sequence. Identically, by hypothesis and from Step 2, so by uniqueness of limits, .
Step 5 — Contradiction. Combining Steps 3 and 4: , so . This directly contradicts the hypothesis .
Conclusion. The assumption that exists (equal to some ) leads to a contradiction. Hence no such exists, i.e. does not exist.
Remark on the single-sequence form. Suppose instead in but does not converge. If existed, then by the Sequential Characterization applied to , we would get , i.e., does converge (to ) — contradicting the assumption that it does not converge. Hence no such exists. This is logically the contrapositive of the same single application of the sequential characterization, and it subsumes the two-sequence case: if , interleave and into one sequence ; this interleaved sequence still tends to (an exercise in the definition of sequential convergence: given , both tails are eventually within of , hence so is the interleaved tail), but has two subsequences converging to different limits , so itself cannot converge (a convergent sequence forces all its subsequences to converge to the same, unique limit). This shows the two forms are logically equivalent formulations of a single principle.
∎Worked examples
Example 1: has no limit as . Here and is a limit point of . Define, for ,
Both sequences lie in (they are never zero), and since the denominators , we get and . Now compute directly:
using the periodicity . So for all , hence trivially . Similarly,
so . Since , the Divergence Criterion (two-sequence form) applies directly: , , both in , , , and . Therefore
Note what we did not need: any appeal to "the function oscillates infinitely" in vague terms, or any - computation. Two explicit, elementary sequences and two exact function-value computations suffice.
Example 2: has no limit as , via unboundedness (single-sequence form). Let , . We use the single-sequence form of the criterion by exhibiting a sequence along which is unbounded, hence has no (finite) limit. Choose so that hits a point where equals , namely , i.e.
These are well-defined, positive, nonzero reals, and since , we get , so certainly and . Compute:
so
As , . In particular is unbounded, hence does not converge to any real number (a convergent sequence is always bounded: if , then eventually , so for all large , contradicting unboundedness). By the single-sequence form of the Divergence Criterion, since in but fails to converge, we conclude
This example is instructive because the divergence is not merely "oscillation between two values" as in Example 1 — the function is genuinely unbounded near , and yet the same logical mechanism (one sequence, no convergent limit of function values, contradiction via the sequential characterization) delivers the proof. It's worth noting this differs from saying "the limit is " — one could ask whether as in the extended sense, but even that fails, since e.g. taking gives and ; so along one path values go to and along another to , confirming there is no sensible limit, finite or infinite.
A extremely common student error is to check the limit along one sequence (or even two agreeing sequences) and conclude the limit exists. This block shows why the hypothesis "" (equivalently, the existence of disagreement) is essential, and that its absence gives no information either way. Consider the Dirichlet-type function
at . Suppose a student picks the sequence (rational, since for all ), computing
If they stop here and declare "," they have committed a logical error: they checked only one sequence, and the theorem's hypothesis (a second, disagreeing sequence, or single-sequence divergence) was never verified — worse, it was never even sought. Indeed the conclusion "" is false. Taking (irrational, since is irrational and is a field, so ), we get
Now the Divergence Criterion applies correctly (), and correctly shows does not exist. The point of this counterexample is sharper than "the student made an arithmetic mistake." It demonstrates that checking agreement along any single sequence, or even along a family of sequences that happen to agree, never proves existence of the limit — the sequential characterization requires all sequences to agree, and one supporting example, no matter how natural-looking ( is the most standard sequence there is), carries zero logical weight toward existence. The theorem's hypothesis structure (find some two sequences that disagree) is exactly matched to the falsity of the naive converse (checking some sequences that agree proves nothing). This is why the criterion is stated as a sufficient condition for nonexistence, never turned around into a sufficient condition for existence from partial sequential data.
Scope, edge cases & common traps
| Situation | What to check | Common error |
|---|---|---|
| Two-sided limit at interior point | Sequences may approach from either side, or mix sides | Only testing sequences from one side (e.g., only ) and wrongly concluding existence |
| One-sided limits or | Restrict test sequences to lie strictly on the correct side | Using a sequence that approaches from the wrong side, invalidating the criterion's hypotheses |
| Function undefined at isolated points near | Sequences must stay in the domain | Choosing that occasionally leaves (e.g. hits a pole or an excluded value) |
| Unbounded divergence (e.g. as ) | Single-sequence unboundedness suffices; distinguish "DNE" from "DNE as extended real" | Conflating "" (a meaningful extended-real statement, itself requiring proof) with plain nonexistence |
| Multivariable limits (foreshadowing) | Paths, not just sequences on , can differ; same two-path idea generalizes | Testing only straight-line paths through the limit point, missing curved paths that disagree |
The mathematician behind it
Origins · 1 minAugustin-Louis Cauchy and how this was discovered
Cauchy did not phrase limits in terms of sequences of real numbers converging by the modern – machinery — that sharper formalism is largely due to Weierstrass a generation later — but Cauchy's Cours d'Analyse (1821) was the decisive text that insisted limits be treated as precise, provable objects rather than intuitive infinitesimal manipulations. Cauchy's rigor made questions like "does this limit exist?" into genuine mathematical propositions requiring proof, rather than matters of calculation or convention, setting the stage for the sequential and – characterizations used today.
Why does it suffice to find just two sequences instead of checking every possible sequence?
Because the theorem being disproved — " exists and equals some " — is a universal statement over all sequences converging to (via the sequential characterization). To disprove a universal statement, formal logic requires only a single counterexample, not an exhaustive check. Two sequences whose function values converge to different limits directly witness that "for all sequences, " fails for every candidate : it fails for (because of ) and fails for (because of ), and by uniqueness of limits it fails for every other candidate too, since at most one value can match both. Hence no works, and existence is refuted completely by this one pair.
Does the divergence criterion also work at or for one-sided limits?
Yes, with the obvious modifications. For , "sequences converging to " becomes "sequences ," and the same sequential characterization (its version for limits at infinity) underlies an identical proof. For one-sided limits , you restrict to sequences with for all (approaching strictly from the right); the two-sequence criterion is applied with both test sequences required to satisfy this side restriction. The logical skeleton — exhibit disagreement, invoke uniqueness of sequential limits, derive a contradiction — is unchanged in every variant.
Can I use this method to prove a limit exists, not just that it fails to exist?
Not directly. The divergence criterion is a one-way tool: agreement of finitely many test sequences never establishes existence, because the sequential characterization demands agreement across all sequences, and no finite sample of sequences exhausts that infinite class. To prove existence, you either verify the – definition directly, or invoke the full force of the sequential characterization by showing convergence for an arbitrary, unspecified sequence (a universally quantified argument, not a finite check). This asymmetry — nonexistence is "easy" (existential), existence is "hard" (universal) — is one of the central logical lessons of this topic.
What is the difference between "the limit does not exist" and "the limit is infinite"?
"The limit does not exist" simply means no real number satisfies the – definition. "The limit is " (or ) is a separate, stronger, positive claim: for every there is such that implies . A function can fail to have a finite limit while also failing to diverge to or — as in Example 2 of this article, where along one sequence but along another, so neither " finite" nor "" nor "" holds. All three possibilities must be checked and ruled out separately if a fully precise classification is wanted.
How does this connect to classifying discontinuities?
Once you can rigorously prove a limit at a point does not exist, you are equipped to distinguish the different ways a function can fail to be continuous there. A removable discontinuity occurs when the limit exists but disagrees with (or is undefined at) . A jump discontinuity occurs when both one-sided limits exist but disagree with each other. An essential or oscillatory discontinuity (like at ) occurs precisely when the two-sided limit fails to exist because of exactly the kind of oscillation proved via the two-sequence criterion here. This article's techniques are the diagnostic prerequisite for that classification.
Is there a version of this for functions of several variables?
Yes, and it is essentially the same idea generalized from sequences on to sequences (or paths) in . To show does not exist, exhibit two sequences of points along which tends to different limits — often realized concretely as two different paths through the origin, such as the -axis versus the line , or the -axis versus a parabola . The underlying sequential characterization in is proved the same way, and the divergence criterion transfers verbatim.
What's the most common mistake students make when trying to apply this criterion?
By far the most common mistake is providing only one sequence and a single limiting value, then asserting the limit equals that value — this proves nothing, per the counterexample in this article. The second most common mistake is choosing two sequences that don't actually lie in the domain, or that violate the side-restriction for a one-sided limit, silently invalidating the hypotheses of the criterion. A third common error is confusing "the limit is infinite" with "the limit does not exist," treating them as interchangeable when they require separate verification.