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.
Sierpinski space is normal and not completely regular, so the hypothesis in the Urysohn corollary is not decoration
Example
Sierpinski space , , with (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) is normal (Normal spaces and spaces, with the source disagreement over whether normality includes stated explicitly) but not completely regular (Completely regular spaces and Tychonoff () spaces), by FALSE: Every normal space is completely regular. The refutation there in fact shows is not even regular — the only open set containing is itself — and complete regularity then fails because it implies regularity (Every completely regular space is regular, and every Tychonoff space is ). And is not : the singleton is not closed in .
This is exactly why Under dependent choice a normal space is completely regular, so , and together with the implications already proved this is the whole classical chain proves its arrow for a normal space and not for a bare normal space: is a normal space for which the corollary's conclusion — complete regularity — genuinely fails, and the one hypothesis it lacks is .
Facts & Assumptions
Given: Sierpinski space as above.
is normal and not completely regular, with witness argument as in FALSE: Every normal space is completely regular.
is not ( (Kolmogorov) and (Frechet) spaces): the only closed sets of are , so the singleton is not closed.
Verification
By [L1], is normal and not completely regular.
By [L2], is not among the closed sets of , so fails .
By steps 1.1 and 1.2: is a normal space that is not and not completely regular, so it does not meet the hypothesis of Under dependent choice a normal space is completely regular, so , and together with the implications already proved this is the whole classical chain (normal and ), and indeed its conclusion fails for ; dropping from that corollary would make it false, with as the witness.
Remarks
- This is not a new computation. Every fact used above is proved in FALSE: Every normal space is completely regular; this item only reads that refutation as the positive example it also is, and connects it to the hypothesis of Under dependent choice a normal space is completely regular, so , and together with the implications already proved this is the whole classical chain by name.
Depends on
- FALSE: Every normal space is completely regular
- Under dependent choice a normal $T_1$ space is completely regular, so $T_4 \Rightarrow T_{3\frac{1}{2}}$, and together with the implications already proved this is the whole classical chain
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Normal spaces and $T_4$ spaces, with the source disagreement over whether normality includes $T_1$ stated explicitly
- Completely regular spaces and Tychonoff ($T_{3\frac{1}{2}}$) spaces
- Every completely regular space is regular, and every Tychonoff space is $T_3$
- Regular spaces and $T_3$ spaces, with the source disagreement over whether regularity includes $T_1$ stated explicitly
- $T_0$ (Kolmogorov) and $T_1$ (Frechet) spaces
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: 105 results over 28 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
- Sierpinski space (Wikipedia) (standard reference, not scraped)