1.II.16G

Set Theory and Logic
Part II, 2007

By a directed set in a poset (P,)(P, \leqslant), we mean a nonempty subset DD such that any pair {x,y}\{x, y\} of elements of DD has an upper bound in DD. We say (P,)(P, \leqslant) is directed-complete if each directed subset DPD \subseteq P has a least upper bound in PP. Show that a poset is complete if and only if it is directed-complete and has joins for all its finite subsets. Show also that, for any two sets AA and BB, the set [A>B][A>B] of partial functions from AA to BB, ordered by extension, is directed-complete.

Let (P,)(P, \leqslant) be a directed-complete poset, and f:PPf: P \rightarrow P an order-preserving map which is inflationary, i.e. satisfies xf(x)x \leqslant f(x) for all xPx \in P. We define a subset CPC \subseteq P to be closed if it satisfies (xC)(f(x)C)(x \in C) \rightarrow(f(x) \in C), and is also closed under joins of directed sets (i.e., DCD \subseteq C and DD directed imply DC\bigvee D \in C ). We write xyx \ll y to mean that every closed set containing xx also contains yy. Show that \ll is a partial order on PP, and that xyx \ll y implies xyx \leqslant y. Now consider the set HH of all functions h:PPh: P \rightarrow P which are order-preserving and satisfy xh(x)x \ll h(x) for all xx. Show that HH is closed under composition of functions, and deduce that, for each xPx \in P, the set Hx={h(x)hH}H_{x}=\{h(x) \mid h \in H\} is directed. Defining h0(x)=VHxh_{0}(x)=V H_{x} for each xx, show that the function h0h_{0} belongs to HH, and deduce that h0(x)h_{0}(x) is the least fixed point of ff lying above xx, for each xPx \in P.