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.
Countable paracompactness and Dowker spaces
Definition
A topological space is countably paracompact if every countable open cover of has a locally finite open refining cover : its members are open, their union is , each is contained in some member of , and every point has a neighborhood meeting only finitely many members of . The terminology is that of Refinements, locally finite families, point-finite families, and star refinements. Countable includes finite; the refinement is not required in this definition to be countable.
A Dowker space is a normal space that is not countably paracompact. Normality means separation of disjoint closed sets by disjoint open sets and does not include in this library; see Normal spaces and spaces, with the source disagreement over whether normality includes stated explicitly. Hart's Chapter 4 introduction instead names these spaces by failure of normality of their interval product; the product characterization below proves the equivalence under AC.
The empty space is countably paracompact: the empty family refines and covers it. A one-point space is countably paracompact: the singleton family consisting of the space refines every cover. More generally every finite open cover is itself locally finite. These conventions do not assert that every space with infinite countable covers is countably paracompact. No choice axiom is part of either definition.
Depends on
Used by
Dependency tree · two levels
8 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
- K. P. Hart, Set-Theoretic Topology, Chapter 4 introduction p. 25 and §3 Definition 3.2 p. 27 (standard reference, not scraped)