Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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 T1 space is completely regular, so T4⇒T312, and together with the implications already proved this is the whole classical chain carries the hypothesis T1: normality alone, without T1, gives no separation property above itself.

Facts & Assumptions

Given: Sierpinski space S={a,b}, a≠b, with topology TSier={∅,{b},S} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

The closed sets of S are the complements of TSier: S∖∅=S, S∖{b}={a}, S∖S=∅; so the closed sets are {S,{a},∅} (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]

S is normal when disjoint closed subsets of S admit disjoint open supersets (Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly).

[L3]

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

Refutation

technique · constructive
1.1

Let S={a,b} with a≠b and TSier={∅,{b},S}; by [L1] its closed sets are {S,{a},∅}.

givenL1construct
2.1

S is normal: let A,B be disjoint closed subsets of S. The nonempty closed sets are {a} and S, and {a}⊆S, so any two nonempty closed sets of S meet at a; hence disjointness of A,B forces A=∅ or B=∅. If A=∅, take U:=∅⊇A and V:=S⊇B; if B=∅, take U:=S⊇A and V:=∅⊇B. Either way U,V are open and U∩V=∅.

step 1.1L1L2algebra
2.2

S is not regular: b∉{a}, since a≠b, and {a} is closed by step 1.1. Every open set containing a equals S, since among ∅,{b},S only S contains a; so any open V⊇{a} has V=S, and any open U∋b then satisfies U∩V=U∩S=U≠∅, since b∈U. So no disjoint open U∋b, V⊇{a} exist, and S is not regular.

step 1.1L1L3
3.1

By [L4], complete regularity implies regularity; by step 2.2, S is not regular, so S is not completely regular. With step 2.1, S 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 · two levels

33 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