Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

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

Statement

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). The following implications hold, and each is proved by an earlier item of this page.

  1. Perfectly normal implies completely normal, assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).
  2. Completely normal implies normal, and perfectly normal implies normal.
  3. Normal together with T1 implies T3, that is regular together with T1.
  4. Completely regular implies regular, and Tychonoff implies T3.
  5. Regular together with T1 implies Urysohn, which implies Hausdorff, which implies T1, which implies T0.
  6. Metrizable implies every property named above: a metrizable space is perfectly normal, completely normal, normal, Tychonoff, completely regular, T3, regular, Urysohn, Hausdorff, T1 and T0, with no choice principle used.

Reading the numbered axioms in order, clauses 1 to 5 give

T6⇒T5⇒T4⇒T3⇒T212⇒T2⇒T1⇒T0,

the first arrow under ACω, together with T312⇒T3.

This is the whole of the classical chain that this page proves, and it is one arrow short of the classical chain. The implication T4⇒T312 — a normal T1 space is completely regular — is Urysohn's lemma and is not available at this point in the reading order. Its absence is recorded, with what would license it, in this page's conventions remark; it is deliberately not asserted here, and no clause above may be read as giving it.

Facts & Assumptions

[L2]

Every completely normal space is normal, and every perfectly normal space is normal (Every completely normal space is normal, and every perfectly normal space is normal).

[L4]

Every completely regular space is regular, and every Tychonoff space is T3 (Every completely regular space is regular, and every Tychonoff space is T3).

[L5]

Every regular T1 space is Urysohn, every Urysohn space is Hausdorff, and every Hausdorff space is T1 and hence T0 (Every Urysohn space is Hausdorff, every Hausdorff space is T1 and hence T0, and every regular T1 space is Urysohn).

[L7]

Every metric space is completely normal, hence normal, with no choice principle used (In a metric space any two separated sets have disjoint open neighbourhoods, so every metrizable space is completely normal).

Proof

technique · direct
1.1

Clause 1 is [L1], whose hypothesis ACω is carried into clause 1 unchanged.

L1
1.2

Clause 2 is [L2].

L2
1.3

Clause 3 is [L3].

L3
1.4

Clause 4 is [L4].

L4
1.5

Clause 5 is [L5], the first implication of which uses [L6] inside its own proof and needs nothing further here.

L5L6
1.6

Clause 6 is [L7] together with [L8].

L7L8
2.1

The displayed chain of numbered axioms is read off from steps 1.1 to 1.5, each numbered axiom being the corresponding unnumbered property together with T1, which is carried along every arrow: T6 gives completely normal by step 1.1, hence T5; T5 gives normal by step 1.2, hence T4; T4 gives T3 by step 1.3; and T3 gives Urysohn, Hausdorff, T1 and T0 by step 1.5.

step 1.1step 1.2step 1.3step 1.5
2.2

The side arrow T312⇒T3 is the second half of step 1.4.

step 1.4
3.1

Steps 1.1 to 1.6, 2.1 and 2.2 are exactly clauses 1 to 6 and the two displayed chains, and no other implication is asserted.

step 1.6step 2.1step 2.2∎

Remarks

  • Every clause above is an implication and none is an equivalence. This page refutes four of the possible converses among its false statements — T1 does not give Hausdorff, normal does not give Hausdorff, Hausdorff does not give regular, and unique sequential limits do not give Hausdorff — and asserts nothing about the others.

  • The T1 hypothesis is where the numerals differ from the adjectives. Regular, completely regular, normal, completely normal and perfectly normal carry no T1 in this library; T3, T312, T4, T5 and T6 are the conjunctions with T1. Clauses 3 and 5 are the two places the conjunction is genuinely needed for the next arrow, and they are what makes the numbered chain descend at all.

  • The countable choice in clause 1 is inherited, not introduced. It is spent in the proof of 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 nowhere else on this page; clause 6 in particular is choice free, since the metric proofs construct their open sets explicitly.

Depends on

Used by

Dependency tree · two levels

66 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