The cofinality of an ordered set or an ordinal is the smallest order type of a cofinal (unbounded) subset; for an ordinal α, cf(α) is the least ordinal β for which there exists a strictly increasing sequence of type β with limit α.

Principle

A subset S of a poset P is cofinal if every element of P is ≤ some element of S; the cofinality is the minimal order type of such S. For cardinals κ, cf(κ) measures whether κ is regular (cf(κ)=κ) or singular (cf(κ)<κ), a key distinction in cardinal arithmetic and combinatorics.

Demonstration

cf(ω) = ω because the natural numbers form a cofinal sequence in ω; cf(ω+1) = 1 since the single top element is cofinal; cf(ω_1) = ω_1 because no countable subset of ω_1 is unbounded, so the smallest cofinal order type is ω_1 itself.

Misapplication

Mistaking cofinality for cardinality or failing to check order-type minimality leads to error — for example asserting cf(ω_1)=ω because both involve 'countable' notions conflates cofinal behaviour with cardinality of subsets.

Consequence

Cofinality governs limit behavior and informs structural results: regular cardinals resist being expressed as unions of fewer smaller sets of the same cardinality, stationary set and reflection principles depend on cofinalities, and combinatorial partition properties hinge on cf values.

Reversal

The dual notion is initiality or coinitiality (least order type of an initial unbounded below subset) or considering bounded initial segments rather than unbounded tails; reversing focus shifts attention from how a set approaches its supremum to how it is generated from below.

Boundary

Defined for posets and ordinals; statements about cf require ordered context and do not translate meaningfully to unordered collections. For ordinals cf is itself an ordinal; for general directed posets one uses minimal cofinal cardinal or order type, and some posets may lack small cofinal subsets.

Semantic Tension

Cofinality often competes with naive understandings of 'size' and 'limit': it is an order-theoretic invariant (order type of unbounded sequences) rather than a mere cardinal count, so statements about cofinality must not be collapsed into cardinality statements without care.

Synthesis

Cofinality captures how an ordered set is approached from below by minimal-type unbounded subsets: compute or compare cf by finding smallest order types of cofinal sequences, use cf to classify ordinals and cardinals into regular or singular and to govern combinatorial and limit phenomena.