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 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 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 be the cofinite topology on the set (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). The following four conditions are equivalent.
- (a) is ( (Kolmogorov) and (Frechet) spaces).
- (b) is closed for every .
- (c) is closed for every finite (Finite, countably infinite, countable, uncountable).
- (d) , that is, the topology of is finer than the cofinite topology on the same set.
Condition (d) says that the cofinite topology is the coarsest topology on any set: it is by the equivalence, and every topology on that set contains it.
Facts & Assumptions
Given: A topological space , the cofinite topology on the same set , points and a finite subset .
is when for all there are open with , , and ( (Kolmogorov) and (Frechet) spaces).
A set is closed exactly when its complement is open; and 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).
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).
The cofinite topology on consists of together with the sets whose complement in is finite; its closed sets are together with the finite subsets of (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
A finite set is one equinumerous with a natural number, so a finite may be listed as for some , the case being (Finite, countably infinite, countable, uncountable).
Proof
(a) implies (b): fix and let ; then , so [A1] supplies an open with and , whence .
(b) implies (c): let be finite and list it as by [L4], so that ; for this reads , which is closed by [L1].
(c) implies (d): let ; if then by [L1], and otherwise is finite by [L3], hence closed by (c), hence is open.
(d) implies (a): let in ; the sets and have finite complements, so they lie in by [L3] and hence in by (d), and they witness the condition, since , , and .
By step 1.1 the set is a neighbourhood of each of its points, hence open by [L2], so is closed by [L1]; this completes the implication (a) implies (b).
By step 1.2 and (b) the set is a union of closed sets, hence closed by [L1]; this completes the implication (b) implies (c).
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.
In particular itself satisfies (d) with , so the cofinite topology on any set is by step 3.1, and by (d) it is contained in every topology on that set; this is the final assertion of the statement.
Remarks
-
The theorem is the reason is quoted as "points are closed". Every later use of on this page goes through clause (b): the hypothesis in and 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 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 space that fails every stronger separation axiom; the witness is worked on the companion page.
Depends on
- $T_0$ (Kolmogorov) and $T_1$ (Frechet) spaces
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open
- Finite, countably infinite, countable, uncountable
Used by
- Assuming dependent choice, a nonempty topological space is separated-uniformizable if and only if it is Tychonoff Corollary
- Under dependent choice a normal T₁ space is completely regular, so T₄ ⟹ T_31/2, and together with the implications already proved this is the whole classical chain Corollary
- In the K-topology on ℝ the closed set K ∪ {0} carries a continuous two-valued function with no continuous extension Counterexample
- A discrete space satisfies every axiom in the chain; an indiscrete space with two points is regular, completely regular, normal, completely normal and perfectly normal, and fails T₀ Example
- A finite Hausdorff space is discrete, and its diagonal is closed for the trivial reason that every subset of the square is Example
- Sierpinski space is T₀ and normal but neither T₁ nor regular: normality without T₁ implies nothing Example
- The cocountable topology on ℝ is T₁, has unique sequential limits, and is neither Hausdorff nor regular nor normal Example
- The cofinite topology on an infinite set is T₁ but neither Hausdorff nor regular nor normal Example
- The cofinite topology on an infinite set, and the cocountable topology on ℝ, are T₁ with a diagonal whose closure is the whole square; on a countably infinite set the cocountable topology is discrete instead Example
- The particular-point topology is T₀, it is not T₁ and not regular once the set has at least two points, and it is not normal once the set has at least three Example
- The Samuel reflection of a nonempty indiscrete uniform space is a singleton Example
- FALSE: a space in which every sequence has at most one limit is Hausdorff False statement
- FALSE: every T₁ space is Hausdorff False statement
- Every ordinal with its order topology has a basis of clopen sets, and is T₁, Hausdorff and regular Lemma
- Every Urysohn space is Hausdorff, every Hausdorff space is T₁ and hence T₀, and every regular T₁ space is Urysohn Lemma
- A normal T₁ space is regular, hence T₃, hence Urysohn, Hausdorff, T₁ and T₀ Theorem
- The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T₁ gives T₃; completely regular gives regular; regular with T₁ gives Urysohn, hence Hausdorff, hence T₁, hence T₀; and metrizable gives every one of them Theorem
- Under dependent choice a locally compact Hausdorff space is completely regular, hence Tychonoff Theorem
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
- T1 space (Wikipedia) (standard reference, not scraped)
- Cofiniteness (Wikipedia) (standard reference, not scraped)
- J. Munkres, Topology, 2nd ed., §17 (standard reference, not scraped)
- R. Gardner, Introduction to Topology, notes on Munkres Section 17: Closed Sets and Limit Points (East Tennessee State University) (standard reference, not scraped)