# Order isomorphism

Order isomorphism

In the mathematical field of order theory an order isomorphism is a special kind of monotone function that constitutes a suitable notion of isomorphism for partially ordered sets (posets). Whenever two posets are order isomorphic, they can be considered to be "essentially the same" in the sense that one of the orders can be obtained from the other just by renaming of elements. Two strictly weaker notions that relate to order isomorphisms are order embeddings and Galois connections.

Formally, given two posets S=(S, ≤S) and T=(T, ≤T) an order isomorphism from (S, ≤S) to (T, ≤T) is a surjective function h : ST such that for all u and v in S,

h(u) ≤T h(v) if and only if uS v.

In this case, the posets S and T are said to be order isomorphic. Note that the above definition characterizes order isomorphisms as surjective order embeddings. It should also be remarked that order isomorphisms are necessarily injective. Hence, yet another characterization of order isomorphisms is possible: they are exactly those monotone bijections that have a monotone inverse.

An order isomorphism from (S, ≤) to itself is called an order automorphism.

## Examples

• Negation is an order isomorphism from (R,≤) to (R,≥), since -x ≥ -y if and only if xy.
• The function f(x) = x-1 is an order automorphism on (R,≤), since x-1 ≤ y-1 if and only if xy.
• A utility function is an order isomorphism from some consumption set into the real line.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Isomorphism — In abstract algebra, an isomorphism (Greek: ἴσος isos equal , and μορφή morphe shape ) is a bijective map f such that both f and its inverse f −1 are homomorphisms, i.e., structure preserving mappings.In the more general setting of category… …   Wikipedia

• Order-embedding — In mathematical order theory, an order embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another. Like Galois connections, order embeddings constitute a notion which is strictly… …   Wikipedia

• Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… …   Wikipedia

• List of order theory topics — Order theory is a branch of mathematics that studies various kinds of binary relations that capture the intuitive notion of ordering, providing a framework for saying when one thing is less than or precedes another. An alphabetical list of many… …   Wikipedia

• Total order — In set theory, a total order, linear order, simple order, or (non strict) ordering is a binary relation (here denoted by infix ≤) on some set X. The relation is transitive, antisymmetric, and total. A set paired with a total order is called a… …   Wikipedia

• Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be …   Wikipedia

• List of order topics — This is a list of order topics, by Wikipedia page.An alphabetical list of many notions of order theory can be found in the order theory glossary. See also inequality, extreme value, optimization (mathematics), domain theory.Basic… …   Wikipedia

• Duality (order theory) — In the mathematical area of order theory, every partially ordered set P gives rise to a dual (or opposite) partially ordered set which is often denoted by Pop or Pd. This dual order Pop is defined to be the set with the inverse order, i.e. x ≤ y… …   Wikipedia

• Group isomorphism — In abstract algebra, a group isomorphism is a function between two groups that sets up a one to one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two… …   Wikipedia

• Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… …   Wikipedia