Sequential Characterization of Limits

Suppose you want to show that lim⁡x→0sin⁡(1/x)\lim_{x\to 0} \sin(1/x) does not exist. Chasing ε\varepsilon's and δ\delta's to prove a negative statement is awkward. The ε\varepsilon-δ\delta 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 xx 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 lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L holds precisely when a condition is met. Every sequence (xn)(x_n) in the domain, with xn→cx_n \to c and xn≠cx_n \neq c, must produce f(xn)→Lf(x_n) \to L. 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 ε\varepsilon-δ\delta 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, f(xn)f(x_n) should not converge. Alternatively, exhibit two sequences along which f(xn)f(x_n) converges to different limits. This single idea powers the standard proofs. It shows that lim⁡x→0sin⁡(1/x)\lim_{x\to 0}\sin(1/x), lim⁡x→0∣x∣x\lim_{x\to 0} \frac{|x|}{x}, 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 xn=cx_n = c.

Key takeaways
  • The theorem: lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L iff for every sequence xn→cx_n \to c with xn≠cx_n \neq c in the domain, f(xn)→Lf(x_n) \to L.
  • It is a biconditional: both the "ε\varepsilon-δ\delta ⇒\Rightarrow sequential" and "sequential ⇒\Rightarrow ε\varepsilon-δ\delta" directions need separate proofs.
  • The forward direction is a direct construction; the reverse direction is a proof by contrapositive, built by negating the ε\varepsilon-δ\delta definition.
  • Its main practical use is disproving limits: one bad sequence, or two sequences with different sequential limits, kills the limit.
  • The condition xn≠cx_n \neq c is essential — dropping it can force f(c)f(c) into the answer, breaking the equivalence when ff is undefined or discontinuous at cc.
  • 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 ff at cc becomes: xn→c  ⟹  f(xn)→f(c)x_n \to c \implies f(x_n) \to f(c), with no need to exclude xn=cx_n = c this time, since f(c)f(c) 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 ε\varepsilon-δ\delta estimates. In numerical analysis and scientific computing, iterative algorithms that generate a discrete sequence of approximations xn→cx_n \to c 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 xn≠cx_n \neq c disappear there?

DefinitionLimit of a function and convergence of a sequence

Let f:D→Rf: D \to \mathbb{R} where D⊆RD \subseteq \mathbb{R}, and let cc be a limit point of DD (every open interval around cc contains a point of DD other than cc). Let L∈RL \in \mathbb{R}.

(ε\varepsilon-δ\delta definition.) We say

lim⁡x→cf(x)=L\lim_{x \to c} f(x) = L

if for every ε>0\varepsilon > 0 there exists δ>0\delta > 0 such that for all x∈Dx \in D,

0<∣x−c∣<δ  ⟹  ∣f(x)−L∣<ε.0 < |x - c| < \delta \implies |f(x) - L| < \varepsilon.

(Sequential convergence, recalled). A sequence (an)(a_n) of real numbers converges to A∈RA \in \mathbb{R}, written an→Aa_n \to A, if for every ε>0\varepsilon > 0 there exists N∈NN \in \mathbb{N} such that n≥N  ⟹  ∣an−A∣<εn \geq N \implies |a_n - A| < \varepsilon.

(The sequential criterion, to be proved equivalent). We say ff satisfies the sequential criterion for the limit LL at cc if: for every sequence (xn)(x_n) with xn∈D∖{c}x_n \in D \setminus \{c\} for all nn and xn→cx_n \to c, we have f(xn)→Lf(x_n) \to L.

Intuition

Think of cc 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 cc. The ε\varepsilon-δ\delta definition says f(x)→Lf(x) \to L when xx is continuously close to cc. The sequential criterion says instead: no matter which of these discrete walks (xn)(x_n) toward cc you choose, the corresponding heights f(xn)f(x_n) must all funnel toward the same value LL. The power of the equivalence is that it lets you swap perspectives. The ε\varepsilon-δ\delta side is a universal statement about a continuum (hard to falsify directly, since there are uncountably many xx near cc to check). The sequential side is a universal statement about sequences, but it becomes easy to falsify: you just need one bad walk. If f(xn)→L1f(x_n) \to L_1 along one path and f(yn)→L2≠L1f(y_n) \to L_2 \neq L_1 along another, the sequential criterion fails for every LL, so — by the theorem — the ε\varepsilon-δ\delta limit does not exist either. The figure below shows this "many paths, one destination" picture for a function with a genuine limit at cc, alongside a warning sign for a function like sin⁡(1/x)\sin(1/x) where different paths disagree.

