Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact

Statement

Every ordinal carries the order topology of the membership order on it (Ordinal (von Neumann), The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua), with the clopen basis Bγ\mathcal{B}_\gamma of On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff. Then:

  1. Successors are compact. For every ordinal δ\delta the successor ordinal δ+\delta^{+} is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  2. Limits are not. No limit ordinal (Successor and limit ordinals) is compact.
  3. Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)): the first uncountable ordinal ω1\omega_1 (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)) is sequentially compact and countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets), and it is not compact; while ω1+1\omega_1 + 1 is compact (Ordinal addition α+β\alpha + \beta).

Claims 1 and 2 are theorems of ZF. Claim 3 spends countable choice twice, both times through cited results that carry the hypothesis in their own statements: 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, which supplies the boundedness of at most countable subsets of ω1\omega_1, and claim 2 of Compact implies countably compact, Lindel"of and limit point compact; countably compact together with Lindel"of implies compact; and, at the cost of countable or dependent choice, sequentially compact implies countably compact, countably compact implies limit point compact, and the converse holds when every singleton is closed, which converts sequential compactness into countable compactness; the extraction of a subsequence below selects nothing, taking least elements throughout.

Facts & Assumptions

[A1]

The Axiom of Countable Choice, for claim 3 only (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L2]

