Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

Every completely normal space is normal, and every perfectly normal space is normal

Statement

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

  1. If XX is completely normal (Completely normal (T5T_5) and perfectly normal (T6T_6) spaces) then XX is normal (Normal spaces and T4T_4 spaces, with the source disagreement over whether normality includes T1T_1 stated explicitly).
  2. If XX is perfectly normal then XX is normal.
  3. Consequently T5T_5 implies T4T_4 and T6T_6 implies T4T_4.

Claim 2 is immediate from the definition, normality being one of the two conjuncts of perfect normality; it is recorded here so that the chain assembled at the end of this page has a single item to cite for both implications. Claim 1 is the one with content, and its content is that disjoint closed sets are a special case of separated sets.

Facts & Assumptions

Given: A topological space (X,T)(X,\mathcal{T}) and closed sets A,BXA, B \subseteq X with AB=A \cap B = \varnothing.

[A1]

XX completely normal: every pair of separated sets admits disjoint open supersets (Completely normal (T5T_5) and perfectly normal (T6T_6) spaces).

[A2]

XX perfectly normal: XX is normal and every closed subset of XX is a GδG_\delta (Completely normal (T5T_5) and perfectly normal (T6T_6) spaces).

[L1]

AA and BB are separated when AB=AB=\overline{A} \cap B = A \cap \overline{B} = \varnothing (Separated sets: AB=AB=\overline{A} \cap B = A \cap \overline{B} = \varnothing).

[L3]

Normality is the assertion that disjoint closed sets admit disjoint open supersets (Normal spaces and T4T_4 spaces, with the source disagreement over whether normality includes T1T_1 stated explicitly).

Proof

technique · direct
1.1

A=A\overline{A} = A and B=B\overline{B} = B, both sets being closed.

L2
1.2

If XX is perfectly normal then XX is normal, this being the first conjunct of [A2], which is claim 2.

A2L3
2.1

AB=AB=\overline{A} \cap B = A \cap B = \varnothing and AB=AB=A \cap \overline{B} = A \cap B = \varnothing, so AA and BB are separated.

step 1.1L1
3.1

If XX is completely normal, [A1] applied to the separated pair of step 2.1 gives disjoint open UAU \supseteq A and VBV \supseteq B; since AA and BB were arbitrary disjoint closed sets, XX is normal, which is claim 1.

step 2.1A1L3
4.1

Adding the hypothesis T1T_1 to either of steps 3.1 and 1.2 turns T5T_5, respectively T6T_6, into T4T_4, which is claim 3.

step 3.1step 1.2

Remarks

  • Neither converse is proved here and neither is asserted. Whether a normal space must be completely normal, and whether a normal space must be perfectly normal, are left open on this page: any witness would need machinery this page does not have, and no false statement asserting a reversal is planted here.

  • Where the strength of complete normality actually shows. It is not in the closed case above but in pairs like (0,1)(0,1) and (1,2)(1,2) in R\mathbb{R}, which are separated and not closed. The metric theorem later on this page separates every such pair at once, which is why every metrizable space is completely normal and not merely normal.

Depends on

Used by

Dependency tree · next 3 levels

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