Figure
Two sequences xn→cx_n \to c from opposite sides both forcing f(xn)→Lf(x_n) \to L
x c y L x₁,x₂,x₃,x₄ → c⁻ y₁,y₂,y₃,y₄ → c⁺ Both f(xₙ), f(yₙ) → L

Central theorem

TheoremSequential Characterization of Limits

Let f:D→Rf : D \to \mathbb{R} with D⊆RD \subseteq \mathbb{R}, let cc be a limit point of DD, and let L∈RL \in \mathbb{R}. Then

lim⁡x→cf(x)=L\lim_{x \to c} f(x) = L

(in the ε\varepsilon-δ\delta sense) if and only if for every sequence (xn)n=1∞(x_n)_{n=1}^{\infty} with xn∈D∖{c}x_n \in D \setminus \{c\} for all nn and lim⁡n→∞xn=c\lim_{n\to\infty} x_n = c, the image sequence satisfies

lim⁡n→∞f(xn)=L.\lim_{n \to \infty} f(x_n) = L.
Proof

We prove both directions. Let DD, cc, ff, LL be as in the statement; note cc being a limit point of DD guarantees such sequences (xn)(x_n) 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: ε\varepsilon-δ  ⟹  \delta \implies sequential. (Direct proof.) Assume lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L in the ε\varepsilon-δ\delta sense. Let (xn)(x_n) be an arbitrary sequence with xn∈D∖{c}x_n \in D\setminus\{c\} for all nn, and xn→cx_n \to c. We must show f(xn)→Lf(x_n) \to L. Fix ε>0\varepsilon > 0. By the ε\varepsilon-δ\delta hypothesis, there exists δ>0\delta > 0 such that

x∈D, 0<∣x−c∣<δ  ⟹  ∣f(x)−L∣<ε.(1)x \in D,\ 0 < |x - c| < \delta \implies |f(x) - L| < \varepsilon. \tag{1}

Since xn→cx_n \to c, applying the definition of sequential convergence with this specific δ>0\delta > 0, there exists N∈NN \in \mathbb{N} such that

n≥N  ⟹  ∣xn−c∣<δ.(2)n \geq N \implies |x_n - c| < \delta. \tag{2}

Now fix any n≥Nn \geq N. Since xn∈D∖{c}x_n \in D \setminus \{c\}, we have xn∈Dx_n \in D and xn≠cx_n \neq c, so ∣xn−c∣>0|x_n - c| > 0; combined with (2) this gives 0<∣xn−c∣<δ0 < |x_n - c| < \delta. Applying (1) with x=xnx = x_n gives

∣f(xn)−L∣<ε.|f(x_n) - L| < \varepsilon.

Since this holds for all n≥Nn \geq N, and ε>0\varepsilon>0 was arbitrary, we conclude f(xn)→Lf(x_n) \to L by the definition of sequential convergence. As (xn)(x_n) was an arbitrary admissible sequence, the sequential criterion holds.

Direction 2: sequential   ⟹  \implies ε\varepsilon-δ\delta. (Proof by contrapositive.) We prove the contrapositive: assume ff does not satisfy lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L in the ε\varepsilon-δ\delta sense; we construct a sequence xn∈D∖{c}x_n \in D\setminus\{c\} with xn→cx_n \to c but f(xn)↛Lf(x_n) \not\to L, which negates the sequential criterion. Negating the ε\varepsilon-δ\delta definition: "lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L" fails means

∃ ε0>0 such that ∀δ>0, ∃ x∈D with 0<∣x−c∣<δ and ∣f(x)−L∣≥ε0.\exists\, \varepsilon_0 > 0 \text{ such that } \forall \delta > 0,\ \exists\, x \in D \text{ with } 0 < |x-c| < \delta \text{ and } |f(x) - L| \geq \varepsilon_0.

