Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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)‾

Statement

Let (X,TX) and (Y,TY) be topological spaces, let f:X→Y be a function, and let S be a subbasis for TY (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) and (Y,TY), a function f:X→Y, a subbasis S for TY, subsets A⊆X and V,F⊆Y. Preimages satisfy f−1[Y∖W]=X∖f−1[W], f−1[⋃iWi]=⋃if−1[Wi] and f−1[⋂iWi]=⋂if−1[Wi] for every family, with f−1[Y]=X for the empty intersection.

[A1]

f is continuous at x when for every open V∋f(x) there is an open U∋x with f[U]⊆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 has as a basis the family BS of intersections of finitely many members of S, the empty intersection being Y; every open set is a union of members of BS (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‾ is the smallest closed superset of A, and A is closed exactly when A=A‾ (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Proof

technique · direct
1.1

(a) implies (b): let V⊆Y be open and let x∈f−1[V], so f(x)∈V; continuity at x gives an open U∋x with f[U]⊆V, that is U⊆f−1[V]. As x was arbitrary, f−1[V] is a union of open sets, hence open.

A1A2
1.2

(b) implies (a): let x∈X and let V be open with f(x)∈V; then U:=f−1[V] is open, contains x, and satisfies f[U]⊆V.

A1
1.3

(b) and (c) are equivalent: F⊆Y is closed exactly when Y∖F is open, and f−1[Y∖F]=X∖f−1[F], so f−1[F] is closed exactly when f−1[Y∖F] is open; as F ranges over the closed sets, Y∖F ranges over the open sets.

givenA2
1.4

(b) implies (d): every S∈S is open, S being contained in the topology it generates.

L1
1.5

(d) implies (b): let V⊆Y be open; by [L1] V is a union of sets of the form S1∩⋯∩Sn with n≥0 and Si∈S, and f−1 turns unions into unions and intersections into intersections, with f−1[Y]=X for n=0; so f−1[V] is a union of finite intersections of the open sets f−1[Si] together with X, hence open.

givenL1A2
1.6

(e) implies (c): let F⊆Y be closed and put A:=f−1[F]; then f[A]⊆F, so f[A‾]⊆f[A]‾⊆F‾=F by (e), monotonicity of the closure and [L3]; hence A‾⊆f−1[F]=A, and with A⊆A‾ this gives A=A‾, so A is closed.

L3
2.1

(b) implies (e): let A⊆X and x∈A‾, and let V be open with f(x)∈V; then f−1[V] is open and contains x, so it meets A by [L2], say at a; then f(a)∈V∩f[A], so V meets f[A]. As V was arbitrary, f(x)∈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) can fail to be open while still being a neighbourhood of x, which is exactly what continuity at x asserts.

  • The inclusion in (e) may be strict for a continuous map. For the inclusion of (0,1) into R and A=(0,1), the image of the closure is (0,1) while the closure of the image is [0,1]. Equality for all A is a strictly stronger condition, equivalent to f 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]‾ 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 21 more results.

Dependency tree · two levels

9 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