TOPICS
Search

Strict Order


A relation < is a strict order on a set S if it is

1. Irreflexive: a<a does not hold for any a in S.

2. Asymmetric: if a<b, then b<a does not hold.

3. Transitive: a<b and b<c implies a<c.

Note that transitivity and irreflexivity combined imply that if a<b holds, then b<a does not.

A strict order is total if, for any a,b in S, either a<b, b<a, or a=b.

Every partial order <= induces a strict order

 a<b:a<=b ^ a!=b.

Similarly, every strict order < induces a partial order

 a<=b:a<b v a=b.

See also

Partial Order, Total Order

This entry contributed by Alex Sakharov (author's link)

Explore with Wolfram|Alpha

Cite this as:

Sakharov, Alex. "Strict Order." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/StrictOrder.html

Subject classifications