Fix such an ε0>0\varepsilon_0 > 0. For each n∈Nn \in \mathbb{N}, apply this negated statement with δ=1n>0\delta = \tfrac{1}{n} > 0: there exists a point, which we call xn∈Dx_n \in D, satisfying

0<∣xn−c∣<1nand∣f(xn)−L∣≥ε0.(3)0 < |x_n - c| < \frac{1}{n} \quad \text{and} \quad |f(x_n) - L| \geq \varepsilon_0. \tag{3}

(This uses the Axiom of Choice / dependent choice implicitly to pick one such xnx_n for each nn, as is standard and harmless in this elementary setting.) We now verify (xn)(x_n) has the required properties. Membership: by construction xn∈Dx_n \in D for every nn, and 0<∣xn−c∣0 < |x_n - c| forces xn≠cx_n \neq c, so xn∈D∖{c}x_n \in D \setminus \{c\} for all nn. Convergence to cc: let ε>0\varepsilon > 0 be arbitrary. Choose N∈NN \in \mathbb{N} with N>1/εN > 1/\varepsilon (possible by the Archimedean property of R\mathbb{R}). For n≥Nn \geq N, (3) gives ∣xn−c∣<1/n≤1/N<ε|x_n - c| < 1/n \leq 1/N < \varepsilon. Hence xn→cx_n \to c. Failure of f(xn)→Lf(x_n) \to L: by (3), ∣f(xn)−L∣≥ε0|f(x_n) - L| \geq \varepsilon_0 for every nn, not just eventually. In particular it is false that for every ε>0\varepsilon>0 there is NN with ∣f(xn)−L∣<ε|f(x_n)-L|<\varepsilon for n≥Nn \geq N: taking ε=ε0\varepsilon = \varepsilon_0, no such NN can work since ∣f(xn)−L∣≥ε0|f(x_n)-L|\ge \varepsilon_0 always. Hence f(xn)↛Lf(x_n) \not\to L. We have produced a sequence xn∈D∖{c}x_n \in D\setminus\{c\} with xn→cx_n \to c but f(xn)↛Lf(x_n) \not\to L. This is precisely the negation of "for every admissible sequence xn→cx_n \to c, f(xn)→Lf(x_n) \to L." 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 ε\varepsilon-δ\delta limit must hold.

Conclusion. Both directions are established, so

lim⁡x→cf(x)=L  ⟺  [ ∀(xn)⊂D∖{c}, xn→c  ⟹  f(xn)→L ].■\lim_{x\to c} f(x) = L \iff \big[\, \forall (x_n) \subset D\setminus\{c\},\ x_n \to c \implies f(x_n) \to L \,\big]. \qquad \blacksquare
∎
CorollaryNonexistence criterion

Let f:D→Rf: D \to \mathbb{R}, and let cc be a limit point of DD. If there exist two sequences (xn),(yn)(x_n), (y_n) in D∖{c}D \setminus \{c\} with xn→cx_n \to c, yn→cy_n \to c, but

lim⁡n→∞f(xn)≠lim⁡n→∞f(yn)\lim_{n\to\infty} f(x_n) \neq \lim_{n\to\infty} f(y_n)

(where both limits exist but differ), or if there exists a single sequence xn→cx_n \to c for which f(xn)f(x_n) has no limit at all, then lim⁡x→cf(x)\lim_{x\to c} f(x) does not exist.

Proof

Suppose toward contradiction that lim⁡x→cf(x)=L\lim_{x\to c} f(x) = L exists for some L∈RL \in \mathbb{R}. By Direction 1 of the theorem above, every sequence xn→cx_n \to c in D∖{c}D\setminus\{c\} satisfies f(xn)→Lf(x_n) \to L. Case 1 (two disagreeing sequences): both (xn)(x_n) and (yn)(y_n) would force f(xn)→Lf(x_n) \to L and f(yn)→Lf(y_n) \to L. 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 lim⁡f(xn)=lim⁡f(yn)\lim f(x_n) = \lim f(y_n), contradicting the hypothesis that they differ. Case 2 (one non-convergent sequence): the sequence (xn)(x_n) would be forced to satisfy f(xn)→Lf(x_n) \to L, contradicting the hypothesis that f(xn)f(x_n) has no limit. In both cases we reach a contradiction, so no such LL can exist; hence lim⁡x→cf(x)\lim_{x\to c}f(x) does not exist. ■\blacksquare

