A total order on a set is a way of ordering its elements to say that some elements precede others, with the understanding that any two elements can be compared one way or the other.
Given a set , a total order on is a (binary) relation with the following properties: * reflexivity: for any element of , ; * transitivity: whenever , then ; * antisymmetry: whenever , then ; * totality: for any and in , or .
A toset is a set equipped with a total order.
The category of finite nonempty totally ordered sets and order-preserving maps is called , the simplex category.
The category of all finite totally ordered sets and order-preserving maps is called , the augmented simplex category.
A linear order is much like a total order, except that it is based on an irreflexive relation .
Using excluded middle, one can move between linear orders and total orders using negation; that is, the negation of a total order is a linear order and vice versa. Actually one usually swaps the order too, as follows: * iff ; * iff .
One often sees defined as but ; this is equivalent, but doesn't show the duality explicitly. Similarly, one often sees defined as or ; this is not even equivalent constructively, although it is classically.
In classical mathematics, the distinction between total orders and linear orders is merely a terminological technicality, which is not always observed; more precisely, there is a natural bijection between the set of total orders on a given set and the set of linear orders on , and one distinguishes them by their notation. In constructive mathematics, however, they are irreducibly different.
For more, including why linear orders are more often useful in constructive mathematics, see linear order.