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.
Increasing-cover and decreasing-closed-set criteria
Statement
Assume AC. For any space the following are equivalent, with indices in :
- (i) is countably paracompact.
- (ii) Every increasing open cover has closed sets such that .
- (iii) Every decreasing closed sequence with empty intersection has open sets such that .
If is normal, these are also equivalent to (iv): every such has open expansions with .
Facts & Assumptions
Given: A topological space , and AC. Normality is assumed only for (iv) implying (iii).
Countable paracompactness supplies a locally finite open refining cover, including its covering condition (Countable paracompactness and Dowker spaces).
In a normal space a closed inside an open admits open with (A space is normal if and only if every closed inside an open admits an open with ).
Every family of nonempty sets has a choice function (The Axiom of Choice).
Proof
Assume (i), and let be an increasing open cover. Take a locally finite open refining cover . For each let be the least with , and set . This is closed. If , some contains because covers; necessarily , so . If , choose an open neighborhood meeting only finitely many members of . At least one meets it because is covered. The maximum of their assigned indices exists, and the neighborhood is contained in . Thus the interiors cover and (ii) holds. All index assignments are least natural numbers, without choice.
Assume (ii) and let be any countable open cover; finite nonempty covers can be extended by empty entries. Put , obtain closed as in (ii), and replace by . Then is closed and increasing, is contained in , and its interiors cover. With put . For each , the least with gives , so these open sets cover. If a neighborhood lies in , it misses every with . The family covers , refines , and near has at most possibly meeting indexed members. It is the locally finite open refining cover required for (i). If the original cover is empty, is empty and its empty refining cover suffices.
Complementation proves (ii) implies (iii): given decreasing closed with empty intersection, use , and put . Then and . Conversely, given increasing covering , put , take the expansions of (iii), and set . These are closed subsets of , and the same identity says their interiors cover. The identity uses , which follows because a point has a neighborhood contained in exactly when it is outside that closure.
Condition (iii) implies (iv), since . Suppose now that is normal and (iv) holds. For a given decreasing closed sequence with empty intersection, take its open expansions with empty intersection. For each , the closed set lies in the open , so normal shrinking provides an open with . AC selects these witnesses for all simultaneously. Hence , proving (iii). Steps 1.1–1.3 prove the other equivalences; empty sets cause no exception to these inclusions. QED.
Depends on
- Countable paracompactness and Dowker spaces
- Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed
- A space is normal if and only if every closed $A$ inside an open $U$ admits an open $V$ with $A \subseteq V \subseteq \overline{V} \subseteq U$
- The Axiom of Choice
Used by
Dependency tree · two levels
10 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 §3, Theorem 3.3 and Exercises 5–6, p. 27 (standard reference, not scraped)