Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

ω+1 as a convergent sequence together with its limit, and, assuming countable choice, [0,ω1), in which every sequence lies inside an at most countable initial segment

Example

Give every ordinal its order topology (The order topology on an ordinal, with the half-open intervals (α,β] and the initial segments [0,β] as a basis), under which it is T3 — that is T1, Hausdorff and regular (Every ordinal with its order topology has a basis of clopen sets, and is T1, Hausdorff and regular). Two ordinals are worked here.

The space ω+1. By the successor clause of ordinal addition (Ordinal addition α+β), ω+1=ω+=ω∪{ω}, so the space is the set of natural numbers together with one extra point on top (ω is the least limit ordinal). Then:

  1. Every n∈ω is isolated: {0}=[0,0] and {m+}=(m,m+] are basic open sets.
  2. The sequence xk:=k (k∈N) converges to ω (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure), and it converges to no other point of ω+1.

So ω+1 is, as a topological space, exactly a convergent sequence together with its limit, and ω is its unique non-isolated point.

The space [0,ω1)=ω1. Let ω1 be the first uncountable ordinal (The first uncountable ordinal ω1:=ℵ(ω)), so that ω1 is a limit ordinal, every ordinal below it is at most countable, and ω1 itself is uncountable (ω1 is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF). As a set, [0,ω1) is ω1, an ordinal being the set of ordinals below it (Ordinal (von Neumann)). Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)):

  1. Every sequence (xk) in ω1 has an at most countable range, so there is α<ω1 with xk≤α for all k; hence the whole sequence lies inside the initial segment [0,α]=α+, which is an ordinal below ω1 and is at most countable.
  2. Consequently no sequence in ω1 has a range cofinal in ω1 (Cofinal subset of an ordinal).

Clause 3 is the fact the deleted Tychonoff plank consumes, and it is the reason [0,ω1) behaves unlike any metrizable space: a sequence can never approach the "top" of ω1, because there is no top to approach along a sequence.

Facts & Assumptions

Given: Ordinals with their order topologies; the natural numbers ω; the first uncountable ordinal ω1; a sequence (xk)k∈N in ω1; and the Axiom of Countable Choice where stated.

[A2]

α+1=α+, by the clauses of ordinal addition at 0 and at a successor (Ordinal addition α+β).

[L1]

ω is an ordinal and a limit ordinal, every element of ω is 0 or a successor, and m∈n is m<n for naturals (ω is the least limit ordinal, Successor and limit ordinals, Basic closure properties of ordinals).

[L2]

xk→p means: for every neighbourhood N of p there is K with xk∈N for all k≥K; an open set containing p is such a neighbourhood (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L6]

For ordinals exactly one of ξ<η, ξ=η, η<ξ holds; α+ is an ordinal, and α+={ ξ:ξ≤α } (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Ordinal (von Neumann)).

[L7]

A subset S of a limit ordinal γ is cofinal in γ when for every ξ∈γ there is σ∈S with ξ≤σ (Cofinal subset of an ordinal).

[L8]

Every ordinal with its order topology is T1, Hausdorff and regular (Every ordinal with its order topology has a basis of clopen sets, and is T1, Hausdorff and regular).

Verification

technique · direct
1.1

ω+1=ω+=ω∪{ω} by [A2], so the points of the space are the natural numbers together with ω.

A2L1
1.2

Let N be a neighbourhood of ω in ω+1; by [A1] and [L2] there is a basic set B with ω∈B⊆N, and B is [0,β] with ω≤β or (α,β] with α<ω≤β. In either case (α,ω]⊆B for some α∈ω, taking α:=0 in the first case.

A1L2L6
1.3

Let (xk) be a sequence in ω1; its range R:={ xk:k∈N } is an at most countable subset of ω1 by [L5].

L5
2.1

Each n∈ω is 0 or a successor m+ by [L1]; in the first case {n}=[0,0] and in the second {n}=(m,m+], both basic open sets of ω+1 by [A1], since 0∈ω+1 and m<m+=n in ω+1. So every n∈ω is isolated, which is claim 1.

step 1.1A1L1
2.2

Under step 1.2: α∈ω, so for every k>α one has α<k≤ω and hence xk=k∈(α,ω]⊆N; so xk→ω by [L2].

step 1.2L1L2L6
2.3

By [L4] there is α∈ω1 with ξ≤α for every ξ∈R, hence xk≤α for every k.

step 1.3L4
3.1

The sequence converges to no n∈ω: by step 2.1 the set {n} is an open neighbourhood of n, and xk=k≠n for every k>n, so the sequence is not eventually in {n}.

step 2.1L1L2
3.2

By [L6] the set α+={ ξ:ξ≤α } contains every xk, and α+∈ω1 because ω1 is a limit ordinal and α∈ω1; so α+ is an ordinal below ω1 and is at most countable by [L3]. This is claim 3.

step 2.3L3L6
4.1

Steps 2.2 and 3.1 are claim 2.

step 2.2step 3.1
4.2

If some sequence had range cofinal in ω1, then by [L7] every ξ∈ω1 would satisfy ξ≤xk for some k; taking ξ:=α+ of step 3.2 gives α+≤xk≤α for some k, contradicting α<α+ by [L6]. So claim 4 holds.

step 2.3step 3.2L6L7
5.1

Both spaces are T3 by [L8], and steps 2.1, 4.1, 3.2 and 4.2 are claims 1 to 4.

step 2.1step 4.1step 3.2step 4.2L8∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

60 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