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 space is completely regular, so , 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 -indexed chain). If is normal and , that is (Normal spaces and spaces, with the source disagreement over whether normality includes stated explicitly, (Kolmogorov) and (Frechet) spaces), then is completely regular (Completely regular spaces and Tychonoff () spaces). Since is also , is Tychonoff, and .
now holds: the first arrow under the Axiom of Countable Choice (The Axiom of Countable Choice ()), the arrow 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, topological space , a closed set , and a point .
In a space every singleton is closed (A space is if and only if every singleton is closed, if and only if every finite subset is closed, if and only if its topology contains the cofinite topology, clause (b)).
Urysohn's lemma, clause 1: assuming DC, if is normal and are disjoint closed sets, there is a continuous with and (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into , and conversely such a space is normal).
is completely regular when for every closed and every there is a continuous with and on (Completely regular spaces and Tychonoff () spaces).
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 gives ; completely regular gives regular; regular with gives Urysohn, hence Hausdorff, hence , hence ; and metrizable gives every one of them: normal with implies ; completely regular implies regular, and Tychonoff implies ; and clauses 1, 2 and 5 give the remaining arrows of the displayed chain, clause 1 — perfectly normal implies completely normal, that is — under the Axiom of Countable Choice.
Proof
is closed, since is by [A1].
, since .
By [A1] is normal, so [L2] applies to the disjoint closed sets and : there is a continuous with and , that is on and .
Since and were arbitrary, step 2.1 exhibits, for every closed and every , a continuous with and on ; by [L3] this makes completely regular.
Since is also by [A1], is Tychonoff, so .
By [L4], and all hold, the arrow under countable choice; combined with step 4.1, every arrow of the displayed chain holds.
Remarks
-
This corollary supplies exactly the one arrow the published
separation-axiomspage could not reach. That page's ownrem-separation-axiom-conventionsnames the missing arrow as normal implies completely regular and records that no rearrangement of material already on that page could supply it, since the implication is Urysohn's lemma. Nothing in this corollary revisits or amends that page; it only supplies, at a later point in the reading order, the theorem that page named as absent. -
The chain above is not asserted to be a theorem of ZF. Its weakest link is this corollary's own dependent-choice hypothesis, and the first arrow separately costs countable choice; neither cost is removed by combining the arrows, and no clause of The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with gives ; completely regular gives regular; regular with gives Urysohn, hence Hausdorff, hence , hence ; and metrizable gives every one of them is reproved here.
Depends on
- 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]$, and conversely such a space is normal
- Normal spaces and $T_4$ spaces, with the source disagreement over whether normality includes $T_1$ stated explicitly
- $T_0$ (Kolmogorov) and $T_1$ (Frechet) spaces
- A space is $T_1$ if and only if every singleton is closed, if and only if every finite subset is closed, if and only if its topology contains the cofinite topology
- Completely regular spaces and Tychonoff ($T_{3\frac{1}{2}}$) spaces
- The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with $T_1$ gives $T_3$; completely regular gives regular; regular with $T_1$ gives Urysohn, hence Hausdorff, hence $T_1$, hence $T_0$; and metrizable gives every one of them
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Under dependent choice a compact Hausdorff space is Tychonoff, and its disjoint closed sets are separated by continuous functions Corollary
- Sierpinski space is normal and not completely regular, so the T₁ hypothesis in the Urysohn corollary is not decoration Example
- FALSE: Every normal space is completely regular False statement
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
- Urysohn's lemma (Wikipedia) (standard reference, not scraped)
- Separation axiom (Wikipedia) (standard reference, not scraped)