Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

Refuted, assuming countable choice: every Hausdorff space built from ordinal spaces is normal. The deleted Tychonoff plank ((ω1+1)×(ω+1))∖{(ω1,ω)} is Hausdorff and not normal

Statement refuted

False claim: every Hausdorff space obtained from ordinals with their order topologies (The order topology on an ordinal, with the half-open intervals (α,β] and the initial segments [0,β] as a basis) by forming a product (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) and passing to a subspace (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace) is normal (Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly).

The witness is the deleted Tychonoff plank. Write W:=ω1+1 and Z:=ω+1, which by the successor clause of ordinal addition (Ordinal addition α+β) are ω1+ and ω+; give each its order topology and W×Z the product topology, and put

T  :=  (W×Z)∖{(ω1,ω)}

with the subspace topology. Then T is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) and T is not normal: the two sets

A  :=  { (ω1,n):n∈ω },B  :=  { (ξ,ω):ξ∈ω1 }

are disjoint and closed in T and have no disjoint open neighbourhoods.

Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The cost is inherited from Assuming countable choice: every at most countable subset of ω1 is bounded below ω1, so no at most countable subset of ω1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable, which is the single step of the argument that spends it; everything else below is a theorem of ZF, the ordinals αn being defined as least elements rather than selected.

What is and is not claimed. T is Hausdorff and not normal, and that is all. Nothing here asserts that T is regular, nor that W×Z itself is normal, nor anything about which separation axioms are hereditary or productive; those questions need machinery this page does not have.

Facts & Assumptions

Given: W=ω1+1 and Z=ω+1 with their order topologies, the product W×Z, the subspace T=(W×Z)∖{(ω1,ω)}, and the sets A and B above.

[A1]

The basic open sets of an ordinal γ are [0,β] for β∈γ and (α,β] for α<β in γ, and they form a basis (The order topology on an ordinal, with the half-open intervals (α,β] and the initial segments [0,β] as a basis, Basis and subbasis for a topology, and the topology generated by a family of sets).

[A2]

For a binary product the basic product-open sets are exactly the boxes P×Q with P and Q open, and the boxes P0×Q0 with P0, Q0 basic in the factors also form a basis: given (x,y)∈P×Q, basic P0∋x inside P and Q0∋y inside Q give (x,y)∈P0×Q0⊆P×Q (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L2]

For ordinals exactly one of ξ<η, ξ=η, η<ξ holds, and every nonempty set of ordinals has a least element (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Ordinal (von Neumann)).

Counterexample

technique · contradiction
1.1

ω1 is open in W and ω is open in Z: for ξ<ω1 the basic set [0,ξ] lies inside ω1, and for n<ω the basic set [0,n] lies inside ω.

A1L2
1.2

A and B are subsets of T and are disjoint: every point of A has second coordinate in ω and every point of B has second coordinate ω, and ω∉ω.

L1L2
1.3

T is Hausdorff: let (ξ,η)≠(ξ′,η′) in T. If ξ≠ξ′, [L5] gives disjoint open P,P′ in W containing them, and (P×Z)∩T and (P′×Z)∩T are disjoint open sets of T containing the two points by [A2] and [A3]; if η≠η′ the same argument runs in the second factor.

A2A3L5L6
2.1

T∖A=(ω1×Z)∩T: a point (ξ,η)∈T with ξ=ω1 has η≠ω, hence η∈ω and (ξ,η)∈A; so the points of T outside A are exactly those with ξ∈ω1.

step 1.2L1L2
2.2

T∖B=(W×ω)∩T: a point (ξ,η)∈T with η=ω has ξ≠ω1, hence ξ∈ω1 and (ξ,η)∈B; so the points of T outside B are exactly those with η∈ω.

step 1.2L1L2
3.1

By steps 1.1, 2.1 and 2.2 and [A2] and [A3], the sets T∖A and T∖B are open in T, so A and B are closed in T.

step 1.1step 2.1step 2.2A2A3L6
4.1

Suppose U and V are disjoint open subsets of T with A⊆U and B⊆V.

step 3.1L6assume-contra
5.1

Fix n∈ω. Then (ω1,n)∈U, so by [A2] and [A3] there are basic P in W and Q in Z with (ω1,n)∈(P×Q)∩T⊆U.

step 4.1A2A3
6.1

Under step 5.1: P contains ω1, and ω1 is the largest element of W, so P is [0,ω1]=W or (α,ω1] with α∈ω1; in either case (α,ω1]⊆P for some α∈ω1, taking α:=0 in the first case.

step 5.1A1L1L2
7.1

Under step 5.1: (α,ω1]×{n}⊆(P×Q)∩T⊆U, since n∈Q and since every point of (α,ω1]×{n} has second coordinate n≠ω and so lies in T.

step 5.1step 6.1L1L2
8.1

For each n∈ω the set of α∈ω1 with (α,ω1]×{n}⊆U is nonempty by step 7.1, so it has a least element αn by [L2]; this defines αn from n and U alone and selects nothing.

step 7.1L2
9.1

The set S:={ αn:n∈ω } is an at most countable subset of ω1 by [L4], so [L3] gives α∈ω1 with αn≤α for every n∈ω.

step 8.1L3L4
10.1

Hence (α,ω1]⊆(αn,ω1] for every n, and therefore (α,ω1]×{n}⊆U for every n∈ω.

step 8.1step 9.1L2
10.2

α+∈ω1, since ω1 is a limit ordinal and α∈ω1; so (α+,ω)∈B⊆V.

step 4.1step 9.1L1L2
11.1

By [A2] and [A3] there are basic P′ in W and Q′ in Z with (α+,ω)∈(P′×Q′)∩T⊆V; and Q′ contains ω, the largest element of Z, so Q′ is [0,ω]=Z or (m,ω] with m∈ω, and in either case (m,ω]⊆Q′ for some m∈ω.

step 10.2A1A2A3L1L2
12.1

Put z:=(α+,m+). Then m+∈ω because ω is a limit ordinal, and m<m+≤ω, so m+∈(m,ω]⊆Q′; also α+∈P′; and z∈T because its first coordinate is α+≠ω1. Hence z∈(P′×Q′)∩T⊆V.

step 11.1L1L2
13.1

Also α<α+≤ω1, so α+∈(α,ω1], and m+∈ω; hence z∈(α,ω1]×{m+}⊆U by step 10.1.

step 10.1step 12.1L2
14.1

Steps 12.1 and 13.1 put z in U∩V, contradicting the disjointness assumed in step 4.1; so no such U and V exist, the disjoint closed sets A and B of step 3.1 cannot be separated, and T is not normal by [L6]. With step 1.3 the space T is Hausdorff and not normal, which refutes the claim.

step 3.1step 1.3step 4.1step 12.1step 13.1L6discharge-contradiction∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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