Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge 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.

For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A)f(A)f(\overline{A}) \subseteq \overline{f(A)}

Statement

Let (X,TX)(X, \mathcal{T}_X) and (Y,TY)(Y, \mathcal{T}_Y) be topological spaces, let f:XYf : X \to Y be a function, and let S\mathcal{S} be a subbasis for TY\mathcal{T}_Y (Basis and subbasis for a topology, and the topology generated by a family of sets). The following five conditions are equivalent.

Condition (d) is what makes continuity checkable against a generating family rather than against every open set, and it holds for a basis as well, a basis being in particular a subbasis for the topology it generates.

Facts & Assumptions

Given: Topological spaces (X,TX)(X,\mathcal{T}_X) and (Y,TY)(Y,\mathcal{T}_Y), a function f:XYf : X \to Y, a subbasis S\mathcal{S} for TY\mathcal{T}_Y, subsets AXA \subseteq X and V,FYV, F \subseteq Y. Preimages satisfy f1[YW]=Xf1[W]f^{-1}[Y \setminus W] = X \setminus f^{-1}[W], f1[iWi]=if1[Wi]f^{-1}[\bigcup_i W_i] = \bigcup_i f^{-1}[W_i] and f1[iWi]=if1[Wi]f^{-1}[\bigcap_i W_i] = \bigcap_i f^{-1}[W_i] for every family, with f1[Y]=Xf^{-1}[Y] = X for the empty intersection.

[A1]

ff is continuous at xx when for every open Vf(x)V \ni f(x) there is an open UxU \ni x with f[U]Vf[U] \subseteq V (Continuity of a map of topological spaces at a point and globally).

[A2]

A set is closed exactly when its complement is open; a set is open exactly when it is a union of open sets containing each of its points (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L1]

The topology generated by S\mathcal{S} has as a basis the family BS\mathcal{B}_{\mathcal{S}} of intersections of finitely many members of S\mathcal{S}, the empty intersection being YY; every open set is a union of members of BS\mathcal{B}_{\mathcal{S}} (A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

A\overline{A} is the smallest closed superset of AA, and AA is closed exactly when A=AA = \overline{A} (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Proof

technique · direct
1.1

(a) implies (b): let VYV \subseteq Y be open and let xf1[V]x \in f^{-1}[V], so f(x)Vf(x) \in V; continuity at xx gives an open UxU \ni x with f[U]Vf[U] \subseteq V, that is Uf1[V]U \subseteq f^{-1}[V]. As xx was arbitrary, f1[V]f^{-1}[V] is a union of open sets, hence open.

A1A2
1.2

(b) implies (a): let xXx \in X and let VV be open with f(x)Vf(x) \in V; then U:=f1[V]U := f^{-1}[V] is open, contains xx, and satisfies f[U]Vf[U] \subseteq V.

A1
1.3

(b) and (c) are equivalent: FYF \subseteq Y is closed exactly when YFY \setminus F is open, and f1[YF]=Xf1[F]f^{-1}[Y \setminus F] = X \setminus f^{-1}[F], so f1[F]f^{-1}[F] is closed exactly when f1[YF]f^{-1}[Y \setminus F] is open; as FF ranges over the closed sets, YFY \setminus F ranges over the open sets.

givenA2
1.4

(b) implies (d): every SSS \in \mathcal{S} is open, S\mathcal{S} being contained in the topology it generates.

L1
1.5

(d) implies (b): let VYV \subseteq Y be open; by [L1] VV is a union of sets of the form S1SnS_1 \cap \dots \cap S_n with n0n \ge 0 and SiSS_i \in \mathcal{S}, and f1f^{-1} turns unions into unions and intersections into intersections, with f1[Y]=Xf^{-1}[Y] = X for n=0n = 0; so f1[V]f^{-1}[V] is a union of finite intersections of the open sets f1[Si]f^{-1}[S_i] together with XX, hence open.

givenL1A2
1.6

(e) implies (c): let FYF \subseteq Y be closed and put A:=f1[F]A := f^{-1}[F]; then f[A]Ff[A] \subseteq F, so f[A]f[A]F=Ff[\overline{A}] \subseteq \overline{f[A]} \subseteq \overline{F} = F by (e), monotonicity of the closure and [L3]; hence Af1[F]=A\overline{A} \subseteq f^{-1}[F] = A, and with AAA \subseteq \overline{A} this gives A=AA = \overline{A}, so AA is closed.

L3
2.1

(b) implies (e): let AXA \subseteq X and xAx \in \overline{A}, and let VV be open with f(x)Vf(x) \in V; then f1[V]f^{-1}[V] is open and contains xx, so it meets AA by [L2], say at aa; then f(a)Vf[A]f(a) \in V \cap f[A], so VV meets f[A]f[A]. As VV was arbitrary, f(x)f[A]f(x) \in \overline{f[A]} by [L2].

step 1.1L2
3.1

Steps 1.1 and 1.2 make (a) and (b) equivalent; step 1.3 makes (b) and (c) equivalent; steps 1.4 and 1.5 make (b) and (d) equivalent; step 2.1 gives (b) implies (e) and step 1.6 gives (e) implies (c), which closes the cycle through (c) and (b). Hence all five conditions are equivalent.

step 1.1step 1.2step 1.3step 1.4step 1.5step 2.1step 1.6

Remarks

  • Only (a) is pointwise. Conditions (b) to (e) are global, and none of them has a pointwise version that is equivalent to continuity at a single point: the preimage of an open set containing f(x)f(x) can fail to be open while still being a neighbourhood of xx, which is exactly what continuity at xx asserts.

  • The inclusion in (e) may be strict for a continuous map. For the inclusion of (0,1)(0,1) into R\mathbb{R} and A=(0,1)A = (0,1), the image of the closure is (0,1)(0,1) while the closure of the image is [0,1][0,1]. Equality for all AA is a strictly stronger condition, equivalent to ff being a closed map, and closed maps are defined three items below. Note that no map into a discrete space can witness strictness: there every subset is closed, so f[A]=f[A]=f[A]f[\overline{A}] = f[A] = \overline{f[A]} always.

  • What the theorem does not say. It says nothing about images of open sets: a continuous map need not carry open sets to open sets, and the failure is exactly what separates a continuous bijection from a homeomorphism. That separation is recorded on this page as a false statement with an explicit two-point witness.

Depends on

Used by

…and 14 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 11 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