Order type
Isomorphism type of ordered sets / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Order type?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
Not to be confused with ordered types.
In mathematics, especially in set theory, two ordered sets X and Y are said to have the same order type if they are order isomorphic, that is, if there exists a bijection (each element pairs with exactly one in the other set) such that both f and its inverse are monotonic (preserving orders of elements).
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (February 2023) |
This article relies largely or entirely on a single source. (March 2024) |
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.