How to split antichains in infinite posets (Q2460618)

An antichain in a poset \(\mathcal{P}=(P,<)\) is a set of pairwise incomparable elements. A maximal antichain \(A\) of poset \(P\) splits if and only if there is a set \(B\subset A\) such that for each \(p\in P\) either \(b\leq p\) for some \(b\in B\) or \(p\leq c\) for some \(c\in A\backslash B.\) The poset \(P\) is cut-free if and only if there are no \(x<y<z\) in \(P\) such that \([x,z]_{P}=[x,y]_{P}\cup [y,z]_{P}.\) By \textit{R. Ahlswede, P. L. Erdős} and \textit{N. Graham} [Combinatorica 15, 475--480 (1995; Zbl 0840.05097)] every maximal antichain in a finite cut-free poset splits. Although this statement fails for infinite posets, the authors prove here that if a maximal antichain in a cut-free poset resembles to a finite set then it splits. Also they show that a version of this theorem is just equivalent to Axiom of Choice. Also the authors investigate a possible strengthening of the statements that \(A\) does not split and how one could find a maximal strengthening.