In mathematics, especially order theory, a strict weak ordering is a binary relation < on a set S that is a strict partial order (a transitive relation that is irreflexive, or equivalently, that is asymmetric) in which the relation "neither a < b nor b < a" is transitive.
The equivalence classes of this "incomparability relation" partition the elements of S, and are totally ordered by <. Conversely, any total order on a partition of S gives rise to a strict weak ordering in which x < y if and only if there exists sets A and B in the partition with x in A, y in B, and A < B in the total order.
As a non-example, consider the partial order in the set {a, b, c} defined by the relationship b < c. The pairs a,b and a,c are incomparable but b and c are related, so incomparability does not form an equivalence relation and this example is not a strict weak ordering.
Read more about Strict Weak Ordering: Properties, Total Preorders, Representing Weak Orderings By Functions, The Number of Total Preorders, Strict Total Order
Famous quotes containing the words strict, weak and/or ordering:
“History creates comprehensibility primarily by arranging facts meaningfully and only in a very limited sense by establishing strict causal connections.”
—Johan Huizinga (1872–1945)
“How weak and little is the light,
All the universe of sight,
Love and delight,
Before the might,
If you love it not, of night.”
—Edward Thomas (1878–1917)
“Seeing then that truth consisteth in the right ordering of names in our affirmations, a man that seeketh precise truth, had need to remember what every name he uses stands for; and to place it accordingly; or else he will find himself entangled in words, as a bird in lime-twigs; the more he struggles, the more belimed.”
—Thomas Hobbes (1579–1688)