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 is cofinal in , equivalently unbounded in , when
A subset that is not cofinal is bounded below : there is such that for every .
Remarks
-
At a limit ordinal, cofinal means the supremum is attained from below. If is a limit ordinal (Successor and limit ordinals) and is nonempty, then is cofinal in if and only if (claim (e) of Basic closure properties of ordinals). If , then every lies in some , so and is cofinal. Conversely, if is cofinal then , because each satisfies by transitivity; and for the ordinal again lies in (Successor and limit ordinals), so cofinality supplies with , whence and , giving . 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 and .
-
At and at successors the notion is degenerate. is cofinal in , vacuously, and it is the only subset of . 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 , 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 . The ordinal must always be named.
Depends on
Used by
- Assuming the Axiom of Choice: κ < κ^cf(κ) for every infinite cardinal κ, and cf(2^κ) > κ; in particular cf(2^ℵ₀) > ℵ₀ Corollary
- Refuted, assuming countable choice: every Hausdorff space built from ordinal spaces is normal. The deleted Tychonoff plank ((ω₁ + 1) × (ω + 1)) ∖ {(ω₁, ω)} is Hausdorff and not normal Counterexample
- Refuted: every limit ordinal has an at most countable cofinal subset — ω₁ has none, assuming countable choice Counterexample
- Cofinality cf(α), and regular and singular cardinals Definition
- An ordinal α with ℵ_α = α, built as the supremum of the tower ℵ₀, ℵ_ℵ₀, ℵ_ℵ_ℵ₀, …, and its cofinality is ℵ₀ Example
- Assuming countable choice, cf(ℵ_ω₁) = ℵ₁, so singular does not mean of countable cofinality Example
- Assuming the Axiom of Choice: ℶ₀ = ℵ₀, ℶ₁ = 2^ℵ₀ = | ℝ |, ℶ₂ = | P(ℝ) |, and ℶ_ω has cofinality ℵ₀ Example
- cf(ℵ_ω) = ℵ₀, computed from the cofinal map n ↦ ℵₙ Example
- The long ray is connected and locally connected, every proper initial segment is order-convex and connected, and, assuming countable choice, no at most countable subset is cofinal Example
- ω + 1 as a convergent sequence together with its limit, and, assuming countable choice, [0, ω₁), in which every sequence lies inside an at most countable initial segment Example
- For every ordinal α there is a least ordinal β admitting a map β → α with cofinal range, and that map may always be taken strictly increasing Lemma
- Assuming countable choice: every at most countable subset of ω₁ is bounded below ω₁, so no at most countable subset of ω₁ is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable Theorem
- cf(α) ≤ α; cf(0) = 0 and cf(α + 1) = 1; for a limit ordinal λ the value cf(λ) is an infinite cardinal with cf(cf(λ)) = cf(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf(λ), a value that is attained Theorem
- ℵ₀ is regular in ZF; assuming the Axiom of Choice every successor aleph ℵ_α+1 is regular; cf(ℵ_ω) = ℵ₀, so ℵ_ω is singular, and under choice it is the least singular infinite cardinal Theorem
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
- Cofinality (Wikipedia) (standard reference, not scraped)
- Ordinal number (Wikipedia) (standard reference, not scraped)