Encyclopedia > Order isomorphism

  Article Content

Order isomorphism

Given two partially ordered sets (S, <=) and (T, [=) an order isomorphism from (S, <=) to (T, [=) is an isomorphism from S to T that preserves the order, that is, it is a bijection h : S -> T such that for all u and v in S it holds that
h(u) [= h(v) if and only if u <= v.

If there is an order isomorphism between two partially ordered sets then these sets are called order isomorphic.

An order isomorphism from (S,<=) to itself is called an order automorphism

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article

... for any period of time without a legitimate basis of authority. The first to have the title of "Tyrant" was Pisistratus in 560 BC. In modern times Tyrant has come to ...

This page was created in 33 ms