Alphabeta Math
False statementConstruction: Literature-sourcedVerification: 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.

FALSE: every T1T_1 space is Hausdorff

Statement

False claim: every T1T_1 space (T0T_0 (Kolmogorov) and T1T_1 (Frechet) spaces) is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).

The refutation is the cofinite topology Tcof\mathcal{T}_{\mathrm{cof}} on R\mathbb{R} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), whose open sets are \varnothing together with the complements of the finite subsets of R\mathbb{R}. It is T1T_1, because its closed sets are exactly R\mathbb{R} and the finite sets; and it is not Hausdorff, because any two nonempty open sets meet, R\mathbb{R} being infinite. The witness is worked further on the companion page, where the same space is shown to fail regularity and normality as well.

Facts & Assumptions

Given: The set R\mathbb{R} with the cofinite topology Tcof\mathcal{T}_{\mathrm{cof}}, and two points xyx \ne y of R\mathbb{R}.

[L1]

Tcof\mathcal{T}_{\mathrm{cof}} consists of \varnothing together with the sets whose complement is finite; 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).

[L3]

R\mathbb{R} is uncountable (R\mathbb{R} is uncountable (Cantor's nested intervals, 1874)), and every finite set is at most countable (Finite, countably infinite, countable, uncountable); so R\mathbb{R} is not finite.

Refutation

technique · direct
1.1

TcofTcof\mathcal{T}_{\mathrm{cof}} \subseteq \mathcal{T}_{\mathrm{cof}}, so the cofinite topology on R\mathbb{R} is T1T_1.

L2
1.2

R\mathbb{R} is not finite, since a finite set is at most countable and R\mathbb{R} is uncountable.

L3
1.3

Let U,VTcofU, V \in \mathcal{T}_{\mathrm{cof}} be nonempty and suppose UV=U \cap V = \varnothing; then R=R(UV)=(RU)(RV)\mathbb{R} = \mathbb{R} \setminus (U \cap V) = (\mathbb{R} \setminus U) \cup (\mathbb{R} \setminus V), a union of two finite sets, hence finite by [L1].

L1assume-hyp
2.1

Step 1.3 contradicts step 1.2, so no two nonempty open sets of Tcof\mathcal{T}_{\mathrm{cof}} are disjoint.

step 1.2step 1.3
3.1

Take xyx \ne y in R\mathbb{R}, for instance x=0x = 0 and y=1y = 1. Any open UxU \ni x and open VyV \ni y are nonempty, so UVU \cap V \ne \varnothing by step 2.1, and xx and yy have no disjoint open neighbourhoods.

step 2.1
4.1

By step 1.1 the space (R,Tcof)(\mathbb{R}, \mathcal{T}_{\mathrm{cof}}) is T1T_1, and by step 3.1 and [A1] it is not Hausdorff; so the claim is false.

step 1.1step 3.1A1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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