Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableverified 2026-08-03 (gpt-5.6-sol-codex-subscription)‡ rests on unproved material
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.

Conventions on this page, and the one implication of the classical chain that is not available at this point in the reading order

The separation axioms are the part of general topology where textbooks disagree most sharply about vocabulary, and where a reader arriving with the other convention misreads statements rather than merely finding them unfamiliar. This remark settles the disagreements that are live on this page, records the one implication of the classical chain that this page does not prove, and states the choice cost of the one implication whose proof spends a choice principle. The standing topological vocabulary is used throughout: neighbourhoods need not be open, empty intersections equal the whole carrier, a basis is always relative to a topology, and comparisons use coarser and finer.

1. Whether *regular* and *normal* include $T_1$

They do not, in this library. Regular, completely regular, normal, completely normal and perfectly normal name separation conditions on sets alone (Regular spaces and T3 spaces, with the source disagreement over whether regularity includes T1 stated explicitly, Completely regular spaces and Tychonoff (T312) spaces, Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly, Completely normal (T5) and perfectly normal (T6) spaces); the numerals T3, T312, T4, T5 and T6 name the conjunction of each with T1 (T0 (Kolmogorov) and T1 (Frechet) spaces).

Munkres builds T1 into regular and normal and then has no separate name for the bare conditions; Kelley, Willard and Engelking take the side taken here. Both usages are current, and neither is more correct. The reason for the choice made here is that the two halves are genuinely independent and each is used alone on this page: the indiscrete topology on a two-point set is regular, completely regular, normal, completely normal and perfectly normal, and fails T0; and the cofinite topology on an infinite set is T1 and fails everything above it. Every statement on this page writes the T1 hypothesis out where it is used, so a reader may translate to the other convention by deleting it.

The word Tychonoff is used for completely regular plus T1, and T312 is treated as a synonym.

2. The name *Urysohn*, which denotes three different things

  • Urysohn space, T212: distinct points have neighbourhoods with disjoint closures (Urysohn (T212) space: distinct points have neighbourhoods with disjoint closures). This is what "Urysohn" means on this page.
  • Completely Hausdorff: distinct points are separated by a continuous real-valued function. Some texts attach Urysohn's name to this condition instead. This library does not define it.
  • Urysohn's lemma: the theorem that in a normal T1 space two disjoint closed sets are separated by a continuous function into [0,1]. It is a theorem about sets, not points, and it is unrelated to either space condition.

A statement quoting "Urysohn" without saying which is meant is ambiguous; this page always says which.

3. The one arrow this page does not prove

The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T1 gives T3; completely regular gives regular; regular with T1 gives Urysohn, hence Hausdorff, hence T1, hence T0; and metrizable gives every one of them assembles every implication proved here. Against the classical chain it is short by exactly one arrow:

T4⇒T312: a normal T1 space is completely regular.

This is Urysohn's lemma, applied to the point {x0} — which is closed by T1 — and the closed set C. Its proof indexes a family of open sets by the dyadic rationals, choosing each from the previous one by the shrinking lemma; it is not available at this point in the reading order, and no theorem of this page proves it. Where it is named — in Completely regular spaces and Tychonoff (T312) spaces and in Every completely regular space is regular, and every Tychonoff space is T3 — it is named as the classical arrow that is missing here, and it is never used as a fact in any proof on this page. What would license it is a page proving Urysohn's lemma, which in this library's plan sits above the present one.

The gap is not mere bookkeeping. Urysohn's lemma is not a theorem of ZF, nor of ZF together with countable choice: this is recorded, with its sources, in Urysohn's lemma is not a theorem of ZF, nor of ZF plus countable choice ‡, which this remark mentions without depending on. So the missing arrow is missing for a reason stronger than the reading order — no rearrangement of the material already on this page could supply it, and any page that does supply it must record a choice principle.

Everything else in the classical chain is here. In particular T6⇒T5 is proved (Assuming countable choice, every perfectly normal space is completely normal: separated sets in a normal space whose open sets are all Fσ can be separated by disjoint open sets), and proved without any Urysohn function: it needs only normality, the Fσ presentation of open sets, and the Axiom of Countable Choice recorded in §4 below. A reader who expects that arrow also to be unavailable is thinking of the route through "every closed set is a zero set", which does need Urysohn's lemma; the route taken here does not.

4. The one choice cost incurred on this page

Every proof on this page is a theorem of ZF except Assuming countable choice, every perfectly normal space is completely normal: separated sets in a normal space whose open sets are all Fσ can be separated by disjoint open sets, which assumes the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and spends it at one step, selecting one open set for each member of a countable family of closed sets. The hypothesis is written into that theorem's own statement and into clause 1 of The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T1 gives T3; completely regular gives regular; regular with T1 gives Urysohn, hence Hausdorff, hence T1, hence T0; and metrizable gives every one of them, and it is inherited by nothing else: in particular the metric results are choice free, so "metrizable implies perfectly normal, completely normal and normal" needs no choice at all, even though the general arrow from perfect to complete normality does.

5. What this page deliberately does not contain

Depends on

Used by

Dependency tree · two levels

63 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