Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedverified 2026-08-06 (claude-sonnet-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.

Regular spaces and T3 spaces, with the source disagreement over whether regularity includes T1 stated explicitly

Definition

Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

  • X is regular when a point can be separated from a closed set not containing it: for every closed C⊆X and every x∈X∖C there are U,V∈T with x∈U,C⊆V,U∩V=∅.
  • X is T3 when it is regular and T1 (T0 (Kolmogorov) and T1 (Frechet) spaces).

Since an open set containing a point is an open neighbourhood of it (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open), regularity reads: x and C have disjoint open neighbourhoods. The case C=∅ is allowed and is satisfied by U=X, V=∅, so no nonemptiness is hidden in the condition.

The convention fork, and this library's side of it. Textbooks disagree about whether the word regular carries a T1 hypothesis. Munkres builds it in, defining a regular space to be one in which points are closed and the separation condition above holds; Kelley, Willard and Engelking do not, and reserve T3 for the conjunction. This library takes the second side: regular names the separation condition alone, T3 names regular plus T1, and every statement that needs points to be closed writes the T1 hypothesis out. The reason is that the two halves are genuinely independent and each is used alone below: the indiscrete topology on a two-point set is regular and not T0 (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), and the cofinite topology on an infinite set is T1 and not regular, both witnessed on the companion page.

Regularity alone implies no other separation axiom. It does not imply T0, T1 or Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not): in the indiscrete topology on a set X the only closed sets are ∅ and X, so the only pair (C,x) to be separated has C=∅, and U=X, V=∅ separates it; yet no two distinct points are distinguished by any open set. Conversely T1 does not imply regularity. It is the conjunction T3 that sits above Hausdorff in the hierarchy, and the proof of that is three items below.

Remarks

  • A regular space is not required to separate two closed sets, which is the stronger condition of normality defined later on this page; and a normal space is not required to separate a point from a closed set, since a point need not be closed. Normality does not imply regularity, and the witness is Sierpinski space on the companion page. Whether regularity implies normality is a question this page leaves open, and no statement here asserts an answer (Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly).

  • What regularity is really about. The reformulation proved next — every point has a neighbourhood base of closed neighbourhoods — is the form in which regularity is used in practice, and the form in which it is verified for the ordinal spaces later on this page, whose basis consists of clopen sets.

  • The numeral. Because of the fork above, "T3" in the literature may mean either what is defined here or the bare separation condition. This library always writes the numeral for the conjunction and never uses it to abbreviate the separation condition alone (Conventions on this page, and the one implication of the classical chain that is not available at this point in the reading order).

Depends on

Used by

Dependency tree · two levels

20 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