Let $L=\mathcal P(\mathbb N)$ be a complete lattice of subsets of $\mathbb N$.
a) Justify that the function $F(X)=\mathbb N \setminus X$ does not have a Fixed Point.
I don't know how to solve this.
b) Be $F(X)=\left\{ x+1 \mid x\in X \right\} $. Find the smallest and the greatest Fixed points. (You can start with $\emptyset $ and $\mathbb N$ and see where it goes.)
My Solution:
Here I started like this for the least fixed point: $\emptyset \sqsubseteq F(\emptyset) = \emptyset$ (but this is just assumption, how do I prove this ?)
For greatest Fixed Point I have $\mathbb N \sqsupseteq F(\mathbb N) \sqsupseteq F(F(\mathbb N)) \sqsupseteq \cdots $ (But I can't make a assumption about the greatest fixed point). Which is it and why?