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

Under dependent choice a normal T1T_1 space is completely regular, so T4T312T_4 \Rightarrow T_{3\frac{1}{2}}, and together with the implications already proved this is the whole classical chain

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain). If (X,T)(X,\mathcal{T}) is normal and T1T_1, that is T4T_4 (Normal spaces and T4T_4 spaces, with the source disagreement over whether normality includes T1T_1 stated explicitly, T0T_0 (Kolmogorov) and T1T_1 (Frechet) spaces), then XX is completely regular (Completely regular spaces and Tychonoff (T312T_{3\frac{1}{2}}) spaces). Since XX is also T1T_1, XX is Tychonoff, and T4T312T_4 \Rightarrow T_{3\frac12}.

Combined with The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T1T_1 gives T3T_3; completely regular gives regular; regular with T1T_1 gives Urysohn, hence Hausdorff, hence T1T_1, hence T0T_0; and metrizable gives every one of them, every arrow of

T6T5T4T312T3T212T2T1T0T_6 \Rightarrow T_5 \Rightarrow T_4 \Rightarrow T_{3\frac12} \Rightarrow T_3 \Rightarrow T_{2\frac12} \Rightarrow T_2 \Rightarrow T_1 \Rightarrow T_0

now holds: the first arrow under the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)), the arrow T4T312T_4 \Rightarrow T_{3\frac12} proved here under dependent choice, and every other arrow with no choice principle at all. No arrow of this chain is asserted to reverse.

Facts & Assumptions

Given: A normal, T1T_1 topological space (X,T)(X,\mathcal{T}), a closed set CXC \subseteq X, and a point x0XCx_0 \in X \setminus C.

[L2]

Urysohn's lemma, clause 1: assuming DC, if XX is normal and P,QXP, Q \subseteq X are disjoint closed sets, there is a continuous h:X[0,1]h : X \to [0,1] with Ph1({0})P \subseteq h^{-1}(\{0\}) and Qh1({1})Q \subseteq h^{-1}(\{1\}) (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into [0,1][0,1], and conversely such a space is normal).

[L3]

XX is completely regular when for every closed CC and every x0XCx_0 \in X \setminus C there is a continuous f:X[0,1]f : X \to [0,1] with f(x0)=1f(x_0) = 1 and f0f \equiv 0 on CC (Completely regular spaces and Tychonoff (T312T_{3\frac{1}{2}}) spaces).

[L4]

Clauses 3 and 4 of The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T1T_1 gives T3T_3; completely regular gives regular; regular with T1T_1 gives Urysohn, hence Hausdorff, hence T1T_1, hence T0T_0; and metrizable gives every one of them: normal with T1T_1 implies T3T_3; completely regular implies regular, and Tychonoff implies T3T_3; and clauses 1, 2 and 5 give the remaining arrows of the displayed chain, clause 1 — perfectly normal implies completely normal, that is T6T5T_6 \Rightarrow T_5 — under the Axiom of Countable Choice.

Proof

technique · direct
1.1

{x0}\{x_0\} is closed, since XX is T1T_1 by [A1].

A1L1
1.2

{x0}C=\{x_0\} \cap C = \varnothing, since x0Cx_0 \notin C.

given
2.1

By [A1] XX is normal, so [L2] applies to the disjoint closed sets CC and {x0}\{x_0\}: there is a continuous f:X[0,1]f : X \to [0,1] with Cf1({0})C \subseteq f^{-1}(\{0\}) and {x0}f1({1})\{x_0\} \subseteq f^{-1}(\{1\}), that is f0f \equiv 0 on CC and f(x0)=1f(x_0) = 1.

step 1.1step 1.2A1L2
3.1

Since CC and x0Cx_0 \notin C were arbitrary, step 2.1 exhibits, for every closed CC and every x0XCx_0 \in X \setminus C, a continuous f:X[0,1]f : X \to [0,1] with f(x0)=1f(x_0)=1 and f0f \equiv 0 on CC; by [L3] this makes XX completely regular.

step 2.1L3
4.1

Since XX is also T1T_1 by [A1], XX is Tychonoff, so T4T312T_4 \Rightarrow T_{3\frac12}.

step 3.1A1
5.1

By [L4], T312T3T212T2T1T0T_{3\frac12} \Rightarrow T_3 \Rightarrow T_{2\frac12} \Rightarrow T_2 \Rightarrow T_1 \Rightarrow T_0 and T6T5T4T_6 \Rightarrow T_5 \Rightarrow T_4 all hold, the arrow T6T5T_6 \Rightarrow T_5 under countable choice; combined with step 4.1, every arrow of the displayed chain holds.

step 4.1L4

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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