Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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 T1 hypothesis in the Urysohn corollary is not decoration

Example

Sierpinski space S={a,b}, a≠b, with TSier={∅,{b},S} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) is normal (Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly) but not completely regular (Completely regular spaces and Tychonoff (T312) spaces), by FALSE: Every normal space is completely regular. The refutation there in fact shows S is not even regular — the only open set containing a is S itself — and complete regularity then fails because it implies regularity (Every completely regular space is regular, and every Tychonoff space is T3). And S is not T1: the singleton {b} is not closed in S.

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 proves its arrow for a normal T1 space and not for a bare normal space: S is a normal space for which the corollary's conclusion — complete regularity — genuinely fails, and the one hypothesis it lacks is T1.

Facts & Assumptions

Given: Sierpinski space S as above.

[L1]

S is normal and not completely regular, with witness argument as in FALSE: Every normal space is completely regular.

[L2]

S is not T1 (T0 (Kolmogorov) and T1 (Frechet) spaces): the only closed sets of S are S,{a},∅, so the singleton {b} is not closed.

Verification

technique · direct
1.1

By [L1], S is normal and not completely regular.

L1
1.2

By [L2], {b} is not among the closed sets {S,{a},∅} of S, so S fails T1.

L2
2.1

By steps 1.1 and 1.2: S is a normal space that is not T1 and not completely regular, so it does not meet the hypothesis of 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 (normal and T1), and indeed its conclusion fails for S; dropping T1 from that corollary would make it false, with S as the witness.

step 1.1step 1.2∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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