Ordinal number

related topics
{math, number, function}
{village, small, smallsup}
{game, team, player}
{style, bgcolor, rowspan}

In set theory, an ordinal number, or just ordinal, is the order type of a well-ordered set. They are usually identified with hereditarily transitive sets. Ordinals are an extension of the natural numbers different from integers and from cardinals. Like other kinds of numbers, ordinals can be added, multiplied, and exponentiated.

Ordinals were introduced by Georg Cantor in 1897 to accommodate infinite sequences and to classify sets with certain kinds of order structures on them.[1]

The finite ordinals (and the finite cardinals) are the natural numbers: 0, 1, 2, …, since any two total orderings of a finite set are order isomorphic. The least infinite ordinal is ω, which is identified with the cardinal number \aleph_0. However in the transfinite case, beyond ω, ordinals draw a finer distinction than cardinals on account of their order information. Whereas there is only one countably infinite cardinal, namely \aleph_0 itself, there are uncountably many countably infinite ordinals, namely

Here addition and multiplication are not commutative: in particular 1 + ω is ω rather than ω + 1 and likewise, 2·ω is ω rather than ω·2. The set of all countable ordinals constitutes the first uncountable ordinal ω1 which is identified with the cardinal \aleph_1 (next cardinal after \aleph_0). Well-ordered cardinals are identified with their initial ordinals, i.e. the smallest ordinal of that cardinality. The cardinality of an ordinal defines a many to one association from ordinals to cardinals.

In general, each ordinal α, is the order type of the set of ordinals strictly less than the ordinal, α itself. This property permits every ordinal to be represented as the set of all ordinals less than it. Ordinals may be categorized as: zero, successor ordinals, and limit ordinals (of various cofinalities). Given a class of ordinals, one can identify the α-th member of that class, i.e. one can index (count) them. Such a class is closed and unbounded if its indexing function is continuous and never stops. The Cantor normal form uniquely represents each ordinal as a finite sum of ordinal powers of ω. However, this cannot form the basis of a universal ordinal notation due to such self-referential representations as \epsilon_0 = \omega^{\epsilon_0}. Larger and larger ordinals can be defined, but they become more and more difficult to describe. Any ordinal number can be made into a topological space by endowing it with the order topology; this topology is discrete if and only if the ordinal is a countable cardinal, i.e. at most ω. A subset of ω + 1 is open in the order topology if and only if either it is cofinite or it does not contain ω as an element.

Contents

Full article ▸

related documents
Quaternion
Regular expression
Algorithm
Common Lisp
Eiffel (programming language)
Discrete Fourier transform
Surreal number
Prime number
Polynomial
Floating point
Singular value decomposition
Radix sort
Emmy Noether
Clifford algebra
Derivative
Complex number
Number
Natural deduction
Generic programming
Smalltalk
Mathematical logic
Group (mathematics)
Euclidean vector
History of mathematics
C++
Vienna Development Method
Distribution (mathematics)
Forth (programming language)
Mandelbrot set
Binary search algorithm