Namespaces
Variants
Actions

Difference between revisions of "Anti-isomorphism of partially ordered sets"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Category:Order, lattices, ordered algebraic structures)
m (Implemented standard functional notation for easier reading.)
 
Line 1: Line 1:
A [[bijection|bijective]] [[antitone mapping]] of a [[partially ordered set]] $A$ into a partially ordered set $B$, for which the [[inverse mapping]] is also antitone, i.e. a [[Injection|one-to-one mapping]] $\phi : A \rightarrow B$ such that $a < b$ ($a,b \in A$) implies $a\phi > b\phi$ in $B$ (and similarly for the inverse).
+
A [[bijection|bijective]] [[antitone mapping]] of a [[partially ordered set]] $ A $ into a partially ordered set $ B $, for which the [[inverse mapping]] is also antitone, i.e., a [[Injection|one-to-one mapping]] $ \phi : A \rightarrow B $ such that $ a < b $ in $ A $ implies $ \phi(a) > \phi(b) $ in $ B $ (and similarly for the inverse).
  
 
{{TEX|done}}
 
{{TEX|done}}
  
 
[[Category:Order, lattices, ordered algebraic structures]]
 
[[Category:Order, lattices, ordered algebraic structures]]

Latest revision as of 02:54, 9 January 2017

A bijective antitone mapping of a partially ordered set $ A $ into a partially ordered set $ B $, for which the inverse mapping is also antitone, i.e., a one-to-one mapping $ \phi : A \rightarrow B $ such that $ a < b $ in $ A $ implies $ \phi(a) > \phi(b) $ in $ B $ (and similarly for the inverse).

How to Cite This Entry:
Anti-isomorphism of partially ordered sets. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Anti-isomorphism_of_partially_ordered_sets&oldid=40157
This article was adapted from an original article by O.A. Ivanova (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article