Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The ε\varepsilon-δ\delta limit limxcf(x)=L\lim_{x \to c} f(x) = L of f:ARf : A \to \mathbb{R} at a limit point cc of AA

Definition

Throughout, R\mathbb{R} is the complete ordered field (Complete ordered field (least-upper-bound property)) with its order and absolute value (Order on the reals).

Let ARA \subseteq \mathbb{R}, let f:ARf : A \to \mathbb{R}, let cRc \in \mathbb{R} be a limit point of AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}), and let LRL \in \mathbb{R}. We say that f(x)f(x) tends to LL as xx tends to cc, and write

limxcf(x)=L,\lim_{x \to c} f(x) = L ,

when

(ε>0) (δ>0) (xA) [ 0<xc<δ  f(x)L<ε ],(\forall \varepsilon > 0)\ (\exists \delta > 0)\ (\forall x \in A)\ \bigl[\ 0 < |x - c| < \delta \ \Longrightarrow\ |f(x) - L| < \varepsilon\ \bigr],

where ε\varepsilon and δ\delta range over the positive reals.

In the language of neighbourhoods (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}) the condition reads: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 with

f(ANδ(c))    Nε(L),f\bigl(A \cap N^{*}_{\delta}(c)\bigr) \;\subseteq\; N_{\varepsilon}(L),

Nδ(c)={y:0<yc<δ}N^{*}_{\delta}(c) = \{\, y : 0 < |y - c| < \delta \,\} being the punctured δ\delta-neighbourhood of cc and Nε(L)=(Lε, L+ε)N_{\varepsilon}(L) = (L - \varepsilon,\ L + \varepsilon) the open interval of Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length. The two forms agree because f(x)L<ε|f(x) - L| < \varepsilon says exactly f(x)Nε(L)f(x) \in N_\varepsilon(L), and 0<xc<δ0 < |x - c| < \delta says exactly xNδ(c)x \in N^{*}_\delta(c).

Three features of this definition are load bearing, not decoration.

  1. cc is required to be a limit point of AA. By Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R} that says every punctured neighbourhood of cc meets AA, so for every δ>0\delta > 0 the set ANδ(c)A \cap N^{*}_\delta(c) over which the implication quantifies is nonempty. Drop the requirement and the implication can be satisfied vacuously by every real LL at once, which is exactly what FALSE: a function has at most one limit at every point of its domain, isolated points included records. At a point of AA that is not a limit point of AA — an isolated point — the symbol limxcf(x)\lim_{x \to c} f(x) is therefore not defined in this library.

  2. cAc \in A is not required. A limit point of AA need not belong to AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}), and the definition never evaluates ff at cc. This is what allows a limit to be taken at a point where the function is not defined at all, as at 00 for xxψ(1/x)x \mapsto x\,\psi(1/x).

  3. The value f(c)f(c), when it exists, is irrelevant. The hypothesis 0<xc0 < |x - c| excludes x=cx = c from the quantifier, so changing ff at the single point cc changes nothing. Equality of the limit with the value is an extra condition, not a consequence: FALSE: limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) whenever both sides exist.

The notation presumes uniqueness. Writing limxcf(x)=L\lim_{x \to c} f(x) = L treats the left-hand side as a name for a single real number, which is legitimate only because at a limit point at most one LL can satisfy the displayed condition. That obligation is discharged by At a limit point of the domain a function has at most one limit , recorded in this item's justified_by. As with supS\sup S (Conventions: sup\sup \emptyset, unbounded sets, and the extended reals) and limkxk\lim_k x_k (A sequence has at most one limit), the symbol is written only for a function already known to have a limit at cc.

Real and rational ε\varepsilon define the same relation. Above, ε\varepsilon and δ\delta range over the positive reals. Restricting either quantifier to the positive rationals gives the same relation: every positive rational is a positive real, and below every positive real lies a positive rational (The rationals embed densely in the reals), so an ε\varepsilon-condition verified for all positive rationals is verified for an arbitrary positive real η\eta by running it at a rational ε\varepsilon with 0<ε<η0 < \varepsilon < \eta, and a δ\delta produced as a real may be shrunk to a rational one below it. This is the passage sanctioned in the remarks of Sequences of reals: bounded, eventually, frequently, tails, subsequences, and it is what lets this definition be compared with Limits and Cauchy sequences of reals, whose ε\varepsilon is rational, in Heine criterion: limxcf(x)=L\lim_{x \to c} f(x) = L iff f(xk)Lf(x_k) \to L for every sequence in A{c}A \setminus \{c\} converging to cc.

Remarks

Depends on

Used by

…and 24 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 41 results over 19 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources