Topics: Discrete Mathematics - Relation
(definition)
Let be a poset.
We say that is a total order relation if every pair is comparable. In such a case, we can describe as “totally ordered”.
Example
is totally ordered, since or
Search
Topics: Discrete Mathematics - Relation
(definition)
Let (A,⪯) be a poset.
We say that ⪯ is a total order relation if every pair is comparable. In such a case, we can describe (A,⪯) as “totally ordered”.
Example
(R,≤) is totally ordered, since x≤y or y≤x∀ x,y∈R