Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

The cofinite topology on an infinite set is T1 but neither Hausdorff nor regular nor normal

Example

Let X be an infinite set — that is, a set that is not finite (Finite, countably infinite, countable, uncountable) — and give it the cofinite topology Tcof={∅}∪{ U⊆X:X∖U is finite } (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), whose closed sets are X together with the finite subsets of X. Then:

  1. (X,Tcof) is T1 (T0 (Kolmogorov) and T1 (Frechet) spaces).
  2. No two nonempty open sets are disjoint. Consequently the space is not Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not), not regular (Regular spaces and T3 spaces, with the source disagreement over whether regularity includes T1 stated explicitly) and not normal (Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly).

So the cofinite topology on an infinite set satisfies T1 and T0 and fails every axiom above them. It is the standard witness that T1 is strictly weaker than the Hausdorff condition, and that is how it is used on the main page (FALSE: every T1 space is Hausdorff); here it is pushed further, to show that T1 implies neither of the two axioms that sit above T2 either.

Facts & Assumptions

Given: An infinite set X with the cofinite topology Tcof, and points x,y,z∈X.

[A1]

U∈Tcof exactly when U=∅ or X∖U is finite; the closed sets are X and the finite subsets of X; and a union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, facts (i) and (ii) of that item, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L3]

A set with at most one element is finite, being equinumerous with 0 or with 1; so an infinite set has at least three distinct points, since a set with at most two elements is finite as a union of two sets each with at most one (Finite, countably infinite, countable, uncountable, The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, fact (ii)).

Verification

technique · direct
1.1

Tcof⊆Tcof, so (X,Tcof) is T1, which is claim 1.

L1
1.2

X contains three distinct points x, y, z.

L3
1.3

Let U,V be nonempty open sets and suppose U∩V=∅; then X=(X∖U)∪(X∖V) is a union of two finite sets, hence finite by [A1], contradicting the hypothesis that X is infinite. So no two nonempty open sets are disjoint, which is the first half of claim 2.

A1assume-hyp
2.1

x≠y, and any open U∋x and open V∋y are nonempty, hence meet by step 1.3; so the space is not Hausdorff by [L2].

step 1.2step 1.3L2
2.2

{y} is closed by [A1] and x∉{y}; any open U∋x and open V⊇{y} are nonempty, hence meet by step 1.3; so the space is not regular by [L2].

step 1.2step 1.3A1L2L4
2.3

{y} and {z} are disjoint nonempty closed sets by [A1] and step 1.2; any open U⊇{y} and open V⊇{z} are nonempty, hence meet by step 1.3; so the space is not normal by [L2].

step 1.2step 1.3A1L2L4
3.1

Steps 2.1, 2.2 and 2.3 complete claim 2, and step 1.1 is claim 1.

step 1.1step 2.1step 2.2step 2.3∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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