**Short version of the question.** If $(P,\leq)$ is a partially ordered set (poset), a topology denoted by $\tau\_o(P)$ can be defined (see below). There is also another notion of convergence, called *order-convergence*. My question is: if ${\cal F}$ is a set-filter on $P$, is it true that ${\cal F}$ converges to some $x\in P$ with respect to $\tau\_o(P)$ if and only if ${\cal F}$ order-converges to $x$? All the definitions are given below.


**Long version with explanations.** Let $(P,\leq)$ be a poset. We define the *order-convergence topology*, denoted by $\tau\_o(P)$ on $P$. By a *set-filter* $\mathcal{F}$ on $P$ we mean a collection of subsets of $P$ such that:


* $\emptyset \notin \mathcal{F}$;
* $A, B\in \mathcal{F}$ implies $A\cap B\in \mathcal{F}$;
* $U\in \mathcal{F}$, $U'\subseteq P$ and $U'\supseteq U$ implies $U'\in \mathcal{F}$.


If $S\subseteq P$ we define $S^u= \{x\in P: x\geq s\text{ for all } s\in S\}$, and $S^l= \{x\in P: x\leq s\text{ for all } s\in S\}$. If $\cal{F}$ is a set-filter, then we set ${\cal F}^u = \bigcup\{F^u: F\in \cal{F}\}$ and define ${\cal F}^l$ similarly. For $x\in P$ and a set-filter ${\cal F}$ on $P$ we write $${\cal F}\to x \textrm{ iff } \bigwedge\cal{F}^u = x = \bigvee \cal{F}^l$$ and say that ${\cal F}$ *order-converges* to $x$.


Then we set $\tau\_o(P)=\{U\subseteq P: \textrm{ for any } x\in U \text{ and any set-filter }\mathcal{F} \text{ with } \mathcal{F}\to x \text{ we have } U\in \mathcal{F}\}$. It is not hard to verify that this defines a topology, called the *order-convergence topology*.


It is furthermore easy to check that if ${\cal F}$ is a set-filter on a poset $P$ and ${\cal F}$ order-converges to some $x\in P$, then ${\cal F}$ also converges topologically to $x$ (i.e. contains ${\cal N}\_x$, the neighborhood filter of $x$).


Does the converse hold, that is, does topological convergence of a filter ${\cal F}$ to $x\in P$ with respect to $\tau\_o(P)$ imply that ${\cal F}$ order-converges to $x$?



Order convergence vs topological convergence in partially ordered sets
The answer to this question is negative.


As a counterexample, consider the one-point extension $P:=2^{<\omega}\cup\{\infty\}$ of the binary tree $2^{<\omega}=\bigcup\_{n\in\omega}2^n$. Here $2$ is the ordinal $\{0,1\}$ and $2^n$ is the set of binary sequences of length $n$. 


The partial order on $P$ is defined by two conditions:


(i) $p\le\infty$ for all $p\in P$ and 


(ii) $x\le y$ for $x,y\in 2^{<\omega}$ if the sequence $y$ is an extension of the sequence $x$, that is $x=y\restriction n$ for $n=|x|$ where $|x|$ is the unique number such that $x\in 2^{|x|}\subset 2^{<\omega}$. 


Now we describe the topology $\tau\_o(P)$.


**Claim 1.** If a set-filter $\mathcal F$ on $P$ converges to a point $p\in 2^{<\omega}$, then $\{p\}\in\mathcal F$.


*Proof.* It follows from $\mathcal F\to p$ that $\sup\mathcal F^l=p=\inf \mathcal F^u$. The equality $p=\sup\mathcal F^l$ implies that $\mathcal F^l\subset{\downarrow}p$. Taking into account that ${\downarrow}p$ is a finite linearly ordered set, we conclude that $p\in\mathcal F^l$ and hence $p\in F^l$ for some $F\in\mathcal F$. Then $F\subset{\uparrow}p$ and hence ${\uparrow}p\in\mathcal F$. 


The equality $p=\inf\mathcal F^u$ implies that $\mathcal F^u\subset{\uparrow}p$. Taking into account that $P$ contains no strictly decreasing sequences, we conclude that $p=\inf A$ for some finite subset $A\subset\mathcal F^u$. Since $\mathcal F$ is closed under taking finite intersections, $A\subset F^u$ for some $F\in\mathcal F$ and then $p=\inf A\in F^u$, which implies $F\subset {\downarrow}p$ and ${\downarrow}p\in \mathcal F$.


