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.
Collectionwise normal Moore spaces are screenable
Statement
In every collectionwise normal Moore space is screenable: every open cover of the space has a refinement that is a countable union of pairwise disjoint families of open sets and covers the space (Moore spaces and developments, Normalized families and collectionwise normality, The Axiom of Choice).
Facts & Assumptions
Given: A collectionwise normal Moore space with a decreasing development (Moore spaces and developments) and an open cover well-ordered by .
Each is open and contains , and for open there is with ; members of are contained in members of when (Moore spaces and developments, Refinements, locally finite families, point-finite families, and star refinements).
Collectionwise normality: every discrete family of closed sets has a pairwise disjoint open expansion (Normalized families and collectionwise normality, Discrete families and -locally-finite and -discrete bases).
exactly when every neighbourhood of meets ; hence an open set disjoint from is disjoint from (A point lies in the closure of iff every basic neighbourhood of it meets ; the closure is the smallest closed superset and equals together with its derived set).
The well-ordering provides least elements, so "the -least with a property" is a definable description (The Axiom of Choice).
Proof
Fix , and . For and put .
, and for all : given , let be the -least index with and choose with ; every containing is then contained in , so .
Each is closed. Let and with . By [L1] there is ; then , and since every member of containing lies in , we get ; hence every member of containing lies in . Also , and for because with open and [L1]. So .
For each fixed the family is discrete. Let , let be -least with and choose with . If , pick with ; since lies in some , we have , so . Also , so if then contradicts ; hence and the open neighbourhood of meets at most one member.
For each , apply [F2] to the discrete family of closed sets, obtaining pairwise disjoint open sets , and put . Then each is open, contains , lies in , and the family is pairwise disjoint.
Since by step 2.1, the family covers , refines by step 3.1, and is a countable union of pairwise disjoint families of open sets. Hence the arbitrary open cover has such a refinement and is screenable.
Remarks
-
Bing's Theorem 9 is steps 1.1-4.1. The sets are Bing's , each is his discrete family of closed sets, and the well-order of the cover is exactly where choice enters; the proof of closedness follows his displayed argument, with the closure criterion used at the two places where an open set disjoint from a member must remain disjoint from its closure.
-
Collectionwise normality is used once, in step 3.1, and it is applied to a family of closed sets; the expansion is then intersected with the corresponding cover member so that the refinement property survives. A merely normal space would not suffice at this step.
Depends on
- Moore spaces and developments
- Normalized families and collectionwise normality
- The Axiom of Choice
- Discrete families and $\sigma$-locally-finite and $\sigma$-discrete bases
- Refinements, locally finite families, point-finite families, and star refinements
- 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
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
Used by
Dependency tree · two levels
19 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
- R. H. Bing, Metrization of topological spaces (standard reference, not scraped)