Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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 is countably compact and sequentially compact while ω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γ of On an ordinal with its order topology the sets [0,β] and (α,β] 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 δ the successor ordinal δ+ 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ω)): the first uncountable ordinal ω1 (The first uncountable ordinal ω1:=ℵ(ω)) is sequentially compact and countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets), and it is not compact; while ω1+1 is compact (Ordinal addition α+β).

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 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 supplies the boundedness of at most countable subsets of ω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ω)).

[L2]

On an ordinal γ the sets [0,β] and (α,β] with α,β∈γ are clopen and form a basis Bγ, so every open U and every η∈U admit a member of Bγ between them (On an ordinal with its order topology the sets [0,β] and (α,β] 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; β<α holds exactly when β+≤α; a nonempty set of ordinals has a least element, and a nonempty set listed as {β0,…,βn} has a greatest, by induction on n using trichotomy; and β∈λ with λ a limit ordinal gives β+∈λ (Ordinal (von Neumann), Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Successor and limit ordinals).

[L4]

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

[L8]

An infinite subset P⊆N carries a strictly increasing enumeration i↦mi of N onto P, built by taking least elements and using no choice principle; and a strictly increasing index map satisfies mi≥i (Every subset of an at most countable set is at most countable, A strictly increasing index map satisfies nk≥k).

[L9]

A sequence in a space is a function on N, and yk→p means that every open set containing p contains yk 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=α+ for every ordinal α (Ordinal addition α+β).

Proof

technique · direct
1.1

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

L1L3construct
1.2

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

L2L3
1.3

For claim 3 assume ACω and let (yk) be a sequence in ω1; its range is at most countable by [L7], so [L6] gives σ:=sup⁡{ yk:k∈N }∈ω1, and the set { k∈N:yk≤σ } is all of N and in particular infinite.

A1L6L7
2.1

Let η∈γ and suppose [0,ζ] is covered by finitely many members of U for every ζ<η. Some U∈U contains η, and [L2] gives B∈Bγ with η∈B⊆U. If B=[0,β] then η≤β and [0,η]⊆[0,β]⊆U, so {U} covers [0,η]. If B=(α,β] then α<η≤β, and [0,η]⊆[0,α]∪(α,η]⊆[0,α]∪U by [L3], so a finite cover of [0,α] with U adjoined covers [0,η]. Either way η∈S.

L2L3step 1.1
2.2

A finite subfamily of the cover of step 1.2 is empty, and then covers only ∅≠λ, or is [0,β0],…,[0,βn] with union [0,β] for β the greatest of the βj, which exists by [L3]; and β+∈λ by [L3] while β+∉[0,β]. So no finite subfamily covers λ and λ is not compact, which is claim 2.

L1L3step 1.2
2.3

By [L5] and [L6] the set { ξ∈ω1:{k:yk≤ξ} is infinite } is a nonempty set of ordinals, σ belonging to it by step 1.3, so it has a least element τ by [L3]; then P:={ k∈N:yk≤τ } is infinite while { k:yk≤α } is finite for every α<τ.

L3L5step 1.3
3.1

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

L1L4step 1.1step 2.1
3.2

Let i↦mi be the strictly increasing enumeration of P given by [L8]; then (ymi) is a subsequence of (yk) by [L9], and every one of its terms satisfies ymi≤τ.

L8L9step 2.3
4.1

ymi→τ. Let U be open with τ∈U and take B∈Bω1 with τ∈B⊆U by [L2]. If B=[0,β] then τ≤β and every term satisfies ymi≤τ≤β, so all terms lie in B. If B=(α,β] then α<τ≤β, the set {k:yk≤α} is finite by step 2.3, so { i:ymi≤α } is finite, the map i↦mi being injective; hence α<ymi≤τ≤β for all large i and the terms lie in B from some index on. So ω1 is sequentially compact.

L2L9step 2.3step 3.2
5.1

By [L10] the space ω1 is therefore countably compact; it is not compact by step 2.2, being a limit ordinal by [L5]; and ω1+1=ω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 η uses the statement at α for a single α<η produced by the cover, not at the predecessor of η, and η may have no predecessor. What the induction of [L4] gives is exactly the right shape: the step assumes the statement below η and proves it at η, with no separate limit clause to write.

ω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, 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 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 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 is what claim 3 rests on, and everything else in the argument takes least elements.

Depends on

Used by

Dependency tree · two levels

87 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