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.
On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint
Example
Let be an infinite set with the cofinite topology , whose open sets are together with the sets of finite complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable). Then:
- Closures. For ,
- A subset is dense if and only if it is infinite (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets); in particular every infinite subset is dense, and no finite subset is.
- No two nonempty open sets are disjoint. If are nonempty then .
- Every singleton is closed, so points are distinguishable by closed sets; nevertheless claim 3 says distinct points are never separated by disjoint open sets, so the space is as far from Hausdorff as a space with closed points can be.
Facts & Assumptions
Given: An infinite set with the cofinite topology, subsets and points of .
The open sets of are together with the sets whose complement is finite; the closed sets are together with the finite subsets of (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
A subset of a finite set is finite, and a union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies); "infinite" means "not finite" (Finite, countably infinite, countable, uncountable).
is the largest open subset of , the smallest closed superset of (Interior, closure, boundary, exterior, derived set and isolated point in a topological space); a set is closed exactly when it equals its closure (A point lies in the closure of iff every basic neighbourhood of it meets ; the closure is the smallest closed superset and equals together with its derived set, claim 2).
is dense exactly when it meets every nonempty open set, equivalently when (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).
A topology contains and is closed under binary intersections (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
Verification
If is finite then is closed by [A1], so by [L1].
If is infinite then no finite set contains , since a subset of a finite set is finite; so the only closed superset of is and .
If is finite then is open by [A1], so .
If is infinite then no nonempty open satisfies : such a would have finite and , making finite by [A2]. Hence .
Let be nonempty open sets; then and are finite, so is finite by [A2], and cannot be empty, for otherwise would be finite, contradicting the hypothesis on .
Each singleton is finite, hence closed by [A1].
Steps 1.1 to 1.4 give claim 1.
If is infinite then by step 1.2, so is dense by [L2]; if is finite then , since is infinite, and by step 1.1, so is not dense. Hence the dense subsets are exactly the infinite ones, which is claim 2.
Step 1.5 is claim 3, and step 1.6 with claim 3 is claim 4.
Remarks
-
Claim 3 is the reason the cofinite topology is a standard counterexample factory. A space with at least two points in which any two nonempty open sets meet cannot be metrizable (Distinct points of a metric space have disjoint balls around them, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), since a metric separates distinct points by disjoint balls. It does not follow that sequential limits fail to be unique there: the cocountable topology on also has no two disjoint nonempty open sets and its sequential limits are unique (In the cocountable topology on the closed sets are the countable sets and , and a sequence converges iff it is eventually constant). In the cofinite topology uniqueness does fail, but the argument needs an injective sequence and not merely the meeting of open sets (In the indiscrete topology every sequence converges to every point, and in the cofinite topology on an infinite set an injective sequence converges to every point).
-
Finiteness of collapses the example. If were finite then every subset would have finite complement, the topology would be discrete, and all four claims would read differently or vacuously. The hypothesis that is infinite is used in steps 1.5 and 2.2 and is not decoration.
-
The same computation with "at most countable" in place of "finite" gives the cocountable topology, whose behaviour on is the subject of the next example (In the cocountable topology on the closed sets are the countable sets and , and a sequence converges iff it is eventually constant). The two differ in exactly one respect that matters here: on the cocountable topology still has closed points and no two disjoint nonempty open sets, but its convergent sequences are far more restricted.
Depends on
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets
- A point lies in the closure of $A$ iff every basic neighbourhood of it meets $A$; the closure is the smallest closed superset and equals $A$ together with its derived set
- Finite, countably infinite, countable, uncountable
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Interior, closure, boundary, exterior, derived set and isolated point in a topological space
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 39 results over 17 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
- Cofiniteness (Wikipedia) (standard reference, not scraped)
- Dense set (Wikipedia) (standard reference, not scraped)
- J. Munkres, Topology, 2nd ed., §12 (standard reference, not scraped)