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 a map of topological spaces at a point and globally

Definition

Let (X,TX)(X, \mathcal{T}_X) and (Y,TY)(Y, \mathcal{T}_Y) be topological spaces (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), let f:XYf : X \to Y be a function and let xXx \in X. Neighbourhoods are as in Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open.

ff is continuous at xx if for every neighbourhood VV of f(x)f(x) in YY the preimage f1[V]f^{-1}[V] is a neighbourhood of xx in XX.

ff is continuous if it is continuous at every point of XX.

The same condition with open sets only. ff is continuous at xx if and only if for every open VYV \subseteq Y with f(x)Vf(x) \in V there is an open UXU \subseteq X with xUx \in U and f[U]Vf[U] \subseteq V. Indeed, if ff is continuous at xx and VV is such an open set, then VV is a neighbourhood of f(x)f(x), so f1[V]f^{-1}[V] is a neighbourhood of xx and contains an open UxU \ni x, which satisfies f[U]Vf[U] \subseteq V. Conversely, given the displayed condition and a neighbourhood VV of f(x)f(x), fix open V0V_0 with f(x)V0Vf(x) \in V_0 \subseteq V and then open UxU \ni x with f[U]V0f[U] \subseteq V_0; then xUf1[V0]f1[V]x \in U \subseteq f^{-1}[V_0] \subseteq f^{-1}[V], so f1[V]f^{-1}[V] is a neighbourhood of xx. Both forms are used below and are the same statement written twice.

Preimage, not image. f1[V]={xX:f(x)V}f^{-1}[V] = \{\, x \in X : f(x) \in V \,\} is the preimage in the sense of Injection, surjection, bijection and is defined for every function, invertible or not; no inverse function is being asserted to exist. Continuity is a condition on preimages throughout, and the corresponding conditions on images define the open and closed maps of a later item, which are different notions.

Remarks

  • This is the metric definition when both topologies are metric topologies. For metric spaces, ε\varepsilon-δ\delta continuity at aa (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form) says that every ball around f(a)f(a) has a ball around aa mapped into it, and the balls around a point are a neighbourhood base there; the identification is carried out where metrizable spaces are defined later on this page. Nothing about a metric survives in the definition above: continuity is a relation between two topologies and a function, and it is meaningless to ask whether a function between bare sets is continuous.

  • Continuity depends on both topologies, and coarsening the target or refining the source only helps. If ff is continuous and TX\mathcal{T}_X is replaced by a finer topology, or TY\mathcal{T}_Y by a coarser one, ff remains continuous, since each condition to be verified is weakened and each neighbourhood available in the source is still available. In particular every map out of a discrete space and every map into an indiscrete space is continuous (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

  • Continuity at a point is strictly weaker than continuity. A function may be continuous at exactly one point, and the definition above is deliberately local so that the sequential criteria proved later can be stated pointwise.

Depends on

Used by

…and 71 more results.

Dependency tree · next 3 levels

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