Axioms for the usual ordering on
There is a subset of such that for
- and ordering: If then
- and ordering: If then
- positive, negative or : Exactly one of and holds
Note that the elements of are the positive numbers
Inequalities with axioms of usual ordering on
Note that elements of are the non-negative integers
- or exactly when
- or exactly when
Properties of axioms of ordering
Take thhen
Reflexivity:
Antisymmetry: If and then
Transitivity: If and then
Works with so, If and thenTrichotomy: Exactly one of and holds
Proof
- We have (additive inverse)
- Suppose that and
If or then (properties of ) then that is what we needed
If not, then and
But (properties of )
So and , contradicting the positive, negative or ( axiom)- Note that
Using properties of
So if and then ( and ordering)
If and or then it is straightforward and the results for follows- Follows from positive, negative or 0 axiom ( axiom)
Results on inequalities
Take
- if
In particular, if and only if- If then
- If and then
- , with equality if and only if
- if and only if
- If and then
Note that 1, 2, 3 hold when using instead of
Proof
- By trichotomy then either or or
By Axioms for Arithmetic (To Avoid Total Collapse) then so eitherSuppose for a contradiction that then
Hence by and ordering
However (Properties of arithmetic (12))
So but this contradicts trichotomy hence
- Using properties of addition
- Assume that
- Assume that and
- Naturally by Properties of Arithmetic (10 & 13)
If then by trichotomy then either or
Either way ( and ordering)- Suppose for a contradiction that and , hence
ThenThis contradicts hence if
Similarly if and thenThis contradicts hence
- Suppose that and
Then by
SoHence