A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Cofinality and Regular Cardinals

College Depth 84 in the knowledge graph ☐ I know this ☆ Set as goal
12topics build on this
428prerequisites beneath it
See this on the map →
Infinite Cardinal NumbersCantor's Theorem+3 more→→Independence Results in Set TheorySingular Cardinals
cofinality regular cardinals singular cardinals König's theorem

Core Idea

The cofinality of an ordinal α, written cf(α), is the smallest ordinal β such that α is the supremum of a β-indexed sequence of ordinals less than α. A cardinal κ is regular if cf(κ) = κ (it cannot be written as a union of fewer than κ sets each of size less than κ); otherwise it is singular. Every successor cardinal ℵ_{α+1} is regular; limit cardinals like ℵ_ω may be singular (cf(ℵ_ω) = ω). Königʼs theorem states that cf(2^κ) > κ for all cardinals κ, placing a fundamental constraint on the continuum function: for example, 2^ℵ₀ cannot equal ℵ_ω.

How It's Best Learned

Compute cofinalities directly: cf(ω) = ω (regular), cf(ω₁) = ω₁ (regular), cf(ℵ_ω) = ω (singular). Prove that every successor cardinal is regular. Apply König's theorem to rule out specific values for 2^ℵ₀: for instance, 2^ℵ₀ ≠ ℵ_ω because cf(ℵ_ω) = ω ≤ ℵ₀.

Common Misconceptions

Explainer

From your study of infinite cardinals, you know that the aleph sequence ℵ₀, ℵ₁, ℵ₂, ... extends through all ordinals: ℵ_α for every ordinal α. Successor cardinals like ℵ₁ = ℵ_{0+1} are defined as the next cardinal above the previous one. Limit cardinals like ℵ_ω are defined as suprema — ℵ_ω = sup{ℵ₀, ℵ₁, ℵ₂, ...}. Cofinality asks a finer question about such limit cardinals: how "approachable" is a cardinal from below?

The cofinality cf(κ) of a limit ordinal κ is the smallest cardinality of a cofinal subset — a set whose supremum is κ. Equivalently, it is the length of the shortest sequence that converges to κ. For ℵ_ω, the sequence ℵ₀, ℵ₁, ℵ₂, ... is cofinal and has length ω, and no shorter sequence suffices (ℵ_ω is not the supremum of any finite set). So cf(ℵ_ω) = ω. By contrast, cf(ℵ₁) = ℵ₁ itself — you cannot approach ℵ₁ from below via a countable sequence, because the supremum of countably many countable ordinals is countable, never ℵ₁.

A cardinal κ is regular if cf(κ) = κ — it cannot be written as the supremum of fewer than κ sets each smaller than κ. A cardinal is singular if cf(κ) < κ. Every successor cardinal is regular: ℵ_{α+1} cannot be the supremum of an ℵ_α-indexed sequence of cardinals each less than ℵ_{α+1}, because such a sequence would contain at most ℵ_α many cardinals each of size ≤ ℵ_α, and their union would have size ≤ ℵ_α · ℵ_α = ℵ_α < ℵ_{α+1}. Limit cardinals like ℵ_ω, ℵ_{ω₁}, etc., can be singular — ℵ_ω is the supremum of ω many smaller cardinals, so cf(ℵ_ω) = ω < ℵ_ω.

König's theorem states that cf(2^κ) > κ for every infinite cardinal κ. This is proved by a diagonal argument: a union of κ many sets each of size < 2^κ has size < 2^κ (by the cardinal arithmetic of cofinalities), so 2^κ cannot be the supremum of a κ-indexed sequence of smaller cardinals, meaning cf(2^κ) > κ. The striking application: 2^ℵ₀ cannot equal ℵ_ω, because cf(ℵ_ω) = ω = ℵ₀, which would require cf(2^ℵ₀) = ω ≤ ℵ₀ — contradicting König's theorem which requires cf(2^ℵ₀) > ℵ₀. Similarly, the continuum 2^ℵ₀ cannot be any ℵ_α with cf(ℵ_α) ≤ ℵ₀. This is one of the few unconditional constraints on the continuum function that holds regardless of additional set-theoretic axioms — no consistency proof or forcing argument can circumvent it.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → ZFC Axioms Overview → Axiom Schema of Separation → Axiom Schema of Replacement → Von Neumann Ordinals → Hereditarily Finite Sets → Recursive Definitions on Finite Sets → Well-Founded Relations and Transfinite Recursion → The Axiom of Choice and Equivalent Formulations → Axiom of Choice → Well-Ordering Theorem → Infinite Cardinal Numbers → Cantor's Theorem → Cofinality and Regular Cardinals

Longest path: 85 steps · 428 total prerequisite topics

Prerequisites (5)

Leads To (2)