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.

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

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice ( ${A C}_{ω}$ )). Let $(X, T)$ be a perfectly normal space (Completely normal ( $T_{5}$ ) and perfectly normal ( $T_{6}$ ) spaces): $X$ is normal (Normal spaces and $T_{4}$ spaces, with the source disagreement over whether normality includes $T_{1}$ stated explicitly) and every closed subset of $X$ is a $G_{δ}$ , equivalently every open subset of $X$ is an $F_{σ}$ ( $G_{δ}$ and $F_{σ}$ subsets of a topological space, agreeing with the real-line notion). Then $X$ is completely normal: any two separated sets $A, B \subseteq X$ (Separated sets: $\overline{A} \cap B = A \cap \overline{B} = \emptyset$ ) admit disjoint open $U \supseteq A$ and $V \supseteq B$ .

Consequently $T_{6}$ implies $T_{5}$ .

No continuous function is constructed anywhere in the proof, and in particular Urysohn's lemma is not used. All that is consumed is normality, applied once to each member of a countable family of closed sets, and the $F_{σ}$ presentation of two open sets.

Where the choice principle is spent, and why it is not removable as written. Step 4.1 selects, for each $n \in N$ at once, one open set $U_{n}$ out of the nonempty family that normality provides for the closed set $F_{n}$ , and likewise one $V_{n}$ ; normality is an existence statement and supplies no rule for singling out a member, so extracting the two sequences is an application of ${A C}_{ω}$ and of nothing stronger. The hypothesis is stated in the theorem rather than hidden in the proof, as this library does everywhere.

Facts & Assumptions

Given: A perfectly normal space $(X, T)$ and separated sets $A, B \subseteq X$ , so that $\overline{A} \cap B = A \cap \overline{B} = \emptyset$ .

[A1]

$A$ and $B$ are separated: $\overline{A} \cap B = \emptyset$ and $A \cap \overline{B} = \emptyset$ (Separated sets: $\overline{A} \cap B = A \cap \overline{B} = \emptyset$ ).

[A2]

Every open subset of $X$ is an $F_{σ}$ : it is $⋃_{n \in N} C_{n}$ for some sequence of closed sets $C_{n}$ (Completely normal ( $T_{5}$ ) and perfectly normal ( $T_{6}$ ) spaces, $G_{δ}$ and $F_{σ}$ subsets of a topological space, agreeing with the real-line notion, Finite, countably infinite, countable, uncountable).

[A3]

${A C}_{ω}$ : for a family of nonempty sets indexed by $N$ there is a function choosing a member of each (The Axiom of Countable Choice ( ${A C}_{ω}$ )).

[L1]

In a normal space, disjoint closed sets $F$ and $D$ admit an open $W \supseteq F$ with $\overline{W} \cap D = \emptyset$ (A space is normal if and only if every closed $A$ inside an open $U$ admits an open $V$ with $A \subseteq V \subseteq \overline{V} \subseteq U$ , final assertion, Normal spaces and $T_{4}$ spaces, with the source disagreement over whether normality includes $T_{1}$ stated explicitly).

[L2]

$\overline{S}$ is closed and contains $S$ ; a set is closed exactly when it equals its closure; a set is closed exactly when its complement is open (A point lies in the closure of $A$ iff every basic neighbourhood of it meets $A$ ; the closure is the smallest closed superset and equals $A$ together with its derived set, claim 2, Interior, closure, boundary, exterior, derived set and isolated point in a topological space, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L3]

A union of finitely many closed sets is closed by iterating (C3), an arbitrary union of open sets is open by (T2), and an intersection of two open sets is open by (T3) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L4]

For all $n, m \in N$ exactly one of $n < m$ , $n = m$ , $m < n$ holds (Trichotomy of the order on $N$ ).

Proof

technique · direct

1.1

$A \subseteq X ∖ \overline{B}$ and $B \subseteq X ∖ \overline{A}$ , and both of these sets are open.

A1L2

2.1

By [A2] fix sequences of closed sets with $X ∖ \overline{B} = ⋃_{n \in N} F_{n}$ and $X ∖ \overline{A} = ⋃_{n \in N} G_{n}$ .

step 1.1A2choose

3.1

For every $n$ the closed sets $F_{n}$ and $\overline{B}$ are disjoint, since $F_{n} \subseteq X ∖ \overline{B}$ ; likewise $G_{n}$ and $\overline{A}$ are disjoint closed sets.

step 2.1L2

4.1

By [L1] the set of open $W \supseteq F_{n}$ with $\overline{W} \cap \overline{B} = \emptyset$ is nonempty for each $n$ , and likewise the set of open $W^{'} \supseteq G_{n}$ with $\overline{W^{'}} \cap \overline{A} = \emptyset$ ; so [A3] supplies sequences $(U_{n})_{n \in N}$ and $(V_{n})_{n \in N}$ of open sets with $F_{n} \subseteq U_{n}$ , $\overline{U_{n}} \cap \overline{B} = \emptyset$ , $G_{n} \subseteq V_{n}$ and $\overline{V_{n}} \cap \overline{A} = \emptyset$ for every $n$ .

