Successor ordinal

Successor ordinal

When defining the ordinal numbers, an absolutely fundamental operation that we can perform on them is a successor operation "S" to get the next higher one. Using von Neumann's ordinal numbers (the standard ordinals used in set theory), we have, for any ordinal number,

:S(alpha) = alpha cup {alpha}.

Since the ordering on the ordinal numbers α < β if and only if alpha in eta, it is immediate that there is no ordinal number between α and "S"(α) and it is also clear that α < "S"(α). An ordinal number which is "S"(β) for some ordinal β, or equivalently, an ordinal with a maximum element, is called a successor ordinal. Ordinals which are neither zero nor successors are called limit ordinals. We can use this operation to define ordinal addition rigorously via transfinite recursion as follows:

:alpha + 0 = alpha!:alpha + S(eta) = S(alpha + eta)!

and for a limit ordinal λ

:alpha + lambda = igcup_{eta < lambda} (alpha + eta)

In particular, "S"(α) = α + 1. Multiplication and exponentiation are defined similarly.

The successor points and zero are the isolated points of the class of ordinal numbers, with respect to the order topology.

ee also

*ordinal arithmetic
*limit ordinal
*successor cardinal


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… …   Wikipedia

  • Successor cardinal — In the theory of cardinal numbers, we can define a successor operation similar to that in the ordinal numbers. This coincides with the ordinal successor operation for finite cardinals, but in the infinite case they diverge because every infinite… …   Wikipedia

  • Ordinal arithmetic — In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an… …   Wikipedia

  • Successor — A successor can refer to* Someone who, or something which succeeds or comes after (see success and succession).In mathematics: * A successor cardinal. * A successor ordinal. * A successor function. * A successor vertex.In music: * Successor , an… …   Wikipedia

  • Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger …   Wikipedia

  • Ordinal notation — In mathematical logic and set theory, an ordinal notation is a finite sequence of symbols from a finite alphabet which names an ordinal number according to some scheme which gives meaning to the language. There are many such schemes of ordinal… …   Wikipedia

  • Limit ordinal — A limit ordinal is an ordinal number which is neither zero nor a successor ordinal. Various equivalent ways to express this are: *It cannot be reached via the ordinal successor operation S ; in precise terms, we say lambda; is a limit ordinal if… …   Wikipedia

  • Monarchical ordinal — Ordinal numbers or regnal numbers are used to distinguish among persons with the same name who held the same office. Most importantly, they are used to distinguish monarchs. An ordinal is the number placed after a monarch s regnal name to… …   Wikipedia

  • Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… …   Wikipedia

  • Recursive ordinal — In mathematics, specifically set theory, an ordinal α is said to be recursive if there is a recursive binary relation R that well orders a subset of the natural numbers and the order type of that ordering is α. It is trivial to check that ω is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”