A splitting property of maximal antichains (Q1906844)

A poset \(P\) is called dense, if every non-empty open interval contains at least two elements of \(P\). Let \(A\subseteq P\). The set of elements of \(D(A)\subseteq P\) which are less than an element of \(A\) in the partial order of \(P\) is called downset generated by \(A\). Similarly one defines the upset \(U(A)\). It is shown that in any dense poset every maximal antichain \(A\) may be partitioned into two parts \(A_1\) and \(A_2\) such that \(D(A_1)\cup U(A_2)= P\). It is also shown that to find similar partitions of maximal antichains in general posets is NP-hard.