Sequential Characterization of Limits
Suppose you want to show that does not exist. Chasing 's and 's to prove a negative statement is awkward. The - definition is built to confirm limits, not refute them. What you really want is a way to translate something else. Specifically, a statement about a continuous variable approaching a point. You want to turn it into a statement about discrete sequences. There, tools like subsequences and the algebra of limits from Convergence of Sequences are already sharp and easy to wield. This translation is exactly what the sequential characterization of limits provides. It says that holds precisely when a condition is met. Every sequence in the domain, with and , must produce . This is not a heuristic analogy. It is a genuine logical equivalence, an "if and only if." Both directions require proof. The result matters because it gives a two-way bridge. It connects the continuous - world and the discrete world of sequences. Existence proofs can go either way. But non-existence proofs become dramatically easier. To show a limit fails to exist, it suffices to exhibit one sequence. Along this sequence, should not converge. Alternatively, exhibit two sequences along which converges to different limits. This single idea powers the standard proofs. It shows that , , and countless other functions fail to have a limit at a point. This article states the precise definitions. It proves the equivalence rigorously in both directions. It works two asymmetric examples: one confirming a limit, one refuting one. It also shows exactly which hypothesis cannot be dropped. That hypothesis is the exclusion of .
- The theorem: iff for every sequence with in the domain, .
- It is a biconditional: both the "- sequential" and "sequential -" directions need separate proofs.
- The forward direction is a direct construction; the reverse direction is a proof by contrapositive, built by negating the - definition.
- Its main practical use is disproving limits: one bad sequence, or two sequences with different sequential limits, kills the limit.
- The condition is essential — dropping it can force into the answer, breaking the equivalence when is undefined or discontinuous at .
- It generalizes verbatim to functions between metric spaces, and underlies rigorous definitions of continuity and derivatives.
- Key idea: continuous approach to a point is fully captured by all possible discrete approaches to that point.
Where this lives today
The sequential characterization is the standard tool for proving nonexistence of limits in every introductory real analysis course, and it reappears immediately in the definition of Continuity via sequences (continuity of at becomes: , with no need to exclude this time, since is now part of the answer). It underlies rigorous treatments of the derivative as a limit of difference quotients, where sequential arguments are often cleaner than direct - estimates. In numerical analysis and scientific computing, iterative algorithms that generate a discrete sequence of approximations rely implicitly on this correspondence to justify that computed sequential limits track the true continuous limit. In topology, the same idea generalizes to nets (for general topological spaces, where sequences alone may not suffice) and to filters, both built explicitly to repair the sequential criterion in settings without countable neighborhood bases. In complex analysis and functional analysis, sequential compactness arguments and continuity of operators between normed spaces routinely invoke this same equivalence to reduce continuum-indexed statements to countable, discrete ones. The idea also underlies the "sandwich" or squeeze techniques taught alongside The Algebra of Limits, since squeezing is often first proved for sequences and then ported to functions via exactly this correspondence.
Ask the tutor: How does this sequential criterion change when we define continuity instead of a general limit, and why does the exclusion disappear there?
Let where , and let be a limit point of (every open interval around contains a point of other than ). Let .
(- definition.) We say
if for every there exists such that for all ,
(Sequential convergence, recalled). A sequence of real numbers converges to , written , if for every there exists such that .
(The sequential criterion, to be proved equivalent). We say satisfies the sequential criterion for the limit at if: for every sequence with for all and , we have .
Intuition
Think of as a target on the number line, and imagine every conceivable way of walking toward it without ever landing exactly on it: from the left, from the right, hopping around erratically, spiraling in with alternating signs, whatever you like — as long as the walk converges to . The - definition says when is continuously close to . The sequential criterion says instead: no matter which of these discrete walks toward you choose, the corresponding heights must all funnel toward the same value . The power of the equivalence is that it lets you swap perspectives. The - side is a universal statement about a continuum (hard to falsify directly, since there are uncountably many near to check). The sequential side is a universal statement about sequences, but it becomes easy to falsify: you just need one bad walk. If along one path and along another, the sequential criterion fails for every , so — by the theorem — the - limit does not exist either. The figure below shows this "many paths, one destination" picture for a function with a genuine limit at , alongside a warning sign for a function like where different paths disagree.
Central theorem
Let with , let be a limit point of , and let . Then
(in the - sense) if and only if for every sequence with for all and , the image sequence satisfies
We prove both directions. Let , , , be as in the statement; note being a limit point of guarantees such sequences exist at all (a fact we use implicitly but do not need to re-derive here, as it is a standard consequence of the definition of limit point).
Direction 1: - sequential. (Direct proof.) Assume in the - sense. Let be an arbitrary sequence with for all , and . We must show . Fix . By the - hypothesis, there exists such that
Since , applying the definition of sequential convergence with this specific , there exists such that
Now fix any . Since , we have and , so ; combined with (2) this gives . Applying (1) with gives
Since this holds for all , and was arbitrary, we conclude by the definition of sequential convergence. As was an arbitrary admissible sequence, the sequential criterion holds.
Direction 2: sequential -. (Proof by contrapositive.) We prove the contrapositive: assume does not satisfy in the - sense; we construct a sequence with but , which negates the sequential criterion. Negating the - definition: "" fails means
Fix such an . For each , apply this negated statement with : there exists a point, which we call , satisfying
(This uses the Axiom of Choice / dependent choice implicitly to pick one such for each , as is standard and harmless in this elementary setting.) We now verify has the required properties. Membership: by construction for every , and forces , so for all . Convergence to : let be arbitrary. Choose with (possible by the Archimedean property of ). For , (3) gives . Hence . Failure of : by (3), for every , not just eventually. In particular it is false that for every there is with for : taking , no such can work since always. Hence . We have produced a sequence with but . This is precisely the negation of "for every admissible sequence , ." So the sequential criterion fails. This proves the contrapositive of Direction 2, and hence Direction 2 itself: if the sequential criterion holds for all sequences, the - limit must hold.
Conclusion. Both directions are established, so
Let , and let be a limit point of . If there exist two sequences in with , , but
(where both limits exist but differ), or if there exists a single sequence for which has no limit at all, then does not exist.
Suppose toward contradiction that exists for some . By Direction 1 of the theorem above, every sequence in satisfies . Case 1 (two disagreeing sequences): both and would force and . But sequential limits are unique (a basic fact proved directly from the triangle inequality in the theory of Convergence of Sequences), so this would force , contradicting the hypothesis that they differ. Case 2 (one non-convergent sequence): the sequence would be forced to satisfy , contradicting the hypothesis that has no limit. In both cases we reach a contradiction, so no such can exist; hence does not exist.
∎Worked examples
Example 1 (confirming a limit via the sequential criterion, asymmetric case). Let for (undefined at , note ), and let . We claim . First simplify algebraically for :
This is valid precisely because we divide by , which holds for every . We verify the sequential criterion directly (bypassing -, since the theorem lets us). Let be any sequence with (i.e. for all , automatically true since ) and . Then for every ,
By the algebra of limits for sequences (subtraction of a convergent sequence and a constant sequence), since ,
This holds for every admissible sequence , with the same limit each time. By the theorem (Direction 2, applied in reverse as a sufficient condition), we conclude
Notice the asymmetry deliberately built in: the function is a genuinely non-symmetric rational expression, not a disguised even/odd function, and the point is a removable singularity rather than an endpoint or a "nice" value like .
Example 2 (refuting a limit — a genuinely two-sided oscillatory case). Let
We show does not exist, using the Corollary above with two explicitly asymmetric sequences (not simply mirror images). Define
Both are strictly positive, so for all . Convergence to : as , the denominators and both tend to , so and (reciprocal of a sequence diverging to tends to , a standard fact from the algebra of sequence limits). Evaluating along :
using periodicity of with period . So for all , hence . Evaluating along :
again by periodicity, and using the exact value . So . We have exhibited , , both in , with
By the Corollary, does not exist. Notice the choice of the second sequence's phase (, giving ) rather than the more common or : any two distinct output values reachable infinitely often suffice, and this shows the argument does not depend on cherry-picking extreme values like the sequence hitting .
The theorem requires every admissible sequence to satisfy , i.e. for all . Suppose we weaken this to merely requiring and , allowing . Take , , and define
Under the correct (-) definition, : for any , take ; then forces , so , and . This verifies the - definition with , and by the theorem (correctly stated, excluding ), every sequence with satisfies , consistent with . Now suppose we (incorrectly) drop the exclusion and consider the constant sequence for all , which trivially satisfies under the weakened rule. Then
so . Under the weakened ("sequential criterion without excluding ") reading, this single sequence would force us to conclude "the sequential limit is , not " — directly contradicting the correct - value established above. The equivalence in the theorem breaks completely: the weakened sequential statement is no longer equivalent to , and in fact under the weakened rule no single value of can make the criterion true, since the constant sequence forces while sequences avoiding force . This shows precisely why is not a cosmetic technicality: the - definition of is deliberately blind to the value (indeed need not even be defined at ), and only excluding from admissible sequences preserves that blindness.
Scope, edge cases & common traps
| Situation | What to check | Common error |
|---|---|---|
| Function undefined at (e.g. removable singularity) | must still be a limit point of ; sequences automatically avoid since | Assuming the limit requires to exist |
| Proving a limit exists via sequences | Must show every sequence works, not just one or two nice ones | Checking only and along "nice" paths and declaring victory |
| Proving a limit fails to exist | Only need one bad sequence, or two disagreeing ones | Trying to use - directly to prove nonexistence (technically possible but far harder) |
| Isolated points of the domain | must be a limit point; if is isolated, the limit concept (and this theorem) does not apply | Attempting to apply the theorem at an isolated point of |
| Two-sided vs one-sided limits | The theorem as stated uses all sequences ; one-sided versions restrict to or | Forgetting to restrict the family of sequences when proving a one-sided limit |
The mathematician behind it
Origins · 1 minAugustin-Louis Cauchy and how this was discovered
Cauchy was among the first to insist that calculus be built on precise, checkable definitions of limit and convergence rather than infinitesimal intuition alone. His Cours d'Analyse (1821) introduced limit and continuity definitions strikingly close to the modern - formulation later sharpened by Weierstrass, and treated sequences and series with comparable rigor. The interplay between sequences and continuous limits that this article formalizes traces directly back to the analytic culture Cauchy helped create: viewing a function's behavior near a point through the lens of arbitrary approaching sequences, and demanding that every such approach agree, is the spirit of Cauchy's foundational program carried to its precise modern statement.
Why do we need both directions of the proof — isn't one direction "obvious"?
Both directions carry real content and neither is redundant. The forward direction (- sequential) is the more intuitive one: once you have a working for a given , any sequence converging to eventually falls inside that -neighborhood, so it is a fairly direct chase. The reverse direction is genuinely harder, because "for every sequence, " is a statement about countably many discrete objects, while "-" is a statement about an uncountable neighborhood. Bridging that gap requires actively constructing a witnessing sequence from a failed - attempt, which is why the contrapositive proof explicitly builds using . Dropping either direction would leave the equivalence unproven, only a one-way implication.
Can I use just two sequences (left and right limits) to prove a limit exists?
No — this is one of the most common student errors. Checking that and give the same functional limit shows the one-sided limits agree, but the sequential criterion in this theorem requires every sequence approaching , not just monotone ones from each side. There exist functions where the one-sided limits agree but oscillatory sequences (like alternating signs, or spiraling through irrational and rational values) produce different limits, so the two-sided limit fails to exist even though naive left/right checks looked fine. The only fully rigorous way to prove existence via sequences is to give a general argument valid for an arbitrary sequence , as in Worked Example 1.
Does this theorem work for functions of several variables or complex functions?
Yes, essentially verbatim, replacing with the appropriate metric (Euclidean distance in , modulus in ). The proof is identical since it only uses the metric-space structure (absolute value as a distance, triangle inequality, Archimedean property for the index ), not anything special to one real variable. This is exactly why multivariable calculus courses can use the "check two different paths give different limits" trick to disprove limits like : it is the same sequential (or "along-a-path") criterion in disguise.
What's the difference between this and the definition of continuity?
Continuity at (assuming ) is defined as . Translating through this theorem, is continuous at if and only if every sequence in satisfies — and notably, for continuity we do not need to exclude , because even if some , we'd just get trivially, causing no contradiction. This is the key structural difference from the general limit theorem, where excluding was essential precisely because need not equal (or even be) the limit .
Why does the corollary about "two sequences with different limits" work as a complete disproof, and not just weak evidence?
Because the corollary is derived directly from the forward direction of the main theorem (which is unconditionally true whenever the limit exists), not assumed independently. If truly existed, the forward direction guarantees literally every admissible sequence maps to a sequence converging to that same . Producing two sequences with different limits directly contradicts that universal guarantee, which is a strict logical contradiction, not just suggestive numerical evidence. That is what makes it a legitimate proof of nonexistence rather than a heuristic.
Is the axiom of choice really needed to build the sequence in the reverse direction?
A form of countable dependent choice is used to select, for each , one witness point satisfying the required inequalities — the negated - statement only guarantees existence of some such point for each , not a canonical one. In ordinary real analysis this is considered entirely unproblematic and is used constantly (e.g., in proving the Bolzano–Weierstrass theorem or that Cauchy sequences converge), since it only requires choice over a countable family of nonempty sets, a much weaker assumption than full Axiom of Choice. It is standard practice to invoke it silently, as most analysis textbooks do.