Elements of Set Theory: Ordering on Natural Numbers

Words
288
Reading
2 min
Listen
Play
8y

Ordering on Natural Numbers

Previously, we have defined natural numbers that was a side effect of our spurious definition, e.g. alt. Also, we have the following simple definition of order on natural numbers:

For natural numbers m and n, define m to be less than n iff alt

We then, introduce a special symbol "<" for this:

alt

Note, this may seem redundant in a way that we can just use alt. But we have to keep in mind that the symbol "<" has a dual role which is to denote both membership and ordering.

Now, in place of an alt symbol, we define

alt

Observe that

alt

a fact we will use in later calculations.

We are now entitled to state the following fact:

any natural number is just the set of all smaller natural numbers.

alt

which is true becausealt is a transitive set, and thus alt

Because each natural number is a transitive set, we have for m,n,p in alt

alt

That is, our ordering relation on alt is a transitive relation.

With this definition, it is hard to show that between two distinct natural numbers, one is larger than the other. For that, we need the following lemma,

Lemma 4L (a) For any natural numbers m and n,

alt

(b) No natural number is a member of itself

We next use the lemma to prove that for two distinct natural numbers, one is always a member of the other.

Trichotomy Law for set of natural numbers: For any natural numbers m and n, exactly one of the three conditions,

alt

holds.


Disclaimer: this is a summary of section 4.5 from the book "Elements of Set Theory" by Herbert B. Enderton, the content apart from rephrasing is identical, most of the equations are from the book and the same examples are treated. All of the equation images were screenshots from generated latex form using typora

  1. Elements of Set Theory by Herbert B. Enderton

Thank you for reading ...


Elements of Set Theory: Ordering on Natural Numbers | Ecency