Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

A space is T1T_1 if and only if every singleton is closed, if and only if every finite subset is closed, if and only if its topology contains the cofinite topology

Statement

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) and let Tcof\mathcal{T}_{\mathrm{cof}} be the cofinite topology on the set XX (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). The following four conditions are equivalent.

Condition (d) says that the cofinite topology is the coarsest T1T_1 topology on any set: it is T1T_1 by the equivalence, and every T1T_1 topology on that set contains it.

Facts & Assumptions

Given: A topological space (X,T)(X,\mathcal{T}), the cofinite topology Tcof\mathcal{T}_{\mathrm{cof}} on the same set XX, points x,yXx, y \in X and a finite subset FXF \subseteq X.

[A1]

XX is T1T_1 when for all xyx \ne y there are open U,VU, V with xUx \in U, yUy \notin U, yVy \in V and xVx \notin V (T0T_0 (Kolmogorov) and T1T_1 (Frechet) spaces).

[L1]

A set is closed exactly when its complement is open; \varnothing and XX are open and closed; and a union of two closed sets is closed by (C3), hence so is a union of finitely many by iterating (C3) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

A set is open exactly when it is a neighbourhood of each of its points, that is, exactly when each of its points lies in an open subset of it (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, consequence 4).

[L3]

The cofinite topology on XX consists of \varnothing together with the sets whose complement in XX is finite; its closed sets are XX together with the finite subsets of XX (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L4]

A finite set is one equinumerous with a natural number, so a finite FF may be listed as F={x0,,xn1}F = \{x_0, \dots, x_{n-1}\} for some nNn \in \mathbb{N}, the case n=0n = 0 being F=F = \varnothing (Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

(a) implies (b): fix xXx \in X and let yX{x}y \in X \setminus \{x\}; then yxy \ne x, so [A1] supplies an open VV with yVy \in V and xVx \notin V, whence yVX{x}y \in V \subseteq X \setminus \{x\}.

A1
1.2

(b) implies (c): let FXF \subseteq X be finite and list it as F={x0,,xn1}F = \{x_0, \dots, x_{n-1}\} by [L4], so that F={x0}{xn1}F = \{x_0\} \cup \dots \cup \{x_{n-1}\}; for n=0n = 0 this reads F=F = \varnothing, which is closed by [L1].

L1L4
1.3

(c) implies (d): let UTcofU \in \mathcal{T}_{\mathrm{cof}}; if U=U = \varnothing then UTU \in \mathcal{T} by [L1], and otherwise XUX \setminus U is finite by [L3], hence closed by (c), hence UU is open.

L1L3
1.4

(d) implies (a): let xyx \ne y in XX; the sets X{y}X \setminus \{y\} and X{x}X \setminus \{x\} have finite complements, so they lie in Tcof\mathcal{T}_{\mathrm{cof}} by [L3] and hence in T\mathcal{T} by (d), and they witness the T1T_1 condition, since xX{y}x \in X \setminus \{y\}, yX{y}y \notin X \setminus \{y\}, yX{x}y \in X \setminus \{x\} and xX{x}x \notin X \setminus \{x\}.

A1L3
2.1

By step 1.1 the set X{x}X \setminus \{x\} is a neighbourhood of each of its points, hence open by [L2], so {x}\{x\} is closed by [L1]; this completes the implication (a) implies (b).

step 1.1L1L2
2.2

By step 1.2 and (b) the set FF is a union of nn closed sets, hence closed by [L1]; this completes the implication (b) implies (c).

step 1.2L1
3.1

The four implications of steps 2.1, 2.2, 1.3 and 1.4 close the cycle (a) implies (b) implies (c) implies (d) implies (a), so the four conditions are equivalent.

step 1.3step 1.4step 2.1step 2.2
4.1

In particular Tcof\mathcal{T}_{\mathrm{cof}} itself satisfies (d) with T=Tcof\mathcal{T} = \mathcal{T}_{\mathrm{cof}}, so the cofinite topology on any set is T1T_1 by step 3.1, and by (d) it is contained in every T1T_1 topology on that set; this is the final assertion of the statement.

step 3.1L3

Remarks

  • The theorem is the reason T1T_1 is quoted as "points are closed". Every later use of T1T_1 on this page goes through clause (b): the T1T_1 hypothesis in T3T_3 and T4T_4 is used exactly to turn a point into a closed set so that regularity or normality applies to it.

  • Clause (c) is not a strengthening of clause (b). It follows from it by a finite union, and the finite union is genuinely finite: an arbitrary union of closed sets need not be closed, and in the cofinite topology on an infinite set no infinite proper subset is closed at all, although every singleton is.

  • Clause (d) locates the cofinite topology. It is the smallest T1T_1 topology on a given set, in the sense of Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison's comparison order, and this is why it is the standard witness for a T1T_1 space that fails every stronger separation axiom; the witness is worked on the companion page.

Depends on

Used by

Dependency tree · next 3 levels

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