Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge 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 ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A

Definition

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

Let A⊆R, let f:A→R, let c∈R be a limit point of A (Limit point, isolated point, adherent point, derived set, and dense subset of R), and let L∈R. We say that f(x) tends to L as x tends to c, and write

lim⁡x→cf(x)=L,

when

(∀ε>0) (∃δ>0) (∀x∈A) [ 0<∣x−c∣<δ ⟹ ∣f(x)−L∣<ε ],

where ε and δ range over the positive reals.

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

f(A∩Nδ∗(c))  ⊆  Nε(L),

Nδ∗(c)={ y:0<∣y−c∣<δ } being the punctured δ-neighbourhood of c and Nε(L)=(L−ε, L+ε) the open interval of Intervals of R: the nine order-convex forms, nondegeneracy, and length. The two forms agree because ∣f(x)−L∣<ε says exactly f(x)∈Nε(L), and 0<∣x−c∣<δ says exactly x∈Nδ∗(c).

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

  1. c is required to be a limit point of A. By Limit point, isolated point, adherent point, derived set, and dense subset of R that says every punctured neighbourhood of c meets A, so for every δ>0 the set A∩Nδ∗(c) over which the implication quantifies is nonempty. Drop the requirement and the implication can be satisfied vacuously by every real L 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 A that is not a limit point of A — an isolated point — the symbol lim⁡x→cf(x) is therefore not defined in this library.

  2. c∈A is not required. A limit point of A need not belong to A (Limit point, isolated point, adherent point, derived set, and dense subset of R), and the definition never evaluates f at c. This is what allows a limit to be taken at a point where the function is not defined at all, as at 0 for x↦x ψ(1/x).

  3. The value f(c), when it exists, is irrelevant. The hypothesis 0<∣x−c∣ excludes x=c from the quantifier, so changing f at the single point c changes nothing. Equality of the limit with the value is an extra condition, not a consequence: FALSE: lim⁡x→cf(x)=f(c) whenever both sides exist.

The notation presumes uniqueness. Writing lim⁡x→cf(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 L 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 sup⁡S (Conventions: sup⁡∅, unbounded sets, and the extended reals) and lim⁡kxk (A sequence has at most one limit), the symbol is written only for a function already known to have a limit at c.

Real and rational ε define the same relation. Above, ε and δ 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 ε-condition verified for all positive rationals is verified for an arbitrary positive real η by running it at a rational ε with 0<ε<η, and a δ 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 ε is rational, in Heine criterion: lim⁡x→cf(x)=L iff f(xk)→L for every sequence in A∖{c} converging to c.

Remarks

Depends on

Used by

…and 25 more results.

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources