TOPICS
Search

Order Isomorphism


An order isomorphism is a bijection f:P->Q between partially ordered sets which preserves and reflects the order. Thus x<=y in P iff f(x)<=f(y) in Q. Two partially ordered sets are order isomorphic when an order isomorphism exists between them (Cintioli 2026).

The notion determines the equivalence of partially ordered sets used in poset reconstruction.


See also

Bijection, Order Isomorphic, Partially Ordered Set, Poset Power, Poset Reconstruction

Explore with Wolfram|Alpha

References

Cintioli, P. "Reconstruction of Finite Posets of Width Three." 8 Oct 2026. https://arxiv.org/abs/2610.12690.

Cite this as:

Weisstein, Eric W. "Order Isomorphism." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OrderIsomorphism.html

Subject classifications