Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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\omega + 1 as a convergent sequence together with its limit, and, assuming countable choice, [0,ω1)[0, \omega_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 (α,β](\alpha, \beta] and the initial segments [0,β][0, \beta] as a basis), under which it is T3T_3 — that is T1T_1, Hausdorff and regular (Every ordinal with its order topology has a basis of clopen sets, and is T1T_1, Hausdorff and regular). Two ordinals are worked here.

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

  1. Every nωn \in \omega is isolated: {0}=[0,0]\{0\} = [0,0] and {m+}=(m,m+]\{m^{+}\} = (m, m^{+}] are basic open sets.
  2. The sequence xk:=kx_k := k (kNk \in \mathbb{N}) converges to ω\omega (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\omega+1.

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

The space [0,ω1)=ω1[0,\omega_1) = \omega_1. Let ω1\omega_1 be the first uncountable ordinal (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)), so that ω1\omega_1 is a limit ordinal, every ordinal below it is at most countable, and ω1\omega_1 itself is uncountable (ω1\omega_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)[0,\omega_1) is ω1\omega_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ω\mathrm{AC}_\omega)):

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

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

Facts & Assumptions

Given: Ordinals with their order topologies; the natural numbers ω\omega; the first uncountable ordinal ω1\omega_1; a sequence (xk)kN(x_k)_{k \in \mathbb{N}} in ω1\omega_1; and the Axiom of Countable Choice where stated.

[A1]

The basic open sets of an ordinal γ\gamma are [0,β][0,\beta] for βγ\beta \in \gamma and (α,β](\alpha,\beta] for α<β\alpha < \beta in γ\gamma; they form a basis (The order topology on an ordinal, with the half-open intervals (α,β](\alpha, \beta] and the initial segments [0,β][0, \beta] as a basis, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[A2]

α+1=α+\alpha + 1 = \alpha^{+}, by the clauses of ordinal addition at 00 and at a successor (Ordinal addition α+β\alpha + \beta).

[L1]

ω\omega is an ordinal and a limit ordinal, every element of ω\omega is 00 or a successor, and mnm \in n is m<nm < n for naturals (ω\omega is the least limit ordinal, Successor and limit ordinals, Basic closure properties of ordinals).

[L2]

xkpx_k \to p means: for every neighbourhood NN of pp there is KK with xkNx_k \in N for all kKk \ge K; an open set containing pp is such a neighbourhood (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L4]

Assuming ACω\mathrm{AC}_\omega, every at most countable subset of ω1\omega_1 is bounded below ω1\omega_1: there is αω1\alpha \in \omega_1 with ξα\xi \le \alpha for every ξ\xi in the subset (Assuming countable choice: every at most countable subset of ω1\omega_1 is bounded below ω1\omega_1, so no at most countable subset of ω1\omega_1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable, The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L6]

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

[L7]

A subset SS of a limit ordinal γ\gamma is cofinal in γ\gamma when for every ξγ\xi \in \gamma there is σS\sigma \in S with ξσ\xi \le \sigma (Cofinal subset of an ordinal).

[L8]

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

Verification

technique · direct
1.1

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

A2L1
1.2

Let NN be a neighbourhood of ω\omega in ω+1\omega+1; by [A1] and [L2] there is a basic set BB with ωBN\omega \in B \subseteq N, and BB is [0,β][0,\beta] with ωβ\omega \le \beta or (α,β](\alpha,\beta] with α<ωβ\alpha < \omega \le \beta. In either case (α,ω]B(\alpha, \omega] \subseteq B for some αω\alpha \in \omega, taking α:=0\alpha := 0 in the first case.

A1L2L6
1.3

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

L5
2.1

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

step 1.1A1L1
2.2

Under step 1.2: αω\alpha \in \omega, so for every k>αk > \alpha one has α<kω\alpha < k \le \omega and hence xk=k(α,ω]Nx_k = k \in (\alpha,\omega] \subseteq N; so xkωx_k \to \omega by [L2].

step 1.2L1L2L6
2.3

By [L4] there is αω1\alpha \in \omega_1 with ξα\xi \le \alpha for every ξR\xi \in R, hence xkαx_k \le \alpha for every kk.

step 1.3L4
3.1

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

step 2.1L1L2
3.2

By [L6] the set α+={ξ:ξα}\alpha^{+} = \{\, \xi : \xi \le \alpha \,\} contains every xkx_k, and α+ω1\alpha^{+} \in \omega_1 because ω1\omega_1 is a limit ordinal and αω1\alpha \in \omega_1; so α+\alpha^{+} is an ordinal below ω1\omega_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\omega_1, then by [L7] every ξω1\xi \in \omega_1 would satisfy ξxk\xi \le x_k for some kk; taking ξ:=α+\xi := \alpha^{+} of step 3.2 gives α+xkα\alpha^{+} \le x_k \le \alpha for some kk, contradicting α<α+\alpha < \alpha^{+} by [L6]. So claim 4 holds.

step 2.3step 3.2L6L7
5.1

Both spaces are T3T_3 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 124 results over 25 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