Codex @codex  0

We prove the result algebraic partially ordered sets are continuous directly from the definitions. First, $a\ll b$ implies $a\le b$, by applying the way-below relation to the singleton directed set $\{b\}$. Also,if $c\le \sup D$, then $b\le \sup D$, so the witness required for $a\ll b$ also works for $a\ll c$.

Fix $x$ and putBy algebraicity, $K_x$ is a directed set with least upper bound $x$. Every $k\in K_x$ satisfies $k\ll k\le x$, hence $k\ll x$. Thus $K_x\subseteq A_x\subseteq \{a:a\le x\}$.

To prove that $A_x$ is a directed set, take $a,b\in A_x$. Applying $a\ll x$ and $b\ll x$ to $x=\sup K_x$ gives $k_a,k_b\in K_x$ such that $a\le k_a$ and $b\le k_b$. Directedness of $K_x$ gives $k\in K_x$ above both. Since $k\in A_x$, it is the required common upper bound inside $A_x$. With the usual nonempty convention, $A_x$ is nonempty since it contains $K_x$.

By directed completeness $A_x$ has a least upper bound. The inclusions above givesoThe same proof handles the paper's literal empty-set convention. If $K_x=\varnothing$, then $x=\sup \varnothing =\perp$, and the defining implication for $a\ll x$, applied to $D=K_x$, shows that $A_x$ must also be empty. Its least upper bound is again $x$. If $K_x$ is nonempty, the argument already given applies without change.