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.
Dowker product characterization
Statement
Assume AC. For a space , the product is normal if and only if is normal and countably paracompact. The interval has its usual relative real topology and the product has the product topology.
Facts & Assumptions
Given: A space , , and AC. Closures of subsets of are relative to .
A normal space is countably paracompact exactly when every decreasing closed sequence with empty intersection has open expansions with empty intersection (Increasing-cover and decreasing-closed-set criteria).
Open rectangles form a basis for the binary product topology (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
Closed subspaces of normal spaces are normal (Every closed subspace of a normal space is normal).
Normality gives open with whenever is closed and contained in open (A space is normal if and only if every closed inside an open admits an open with ).
A locally finite union has closure equal to the union of the closures; taking closures preserves local finiteness (Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed).
Every open cover of a closed bounded real interval has a finite subcover (Heine-Borel by bisection: every closed bounded interval is compact, proved there by canonical bisection).
For every real there is a natural number greater than (Every complete ordered field is Archimedean, applied to ).
AC supplies choices from sets of nonempty witness sets (The Axiom of Choice).
Proof
The interval is compact also for relative open covers: write each relative open set as with real-open, and apply F6 to the resulting real-open cover. One can use all possible with a specified trace, so this needs no choice. A closed subset of is compact: adjoin to any relative open cover and then remove that member from a finite subcover. For any compact space and closed , its projection to is closed. Indeed, if is outside the projection, for each the product basis gives a rectangle about missing . Using AC to select these rectangles, finitely many cover , and their corresponding finite intersection of is an open neighborhood of missing the projection. If is empty, the projection is empty and the empty intersection is .
Suppose is normal. The slice is closed and its projection to is a homeomorphism: a relative basic rectangle on the slice is either empty or , with open in . By closed heredity is normal. Given closed with , put . This is closed: at a point outside , choose with . The neighborhood misses every strip with ; intersect it with the complements of the finitely many earlier closed strips. This remains an open neighborhood avoiding . Also misses the closed slice at zero. Normal shrinking gives an open containing that slice with .
In the setting of step 1.2, define . The fixed-height inclusion is continuous by the rectangle basis, so is open, and because . For each , a rectangle about inside contains for all sufficiently small . The inequality follows by induction, and F8 therefore gives . Consequently for all sufficiently large , whence then. Thus , and F1 applied to the normal space from step 1.2 gives countable paracompactness.
We next prepare the converse. Dyadic intervals form a countable real basis, directly from F8. Given and , choose with , using and F8. There is an integer with : F8 gives integer bounds on in both directions, and the finite set of integers between those bounds and at most has a greatest element. Then lies in , whose closed endpoints are within of . All dyadic intervals with endpoints and , where are integers, form a countable family: enumerate triples by increasing , each level finite. Finite subsets of this enumerated family are countable by encoding the finite index set as . Enumerate as all finite unions of their traces on , including and . If disjoint closed sets are given, each has a relative interval neighborhood whose closure misses : choose with , and use the dyadic interval just constructed, whose closure lies inside that neighborhood. Compactness of from step 1.1 gives finitely many such intervals covering it. Their union is some with and . If is empty use ; if is empty one may use .
Suppose now that is normal and countably paracompact, and let be disjoint closed subsets of . Their fibers are closed in because fixed-coordinate inclusions are continuous by F2. Put . The complement of is the union of the projections of and . Both projections are closed by step 1.1, since their compact factors are closed in . Hence is open; the fiber separation in step 2.2 shows these sets cover . Take a locally finite open refining cover and assign each its least index with . Set . These sets form a countable open cover and . Near a point only finitely many meet a fixed neighborhood, so only their finitely many assigned can meet it. Thus is locally finite even as an indexed family.
Shrink this locally finite cover as follows. After for have been defined, put . Inductively the earlier together with for cover , initially because covers, so the closed set lies in . Choose open with by F4. This replacement preserves that covering invariant. AC fixes a choice function on all nonempty sets of open shrinking witnesses in , so ordinary recursion makes the choices simultaneously. If a point missed every , the finite nonempty set would have a largest index ; that point would lie in , a contradiction. Thus covers. Because , this family and, by F5, its closures are locally finite.
Put . It is open by the rectangle basis. If , choose with ; then and , so . The rectangles form a locally finite family because a neighborhood in meeting only finitely many gives with the same property. Also : every basic rectangle about a pair of closure points meets the product, whereas outside either closure a rectangle misses it. By F5, . If belongs to one of these products, then and , so . Hence and are disjoint open neighborhoods of and , proving normality. If is empty, both sides of the asserted equivalence hold by the empty covers and empty separation; the constructions also allow empty fibers and shrinking sets. Together with step 2.1 this proves both directions. QED.
Depends on
- Increasing-cover and decreasing-closed-set criteria
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- Every closed subspace of a normal space is normal
- The Axiom of Choice
- 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$
- Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed
- Heine-Borel by bisection: every closed bounded interval $[a,b]$ is compact
- Every complete ordered field is Archimedean
Used by
Dependency tree · two levels
37 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, Exercises 3–4 p. 27 and Theorem 3.4 with Exercises 7–8 p. 28 (standard reference, not scraped)