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
Shoreham, New York

... population is spread out with 27.6% under the age of 18, 6.2% from 18 to 24, 17.7% from 25 to 44, 36.0% from 45 to 64, and 12.5% who are 65 years of age or older. Th ...

 
 
 
This page was created in 28.3 ms