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.
A ZFC Dowker space of size aleph omega plus one
Statement
Assume AC. The Kojman–Shelah scale subspace is a closed, pointwise cofinal Dowker subspace of , and . It is Hausdorff and collectionwise normal. Pointwise cofinal means that every is strictly below some point of at every coordinate.
Facts & Assumptions
Given: The scale subspace and AC.
is closed in (The scale subspace is closed).
and for every strict-product bound there is with pointwise (Cofinality and size of the scale subspace).
is Hausdorff and separates every indexed discrete family of closed sets by disjoint open neighborhoods (Rudin spaces are collectionwise normal).
The initial-top slices in decrease to empty and are closed. Every open expansion sequence contains in its intersection the entire -tail above some (Rudin shrinking obstruction).
In a normal countably paracompact space every decreasing closed sequence with empty intersection has open expansions with empty intersection (Increasing-cover and decreasing-closed-set criteria, (iv)).
A Dowker space is normal, , and not countably paracompact (Countable paracompactness and Dowker spaces).
AC is assumed for the preceding construction theorems and any simultaneous choices of ambient open lifts (The Axiom of Choice).
Proof
Let be an indexed discrete family of closed subsets of . Since is closed in by F1, each is closed in : write it as for a closed in . At a point of , a relative open neighborhood meeting at most one indexed is the intersection with of an ambient open set. That ambient set meets precisely the same members, since every lies in . At a point outside , the open set meets none. Thus the family is indexed discrete in . F3 under A1 gives pairwise disjoint open neighborhoods there, and are pairwise disjoint open neighborhoods of in . Empty members may receive the empty set, and an empty index set gives the empty separating family.
Put . F4 implies these are closed in , decrease, and have empty intersection. Let be any open expansion sequence in , with . Choose open satisfying , using A1 if necessary, and set . This is open by F1. Every point of outside is in its second summand; every point of inside belongs to . Therefore , and . F4 supplies a bound whose entire -tail lies in every . F2 gives an actual with pointwise. Thus for every , proving .
Hausdorff separation in restricts to separation in by intersecting the two disjoint ambient neighborhoods with . Consequently is : for fixed , each other point has an open neighborhood avoiding , and their union is . For disjoint closed , their two-member family is discrete: the complement of works at points of , the complement of at points of , and the complement of their union elsewhere. Step 1.1 separates this family. Thus is normal as well as Hausdorff and collectionwise normal.
If were countably paracompact, its normality from step 2.1 and F5 would give open expansions of the sequence with empty intersection. Step 1.2 excludes every such sequence. Hence is not countably paracompact; together with step 2.1 and F6, this makes a Dowker space.
Closedness is F1, and F2 gives both strict pointwise cofinality and the cardinality . Steps 1.1 and 2.1 establish the stated separation properties, and step 3.1 establishes the Dowker conclusion. No inference that failure of countable paracompactness passes to arbitrary closed subspaces is needed: step 1.2 proves the required failure for this particular cofinal subspace. QED.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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.