Paper 2, Section II, G

Logic and Set Theory | Part II, 2013

Explain what is meant by a chain-complete poset. State the Bourbaki-Witt fixedpoint theorem for such posets.

A poset PP is called directed if every finite subset of PP (including the empty subset) has an upper bound in P;PP ; P is called directed-complete if every subset of PP which is directed (in the induced ordering) has a least upper bound in PP. Show that the set of all chains in an arbitrary poset PP, ordered by inclusion, is directed-complete.

Given a poset PP, let [P→P][P \rightarrow P] denote the set of all order-preserving maps P→PP \rightarrow P, ordered pointwise (i.e. f⩽gf \leqslant g if and only if f(x)⩽g(x)f(x) \leqslant g(x) for all xx ). Show that [P→P][P \rightarrow P] is directed-complete if PP is.

Now suppose PP is directed-complete, and that f:P→Pf: P \rightarrow P is order-preserving and inflationary. Show that there is a unique smallest set C⊆[P→P]C \subseteq[P \rightarrow P] satisfying

(a) f∈Cf \in C;

(b) CC is closed under composition (i.e. g,h∈C⇒g∘h∈Cg, h \in C \Rightarrow g \circ h \in C ); and

(c) CC is closed under joins of directed subsets.

Show that

(i) all maps in CC are inflationary;

(ii) CC is directed;

(iii) if g=⋁Cg=\bigvee C, then all values of gg are fixed points of ff;

(iv) for every x∈Px \in P, there exists y∈Py \in P with x⩽y=f(y)x \leqslant y=f(y).

Typos? Please submit corrections to this page on GitHub.