Lably
Skip to content

Order type

  • 2 min read
  • 4 chapters

Related on Lably

Through Mathematics, Set theory and Bijection

In the special case when X is totally ordered, monotonicity of f already implies monotonicity of its inverse.

One and the same set may be equipped with different orders. Since order-equivalence is an equivalence relation, it partitions the class of all ordered sets into equivalence classes.

Notation

If a set X has order type denoted σ, the order type of the reversed order, the dual of X, is denoted σ∗.

The order type of a well-ordered set X is sometimes expressed as ord(X).

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Discrete mathematics