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.
FALSE: Every normal space is completely regular
Statement
FALSE. Every normal space is completely regular.
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 carries the hypothesis : normality alone, without , gives no separation property above itself.
Facts & Assumptions
Given: Sierpinski space , , with topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
The closed sets of are the complements of : , , ; so the closed sets are (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
is normal when disjoint closed subsets of admit disjoint open supersets (Normal spaces and spaces, with the source disagreement over whether normality includes stated explicitly).
is regular when a point and a closed set not containing it admit disjoint open neighbourhoods (Regular spaces and spaces, with the source disagreement over whether regularity includes stated explicitly).
Every completely regular space is regular (Every completely regular space is regular, and every Tychonoff space is , Completely regular spaces and Tychonoff () spaces).
Refutation
Let with and ; by [L1] its closed sets are .
is normal: let be disjoint closed subsets of . The nonempty closed sets are and , and , so any two nonempty closed sets of meet at ; hence disjointness of forces or . If , take and ; if , take and . Either way are open and .
is not regular: , since , and is closed by step 1.1. Every open set containing equals , since among only contains ; so any open has , and any open then satisfies , since . So no disjoint open , exist, and is not regular.
By [L4], complete regularity implies regularity; by step 2.2, is not regular, so is not completely regular. With step 2.1, is a normal space that is not completely regular, refuting the statement.
Remarks
-
The failure is exactly the missing . Sierpinski space is (the open set distinguishes from ) but not : the singleton is not among the closed sets of step 1.1, so has no closed singleton. Consequently Under dependent choice a normal space is completely regular, so , and together with the implications already proved this is the whole classical chain never claims anything about a normal space that is not .
-
Every disjoint closed pair in is separated for a trivial reason. Step 2.1 never invokes Urysohn's lemma or any function; normality here has nothing to do with continuous functions, because the only disjoint pairs available involve .
Depends on
- 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
- 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
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 104 results over 27 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)
- Normal space (Wikipedia) (standard reference, not scraped)