Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)judge 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.

Completely normal (T5T_5) and perfectly normal (T6T_6) spaces

Definition

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).

As with regular and normal, neither adjective carries a T1T_1 hypothesis in this library, and the numerals name the conjunctions.

The GδG_\delta condition, restated by complementation. Every closed subset of XX is a GδG_\delta if and only if every open subset of XX is an FσF_\sigma, because complementation exchanges the two classes and exchanges open with closed (GδG_\delta and FσF_\sigma subsets of a topological space, agreeing with the real-line notion). Both forms are used below, and the second is the one the implication T6T5T_6 \Rightarrow T_5 consumes.

Complete normality really is stronger than normality, on its face. Disjoint closed sets are separated (Separated sets: AB=AB=\overline{A} \cap B = A \cap \overline{B} = \varnothing), so the complete-normality condition applies in particular to them; that is the whole proof of the next item. What complete normality adds is the ability to separate sets that are not closed, for instance the two sets (0,1)(0,1) and (1,2)(1,2) of R\mathbb{R}, which are separated and neither of which is closed.

A competing definition of perfectly normal, and why this library does not use it. Some texts define a perfectly normal space to be a normal space in which every closed set is a zero set (Zero sets and cozero sets of continuous real-valued functions). That condition is equivalent to the one above, but the equivalence rests on Urysohn's lemma, which is not available at this point in the reading order; the GδG_\delta form is therefore the definition here, and no statement on this page asserts the equivalence. What is proved here is one direction in the metric case, where the distance function exhibits every closed set simultaneously as a zero set and as a GδG_\delta.

Remarks

  • Both axioms are about pairs of sets, not about points. Neither implies T0T_0: the indiscrete topology on a two-point set is completely normal and perfectly normal, since its only separated pairs have an empty member and its only closed sets are open, and it is not T0T_0. That is why the numerals T5T_5 and T6T_6 include T1T_1.

  • A frequently quoted equivalent of complete normality is not proved here. A space is completely normal exactly when every subspace of it is normal, which is why hereditarily normal is the other common name. This page defines and uses only the separated-sets form; the hereditary characterisation belongs to a later page, and nothing here depends on it.

  • The chain at the top. Perfectly normal implies completely normal, which implies normal; the second implication is immediate and the first is a real theorem, proved two items below.

Depends on

Used by

Dependency tree · next 3 levels

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