Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

Cofinal subset of an ordinal

Definition

Let α be an ordinal (Ordinal (von Neumann)). A subset C⊆α is cofinal in α, equivalently unbounded in α, when

for every ξ∈α there is η∈C with ξ≤η.

A subset that is not cofinal is bounded below α: there is ξ∈α such that η<ξ for every η∈C.

Remarks

  • At a limit ordinal, cofinal means the supremum is attained from below. If λ is a limit ordinal (Successor and limit ordinals) and C⊆λ is nonempty, then C is cofinal in λ if and only if sup⁡C=⋃C=λ (claim (e) of Basic closure properties of ordinals). If ⋃C=λ, then every ξ∈λ lies in some η∈C, so ξ<η and C is cofinal. Conversely, if C is cofinal then ⋃C⊆λ, because each η∈C satisfies η⊆λ by transitivity; and for ξ∈λ the ordinal ξ+ again lies in λ (Successor and limit ordinals), so cofinality supplies η∈C with ξ+≤η, whence ξ∈ξ+⊆η and ξ∈⋃C, giving λ⊆⋃C. This is the form in which the notion is used on this page, and it is exactly the hypothesis of the continuity clause of Monotonicity of ordinal + and ⋅: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β and 1⋅β=β.

  • At 0 and at successors the notion is degenerate. ∅ is cofinal in 0, vacuously, and it is the only subset of 0. If α=δ+ then δ is the greatest element of α (Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals), so a subset is cofinal in α if and only if it contains δ. The interesting case is the limit case, and that is where the notion is used.

  • What is not defined at this point in the reading order. The cofinality cf⁡(α), the least order type of a cofinal subset, and the vocabulary of regular and singular cardinals, are not introduced here; they are introduced later, on Cardinal Arithmetic, Cofinality and the Alephs. Nothing on this page needs them: the boundedness theorem below is stated as "no at most countable subset is cofinal", which is a statement about subsets and not about a cardinal invariant.

  • Cofinal is a property of the pair, not of the set. ω is cofinal in ω and bounded below ω+1. The ordinal must always be named.

Depends on

Used by

Dependency tree · two levels

10 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