English

Algebraic duality for partially ordered sets

Category Theory 2007-05-23 v1

Abstract

For an arbitrary partially ordered set PP its {\em dual} PP^* is built as the collection of all monotone mappings P\2P\to\2 where \2={0,1}\2=\{0,1\} with 0<10<1. The set of mappings PP^* is proved to be a complete lattice with respect to the pointwise partial order. The {\em second dual} PP^{**} is built as the collection of all morphisms of complete lattices P\2P^*\to\2 preserving universal bounds. Then it is proved that the partially ordered sets PP and PP^{**} are isomorphic.

Keywords

Cite

@article{arxiv.math/0002025,
  title  = {Algebraic duality for partially ordered sets},
  author = {Roman R. Zapatrin},
  journal= {arXiv preprint arXiv:math/0002025},
  year   = {2007}
}

Comments

latex209, 6 pages