algebra set-theory

Definition

Total Order

A total order is a partial order on a set that satisfies the totality (or connexity) axiom. This requires that every pair of elements in the set is comparable. A set equipped with a total order is called a linearly ordered set or a chain.

Comparability Constraint

The defining characteristic of a total order is that for any , the condition must hold. This eliminates the possibility of “incomparable” elements, which are permitted in general partial orders (such as the subset relation on a power set).

Linearity

Because every element is related to every other element in a specific direction, the structure of the relation is strictly 1-dimensional. In a Hasse diagram, this results in a single vertical path, preventing the branching structures typical of complex posets or lattices.