step 3.1A3L1choose

5.1

Define $U : = ⋃_{n \in N} (U_{n} ∖ ⋃_{i \leq n} \overline{V_{i}})$ and $V : = ⋃_{n \in N} (V_{n} ∖ ⋃_{j \leq n} \overline{U_{j}})$ .

step 4.1construct

6.1

$U$ and $V$ are open: for each $n$ the set $⋃_{i \leq n} \overline{V_{i}}$ is a union of finitely many closed sets, hence closed, so its complement is open and $U_{n} ∖ ⋃_{i \leq n} \overline{V_{i}}$ is an intersection of two open sets; the union over $n$ is then open.

step 5.1L2L3

6.2

$A \subseteq U$ : given $a \in A$ , step 1.1 and step 2.1 put $a$ in some $F_{n} \subseteq U_{n}$ , while $a \in \overline{A}$ and $\overline{V_{i}} \cap \overline{A} = \emptyset$ give $a \notin \overline{V_{i}}$ for every $i$ ; hence $a \in U_{n} ∖ ⋃_{i \leq n} \overline{V_{i}} \subseteq U$ .

step 1.1step 2.1step 4.1step 5.1L2

6.3

$B \subseteq V$ : given $b \in B$ , step 1.1 and step 2.1 put $b$ in some $G_{m} \subseteq V_{m}$ , while $b \in \overline{B}$ and $\overline{U_{j}} \cap \overline{B} = \emptyset$ give $b \notin \overline{U_{j}}$ for every $j$ ; hence $b \in V_{m} ∖ ⋃_{j \leq m} \overline{U_{j}} \subseteq V$ .

step 1.1step 2.1step 4.1step 5.1L2

6.4

Suppose $x \in U \cap V$ ; then by step 5.1 there are $n, m \in N$ with $x \in U_{n}$ , $x \notin \overline{V_{i}}$ for all $i \leq n$ , $x \in V_{m}$ , and $x \notin \overline{U_{j}}$ for all $j \leq m$ .

step 5.1assume-hyp

7.1

If $n \leq m$ in step 6.4 then $j : = n$ satisfies $j \leq m$ , so $x \notin \overline{U_{n}}$ ; but $x \in U_{n} \subseteq \overline{U_{n}}$ , which is impossible.

step 6.4L2

7.2

If $m < n$ in step 6.4 then $i : = m$ satisfies $i \leq n$ , so $x \notin \overline{V_{m}}$ ; but $x \in V_{m} \subseteq \overline{V_{m}}$ , which is impossible.

step 6.4L2

8.1

By [L4] one of $n \leq m$ and $m < n$ holds, so steps 7.1 and 7.2 exclude every case and no such $x$ exists: $U \cap V = \emptyset$ .

step 7.1step 7.2L4

9.1

By steps 6.1, 6.2, 6.3 and 8.1 the sets $U$ and $V$ are disjoint open sets containing $A$ and $B$ respectively; since $A$ and $B$ were an arbitrary separated pair, $X$ is completely normal, and with the hypothesis $T_{1}$ this reads $T_{6}$ implies $T_{5}$ .

step 6.1step 6.2step 6.3step 8.1∎

Remarks

The subtraction of the earlier closures is the entire trick. Each $U_{n} ∖ ⋃_{i \leq n} \overline{V_{i}}$ is still large enough to catch the part of $A$ that $F_{n}$ covers, because no point of $A$ lies in any $\overline{V_{i}}$ ; and it is small enough that the two unions cannot meet, because a putative common point would be inside a $U_{n}$ that a later stage of $V$ has already removed, or inside a $V_{m}$ that a later stage of $U$ has removed. The comparison $n \leq m$ or $m < n$ is what decides which of the two it is.
Only the two closures $\overline{A}$ and $\overline{B}$ are used, never the sets $A$ and $B$ themselves beyond membership, which is why the hypothesis is exactly separation and not disjointness. For disjoint sets that are not separated the argument breaks at step 6.2.
The converse is not proved here and is not asserted. Perfect normality asks a countability condition of every closed set that complete normality never mentions, so the two are not the same hypothesis; but no witness separating them is exhibited in this library, and nothing above claims one exists.
The hereditary reading is not used. Complete normality is equivalent to the normality of every subspace, and some texts prove this theorem in that language; the argument above works directly with the separated-sets definition and never passes to a subspace.

Depends on

Used by

Dependency tree · two levels

46 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

Normal space (Wikipedia) (standard reference, not scraped)
Separated sets (Wikipedia) (standard reference, not scraped)
R. Engelking, General Topology, §1.5 (standard reference, not scraped)
Gδ set (Wikipedia) (standard reference, not scraped)

Assuming countable choice, every perfectly normal space is completely normal: separated sets in a normal space whose open sets are all FσFσ​ can be separated by disjoint open sets