Definition:Trivial Ordering

From ProofWiki
Jump to navigation Jump to search

Theorem

The trivial ordering is an ordering $\mathcal R$ defined on a set $S$ by:

$\forall a, b \in S: a \mathrel{\mathcal R} b \iff a = b$


That is, there is no ordering defined on any two distinct elements of the set $S$.


Also see


Sources