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.
Normalized families and collectionwise normality
Definition
Let be a topological space and let be a family of subsets of that is pairwise disjoint: for all distinct .
-
is separated when it has a pairwise disjoint open expansion: there are open sets with for all distinct . For this is vacuous.
-
is normalized when every subunion can be separated from its complementary subunion: for every there are disjoint open with The two halves and play symmetric roles, so it is enough to test one representative of each complementary pair.
-
is collectionwise normal (cwn) when every discrete family of closed subsets of (Discrete families and -locally-finite and -discrete bases) is separated.
Remarks
-
Discrete closed families are normalized in a normal space. Let be a discrete family of closed sets and a set of indices. A discrete family is locally finite (Every discrete family is locally finite, so every -discrete basis is -locally finite), and a locally finite union of closed sets is closed (Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed); hence and are disjoint closed sets. If is normal (Normal spaces and spaces, with the source disagreement over whether normality includes stated explicitly) they can be separated by disjoint open sets, so is normalized. Normality is thus the two-set case of the normalization of discrete closed families.
-
Collectionwise normality implies normality. For disjoint closed the two-member family is discrete: a point of has a neighbourhood missing , one of has a neighbourhood missing , and a point outside has a neighbourhood missing both, since and are closed. Separating that discrete family yields disjoint open sets containing and , so every cwn space is normal.
-
Separation implies normalization. If are pairwise disjoint open sets and , then and are disjoint open sets containing the two subunions. Hence every separated family is normalized, and the two-member cases of the two conditions coincide.
-
No choice is hidden. The definitions distinguish between "there exist open sets " and "there is a family " only in the usual way: a separation of a family is a family of open sets, so it is a single function together with its verification, not an application of choice.
Depends on
- Normal spaces and $T_4$ spaces, with the source disagreement over whether normality includes $T_1$ stated explicitly
- Discrete families and $\sigma$-locally-finite and $\sigma$-discrete bases
- Refinements, locally finite families, point-finite families, and star refinements
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Every discrete family is locally finite, so every $\sigma$-discrete basis is $\sigma$-locally finite
- Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed
Used by
- Collectionwise normal Moore spaces are screenable Lemma
- Metrizable spaces are collectionwise normal Lemma
- The PMEA three-quarter separation estimate Lemma
- CH yields a normal nonmetrizable Moore space Theorem
- Collectionwise normal Moore spaces are metrizable Theorem
- Fleissner's construction of a normal nonmetrizable Moore space from level data Theorem
- HYP produces a normal nonmetrizable Moore space Theorem
- PMEA makes normal low-character spaces collectionwise normal Theorem
Dependency tree · two levels
15 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
- Joan Bagaria and Samuel Gomes da Silva, omega-one-strongly compact cardinals and normality (standard reference, not scraped)
- D. H. Fremlin, Real-valued-measurable cardinals (standard reference, not scraped)