Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point

Definition

Throughout, R\mathbb{R} is the complete ordered field with its order and absolute value (Complete ordered field (least-upper-bound property), Basic properties of the absolute value), and neighbourhoods are those of The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}.

Let ARA \subseteq \mathbb{R}, let f:ARf : A \to \mathbb{R} and let cAc \in A. Then ff is continuous at cc when

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

with ε\varepsilon and δ\delta ranging over the positive reals. In the language of neighbourhoods: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 with

f(ANδ(c))    Nε(f(c)).f\bigl(A \cap N_{\delta}(c)\bigr) \;\subseteq\; N_{\varepsilon}\bigl(f(c)\bigr).

ff is continuous on AA when it is continuous at every point of AA.

The point cc is required to lie in AA, and the condition is unpunctured. Both differ from 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, and deliberately. There the quantifier runs over 0<xc<δ0 < |x - c| < \delta, which removes x=cx = c; here x=cx = c is allowed, and at x=cx = c the implication reads f(c)f(c)=0<ε|f(c) - f(c)| = 0 < \varepsilon, which is automatic. So allowing x=cx = c costs nothing, and it is what lets the definition be stated at every point of AA, including the points where no limit exists.

Three clauses, and all three are part of the definition.

  1. At a limit point. Suppose cAc \in A is a limit point of AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}). Then ff is continuous at cc if and only if the limit of ff at cc exists and limxcf(x)  =  f(c)\lim_{x \to c} f(x) \;=\; f(c) (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). Indeed, for a given ε>0\varepsilon > 0 a δ\delta witnessing continuity witnesses the limit condition, because the limit condition quantifies over a subset of the points continuity quantifies over; and conversely a δ\delta witnessing limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) witnesses continuity, because the one point it omits, x=cx = c, satisfies f(c)f(c)<ε|f(c) - f(c)| < \varepsilon anyway.

  2. At an isolated point. Suppose cAc \in A is an isolated point of AA (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}), so that Nη(c)A={c}N_{\eta}(c) \cap A = \{c\} for some real η>0\eta > 0. Then every f:ARf : A \to \mathbb{R} is continuous at cc: take δ:=η\delta := \eta, so that the only xAx \in A with xc<δ|x - c| < \delta is cc itself, and f(c)f(c)=0<ε|f(c) - f(c)| = 0 < \varepsilon.

  3. On a set. Continuity on AA is continuity at each point of AA, and nothing more. It is not a condition relating ff to points outside AA.

Every point of AA is either a limit point of AA or an isolated point of AA, and never both (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}), so clauses 1 and 2 between them describe continuity at every point of AA.

This is not the raw ε\varepsilon-δ\delta formula of FALSE: a function has at most one limit at every point of its domain, isolated points included. That item records what goes wrong when the punctured formula of 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 is written down at an arbitrary point of the domain: at an isolated point it is satisfied vacuously by every real LL at once, so it defines nothing, and this library therefore leaves limxcf(x)\lim_{x \to c} f(x) undefined at an isolated point. Continuity at an isolated point is a different matter: the formula above is not vacuous — it is a genuine condition on f(c)f(c), satisfied because f(c)f(c) is the only value being compared with itself — and it names a single, well-defined property. The limit is undefined there; the continuity is defined, and is automatic. Clause 1 is the only place where the two notions meet, and it is stated only where the limit exists as a notion.

Where the distinction disappears. If AA is an open subset of R\mathbb{R} (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen), then every cAc \in A has some Nη(c)AN_{\eta}(c) \subseteq A, and a punctured neighbourhood is never empty (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}), so every point of AA is a limit point of AA and clause 1 covers the whole of AA. The same holds when AA is a nondegenerate interval (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Isolated points are what force clause 2 to exist at all, and they occur as soon as AA is allowed to be an arbitrary subset of R\mathbb{R}, as in A={0}[1,2]A = \{0\} \cup [1,2].

Remarks

Depends on

Used by

…and 117 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 31 results over 12 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