Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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 T1T_1 space is completely regular, so T4T312T_4 \Rightarrow T_{3\frac{1}{2}}, and together with the implications already proved this is the whole classical chain carries the hypothesis T1T_1: normality alone, without T1T_1, gives no separation property above itself.

Facts & Assumptions

Given: Sierpinski space S={a,b}S = \{a,b\}, aba \ne b, with topology TSier={,{b},S}\mathcal{T}_{\mathrm{Sier}} = \{\varnothing, \{b\}, S\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

The closed sets of SS are the complements of TSier\mathcal{T}_{\mathrm{Sier}}: S=SS \setminus \varnothing = S, S{b}={a}S \setminus \{b\} = \{a\}, SS=S \setminus S = \varnothing; so the closed sets are {S,{a},}\{S, \{a\}, \varnothing\} (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).

[L2]
[L3]

SS is regular when a point and a closed set not containing it admit disjoint open neighbourhoods (Regular spaces and T3T_3 spaces, with the source disagreement over whether regularity includes T1T_1 stated explicitly).

Refutation

technique · constructive
1.1

Let S={a,b}S = \{a,b\} with aba \ne b and TSier={,{b},S}\mathcal{T}_{\mathrm{Sier}} = \{\varnothing,\{b\},S\}; by [L1] its closed sets are {S,{a},}\{S,\{a\},\varnothing\}.

givenL1construct
2.1

SS is normal: let A,BA, B be disjoint closed subsets of SS. The nonempty closed sets are {a}\{a\} and SS, and {a}S\{a\} \subseteq S, so any two nonempty closed sets of SS meet at aa; hence disjointness of A,BA,B forces A=A=\varnothing or B=B=\varnothing. If A=A=\varnothing, take U:=AU:=\varnothing \supseteq A and V:=SBV:=S \supseteq B; if B=B=\varnothing, take U:=SAU:=S \supseteq A and V:=BV:=\varnothing \supseteq B. Either way U,VU,V are open and UV=U \cap V = \varnothing.

step 1.1L1L2algebra
2.2

SS is not regular: b{a}b \notin \{a\}, since aba \ne b, and {a}\{a\} is closed by step 1.1. Every open set containing aa equals SS, since among ,{b},S\varnothing, \{b\}, S only SS contains aa; so any open V{a}V \supseteq \{a\} has V=SV=S, and any open UbU \ni b then satisfies UV=US=UU \cap V = U \cap S = U \ne \varnothing, since bUb \in U. So no disjoint open UbU \ni b, V{a}V \supseteq \{a\} exist, and SS is not regular.

step 1.1L1L3
3.1

By [L4], complete regularity implies regularity; by step 2.2, SS is not regular, so SS is not completely regular. With step 2.1, SS is a normal space that is not completely regular, refuting the statement.

step 2.1step 2.2L4discharge-construct

Remarks

Depends on

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