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 D⊆PD \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:P→Pf: P \rightarrow P an order-preserving map which is inflationary, i.e. satisfies x⩽f(x)x \leqslant f(x) for all x∈Px \in P. We define a subset C⊆PC \subseteq P to be closed if it satisfies (x∈C)→(f(x)∈C)(x \in C) \rightarrow(f(x) \in C), and is also closed under joins of directed sets (i.e., D⊆CD \subseteq C and DD directed imply ⋁D∈C\bigvee D \in C ). We write x≪yx \ll y to mean that every closed set containing xx also contains yy. Show that ≪\ll is a partial order on PP, and that x≪yx \ll y implies x⩽yx \leqslant y. Now consider the set HH of all functions h:P→Ph: P \rightarrow P which are order-preserving and satisfy x≪h(x)x \ll h(x) for all xx. Show that HH is closed under composition of functions, and deduce that, for each x∈Px \in P, the set Hx={h(x)∣h∈H}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 x∈Px \in P.

Typos? Please submit corrections to this page on GitHub.