Page:Cantortransfinite.djvu/129

Mathematische Annalen we make use of the so-called "ordinal types" whose theory we have to set forth in the following paragraphs.

§7
The Ordinal Types of Simply Ordered Aggregates

We call an aggregate $M$ "simply ordered" if a definite "order of precedence" (Rangordnung) rules over its elements $m$, so that, of every two elements $m_{1}$ and $m_{2}$, one takes the "lower" and the other the "higher" rank, and so that, if of three elements $m_{1}$, $m_{2}$, and $m_{3}$, $m_{1}$, say, is of lower rank than $m_{2}$, and $m_{2}$ is of lower rank than $m_{3}$, then $m_{1}$ is of lower rank than $m_{3}$.

The relation of two elements $m_{1}$ and $m_{2}$, in which $m_{1}$ has the lower rank in the given order of precedence and $m_{2}$ the higher, is expressed by the formulæ:

Thus, for example, every aggregate $P$ of points defined on a straight line is a simply ordered aggregate if, of every two points $p_{1}$ and $p_{2}$ belonging to it, that one whose co-ordinate (an origin and a positive direction having been fixed upon) is the lesser is given the lower rank.

It is evident that one and the same aggregate can be "simply ordered" according to the most different laws. Thus, for example, with the aggregate $R$ of