Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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 α\alpha be an ordinal (Ordinal (von Neumann)). A subset CαC \subseteq \alpha is cofinal in α\alpha, equivalently unbounded in α\alpha, when

for every ξα there is ηC with ξη.\text{for every } \xi \in \alpha \text{ there is } \eta \in C \text{ with } \xi \le \eta.

A subset that is not cofinal is bounded below α\alpha: there is ξα\xi \in \alpha such that η<ξ\eta < \xi for every ηC\eta \in C.

Remarks

  • At a limit ordinal, cofinal means the supremum is attained from below. If λ\lambda is a limit ordinal (Successor and limit ordinals) and CλC \subseteq \lambda is nonempty, then CC is cofinal in λ\lambda if and only if supC=C=λ\sup C = \bigcup C = \lambda (claim (e) of Basic closure properties of ordinals). If C=λ\bigcup C = \lambda, then every ξλ\xi \in \lambda lies in some ηC\eta \in C, so ξ<η\xi < \eta and CC is cofinal. Conversely, if CC is cofinal then Cλ\bigcup C \subseteq \lambda, because each ηC\eta \in C satisfies ηλ\eta \subseteq \lambda by transitivity; and for ξλ\xi \in \lambda the ordinal ξ+\xi^{+} again lies in λ\lambda (Successor and limit ordinals), so cofinality supplies ηC\eta \in C with ξ+η\xi^{+} \le \eta, whence ξξ+η\xi \in \xi^{+} \subseteq \eta and ξC\xi \in \bigcup C, giving λC\lambda \subseteq \bigcup 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 \cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1β=β1 \cdot \beta = \beta.

  • At 00 and at successors the notion is degenerate. \varnothing is cofinal in 00, vacuously, and it is the only subset of 00. If α=δ+\alpha = \delta^{+} then δ\delta is the greatest element of α\alpha (Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals), so a subset is cofinal in α\alpha if and only if it contains δ\delta. 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(α)\operatorname{cf}(\alpha), 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. ω\omega is cofinal in ω\omega and bounded below ω+1\omega + 1. The ordinal must always be named.

Depends on

Used by

Dependency tree · next 3 levels

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