I am wondering how to show:
An order-preserving map $f$ of a complete lattice $A$ into itself has at least one fixed element.
2026-03-31 17:44:30.1774979070
Complete Lattice and fixed point
593 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
Let $B=\{a\in A:a\le f(a)\}$; $B\ne\varnothing$, since $0_A\in B$. Let $a\in B$; then $f(a)\le f\big(f(a)\big)$, since $f$ is order-preserving. $A$ is complete, so let $u=\sup B$; I’ll leave it to you to finish by showing that $f(u)=u$.