A total order or linear order on a set X is a binary relation that is reflexive, antisymmetric, transitive and total. This means that, if we denote the relation by ≤, it holds for all a, b and c in X:
- a ≤ a (reflexivity)
- if a ≤ b and b ≤ a then a = b (antisymmetry)
- if a ≤ b and b ≤ c then a ≤ c (transitivity)
- a ≤ b or b ≤ a (totalness)
A set with a total order on it is called a totally ordered set.
Because a binary relation that is reflexive, antisymmetric and transitive is called a partial order, a total order can also be defined as a partial order that is total. Alternatively, one may define a totally ordered set as a particular kind of lattice, namely one in which we have {a v b, a ^ b} = {a, b} for all a, b. We then write a ≤ b if and only if a = a ^ b.
If a and b are members of a totally ordered set, we may write a < b if a ≤ b and a ≠ b. The binary relation < is then transitive (a < b and b < c implies a < c) and trichotomous[?] (one and only one of a < b, b < a and a = b is true). In fact, we can define a total order to be a transitive trichotomous binary relation <, and then define a ≤ b to mean a < b or a = b, and this definition can be shown to be equivalent to the one given at the beginning of this article.
For any totally ordered set X we can define the open intervals (a, b) = {x : a < x and x < b}, (-∞, b) = {x : x < b}, (a, ∞) = {x : a < x} and (-∞, ∞) = X. The totally ordered set X turns into a topological space if we define a subset to be open if and only if it is a union of (possibly infinitely many) such open intervals. This is called the order topology on X; it is always a normal Hausdorff space. Unless otherwise stated, it is understood that this topology is being used on a totally ordered set.
Examples
The following is valid up to order isomorphism:
The set of natural numbers is the unique smallest totally ordered set with no upper bound. Similarly, the unique smallest totally ordered set with neither an upper nor a lower bound[?] is the integers. The unique smallest unbounded totally ordered set which also happens to be dense in the sense that (a, b) is non-empty for every a < b, is the rational numbers. The unique smallest unbounded connected totally ordered set is the real numbers.
Note that subsets are possible, which in a way are smaller, but that they are order isomorphic and therefore not counting as smaller. For example, instead of natural numbers and integers we can take the even ones, and instead of all rational numbers we can take those with a finite decimal expansion.
Any set of cardinal numbers or ordinal numbers is totally ordered (in fact, even well-ordered).
Common misspelling and questions (FAQ)
otal-order ttal-order toal-order totl-order tota-order totalorder total-rder total-oder total-orer total-ordr total-orde ottal-order ttoal-order toatl-order totla-order tota-lorder totalo-rder total-roder total-odrer total-oredr total-ordre total-orde ttotal-order tootal-order tottal-order totaal-order totall-order total--order total-oorder total-orrder total-ordder total-ordeer total-orderr 5otal-order rotal-order fotal-order 6otal-order gotal-order 6otal-order yotal-order gotal-order t9tal-order tital-order tktal-order t0tal-order tltal-order t0tal-order tptal-order tltal-order to5al-order toral-order tofal-order to6al-order togal-order to6al-order toyal-order togal-order totql-order totwl-order totzl-order totwl-order totsl-order totzl-order totao-order totak-order tota,-order totap-order tota.-order totap-order tota;-order tota.-order total0order totalporder total[order total-9rder total-irder total-krder total-0rder total-lrder total-0rder total-prder total-lrder total-o4der total-oeder total-odder total-o5der total-ofder total-o5der total-otder total-ofder total-oreer total-orser total-orxer total-orrer total-orcer total-orrer total-orfer total-orcer total-ord3r total-ordwr total-ordsr total-ord4r total-orddr total-ord4r total-ordrr total-orddr total-orde4 total-ordee total-orded total-orde5 total-ordef total-orde5 total-ordet total-ordef total-ordah yotal-order tyotal-order total-ordersdocument.--Bourrienne.]--But enough; you see I know all--farewell;" and brothers, distinguished in the war of the Revolution, and made brigadier- they refused to recognise the Bourbons, and were shot by sentence of wrote me a letter the evening preceding their execution, in which they extract from this letter: In our dungeon we hear our sentence of death being cried in the streets. calmness and courage as shall make our executioners blush. We are sixty During our lives we have shared in common, illness, grief, pleasure, on the same day we shall both depart from it. As to you, sir.... I suppress what relates to myself. The hour of the grand levee arrived just as the singular interview which phantasmagoria. Duroc was there. As soon as he saw me he came up, and evident, and that he was about to be put on his trial. I made some sufficient proofs of his guilt to justify his condemnation? "They should Hohenlinden." Duroc's answer satisfied me that he at least had no doubt been between two gendarmes he is lost, and is good for nothing more. He entirely contrary to facts, and to convince Duroc that Moreau would never proofs. Duroc persisted in his opinion. As if a political crime ever .