Imbedding posets in the integers (Q762507): Difference between revisions

The following theorems answer \textit{D. Daykin}'s problem 2.10 [see Graphs and Order. Proc. NATO Adv. Study Inst., Banff/Can. 1984, NATO ASI Ser., Ser. C 147, 522-590 (1985)]: A countable poset P can be imbedded into the chain Z of integers iff only finitely many elements lie between each pair of elements in P. Denote, for \(V\subseteq P\), \(\bar V=\{x\in V\); \(v\leq x\leq w\) for any v,w\(\in V\}\). If P can be imbedded into Z, then an imbedding f of a finite \(S\subseteq P\) into Z is extendable to an imbedding of P into Z iff every \(V\subseteq P\) satisfies \(card \bar V\leq card \overline{f(V)}.\)