KonkurStudy
همه کارت‌ها

Successor versus Limit Ordinals

Every nonzero ordinal is either a successor S(β)=β∪{β}=β+1S(\beta)=\beta\cup\{\beta\}=\beta+1 (it has a largest element / immediate predecessor) or a limit ordinal (nonzero, no maximum, equal to the supremum of everything below it); ω\omega is the first limit ordinal, while ω+1\omega+1 is a successor.

کارت مفهوم کنکور ارشد علوم کامپیوتر

اهمیت
۰/۵

Definition and intuition

An ordinal is a transitive set well-ordered by ∈\in, so the ordinals are built up one step at a time. Past 00, each ordinal falls into exactly one of two families, and telling them apart is the whole skill.

The successor of an ordinal β\beta glues β\beta's one new element on top:

S(β)=β+1=β∪{β}.S(\beta) = \beta + 1 = \beta \cup \{\beta\}.

So 1={0}1 = \{0\}, 2={0,1}2 = \{0,1\}, 3={0,1,2}3 = \{0,1,2\}, and in general n+1={0,1,…,n}n+1 = \{0,1,\ldots,n\}. A successor ordinal always has a largest element (an immediate predecessor): the element you just adjoined.

A limit ordinal λ\lambda is a nonzero ordinal that is not a successor — it has no maximum and no immediate predecessor. Instead it is the supremum (least upper bound) of all the ordinals beneath it:

λ=sup⁡{α:α<λ}=⋃α<λα,λ≠0,  λ≠β+1 for any β.\lambda = \sup\{\alpha : \alpha < \lambda\} = \bigcup_{\alpha < \lambda} \alpha, \qquad \lambda \neq 0,\ \ \lambda \neq \beta+1 \text{ for any } \beta.

The archetype is ω={0,1,2,3,…}\omega = \{0,1,2,3,\ldots\}, the set of all natural numbers: it is reached only "in the limit" — no single natural number is its predecessor.

The trichotomy

Every ordinal is exactly one of three kinds:

Kind Form Has a maximum? Examples
Zero 0=∅0 = \varnothing — 00
Successor β+1=β∪{β}\beta + 1 = \beta\cup\{\beta\} yes (β\beta) 1,2,…,ω+1,ω+2,ω⋅2+11,2,\ldots,\omega+1,\omega+2,\omega\cdot2+1
Limit sup⁡α<λα\sup_{\alpha<\lambda}\alpha, λ≠0\lambda\neq0 no ω, ω⋅2, ω2, ωω\omega,\ \omega\cdot 2,\ \omega^{2},\ \omega^{\omega}

For ordinals the order relations all coincide: β∈α  ⟺  β⊊α  ⟺  β<α\beta \in \alpha \iff \beta \subsetneq \alpha \iff \beta < \alpha. Adding a finite number kk to a limit ordinal λ\lambda marches you up the successor chain λ,λ+1,λ+2,…\lambda, \lambda+1, \lambda+2, \ldots, so λ+k\lambda + k for k≥1k \ge 1 is always a successor, never a limit.

How to classify an ordinal

  1. Is it 00? Then it is zero (and, depending on the textbook, sometimes lumped with the limits).
  2. Can you write it as β+1\beta + 1 for some β\beta — equivalently, does it have a single largest element? Then it is a successor.
  3. Otherwise, if it is nonzero and equals the sup of everything below it (no top element), it is a limit.

A fast test: find the immediate predecessor. If one exists, successor; if none does, limit.

Mini-example (konkur 1402, Q107)

Which of ω+1\omega+1 and ω+2\omega+2 is a limit ordinal? Write each as a successor:

ω+1=S(ω)=ω∪{ω},ω+2=S(ω+1).\omega + 1 = S(\omega) = \omega \cup \{\omega\}, \qquad \omega + 2 = S(\omega+1).

Each has an immediate predecessor (ω\omega and ω+1\omega+1 respectively), so both are successor ordinals and neither is a limit ordinal. (The first limit ordinal at or above ω\omega is ω\omega itself; the next is ω⋅2=ω+ω\omega\cdot 2 = \omega+\omega.) A companion question (Q105) checks the matching identity directly: α∪{α}\alpha\cup\{\alpha\} is always the successor ordinal α+1\alpha+1, hence always an ordinal — even when α\alpha is a limit.

Pitfall: ω+1\omega+1 is not a limit ordinal — it is the successor S(ω)S(\omega), with immediate predecessor ω\omega. The "ω\omega" buried inside it is a red herring: limitness is decided by the whole ordinal having no maximum, and ω+1\omega+1 has a maximum, namely ω\omega. Only ω\omega (and ω⋅2\omega\cdot2, ω2\omega^2, …\ldots) are limits; everything of the form λ+k\lambda+k with k≥1k\ge1 is a successor.

فرمول‌های کلیدی

Successor ordinal
S(β)=β+1=β∪{β}S(\beta) = \beta + 1 = \beta \cup \{\beta\}

The next ordinal after beta; it always has beta as its largest element / immediate predecessor.

Limit ordinal
λ=sup⁡{α:α<λ}=⋃α<λα,λ≠0, λ≠β+1\lambda = \sup\{\alpha : \alpha < \lambda\} = \bigcup_{\alpha < \lambda}\alpha, \quad \lambda \neq 0,\ \lambda \neq \beta+1

A nonzero ordinal with no maximum: it equals the supremum (union) of all smaller ordinals; omega is the first.

Order = membership = subset
β∈α  ⟺  β⊊α  ⟺  β<α\beta \in \alpha \iff \beta \subsetneq \alpha \iff \beta < \alpha

For ordinals the three relations coincide, which is why beta-plus-1 = beta union {beta} is itself an ordinal.

#ordinals#successor-ordinal#limit-ordinal#omega#ordinal-arithmetic#transfinite#supremum#set-theory#well-ordering

سوالات تمرینی