∎

Worked examples

Example 1 (confirming a limit via the sequential criterion, asymmetric case). Let f(x)=x2−5x+6x−2f(x) = \dfrac{x^2 - 5x + 6}{x - 2} for x≠2x \neq 2 (undefined at x=2x=2, note D=R∖{2}D = \mathbb{R}\setminus\{2\}), and let c=2c = 2. We claim lim⁡x→2f(x)=−1\lim_{x\to 2} f(x) = -1. First simplify algebraically for x≠2x \neq 2:

f(x)=(x−2)(x−3)x−2=x−3.f(x) = \frac{(x-2)(x-3)}{x-2} = x - 3.

This is valid precisely because we divide by x−2≠0x - 2 \neq 0, which holds for every x∈Dx \in D. We verify the sequential criterion directly (bypassing ε\varepsilon-δ\delta, since the theorem lets us). Let (xn)(x_n) be any sequence with xn∈D∖{2}x_n \in D \setminus \{2\} (i.e. xn≠2x_n \neq 2 for all nn, automatically true since 2∉D2 \notin D) and xn→2x_n \to 2. Then for every nn,

f(xn)=xn−3.f(x_n) = x_n - 3.

By the algebra of limits for sequences (subtraction of a convergent sequence and a constant sequence), since xn→2x_n \to 2,

f(xn)=xn−3→2−3=−1.f(x_n) = x_n - 3 \to 2 - 3 = -1.

This holds for every admissible sequence (xn)(x_n), with the same limit −1-1 each time. By the theorem (Direction 2, applied in reverse as a sufficient condition), we conclude

lim⁡x→2f(x)=−1.\lim_{x \to 2} f(x) = -1.

Notice the asymmetry deliberately built in: the function is a genuinely non-symmetric rational expression, not a disguised even/odd function, and the point c=2c = 2 is a removable singularity rather than an endpoint or a "nice" value like 00.

Example 2 (refuting a limit — a genuinely two-sided oscillatory case). Let

g(x)=sin⁡ ⁣(1x),x≠0,D=R∖{0}.g(x) = \sin\!\left(\frac{1}{x}\right), \qquad x \neq 0, \quad D = \mathbb{R}\setminus\{0\}.

We show lim⁡x→0g(x)\lim_{x\to 0} g(x) does not exist, using the Corollary above with two explicitly asymmetric sequences (not simply ±\pm mirror images). Define

xn=12πn+π2,yn=12πn+7π6(n∈N).x_n = \frac{1}{2\pi n + \frac{\pi}{2}}, \qquad y_n = \frac{1}{2\pi n + \frac{7\pi}{6}} \qquad (n \in \mathbb{N}).

Both are strictly positive, so xn,yn∈D∖{0}x_n, y_n \in D \setminus \{0\} for all nn. Convergence to 00: as n→∞n \to \infty, the denominators 2πn+π/22\pi n + \pi/2 and 2πn+7π/62\pi n + 7\pi/6 both tend to +∞+\infty, so xn→0x_n \to 0 and yn→0y_n \to 0 (reciprocal of a sequence diverging to +∞+\infty tends to 00, a standard fact from the algebra of sequence limits). Evaluating gg along (xn)(x_n):

g(xn)=sin⁡ ⁣(2πn+π2)=sin⁡ ⁣(π2)=1for every n,g(x_n) = \sin\!\left(2\pi n + \frac{\pi}{2}\right) = \sin\!\left(\frac{\pi}{2}\right) = 1 \quad \text{for every } n,

using periodicity of sin⁡\sin with period 2π2\pi. So g(xn)=1g(x_n) = 1 for all nn, hence g(xn)→1g(x_n) \to 1. Evaluating gg along (yn)(y_n):

