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.
Normality need not survive product with the interval
Statement
False: Every normal space has normal product , with the ordinary product topology and usual real interval.
Facts & Assumptions
Given: We refute the assertion under AC.
For infinite , the Rudin space is , normal and not countably paracompact (Rudin ZFC Dowker space and its size).
For spaces, normality of the interval product implies normality and countable paracompactness of the factor (Dowker product characterization).
AC is assumed for both cited constructions (The Axiom of Choice).
Refutation
Set and take the specific witness . Explicitly its points are functions whose coordinate cofinalities are all uncountable and strictly bounded by one finite aleph, with the relative ordinal box topology. The set is infinite and avoids zero and one, so F1 and A1 apply and verify that satisfies the asserted normality and hypotheses while failing countable paracompactness.
If this were normal, F2 would imply that is countably paracompact, contradicting step 1.1. Thus the witness has a nonnormal interval product and refutes the universal assertion. The product in the conclusion is the ordinary product of the already defined space and the entire interval, including its endpoints. QED.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
2 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
- Hart, Set-Theoretic Methods in General Topology, Chapter 4 Theorem 3.4 p. 28 and Chapter 6 pp. 35–38 (standard reference, not scraped)