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

FALSE: every T1 space is Hausdorff

Statement

False claim: every T1 space (T0 (Kolmogorov) and T1 (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 on R (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), whose open sets are ∅ together with the complements of the finite subsets of R. It is T1, because its closed sets are exactly R and the finite sets; and it is not Hausdorff, because any two nonempty open sets meet, 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 with the cofinite topology Tcof, and two points x≠y of R.

[L1]

Tcof consists of ∅ 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 is uncountable (R is uncountable (Cantor's nested intervals, 1874)), and every finite set is at most countable (Finite, countably infinite, countable, uncountable); so R is not finite.

Refutation

technique · direct
1.1

Tcof⊆Tcof, so the cofinite topology on R is T1.

L2
1.2

R is not finite, since a finite set is at most countable and R is uncountable.

L3
1.3

Let U,V∈Tcof be nonempty and suppose U∩V=∅; then R=R∖(U∩V)=(R∖U)∪(R∖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 are disjoint.

step 1.2step 1.3
3.1

Take x≠y in R, for instance x=0 and y=1. Any open U∋x and open V∋y are nonempty, so U∩V≠∅ by step 2.1, and x and y have no disjoint open neighbourhoods.

step 2.1
4.1

By step 1.1 the space (R,Tcof) is T1, 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 · two levels

39 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