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.

Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), with neighbourhoods as in Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open.

A sequence in XX is a function x:NXx : \mathbb{N} \to X, written (xk)(x_k) with xk:=x(k)x_k := x(k). As everywhere in this library N\mathbb{N} contains 00 (The natural numbers N\mathbb{N} (von Neumann)) and a sequence is indexed from 00 (Sequences of reals: bounded, eventually, frequently, tails, subsequences); an index range copied from a text that starts at 11 must be shifted before it is used here. The range of (xk)(x_k) is {xk:kN}\{\, x_k : k \in \mathbb{N} \,\}. Following Sequences of reals: bounded, eventually, frequently, tails, subsequences, a property of indices holds eventually if it holds for all kKk \ge K for some KNK \in \mathbb{N}, and frequently if for every KK it holds for some kKk \ge K; that vocabulary is used here for sequences in an arbitrary set.

Let (xk)(x_k) be a sequence in XX and let pXp \in X.

  • (xk)(x_k) converges to pp, written xkpx_k \to p, if for every neighbourhood NN of pp one has xkNx_k \in N eventually. The point pp is then called a limit of (xk)(x_k).
  • pp is a cluster point of (xk)(x_k) if for every neighbourhood NN of pp one has xkNx_k \in N frequently.
  • For AXA \subseteq X, the sequential closure of AA is seqcl(A):={pX:xkp for some sequence (xk) with xkA for all k}.\operatorname{seqcl}(A) := \{\, p \in X : x_k \to p \text{ for some sequence } (x_k) \text{ with } x_k \in A \text{ for all } k \,\} .
  • A function f:XYf : X \to Y into a topological space YY is sequentially continuous at pp if xkpx_k \to p in XX implies f(xk)f(p)f(x_k) \to f(p) in YY, and sequentially continuous if it is sequentially continuous at every point of XX (Continuity of a map of topological spaces at a point and globally for the ordinary notion).

The notation limkxk\lim_k x_k is not available at this generality, and the reason is not fastidiousness. In a general topological space a sequence may converge to more than one point, so there is no function taking a convergent sequence to "its" limit, and a symbol limkxk\lim_k x_k would not denote. In the indiscrete topology on a set with at least two points the only neighbourhood of any point is XX, so every sequence converges to every point; in the cofinite topology on an infinite set every injective sequence converges to every point. Both witnesses are on the companion page. Accordingly this library writes "pp is a limit of (xk)(x_k)" and "(xk)(x_k) converges to pp", never "the limit" and never limkxk\lim_k x_k, for a sequence in a space that has not been given a hypothesis restoring uniqueness.

Where the notation becomes legitimate again. Uniqueness of limits is what licenses the symbol, exactly as it does for sequences of reals (A sequence has at most one limit) and in a metric space (A sequence in a metric space has at most one limit): in a metric space a sequence has at most one limit and limkxk\lim_k x_k is unambiguous. Every metrizable space therefore admits the notation, and so does every space in which distinct points have disjoint neighbourhoods; where this page uses a metrizable space, and only there, the usual notation is used without further comment. The general reading of "xkpx_k \to p" above never presupposes it.

Convergence agrees with the metric notion on a metric topology. For a metric space the balls around pp are a neighbourhood base at pp (The balls B(x,1/n)B(x, 1/n), n1n \ge 1, form a countable neighbourhood base at xx, so every metric space is first countable), so "eventually in every neighbourhood of pp" and "eventually in every ball around pp" are the same condition, and the latter is Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}. The identification is carried out where metrizable spaces are defined, later on this page.

Remarks

  • Every limit is a cluster point, and not conversely. "Eventually" implies "frequently", so a point to which (xk)(x_k) converges is a cluster point of it. A sequence in a two-point discrete space that takes each of the two values frequently has both points as cluster points and converges to neither, since each singleton is a neighbourhood of its point and is missed frequently.

  • Constant sequences. If xk=ax_k = a for every kk, then xkax_k \to a, since every neighbourhood of aa contains aa. More generally an eventually constant sequence with eventual value aa converges to aa. This is the only convergence available in a discrete space, where {a}\{a\} is a neighbourhood of aa and forces xk=ax_k = a eventually.

  • Sequential continuity is a strictly weaker condition than continuity in general, and the two agree under a countability hypothesis proved later on this page. That is the whole reason sequences are treated here as a separate notion rather than as the definition of continuity, and it is why nets and filters exist as a subject.

Depends on

Used by

Dependency tree · next 3 levels

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