g(yn)=sin⁡ ⁣(2πn+7π6)=sin⁡ ⁣(7π6)=−12for every n,g(y_n) = \sin\!\left(2\pi n + \frac{7\pi}{6}\right) = \sin\!\left(\frac{7\pi}{6}\right) = -\frac{1}{2} \quad \text{for every } n,

again by periodicity, and using the exact value sin⁡(7π/6)=−sin⁡(π/6)=−1/2\sin(7\pi/6) = -\sin(\pi/6) = -1/2. So g(yn)→−12g(y_n) \to -\tfrac12. We have exhibited xn→0x_n \to 0, yn→0y_n \to 0, both in D∖{0}D \setminus\{0\}, with

lim⁡n→∞g(xn)=1≠−12=lim⁡n→∞g(yn).\lim_{n\to\infty} g(x_n) = 1 \neq -\frac{1}{2} = \lim_{n\to\infty} g(y_n).

By the Corollary, lim⁡x→0sin⁡(1/x)\lim_{x\to 0}\sin(1/x) does not exist. Notice the choice of the second sequence's phase (7π/67\pi/6, giving −1/2-1/2) rather than the more common −1-1 or 00: 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 ±1\pm 1.

Counterexamplewhy the hypothesis xn≠cx_n \neq c cannot be dropped

The theorem requires every admissible sequence to satisfy xn∈D∖{c}x_n \in D \setminus \{c\}, i.e. xn≠cx_n \neq c for all nn. Suppose we weaken this to merely requiring xn∈Dx_n \in D and xn→cx_n \to c, allowing xn=cx_n = c. Take D=RD = \mathbb{R}, c=0c = 0, and define

