Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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, and the cocountable topology on R\mathbb{R}, are T1T_1 with a diagonal whose closure is the whole square; on a countably infinite set the cocountable topology is discrete instead

Example

Standard topologies are as in The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, diagonals as in The diagonal ΔXX×X\Delta_X \subseteq X \times X, the diagonal map δX\delta_X, and the pairing f,g\langle f, g \rangle of two maps, and every square carries the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

  1. Cofinite, on an infinite set. Let XX be infinite (Finite, countably infinite, countable, uncountable) and give it the cofinite topology Tcof\mathcal{T}_{\mathrm{cof}}. Then (X,Tcof)(X, \mathcal{T}_{\mathrm{cof}}) is T1T_1 (T0T_0 (Kolmogorov) and T1T_1 (Frechet) spaces), no two nonempty open sets are disjoint, ΔX  =  X×X    ΔX,\overline{\Delta_X} \;=\; X \times X \;\ne\; \Delta_X , so ΔX\Delta_X is not closed and the space is not Hausdorff.
  2. Cocountable, on R\mathbb{R}. Give R\mathbb{R} the cocountable topology Tcoc\mathcal{T}_{\mathrm{coc}}. The same three conclusions hold: (R,Tcoc)(\mathbb{R}, \mathcal{T}_{\mathrm{coc}}) is T1T_1, no two nonempty open sets are disjoint, and ΔR=R×RΔR\overline{\Delta_{\mathbb{R}}} = \mathbb{R} \times \mathbb{R} \ne \Delta_{\mathbb{R}}.
  3. "Infinite" is the wrong hypothesis for the cocountable half. If ZZ is countably infinite then Tcoc\mathcal{T}_{\mathrm{coc}} on ZZ is the discrete topology, which is Hausdorff and whose diagonal is therefore closed. So clause 2 must be asserted of a set large enough that a cocountable set is a genuine restriction, and R\mathbb{R} is such a set; an arbitrary infinite set is not.

In every case the verdict on the diagonal matches A space is Hausdorff if and only if its diagonal is closed in the square carrying the product topology, as it must.

Facts & Assumptions

Given: An infinite set XX with the cofinite topology; R\mathbb{R} with the cocountable topology; a countably infinite set ZZ with the cocountable topology; and each square with the product topology.

[A1]

The cofinite topology consists of \varnothing together with the sets of finite complement, and its closed sets are the whole set together with the finite subsets; the cocountable topology consists of \varnothing together with the sets of at most countable complement, and its closed sets are the whole set together with the at most countable subsets (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[A3]

A subset of a finite set is finite and a union of two finite sets is finite, both discharged in The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies; a set with at most one element is equinumerous with 00 or with 11 and hence finite, so an infinite set has at least two distinct elements (Finite, countably infinite, countable, uncountable).

[L2]

A point lies in A\overline{A} exactly when every basic open set containing it meets AA, and AA is closed exactly when A=AA = \overline{A} (A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set, claims 1(d) and 2).

[L4]

In the cocountable topology on R\mathbb{R} no two nonempty open sets are disjoint, so that space is not Hausdorff (FALSE: a space in which every sequence has at most one limit is Hausdorff).

Verification

technique · direct
1.1

Every singleton of XX is finite, hence closed in Tcof\mathcal{T}_{\mathrm{cof}}, so (X,Tcof)(X, \mathcal{T}_{\mathrm{cof}}) is T1T_1; every singleton of R\mathbb{R} is finite, hence at most countable, hence closed in Tcoc\mathcal{T}_{\mathrm{coc}}, so (R,Tcoc)(\mathbb{R}, \mathcal{T}_{\mathrm{coc}}) is T1T_1.

A1A3L1
1.2

No two nonempty U,VTcofU, V \in \mathcal{T}_{\mathrm{cof}} are disjoint: XUX \setminus U and XVX \setminus V are finite by [A1], so X(UV)=(XU)(XV)X \setminus (U \cap V) = (X \setminus U) \cup (X \setminus V) is finite by [A3], and XX is infinite, so UVU \cap V \ne \varnothing.

A1A3
1.3

No two nonempty members of Tcoc\mathcal{T}_{\mathrm{coc}} on R\mathbb{R} are disjoint.

L4
1.4

Each of XX and R\mathbb{R} has two distinct points, XX being infinite and R\mathbb{R} containing 00 and 11.

A3
1.5

Every subset of the countably infinite ZZ is at most countable by [L5], so every subset of ZZ has at most countable complement and is therefore open in Tcoc\mathcal{T}_{\mathrm{coc}}; thus Tcoc\mathcal{T}_{\mathrm{coc}} on ZZ is the discrete topology.

A1L5
2.1

Let (Y,T)(Y, \mathcal{T}) be either (X,Tcof)(X, \mathcal{T}_{\mathrm{cof}}) or (R,Tcoc)(\mathbb{R}, \mathcal{T}_{\mathrm{coc}}), and let zY×Yz \in Y \times Y and U×WU \times W be a basic open box containing zz; then Uz0U \ni z_0 and Wz1W \ni z_1 are nonempty open, so UWU \cap W \ne \varnothing by step 1.2 or step 1.3, and any tUWt \in U \cap W gives (t,t)(U×W)ΔY(t,t) \in (U \times W) \cap \Delta_Y.

step 1.2step 1.3A2
2.2

For distinct p,qYp, q \in Y the point (p,q)(p,q) lies in Y×YY \times Y and not in ΔY\Delta_Y, so ΔYY×Y\Delta_Y \ne Y \times Y.

step 1.4
3.1

By step 2.1 and [L2] every point of Y×YY \times Y lies in ΔY\overline{\Delta_Y}, so ΔY=Y×Y\overline{\Delta_Y} = Y \times Y, which by step 2.2 differs from ΔY\Delta_Y; hence ΔY\Delta_Y is not closed and by [L3] YY is not Hausdorff. This is claims 1 and 2, together with step 1.1.

step 1.1step 2.1step 2.2L2L3
4.1

Distinct p,qZp, q \in Z are separated by the disjoint open sets {p}\{p\} and {q}\{q\}, so (Z,Tcoc)(Z, \mathcal{T}_{\mathrm{coc}}) is Hausdorff and by [L3] its diagonal is closed in Z×ZZ \times Z; this is claim 3, and with step 3.1 the example is verified.

step 3.1step 1.5L3

Remarks

  • Why clause 3 is stated rather than left implicit. The cofinite and the cocountable topologies behave alike only when the underlying set is large enough for the excluded sets to be a genuine restriction. On a countably infinite set "at most countable complement" excludes nothing, so the cocountable topology collapses to the discrete one and every conclusion of clause 2 reverses. Stating the two clauses with the same hypothesis would be a falsehood, and the falsehood is invisible unless the degenerate case is written out.

  • The closure of the diagonal is as large as it can be. In both spaces of clauses 1 and 2 it is the entire square, so the diagonal is not merely non-closed: it is dense. That is the extreme opposite of the metric picture of The diagonal of R\mathbb{R} is closed in R2\mathbb{R}^2, computed from the product basis, where the diagonal is closed and its complement is open.

  • T1T_1 is doing no work here. Both spaces satisfy T1T_1 and neither satisfies T2T_2, which is exactly the separation between the two axioms; the diagonal criterion detects the second and is blind to the first, since it is a statement about the square rather than about singletons.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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