A poset is said to satisfy the finite antichain condition, or FAC for short, if it has no infinite antichain. Such posets exhibit rich and complex structure, and it was conjectured by Aharoni and Korman in 1992 that any FAC poset possesses a chain and a partition into antichains such that meets every antichain of the partition. While this conjecture is now known to be false, in this paper we prove that the conjecture does hold true for a broad class of posets. In particular, we prove that the Aharoni–Korman conjecture holds for countable posets containing no saturated chain such that either or its reverse is of the form , where each is infinite and co-wellfounded. In pursuit of this goal, we prove several structural results, the foremost of which demonstrates how a countable FAC poset may be broken up into a collection of scattered posets which reflect the structure of the poset as a whole.

生成讲解博客的中文版本

生成AI智能校验的中文版本