Alphabeta Math
LemmaStatement: 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.

Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous

Statement

Let X, Y and Z be topological spaces, with subspaces carrying the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). Then:

  1. Composites. If f:X→Y and g:Y→Z are continuous (Continuity of a map of topological spaces at a point and globally) then g∘f:X→Z is continuous.
  2. Open cover. Let f:X→Y be a function and let { Ui:i∈I } be a family of open subsets of X with ⋃i∈IUi=X. If f∣Ui:Ui→Y is continuous for every i∈I, then f is continuous.
  3. Finite closed cover. Let f:X→Y be a function, let n≥1 and let F1,…,Fn be closed subsets of X with F1∪⋯∪Fn=X. If f∣Fk:Fk→Y is continuous for every k, then f is continuous.

The converses of claims 2 and 3 hold with no hypothesis on the cover at all: every restriction of a continuous map to a subspace is continuous (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). The finiteness in claim 3 is not removable; see the remarks.

Facts & Assumptions

Given: Topological spaces X, Y, Z; functions f:X→Y and g:Y→Z; a family { Ui:i∈I } of open subsets of X covering X; a natural n≥1 and closed subsets F1,…,Fn of X covering X. For S⊆X and W⊆Y one has (f∣S)−1[W]=f−1[W]∩S, and (g∘f)−1[W′]=f−1[g−1[W′]] for W′⊆Z.

[A1]

f is continuous if and only if preimages of open sets are open, if and only if preimages of closed sets are closed (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)‾, clauses (b) and (c)).

[A2]

The subspace topology on S⊆X has as its open sets the traces U∩S with U open in X, and as its closed sets the traces F∩S with F closed in X; if S is open in X then every set open in S is open in X, and if S is closed in X then every set closed in S is closed in X (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L1]

A topology is closed under arbitrary unions of open sets (T2), and its closed sets are closed under finite unions (C3) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

Claim 1: let W⊆Z be open; then g−1[W] is open in Y and hence f−1[g−1[W]] is open in X, and this set is (g∘f)−1[W]; so g∘f is continuous.

givenA1
1.2

Let V⊆Y be open. For each i∈I the set f−1[V]∩Ui=(f∣Ui)−1[V] is open in the subspace Ui, because f∣Ui is continuous; and Ui is open in X, so this set is open in X.

givenA1A2
1.3

Let F⊆Y be closed. For each k≤n the set f−1[F]∩Fk=(f∣Fk)−1[F] is closed in the subspace Fk, because f∣Fk is continuous; and Fk is closed in X, so this set is closed in X.

givenA1A2
2.1

Since the Ui cover X, f−1[V]=⋃i∈I(f−1[V]∩Ui), a union of sets open in X by step 1.2, hence open in X by (T2). As V was an arbitrary open subset of Y, f is continuous, which is claim 2.

step 1.2givenA1L1
2.2

Since the Fk cover X, f−1[F]=⋃k=1n(f−1[F]∩Fk), a union of finitely many sets closed in X by step 1.3, hence closed in X by (C3) iterated, the union being over n≥1 sets. As F was an arbitrary closed subset of Y, f is continuous, which is claim 3.

step 1.3givenA1L1
3.1

Claims 1, 2 and 3 are established by step 1.1, step 2.1 and step 2.2 respectively.

step 1.1step 2.1step 2.2∎

Remarks

  • The finiteness in claim 3 is not removable. The witness is on the companion page: R with its usual topology is covered by its closed singletons, every restriction of the indicator function of {0} to a singleton is continuous, and that function is not continuous (R covered by its closed singletons: every restriction of the indicator of {0} is continuous and the map is not, so the closed pasting lemma needs finiteness ↗). No corresponding restriction is needed in claim 2.

  • Where each hypothesis is spent. Claim 2 uses openness of the cover members only to pass from "open in Ui" to "open in X", and it allows an arbitrary index set because arbitrary unions of open sets are open. Claim 3 uses closedness of the cover members for the corresponding passage, and it must restrict to finitely many because only finite unions of closed sets are closed. The two asymmetries of the topology axioms are visible in the two statements, one each.

  • The usual two-piece form. Claim 3 with n=2 is the pasting lemma as it is normally quoted: if X=F1∪F2 with both pieces closed and f1:F1→Y, f2:F2→Y are continuous and agree on F1∩F2, then the combined function is well defined and continuous. Well definedness is the agreement hypothesis and is not a topological matter; continuity is claim 3.

  • Continuity is a local property, and claim 2 is the precise sense. A function continuous in a neighbourhood of each point is continuous, because the interiors of those neighbourhoods form an open cover. No such statement holds for uniform notions, which is why nothing here is called uniform.

Depends on

Used by

…and 32 more results.

Dependency tree · two levels

11 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