f(x)={xx≠05x=0.f(x) = \begin{cases} x & x \neq 0 \\ 5 & x = 0. \end{cases}

Under the correct (ε\varepsilon-δ\delta) definition, lim⁡x→0f(x)=0\lim_{x\to 0} f(x) = 0: for any ε>0\varepsilon>0, take δ=ε\delta = \varepsilon; then 0<∣x∣<δ0<|x|<\delta forces x≠0x \neq 0, so f(x)=xf(x) = x, and ∣f(x)−0∣=∣x∣<δ=ε|f(x) - 0| = |x| < \delta = \varepsilon. This verifies the ε\varepsilon-δ\delta definition with L=0L=0, and by the theorem (correctly stated, excluding xn=cx_n = c), every sequence xn→0x_n \to 0 with xn≠0x_n \neq 0 satisfies f(xn)=xn→0f(x_n) = x_n \to 0, consistent with L=0L = 0. Now suppose we (incorrectly) drop the exclusion and consider the constant sequence xn=0x_n = 0 for all nn, which trivially satisfies xn→0x_n \to 0 under the weakened rule. Then

f(xn)=f(0)=5 for every n,f(x_n) = f(0) = 5 \text{ for every } n,

so f(xn)→5≠0f(x_n) \to 5 \neq 0. Under the weakened ("sequential criterion without excluding cc") reading, this single sequence would force us to conclude "the sequential limit is 55, not 00" — directly contradicting the correct ε\varepsilon-δ\delta value L=0L=0 established above. The equivalence in the theorem breaks completely: the weakened sequential statement is no longer equivalent to lim⁡x→0f(x)=0\lim_{x\to 0} f(x) = 0, and in fact under the weakened rule no single value of LL can make the criterion true, since the constant sequence xn≡0x_n\equiv 0 forces L=5L=5 while sequences avoiding 00 force L=0L=0. This shows precisely why xn≠cx_n \neq c is not a cosmetic technicality: the ε\varepsilon-δ\delta definition of lim⁡x→cf(x)\lim_{x\to c} f(x) is deliberately blind to the value f(c)f(c) (indeed ff need not even be defined at cc), and only excluding xn=cx_n = c from admissible sequences preserves that blindness.

Scope, edge cases & common traps

SituationWhat to checkCommon error
Function undefined at cc (e.g. removable singularity)cc must still be a limit point of DD; sequences automatically avoid cc since c∉Dc \notin DAssuming the limit requires f(c)f(c) to exist
Proving a limit exists via sequencesMust show every sequence works, not just one or two nice onesChecking only xn→c+x_n \to c^+ and xn→c−x_n \to c^- along "nice" paths and declaring victory
Proving a limit fails to existOnly need one bad sequence, or two disagreeing onesTrying to use ε\varepsilon-δ\delta directly to prove nonexistence (technically possible but far harder)
Isolated points of the domaincc must be a limit point; if cc is isolated, the limit concept (and this theorem) does not applyAttempting to apply the theorem at an isolated point of DD
Two-sided vs one-sided limitsThe theorem as stated uses all sequences xn→cx_n \to c; one-sided versions restrict to xn>cx_n > c or xn<cx_n < cForgetting 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
AC
Augustin-Louis Cauchy
1789–1857 · Early rigorous analysis, École Polytechnique, Paris

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 ε\varepsilon-δ\delta 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.

History
- 1821 — Cauchy's Cours d'Analyse gives an early rigorous treatment of limits and continuity, working implicitly with sequential ideas.
- 1861 — Weierstrass, in Berlin lectures, formalizes the modern ε\varepsilon-δ\delta definition of limit used throughout this article.
- 1872 — Heine states a sequential formulation of continuity equivalent to Weierstrass's definition, giving the result its common name "Heine's definition" or the "Heine–Cauchy criterion."
- Late 1800s — Dedekind and Cantor's construction of the real numbers supplies the completeness properties (Archimedean property, uniqueness of sequential limits) this proof silently relies on.
- 20th century — the equivalence becomes a standard early theorem in real analysis textbooks, generalized verbatim to metric and topological spaces via nets and filters.
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 (ε\varepsilon-δ⇒\delta \Rightarrow sequential) is the more intuitive one: once you have a working δ\delta for a given ε\varepsilon, any sequence converging to cc eventually falls inside that δ\delta-neighborhood, so it is a fairly direct chase. The reverse direction is genuinely harder, because "for every sequence, f(xn)→Lf(x_n)\to L" is a statement about countably many discrete objects, while "ε\varepsilon-δ\delta" is a statement about an uncountable neighborhood. Bridging that gap requires actively constructing a witnessing sequence from a failed ε\varepsilon-δ\delta attempt, which is why the contrapositive proof explicitly builds xnx_n using δ=1/n\delta = 1/n. 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 xn→c+x_n \to c^+ and xn→c−x_n \to c^- give the same functional limit shows the one-sided limits agree, but the sequential criterion in this theorem requires every sequence approaching cc, not just monotone ones from each side. There exist functions where the one-sided limits agree but oscillatory sequences (like xnx_n 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 xn→cx_n\to c, as in Worked Example 1.

Does this theorem work for functions of several variables or complex functions?

Yes, essentially verbatim, replacing ∣x−c∣|x-c| with the appropriate metric (Euclidean distance in Rn\mathbb{R}^n, modulus in C\mathbb{C}). The proof is identical since it only uses the metric-space structure (absolute value as a distance, triangle inequality, Archimedean property for the index NN), 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 lim⁡(x,y)→(0,0)xyx2+y2\lim_{(x,y)\to(0,0)} \frac{xy}{x^2+y^2}: 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 cc (assuming c∈Dc \in D) is defined as lim⁡x→cf(x)=f(c)\lim_{x\to c} f(x) = f(c). Translating through this theorem, ff is continuous at cc if and only if every sequence xn→cx_n \to c in DD satisfies f(xn)→f(c)f(x_n) \to f(c) — and notably, for continuity we do not need to exclude xn=cx_n = c, because even if some xn=cx_n = c, we'd just get f(xn)=f(c)→f(c)f(x_n) = f(c) \to f(c) trivially, causing no contradiction. This is the key structural difference from the general limit theorem, where excluding xn=cx_n = c was essential precisely because f(c)f(c) need not equal (or even be) the limit LL.

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 lim⁡x→cf(x)=L\lim_{x\to c} f(x)=L truly existed, the forward direction guarantees literally every admissible sequence maps to a sequence converging to that same LL. 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 nn, one witness point xnx_n satisfying the required inequalities — the negated ε\varepsilon-δ\delta statement only guarantees existence of some such point for each δ=1/n\delta = 1/n, 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.

Before this

Where this leads