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 closed subspace of a paracompact space is paracompact
Statement
Every closed subspace of a paracompact topological space is paracompact.
Facts & Assumptions
Given: A paracompact space , a closed subset , and an open cover of the subspace .
An open subset of has the form for an open , and is open (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).
Every open cover of has a locally finite open refining cover (Paracompactness: every open cover has a locally finite open refinement, with no separation axiom built into the word).
Proof
For each member of , take all ambient open whose trace is that member; together with , these ambient open sets form an open cover of .
By [F2], fix a locally finite open cover refining .
The nonempty traces for cover , are open in , and refine : a meeting cannot be contained in , so its containing member of is an ambient representative of a member of .
These traces are locally finite in , because the trace on of a neighbourhood in meeting only finitely many meets only the corresponding finitely many traces.
The family in step 2.1 is therefore the locally finite open refinement required for , so is paracompact.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 17 results over 11 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
- J. Robbin, Partitions of Unity (standard reference, not scraped)
- R. Gardner, Notes on Munkres Section 41: Paracompactness (East Tennessee State University) (standard reference, not scraped)