On an ordinal γ\gamma the sets [0,β][0,\beta] and (α,β](\alpha,\beta] with α,βγ\alpha, \beta \in \gamma are clopen and form a basis Bγ\mathcal{B}_\gamma, so every open UU and every ηU\eta \in U admit a member of Bγ\mathcal{B}_\gamma between them (On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff, claim 1; Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

Ordinals are linearly ordered by membership; β<α\beta < \alpha holds exactly when β+α\beta^{+} \le \alpha; a nonempty set of ordinals has a least element, and a nonempty set listed as {β0,,βn}\{\beta_0, \dots, \beta_n\} has a greatest, by induction on nn using trichotomy; and βλ\beta \in \lambda with λ\lambda a limit ordinal gives β+λ\beta^{+} \in \lambda (Ordinal (von Neumann), Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Successor and limit ordinals).

[L4]

Transfinite induction: if SS is a subset of a well-ordered set WW containing every aa all of whose strict predecessors lie in SS, then S=WS = W (Transfinite induction).

[L6]

Assuming ACω\mathrm{AC}_\omega, every at most countable Aω1A \subseteq \omega_1 satisfies supA=Aω1\sup A = \bigcup A \in \omega_1 (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, claim (a)).

[L8]

An infinite subset PNP \subseteq \mathbb{N} carries a strictly increasing enumeration imii \mapsto m_i of N\mathbb{N} onto PP, built by taking least elements and using no choice principle; and a strictly increasing index map satisfies miim_i \ge i (Every subset of an at most countable set is at most countable, A strictly increasing index map satisfies nkkn_k \ge k).

[L9]

A sequence in a space is a function on N\mathbb{N}, and ykpy_k \to p means that every open set containing pp contains yky_k from some index on; a subsequence is given by a strictly increasing index map (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L11]

α+1=α+\alpha + 1 = \alpha^{+} for every ordinal α\alpha (Ordinal addition α+β\alpha + \beta).

Proof

technique · direct
1.1

For claim 1 let γ:=δ+\gamma := \delta^{+}, so that δ\delta is the greatest element of γ\gamma and [0,δ]=γ[0,\delta] = \gamma; let U\mathcal{U} be an open cover of γ\gamma and put S:={ηγ:finitely many members of U cover [0,η]}S := \{\, \eta \in \gamma : \text{finitely many members of } \mathcal{U} \text{ cover } [0,\eta] \,\}.

L1L3construct
1.2

For claim 2 let λ\lambda be a limit ordinal; the family {[0,β]:βλ}\{\, [0,\beta] : \beta \in \lambda \,\} consists of open sets by [L2] and covers λ\lambda, since ξ[0,ξ]\xi \in [0,\xi] for every ξλ\xi \in \lambda.

L2L3
1.3

For claim 3 assume ACω\mathrm{AC}_\omega and let (yk)(y_k) be a sequence in ω1\omega_1; its range is at most countable by [L7], so [L6] gives σ:=sup{yk:kN}ω1\sigma := \sup\{\, y_k : k \in \mathbb{N} \,\} \in \omega_1, and the set {kN:ykσ}\{\, k \in \mathbb{N} : y_k \le \sigma \,\} is all of N\mathbb{N} and in particular infinite.

A1L6L7
2.1

Let ηγ\eta \in \gamma and suppose [0,ζ][0,\zeta] is covered by finitely many members of U\mathcal{U} for every ζ<η\zeta < \eta. Some UUU \in \mathcal{U} contains η\eta, and [L2] gives BBγB \in \mathcal{B}_\gamma with ηBU\eta \in B \subseteq U. If B=[0,β]B = [0,\beta] then ηβ\eta \le \beta and [0,η][0,β]U[0,\eta] \subseteq [0,\beta] \subseteq U, so {U}\{U\} covers [0,η][0,\eta]. If B=(α,β]B = (\alpha,\beta] then α<ηβ\alpha < \eta \le \beta, and [0,η][0,α](α,η][0,α]U[0,\eta] \subseteq [0,\alpha] \cup (\alpha,\eta] \subseteq [0,\alpha] \cup U by [L3], so a finite cover of [0,α][0,\alpha] with UU adjoined covers [0,η][0,\eta]. Either way ηS\eta \in S.

L2L3step 1.1
2.2

A finite subfamily of the cover of step 1.2 is empty, and then covers only λ\varnothing \ne \lambda, or is [0,β0],,[0,βn][0,\beta_0], \dots, [0,\beta_n] with union [0,β][0,\beta] for β\beta the greatest of the βj\beta_j, which exists by [L3]; and β+λ\beta^{+} \in \lambda by [L3] while β+[0,β]\beta^{+} \notin [0,\beta]. So no finite subfamily covers λ\lambda and λ\lambda is not compact, which is claim 2.

L1L3step 1.2
2.3

By [L5] and [L6] the set {ξω1:{k:ykξ} is infinite}\{\, \xi \in \omega_1 : \{k : y_k \le \xi\} \text{ is infinite} \,\} is a nonempty set of ordinals, σ\sigma belonging to it by step 1.3, so it has a least element τ\tau by [L3]; then P:={kN:ykτ}P := \{\, k \in \mathbb{N} : y_k \le \tau \,\} is infinite while {k:ykα}\{\, k : y_k \le \alpha \,\} is finite for every α<τ\alpha < \tau.

L3L5step 1.3
3.1

By [L4] applied to the well-ordered γ\gamma, step 2.1 gives S=γS = \gamma; in particular δS\delta \in S, so finitely many members of U\mathcal{U} cover [0,δ]=γ[0,\delta] = \gamma. As U\mathcal{U} was arbitrary, γ=δ+\gamma = \delta^{+} is compact, which is claim 1.

L1L4step 1.1step 2.1
3.2

Let imii \mapsto m_i be the strictly increasing enumeration of PP given by [L8]; then (ymi)(y_{m_i}) is a subsequence of (yk)(y_k) by [L9], and every one of its terms satisfies ymiτy_{m_i} \le \tau.

L8L9step 2.3
4.1

ymiτy_{m_i} \to \tau. Let UU be open with τU\tau \in U and take BBω1B \in \mathcal{B}_{\omega_1} with τBU\tau \in B \subseteq U by [L2]. If B=[0,β]B = [0,\beta] then τβ\tau \le \beta and every term satisfies ymiτβy_{m_i} \le \tau \le \beta, so all terms lie in BB. If B=(α,β]B = (\alpha,\beta] then α<τβ\alpha < \tau \le \beta, the set {k:ykα}\{k : y_k \le \alpha\} is finite by step 2.3, so {i:ymiα}\{\, i : y_{m_i} \le \alpha \,\} is finite, the map imii \mapsto m_i being injective; hence α<ymiτβ\alpha < y_{m_i} \le \tau \le \beta for all large ii and the terms lie in BB from some index on. So ω1\omega_1 is sequentially compact.

L2L9step 2.3step 3.2
5.1

By [L10] the space ω1\omega_1 is therefore countably compact; it is not compact by step 2.2, being a limit ordinal by [L5]; and ω1+1=ω1+\omega_1 + 1 = \omega_1^{+} is compact by step 3.1 and [L11]. This is claim 3, and with claims 1 and 2 at steps 3.1 and 2.2 the theorem is proved.

L5L10L11step 2.2step 3.1step 4.1

Remarks

Why claim 1 is a transfinite induction and not an ordinary one. The statement being proved at η\eta uses the statement at α\alpha for a single α<η\alpha < \eta produced by the cover, not at the predecessor of η\eta, and η\eta may have no predecessor. What the induction of [L4] gives is exactly the right shape: the step assumes the statement below η\eta and proves it at η\eta, with no separate limit clause to write.

ω1\omega_1 separates sequential compactness from compactness. It is sequentially compact and countably compact and not compact, so neither of those two properties implies compactness; that is the content of FALSE: every sequentially compact space is compact and FALSE: every countably compact space is compact, both of which take their witness from here. The reason is visible in the proof: countably many terms cannot escape from ω1\omega_1, because a countable set of countable ordinals has a countable supremum, while the uncountable cover by the initial segments has no finite subfamily covering everything.

The hypothesis of countable choice is inherited, not added. It enters through two cited results whose own statements carry it — 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 at the boundedness step, and claim 2 of Compact implies countably compact, Lindel"of and limit point compact; countably compact together with Lindel"of implies compact; and, at the cost of countable or dependent choice, sequentially compact implies countably compact, countably compact implies limit point compact, and the converse holds when every singleton is closed at the passage from sequential to countable compactness; the boundedness of an at most countable subset of ω1\omega_1 is what claim 3 rests on, and everything else in the argument takes least elements.

Depends on

Used by

Dependency tree · next 3 levels

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