Fixed point theorems for increasing correspondences on lattices

For an ascending correspondence $$F:X\rightarrow 2^X$$ with chain-complete values on a complete lattice X, we prove that the set of fixed points is a complete lattice. This generalizes Zhou’s fixed point theorem. We provide an application to games with strategic complementarities.