A poset is order-scattered if it does not embed the chain η of the rational numbers. We prove that there are eleven posets such that N (P ), the MacNeille completion of P , is order-scattered if and only if P embeds none of these posets. Moreover these posets are pairwise non-embeddable in each other. This result completes a previous characterisation due to Duffus, Pouzet, Rival [4]. The proof is based on the "bracket relation": η → [η] 2 3 , a famous result of F. Galvin.
Presentation of the main resultThe MacNeille completion of a poset P (cf. [7]) is a complete lattice containing P as a subposet and such that each element is a join and a meet of elements of P ; this lattice is unique, up to isomorphism, and denoted by N (P ). Let η be the order type of the chain made of the set Q of rational numbers with their natural order. A poset P is order-scattered, or in brief scattered, if it contains no chain of type η. The following characterization of posets P for which N (P ) is scattered was given in [4] (Theorem 4, p. 49).Theorem 1.1. Let P be an ordered set, then N (P ) contains a subset isomorphic to η if and only if P contains a subset isomorphic to η, D(ℵ 0 ), or some member of E(B(η)).In this statement, D(ℵ 0 ) denotes the cartesian product N × 2, where 2 := {0, 1}, ordered so that (x, i) < (y, j) if x = y and i < j. Also B(η) denotes the set Q × 2 ordered so that (x, i) < (y, j) if x < y and i < j; whereas E(B(η))denote the collection of posets made of Q × 2 and any order ε extending the order of B(η) with no additional comparabilities between Q × {0} and Q × {1}.The proof of Theorem 1.1 is based on the "arrow relation" η → (η, ℵ 0 ) 2 2 , obtained by Erdös and Rado [5], asserting that if the pairs of rational numbers are divided into two classes A and B then there is a subset X of the rationals such that either Presented by R. W. Quackenbush.