Finally, we see that $\{p\}={\uparrow}p\cap{\downarrow}p\in\mathcal F$.


**Corollary 1.** Each point $p\in 2^{<\omega}$ is isolated in the topology $\tau\_o(P)$.


**Claim 2.** If a set-filter $\mathcal F$ on $P$ converges to $\infty$, then either $\{\infty\}\in\mathcal F$ or $\{\sup F^l:F\in\mathcal F\}$ is an infinite chain in $2^{<\omega}$.


*Proof.* Assume that $\{\infty\}\notin\mathcal F$. First we show that for any $F\in\mathcal F$ the set $F^l$ is linearly ordered. Indeed, assuming that $F^l$ contains two incomparable elements $x,y$, we conclude that $$\emptyset\ne F\in{\uparrow}x\cap{\uparrow}y=\{\infty\}$$ and hence $\{\infty\}=F\in\mathcal F$, which contradicts our assumption. So, the set $F^l$ is linearly ordered and hence has $\sup F^l\in F^l\subset 2^{<\omega}$. 


To see that for any sets $F,E\in\mathcal F$ the elements $\sup F^l$ and $\sup E^l$ are comparable, observe that they belong to the linearly ordered set $(F\cap E)^l$. 


Therefore, the set $L=\{\sup F^l:F\in\mathcal F\}$ is linearly ordered. Assuming that this set is finite, we can conclude that $\infty=\sup\mathcal F^l=\sup L\in L$, which contradicts the inclusion $L\subset 2^{<\omega}$.


**Corollary 2.** If an open set $U\in\tau\_0(P)$ contains $\infty$, then $2^{<\omega}\setminus U$ is finite.


*Proof.* To derive a contradiction, assume that the complement $C:=2^{<\omega}\setminus U$ is ifinite. Applying the [Konig Tree Lemma](https://proofwiki.org/wiki/K%C3%B6nig%27s_Tree_Lemma), we can find an infinite linearly ordered set $L\subset C$. Consider the set-filter $$\mathcal F=\{F\subset P:L\setminus F\mbox{ is finite}\}$$ and observe that $\mathcal F\to\infty$ and $U\notin \mathcal F$, which contradicts the definition of the topology $\tau\_0(P)$.


**Claim 3.** A subset $U\subset P$ containing $\infty$ is $\tau\_0(P)$-open if and only if the complement $P\setminus U$ is finite.


*Proof.* The "only if" part is proved in Corollary 2. To prove the "if" part, assume that $P\setminus U$ is finite. The $\tau\_o(P)$-openness of $U$ will follow from Claims 1 as soon as we show that for any filter $\mathcal F\to\infty$ the set $U$ belongs to $\mathcal F$. By Claim 2, either $\{\infty\}\in\mathcal F$ or else $\{\sup F^l:F\in\mathcal F\}$ is an infinite chain in $2^{<\omega}$. In the first case the inclusions $U\supset\{\infty\}\in\mathcal F$ imply that $U\in\mathcal F$. In the second case, we can observe that the set $D:=\bigcup\_{x\in 2^{<\omega}\setminus U}{\downarrow}x$ is finite, so we can find a set $F\in\mathcal F$ such that $\sup F^l\notin D$ and conclude that $F\cap D=\emptyset$ and $U\supset P\setminus D\supset F\in\mathcal F$ implies that $U\in\mathcal F$.




---


  



Now we are able to prove that the poset $P$ provides a counterexample to the original question.


By Claim 3, for every $n\in\mathbb N$ the set $U\_n:=P\setminus\bigcup\_{k\le n}2^k$ belongs to the topology $\tau\_0(P)$. Then the set-filter $\mathcal F=\{F\subset P:\exists n\in\mathbb N\;U\_n\subset F\}$ topologically converges to $\infty$. On the other hand, the set $\{\sup F^l:F\in\mathcal F\}=\{\sup U\_n^\ell:n\in\mathbb N\}$ coincides with the singleton $2^0$ and hence $\mathcal F\not\to\infty$ by Claim 2. 


