Power-ordered sets
For a partially ordered set \((Q,\leq)\) a certain ordering of the power set \(\sigma(Q)\) (the set of all subsets of \(Q\)) is introduced. Namely, if \(A\), \(B\) are subsets of \(Q\), then by definition \(A\leq B\) if and only if there exists a bijection \(\pi: A\to B\) such that \(a\leq\pi(a)\) for each \(a\in A\). If \(Q\) is a chain, then \(\sigma(Q)\) with that ordering is a distributive lattice. The horizontal sum \(Q_1+ Q_2\) of two disjoint ordered sets \((Q_1,\leq)\), \((Q_2,\leq)\) is the set \((Q_1\cup Q_2,\leq)\) such that \(a\leq b\) in \(Q_1\cup Q_2\) if and only if either \(a\leq b\) in \(Q_1\) or \(a\leq b\) in \(Q_2\). If \(Q= Q_1+ Q_2\), then the ordering of \(\sigma(Q)\) is isomorphic to the direct product of orderings on \(\sigma(Q_1)\) and on \(\sigma(Q_2)\). Moreover, ordered sets that are only slightly different from chains as well as complements of orders are studied.
This page was built for publication: Power-ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430909)
