A 1.71 . 7 \quad B1.12

Logic, Computation and Set Theory | Part II, 2004

(i) State and prove the Knaster-Tarski Fixed-Point Theorem.

(ii) A subset SS of a poset XX is called an up-set if whenever x,yXx, y \in X satisfy xSx \in S and xyx \leqslant y then also ySy \in S. Show that the set of up-sets of XX (ordered by inclusion) is a complete poset.

Let XX and YY be totally ordered sets, such that XX is isomorphic to an up-set in YY and YY is isomorphic to the complement of an up-set in XX. Prove that XX is isomorphic to YY. Indicate clearly where in your argument you have made use of the fact that XX and YY are total orders, rather than just partial orders.

[Recall that posets XX and YY are called isomorphic if there exists a bijection ff from XX to YY such that, for any x,yXx, y \in X, we have f(x)f(y)f(x) \leqslant f(y) if and only if xyx \leqslant y.]

Typos? Please submit corrections to this page on GitHub.