Apartness, sharp elements, and the Scott topology of domains

Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness and a notion of sharp elements. Being apart is a positive formulation of being unequal, similar to how inhabitedness is a positive formulation of nonemptiness. To exemplify sharpness, we note that a lower real is sharp if and only if it is located. Our first main result is that for a large class of continuous dcpos, the Bridges-V\^i\c{t}\v{a} apartness topology and the Scott topology coincide. Although we cannot expect a tight or cotransitive apartness on nontrivial dcpos, we prove that the intrinsic apartness is both tight and cotransitive when restricted to the sharp elements of a continuous dcpo. These include the strongly maximal elements, as studied by Smyth and Heckmann. We develop the theory of strongly maximal elements highlighting its connection to sharpness and the Lawson topology. Finally, we illustrate the intrinsic apartness, sharpness and strong maximality by considering several natural examples of continuous dcpos: the Cantor and Baire domains, the partial Dedekind reals, the lower reals and finally, an embedding of Cantor space into an exponential of lifted sets.


Introduction
Domain theory (Abramsky and Jung, 1995) is rich with applications in semantics of programming languages (Scott, 1993(Scott, , 1982;;Plotkin, 1977), topology and algebra (Gierz et al., 2003), and higher-type computability (Longley and Normann, 2015).The basic objects of domain theory are directed complete posets (dcpos), although we often restrict our attention to algebraic or continuous dcpos which are generated by so-called compact elements or, more generally, by the so-called way-below relation (Section 2).We examine the Scott topology on dcpos using an apartness relation and a notion of sharp elements.Our work is constructive in the sense that we do not assume the principle of excluded middle or choice axioms, but we do use impredicativity and powersets in particular, see Section 1.1 for more details on our foundational setup.
Classically, i.e. when assuming excluded middle, a dcpo with the Scott topology satisfies T 0separation: if two points have the same Scott open neighbourhoods, then they are equal.This holds constructively if we restrict to continuous dcpos.A classically equivalent formulation of T 0 -separation is: if x = y, then there is a Scott open separating x and y, i.e. containing x but not y or vice versa.This second formulation is equivalent to excluded middle.This brings us to the first main notion of this paper (Section 3).We say that x and y are intrinsically apart, written x # y, if there is a Scott open containing x but not y or vice versa.Then x # y is a positive formulation of a A shorter version of this paper appeared as Sharp Elements and Apartness in Domains.In A. Sokolova (ed.) 37th Conference on Mathematical Foundations of Programming Semantics (MFPS 2021), Electronic Proceedings in Theoretical Computer Science (EPTCS),vol. 351,Open Publishing Association,(134)(135)(136)(137)(138)(139)(140)(141)(142)(143)(144)(145)(146)(147)(148)(149)(150)(151).4204/EPTCS.351.9.
T. de Jong x = y, similar to how inhabitedness (i.e.∃ x ∈ X) is a positive formulation of nonemptiness (i.e.X = / 0).This definition works for any dcpo, but the intrinsic apartness is mostly of interest to us for continuous dcpos.In fact, the apartness really starts to gain traction for continuous dcpos that have a basis satisfying certain decidability conditions.For example, we prove that for such continuous dcpos, the apartness topology (Bridges and Vît ¸ǎ, 2011) and the Scott topology coincide (Section 4).Thus our work may be regarded as showing that the constructive framework by Bridges and Vît ¸ǎ is applicable to domain theory.It should be noted that these decidability conditions are satisfied by the major examples in applications of domain theory to topology and computation.Moreover, these conditions are stable under products of dcpos and, in the case of bounded complete algebraic dcpos, under exponentials (Section 2).
In (Bridges and Richman, 1987, p. 7), (Mines et al., 1988, p. 8) and (Bridges and Vît ¸ǎ, 2011, p. 8), an irreflexive and symmetric relation is called an inequality (relation) and the symbol = is used to denote it.In (Bishop and Bridges, 1985, Definition 2.1), an inequality is moreover required to be cotransitive: if x = y, then x = z or y = z for any x, y and z.
The latter is called a preapartness in (Troelstra and van Dalen, 1988, Section 8.1.2) and the symbol # is used to denote it, reserving = for the logical negation of equality and the word apartness for a relation that is also tight: if ¬(x # y), then x = y.
Warning 1.We deviate from the above and use the word apartness and the symbol # for an irreflexive and symmetric relation, so we do not require it to be cotransitive or tight.
The reasons for our choice of terminology and notations are as follows: (i) we wish to reserve = for the negation of equality as in (Troelstra and van Dalen, 1988, Section 8.1.2);(ii) the word inequality is confusingly also used in the context of posets to refer to the partial order; and finally, (iii) the word inequality seems to suggest that the negation of the inequality relation is an equivalence relation, but, in the absence of cotransitivity, it need not be.
Actually, we prove that no apartness on a nontrivial dcpo can be cotransitive or tight unless (weak) excluded middle holds.However, there is a natural collection of elements for which the intrinsic apartness is both tight and cotransitive: the sharp elements (Section 5).Sharpness is slightly involved in general, but it is easy to understand for algebraic dcpos: an element x is sharp if and only if for every compact element it is decidable whether it is below x.Moreover, the notion is quite natural in many examples.For instance, the sharp elements of a powerset are exactly the decidable subsets and the sharp lower reals are precisely the located ones.
An import class of sharp elements is given by the strongly maximal elements (Section 6).These were studied in a classical context in (Smyth, 2006) and (Heckmann, 1998), because of their desirable properties.For instance, while the subspace of maximal elements may fail to be Hausdorff, the subspace of strongly maximal elements is both Hausdorff (two distinct points can be separated by disjoint Scott opens) and regular (every neighbourhood contains a Scott closed neighbourhood).As shown by Smyth (2006), strong maximality is closely related to the Lawson topology.Specifically, Smyth proved that a point x is strongly maximal if and only if every Lawson neighbourhood of x contains a Scott neighbourhood of x.Using sharpness, we offer a constructive proof of this.
Finally, in Section 7 we illustrate the above notions by presenting natural examples of continuous dcpos, many of which embed well-known spaces as the strongly maximal elements.Specifically, we consider the Cantor and Baire domains, the partial Dedekind reals, the lower reals, and an embedding of Cantor space into an exponential of lifted sets.

Foundations
We work informally in an impredicative set theory with intuitionistic logic.If we wish to pin down a particular formal system, then we could choose IZF (Friedman, 1973), which has models in Grothendieck and realizability toposes (Fourman, 1980;Hayashi, 1981;Joyal and Moerdijk, 1995).In particular we have powersets and allow for the usual impredicative definitions of interior and closure in topology.Functions, as is standard in set theory, are encoded as single-valued and total relations.We stress that our work is fully compatible with classical logic.

Contributions
Our primary objective is to explore the Scott topology of continuous dcpos in a constructive setting where we do not rely on excluded middle or the axiom of choice.This leads us to study an apartness relation, as well as the subsets of sharp and strongly maximal elements, as explained in the introduction.
We list some main results: Theorem 51 says the framework of Bridges and Vît ¸ǎ ( 2011) is applicable to constructive domain theory; Theorem 68 shows that the intrinsic apartness is tight and cotransitive for sharp elements.We have a supply of sharp elements thanks to Theorems 61 and 67, as well as Proposition 71 which tells us that strongly maximal elements are sharp.Finally, the examples of Section 7 provide important illustrations of the theory.For example, Theorem 105 shows that the real line is homeomorphic to the subspace of strongly maximal elements in the continuous domain of partial Dedekind reals, and moreover, that the homeomorphism reflects and preserves apartness.
Some notions, such as sharpness, trivialize in a classical setting.However, our simplification of Smyth's definition of strong maximality (Section 6) and Proposition 79 are new contributions in a classical setting as well.Moreover, our constructive treatment could possibly inform a classical, but effective treatment of domain theory (Smyth, 1977).
Our work is not situated in formal topology and we work informally in impredicative set theory without using excluded middle or choice axioms.We also consider completeness with respect to all directed subsets and not just ω-chains as is done in (Bauer and Kavkler, 2009;Pattinson and Mohammadian, 2021).The principal contributions of our work are the aforementioned notions of intrinsic apartness and sharp elements, although the idea of sharpness also appears in formal topology: an element of a continuous dcpo is sharp if and only if its filter of Scott open neighbourhoods is located in the sense of Spitters (2010) and Kawai (2017).
If, as advocated in (Abramsky, 1987;Vickers, 1989;Smyth, 1993), we think of (Scott) opens as observable properties, then this suggests that we label two points as apart if we have made conflicting observations about them, i.e. if there are disjoint opens separating the points.Indeed, (an equivalent formulation of) this notion is used in (Smyth, 2006, p. 362).While these notions are certainly useful, both in the presence and absence of excluded middle, our apartness serves a different purpose: It is a positive formulation of the negation of equality used when reasoning about the Scott topology on a dcpo, which (classically) is only a T 0 -space that isn't Hausdorff in general.By contrast, an apartness based on disjoint opens would supposedly perform a similar job for a Hausdorff space, such as a dcpo with the Lawson topology.
Finally, von Plato (2001) gives a constructive account of so-called positive partial orders: sets with a binary relation ≤ that is irreflexive and cotransitive (i.e. if x ≤ y, then x ≤ z or y ≤ z for any elements x, y and z).Our notion ≤ from Definition 33 bears some similarity, but our work is fundamentally different for two reasons.Firstly, ≤ is not cotransitive.Indeed, we cannot expect such a cotransitive relation on nontrivial dcpos, cf.Theorem 57.Secondly, in (von Plato, 2001) equality is a derived notion from ≤, while equality is primitive for us.

Acknowledgements
I am very grateful to Martín Escardó for many discussions (including one that sparked this paper) and valuable suggestions for improving the exposition.In particular, the terminology "sharp" is due to Martín and Theorem 109 was conjectured by him.I should also like to thank Steve Vickers for his interest and remarks.Furthermore, I thank the anonymous referees of the shorter, related MFPS paper for their helpful comments and questions.Finally, I am grateful to the anonymous referee whose comments and questions have led to the addition of Theorem 67, Proposition 79 and Example 92.

Preliminaries
We give the basic definitions and results in the theory of (continuous) dcpos.It is not adequate to simply refer the reader to classical texts on domain theory (Abramsky and Jung, 1995;Gierz et al., 2003), because two classically equivalent definitions need not be constructively equivalent, and hence we need to make choices here.For example, while classically every Scott open subset is the complement of a Scott closed subset, this does not hold constructively (Lemma 10).
The results presented here are all provable constructively.Constructive proofs of standard order-theoretic results, such as Lemma 4 and Proposition 18 (the interpolation property), can be found in (de Jong and Escardó, 2021a), or alternatively, the author's PhD thesis (de Jong, 2022), and will not be repeated here.Since the Scott topology is not treated in the above references, the proofs of any results involving topology (such as Proposition 17) are spelled out in full.
Finally, in Section 2.3 we introduce and study some decidability conditions on bases of dcpos that will make several appearances throughout the paper.These decidability conditions always hold if excluded middle is assumed.
(1) A subset S of a poset (X, ⊑) is directed if it is inhabited (meaning there exists s ∈ S) and semidirected: for every two points x, y ∈ S there exists z ∈ S with x ⊑ z and y ⊑ z. (2) A directed complete poset (dcpo) is a poset where every directed subset S has a supremum, denoted by S. (3) A dcpo is pointed if it has a least element, typically denoted by ⊥.
Notice that a poset is a pointed dcpo if and only if it has suprema for all semidirected subsets.In fact, given a pointed dcpo D and a semidirected subset S ⊆ D, we can consider the directed subset S ∪ {⊥} of D whose supremum is also the supremum of S.
Definition 3 (Way-below relation ≪).An element x of a dcpo D is way below an element y ∈ D, denoted x ≪ y, if for every directed subset S with y ⊑ S there exists s ∈ S such that x ⊑ s already.
Lemma 4. The way-below relation enjoys the following properties: (1) it is transitive; (2) if x ⊑ y ≪ z, then x ≪ z for every x, y and z; (3) if x ≪ y ⊑ z, then x ≪ z for every x, y and z.
Definition 5 (Continuity of a dcpo).A dcpo D is continuous if for every element x ∈ D, the subset ։ x := {y ∈ D | y ≪ x} is directed and its supremum is x.
Definition 6 (Compactness and algebraicity).An element of a dcpo is compact if it is way below itself.A dcpo D is algebraic if for every element x ∈ D, the subset {c ∈ D | c ⊑ x and c is compact} is directed with supremum x.

The Scott topology
We stress that constructively it is necessary to define Definition 11 (Interior and closure).In a topological space X, the interior of a subset S ⊆ X is the largest open of X contained in S, i.e. the interior of S is {U ∈ P(X) | U ⊆ S, U is open}.Dually, the closure of a subset S ⊆ X is the smallest closed subset of X that contains S.

(Abstract) bases
Ideal completions of abstract bases provide a source of continuous (and algebraic) dcpos.In general, the notion of a basis is constructively quite interesting, as explained in the next subsection.Lemma 19.For every two elements x and y of a continuous dcpo D we have Moreover, if D has a basis B, then Definition 20 (Abstract basis and ideal completion Idl(B, ≺)

Decidability conditions
Every continuous dcpo D has a basis, namely D itself.Our interest in bases lies in the fact that we can ask a dcpo to have a basis satisfying certain decidability conditions that we couldn't reasonably impose on the entire dcpo.For instance, the basis {⊥, ⊤} of the Sierpiński domain S has decidable equality, but decidable equality on all of S is equivalent to excluded middle.
The first decidability condition that we will consider is for bases B of a pointed continuous dcpo: For every b ∈ B, it is decidable whether b = ⊥.
(δ ⊥ ) The second and third decidability conditions are for bases of any continuous dcpo: Observe that each of (δ ⊑ ) and (δ ≪ ) implies (δ ⊥ ) for pointed dcpos, because ⊥ is compact.In general, neither of the conditions (δ ⊑ ) and (δ ≪ ) implies the other, at least as far as we know.However, in some cases, for example when B is Kuratowski finite, (δ ≪ ) is a stronger condition, because of Lemma 19.Moreover, if the dcpo is algebraic then conditions (δ ⊑ ) and (δ ≪ ) are equivalent for the unique basis of compact elements.
Finally, we remark that many natural examples in domain theory satisfy the decidability conditions.In particular, this holds for all examples in Section 7.
Again, we stress that these decidability conditions are necessarily restricted to the basis, as the following proposition shows.
Proposition 22.Let D be any pointed dcpo that is nontrivial in the sense that there exists x ∈ D with x = ⊥.If y = ⊥ is decidable for every y ∈ D, then weak excluded middle follows.
Proof.For any proposition P, observe that ¬P holds if and only if {x | P} = ⊥.Hence, if y = ⊥ is decidable for every y ∈ D, then so is ¬P for every proposition P.
Moreover, if the order relation of a dcpo is decidable, then, by antisymmetry, the dcpo must have decidable equality, but we showed in (de Jong and Escardó, 2021b, Corollary 39) that this implies (weak) excluded middle, unless the dcpo is trivial.
For understanding these results, it is important to recall that the two-element poset with ⊥ ⊑ ⊤ cannot be shown to be directed complete, constructively.
We now show that the decidability conditions (δ ⊥ ), (δ ≪ ) and (δ ⊑ ) are preserved by taking products and exponentials (function spaces) of dcpos.Definition 25 (Scott continuity).A function between dcpos is Scott continuous if it preserves directed suprema.
Definition 26 (Exponential of dcpos E D ).The exponential E D of two dcpos D and E is given by the set of Scott continuous functions from D to E ordered pointwise, i.e. f ⊑ g if ∀ x∈D f (x) ⊑ g(x) for f , g : D → E. Suprema of directed subsets are also given pointwise.
We use the name "exponential" for E D , because this construction (together with the product) witnesses that the category of dcpos is cartesian closed.In the (bounded complete) algebraic case, a basis for the exponential can be constructed using step functions which we recall now.Lemma 30.The compact elements of a dcpo are closed under existing Kuratowski finite suprema. is the basis of compact elements for the algebraic exponential E D .Moreover, if B E satisfies (δ ⊥ ), then so does B. Finally, if B D and B E both satisfy (δ ⊑ ) (or equivalently, (δ ≪ )), then B satisfies (δ ⊑ ) and (δ ≪ ) too.
Proof.Firstly, notice that B is well-defined as suprema are given pointwise and E is bounded complete.Secondly, B consists of compact elements by Lemmas 28 and 30.Next, we show that B is indeed a basis for E D .So suppose that f : Observe that this set is indeed semidirected: if S and T are Kuratowski finite subsets of single-step functions bounded by f , then so is S ∪ T and its supremum is above those of S and T .Moreover, the set is inhabited, because D is inhabited, so there must exist some b ∈ B D and then b ⇒ ⊥ is a single-step function way below f .Hence, B ∩ ↓ f is directed, as desired.Next, we prove that f equals the supremum of B ∩ ↓ f , which exists because B ∩ ↓ f is bounded by f .So let x ∈ D be arbitrary.We must show that f Now suppose that B E satisfies (δ ⊥ ) and let S ∈ B. Notice that the least element of E D is given by x → ⊥.We wish to show that it is decidable whether By Lemma 29, this inequality reduces to b = ⊥, which is indeed decidable as B E is assumed to satisfy (δ ⊥ ).
Finally, assume that both B D and B E satisfy (δ ⊑ ) and suppose that S, T ∈ B. We must prove that S ⊑ T is decidable.Since S is Kuratowski finite, it is enough to prove that a ⇒ b ⊑ T is decidable for every a ⇒ b ∈ S. By Lemma 29, this inequality reduces to b ⊑ ( T )(a).Write T as a Kuratowski finite set of single-step functions: using that B D satisfies (δ ⊑ ).Hence, since B E is closed under finite bounded suprema by Lemma 30, we see that by assumption.

The intrinsic apartness
Definition 33 (Specialization preorder ≤ and ≤).The specialization preorder on a topological space X is the preorder ≤ on X given by putting x ≤ y if every open neighbourhood of x is an open neighbourhood of y.Given x, y ∈ X, we write x ≤ y if there exists an open neighbourhood of x that does not contain y.
Observe that x ≤ y is classically equivalent to x y, the logical negation of x ≤ y.We also write x ⊑ y for the logical negation of x ⊑ y, where ⊑ is the partial order on a dcpo.

Definition 34 (Apartness). An apartness on a set X is a binary relation # on X satisfying
(1) irreflexivity: x # x is false for every x ∈ X; (2) symmetry: if x # y, then y # x for every x, y ∈ X.If x # y holds, then x and y are said to be apart.
Notice that we do not require cotransitivity or tightness, cf.Warning 1 on page 2. Also note that irreflexivity implies that if x # y, then x = y, so # is a strengthening of inequality.

Definition 35 (Intrinsic apartness #). Given two points x and y of a topological space X, we say that x and y are intrinsically apart, written x # y, if x ≤ y or y ≤ x. Thus, x is intrinsically apart from y if there is a open neighbourhood of x that does not contain y or vice versa. It is clear that the relation # is an apartness in the sense of Definition 34.
With excluded middle, one can show that the specialization preorder for the Scott topology on a dcpo coincides with the partial order of the dcpo.In particular, the specialization preorder is in fact a partial order.Constructively, we still have the following result.The condition in Lemma 37 appears in a remark right after (Gierz et al., 2003, Definition I-1.6), as a classically equivalent reading of x ⊑ y.
Example 38.Consider the powerset P(X) of a set X as a pointed algebraic dcpo.Using Lemma 37, we see that a subset A ∈ P(X) is intrinsically apart from the empty set if and only if A is inhabited.More generally, for A, B ∈ P(X), we have A ≤ B if and only if B \ A is inhabited.
(1) For any elements x and y of a dcpo D, we have that x ≤ y implies x ⊑ y.
(2) The converse of (1) holds if and only if excluded middle holds.In particular, if the converse of (1) holds for all elements of the Sierpiński domain S, then excluded middle follows.
(3) For any elements x and y of a dcpo D, we have that x # y implies x = y.( 4) The converse of (3) holds if and only if excluded middle holds.In particular, if the converse of (3) holds for all elements of the Sierpiński domain S, then excluded middle follows.( 5) If c is a compact element of a dcpo D and x ∈ D, then c ⊑ x implies c ≤ x, without the need to assume excluded middle. Proof.
(1): This is just the contrapositive of the first claim in Lemma 36.(2): It is straightforward to prove the implication if excluded middle holds.For the converse, assume that x ⊑ y implies x ≤ y for every x, y ∈ S. We are going to show that ¬¬P → P for every proposition P, which is equivalent to excluded middle.So let P be an arbitrary proposition and assume that ¬¬P holds.
Then the element χ P := { * | P} ∈ S satisfies χ P ⊑ ⊥.So χ P ≤ ⊥ by assumption.By Lemma 37 and Example 14, there exists b ∈ {⊥, ⊤} such that b ≪ χ P and b = ⊥.The latter implies b = ⊤ = { * }, which means that χ P must be inhabited, which is equivalent to P holding. (3): Since the intrinsic apartness is irreflexive.(4): Similar to (2). ( 5 An element x of a pointed dcpo may be said to be nontrivial if x = ⊥.Given our notion of apartness, we might consider the constructively stronger x # ⊥.We show that this is related to Johnstone's notion of positivity (Johnstone, 1984, p. 98).In (de Jong and Escardó, 2021b, Definition 25) we adapted Johnstone's notion of positivity from locales to a general class of posets that includes dcpos.Here we give an equivalent, but simpler, definition just for pointed dcpos.
Definition 42 (Positivity).An element x of a pointed dcpo D is positive if every semidirected subset S ⊆ D satisfying x ⊑ S is inhabited (and hence directed).
Proposition 43.For every element x of a pointed dcpo, if x # ⊥, then x is positive.In the other direction, if D is a continuous pointed dcpo with a basis satisfying (δ ⊥ ), then every positive element of D is apart from ⊥.
Proof.Suppose first that x is an element of a pointed dcpo D and that x # ⊥.Then we have a Scott open U containing x but not ⊥.Now suppose that S ⊆ D is semidirected with x ⊑ S. Scott opens are upper sets, so S ∈ U. Now S ′ := S ∪ {⊥} is a directed subset of D with the same supremum as S. In particular, S ′ ∈ U.But then there exists y ∈ S ′ such that y ∈ U already, because U is Scott open.By construction of S ′ , we have y = ⊥ or y ∈ S. As the former is impossible, we are done.
For the other claim, assume that D is continuous with a basis B satisfying (δ ⊥ ) and that x ∈ D is positive.Consider the subset

The apartness topology
In (Bridges and Vît ¸ǎ, 2011, Section 2.2), the authors start with a topological space X equipped with an apartness relation # and, using the topology and apartness, define a second topology on X, known as the apartness topology.A natural question is whether the original topology and the apartness topology coincide.For example, if X is a metric space and we set two points of X to be apart if their distance is strictly positive, then the Bridges-Vît ¸ǎ apartness topology and the topology induced by the metric coincide (Proposition 2.2.10 in ibid).We show, assuming a modest ¬¬-stability condition that holds in examples of interest, that the Scott topology on a continuous dcpo with the intrinsic apartness relation coincides with the apartness topology.
We start by repeating some basic definitions and results of Bridges and Vît ¸ǎ.Recalling Warning 1 on page 2, we remind the reader familiar with (Bridges and Vît ¸ǎ, 2011) that they write = and use the word inequality for what we denote by # and call apartness.
In constructive mathematics, positively defined notions are usually more useful than negatively defined ones.We already saw examples of this: # versus = and ≤ versus ⊑.We now use an apartness to give a positive definition of the complement of a set.
Definition 44 ((Logical) complement; (Bridges and Vît ¸ǎ, 2011, pp. 19-20)).Given a subset A of a set X with an apartness # we define the logical complement and the complement respectively as (1) Recall that, classically, a topological space is a T 0 or Kolmogorov space if x = y implies that there exists an open U such that x ∈ U and y ∈ U.This explains the name for the following definition of Bridges and Vît ¸ǎ.
Definition 45 (Topological reverse Kolmogorov property; p. 29 in ibid).A topological space X equipped with an apartness # satisfies the (topological) reverse Kolmogorov property if for every open U and points x, y ∈ X with x ∈ U and y ∈ U, we have x # y.
Lemma 46 (Proposition 2.2.2 in ibid).If a topological space X equipped with an apartness # satisfies the reverse Kolmogorov property, then for every subset A ⊆ X, we have Definition 47 (Apartness complement and topology, nearly open subset; pp.20, 28 and 31 in ibid).For an element x of a topological space X with an apartness # and a subset A ⊆ X, we write x ⊲⊳ A if x ∈ (∼A) • .This gives rise to the apartness complement: (by ¬¬-stability of the basis), so that U = −(¬U), as desired.

Tightness, cotransitivity and sharpness
We show that, in general, the intrinsic apartness will not be tight or cotransitive.In fact, we cannot expect any tight or cotransitive apartness relation on nontrivial dcpos.To remedy this, we introduce the notion of sharpness and we show (Theorem 68) that the sharp elements do satisfy tightness and cotransitivity for the intrinsic apartness.
Definition 52 (Tightness and cotransitivity).An apartness relation ♯ on a set X is tight if ¬(x ♯ y) implies x = y for every x, y ∈ X.The apartness is cotransitive if x ♯ y implies the disjunction of x ♯ z and x ♯ y for every x, y, z ∈ X.
Lemma 53.If X is a set with a tight apartness, then X is ¬¬-separated, viz.¬¬(x = y) implies x = y for every x, y ∈ X.
It will be helpful to employ the following positive (but classically equivalent) formulation of (x ⊑ y) ∧ (x = y) from (de Jong and Escardó, 2021b, Definition 20).
Definition 54 (Strictly below ⊏).An element x of a dcpo D is strictly below an element y, written x ⊏ y, if x ⊑ y and for every z ⊒ y and proposition P, the equality z = ({x} ∪ {z | P}) implies P.
We can relate the above notion to the intrinsic apartness, but, although we do not have a counterexample, we believe x ⊏ y to be weaker than x # y in general.However, if x is a sharp element of a continuous dcpo, then x ⊏ y does imply x # y, as shown in Proposition 64.Example 56.In the Sierpiński domain S we have ⊥ ⊏ ⊤.In the powerset P(X) of some set X, the empty set is strictly below a subset A of X if and only if A is inhabited.More generally, if A ⊆ B are subsets of some set, then A ⊏ B holds if B \ A is inhabited, and if A is a decidable subset and A ⊏ B, then B \ A is inhabited.
The following shows that we cannot expect any tight or cotransitive apartness relations on nontrivial dcpos.
Theorem 57.Let D be a dcpo with an apartness relation ♯.
(1) If D has elements x ⊏ y, then tightness of ♯ implies excluded middle.
(2) If D has elements x ⊑ y with x ♯ y, then cotransitivity of ♯ implies weak excluded middle. Proof.
(1): If ♯ is tight, then D is ¬¬-separated by Lemma 53, which, since D has elements x ⊏ y, implies excluded middle by (de Jong and Escardó, 2021b, Theorem 38).( 2): For a proposition P, consider the supremum s P of the directed subset {x} ∪ {y | P}.If ♯ is cotransitive, then either x ♯ s P or y ♯ s P .In the first case, x = s P , so that ¬¬P must be the case.In the second case, y = s P , so that ¬P must be true.Hence, ¬P is decidable and weak excluded middle follows.
Theorem 57 works for any apartness relation.The following result specializes to the intrinsic apartness and derives full excluded middle from cotransitivity.
(1) If excluded middle holds, then the intrinsic apartness on any dcpo is tight.In the other direction, if D is a continuous dcpo with elements x ⊑ y that are intrinsically apart, then tightness of the intrinsic apartness on D implies excluded middle.(2) If excluded middle holds, then the intrinsic apartness on any dcpo is cotransitive.In the other direction, if D is a continuous dcpo and has elements x ⊑ y that are intrinsically apart, then cotransitivity of the intrinsic apartness on D implies excluded middle.(3) In particular, if the intrinsic apartness on the Sierpiński domain S is tight or cotransitive, then excluded middle follows. Proof.
(1): If excluded middle holds, then # coincides with = which is easily seen to be tight using excluded middle.Now suppose that D is continuous with elements x ⊑ y such that x # y.By Theorem 57, it satisfies to show that x ⊏ y, but this follows from Proposition 55.
(2): If excluded middle holds, then # coincides with = which is easily seen to be cotransitive using excluded middle.Now suppose that D is continuous with elements x ⊑ y such that x # y.As in the proof of Theorem 57, for any proposition P, consider the supremum s P of the directed subset {x} ∪ {y | P}.If # is cotransitive, then either x # s P or y # s P .If y # s P , then ¬P must be the case, as P implies that y = s P .So suppose that x # s P .Then s P ≤ x, because x ⊑ s P .By Lemma 37, there exists d ∈ D with d ≪ s P and d ⊑ x.Since d ≪ s P , there must exist e ∈ {x} ∪ {y | P} such that d ⊑ e.But d ⊑ x, so e = y and P must be true.Hence, P is decidable.
(3): This follows from the above and the fact that the elements ⊥ ⊑ ⊤ of S are intrinsically apart.
We now isolate a collection of elements, which we call sharp elements, for which the intrinsic apartness is tight and cotransitive.The definition of a sharp element of a continuous dcpo may be somewhat opaque, but the algebraic case (Proposition 62) is easier to understand: an element x is sharp if and only if c ⊑ x is decidable for every compact element c.Sharpness also occurs naturally in our examples in Section 7, e.g. a lower real is sharp if and only if it is located.
Definition 59 (Sharpness).An element x of a dcpo D is sharp if for every y, z ∈ D with y ≪ z we have y ≪ x or z ⊑ x.
Theorem 66 below provides many examples of sharp elements.Our first result is that sharpness in continuous dcpos is equivalent to a seemingly stronger condition.
Proposition 60.An element x of a continuous dcpo D is sharp if and only if for every y, z ∈ D with y ≪ z we have y ≪ x or z ≤ x.
Proof.The right-to-left implication is clear, as z ≤ x implies z ⊑ x.Now suppose that x is sharp and that we have y ≪ z.Using interpolation twice, there exist u, v ∈ D with y ≪ u ≪ v ≪ z.By sharpness of x, we have u ≪ x or v ⊑ x.If u ≪ x, then y ≪ x and we are done; and if v ⊑ x, then z ≤ x by Lemma 37.
As expected, it suffices to check sharpness condition for basis elements, and in the algebraic case, an even simpler criterion is available, as we show now.Proof.This is similar to the proof of Proposition 60, but we use that the interpolants can be found in the basis.
Proposition 62.An element x of an algebraic dcpo D is sharp if and only if for every compact c ∈ D it is decidable whether c ⊑ x holds.
Proof.Suppose that we sharp element x and let c be an arbitrary compact element.By compactness of c and sharpness of x, we have c ≪ x or c ⊑ x, so c ⊑ x is decidable, as desired.Conversely, suppose that c ⊑ x is decidable for every compact element c ∈ D. We use Lemma 61 applied to the basis of compact elements, so let a ≪ b be compact elements.By the decidability assumption, either a ⊑ x or not.In the first case, we get a ≪ x as desired by compactness of a.In the second case, we get b ⊑ x, completing the proof.
Proposition 63.Assuming excluded middle, every element of any dcpo is sharp.The sharp elements of the Sierpiński domain S are exactly ⊥ and ⊤.Hence, if every element of S is sharp, then excluded middle follows.
Proof.Let x be an arbitrary element of a dcpo D and suppose that y and z are elements of D with y ≪ z.By excluded middle, we have z ⊑ x or z ⊑ x.In the latter case, we are done.And if z ⊑ x, then y ≪ z ⊑ x, so y ≪ x.By Proposition 62, an element x ∈ S is sharp if and only if ⊤ = { * } ⊑ x is decidable, so the sharp elements of S are exactly the decidable subsets of { * }.Hence, the only sharp elements of S are ⊥ = / 0 and ⊤.
Sharpness also allows us to prove a converse to Proposition 55: Proposition 64.If x is a sharp element of a continuous dcpo D, then x ⊏ y implies x # y for every element y ∈ D.
Proof.Suppose that x is a sharp element of a continuous dcpo D with x ⊏ y.We are going to show that y ≤ x which implies x # y by definition.By continuity of D and our assumption x ⊏ y, it suffices to prove that d ⊑ {x} ∪ {y | y ≤ x} for every d ≪ y.Given such d ≪ y, we have d ≪ x or y ≤ x by sharpness of x and Proposition 60.In either case we get the desired inequality, completing the proof.
We can relate the notion of sharpness to a notion by Spitters (2010) and (Kawai, 2017, Definition 3.5) of a located subset: A subset V of a poset S is located if for every s, t ∈ S with s ≪ t, we have t ∈ V or s ∈ V .

Proposition 65. An element x of a continuous dcpo is sharp if and only if the filter of Scott open neighbourhoods of x is located in the poset of Scott opens of D.
Proof.Suppose first that ∈ D is sharp.We show that the filter N (x) of Scott open neighbourhoods of x is located in the poset of Scott opens of D. So assume that we have Scott opens U and V with U ≪ V .We must show that x ∈ V or x ∈ U. Using continuity of D, interpolation and Scott openness of V , we can prove that the inclusion V ⊆ { ։ e | e ∈ D, ∃ d∈V d ≪ e} holds.Hence, since also U ≪ V , there are finitely many elements d 1 , d 2 , . . ., d n ∈ V and e 1 , e 2 , . . ., e n ∈ D with d 1 ≪ e 1 , . . ., For every 1 ≤ i ≤ n, we have d i ≪ x or e i ⊑ x by sharpness of x.We can distinguish two cases: either d j ≪ x for some 1 ≤ j ≤ n or e i ⊑ x for every 1 ≤ i ≤ n.If the former holds, then x ∈ ։ d j ⊆ V , so x ∈ V and we are done.And if the latter is the case, then x ∈ U as we had In the first case, we are done immediately.In the second case, assuming v ⊑ x leads to d ≪ x, contradicting ¬(d ≪ x), so v ⊑ x and we are finished too.
The following theorems give examples of sharp elements.
Theorem 66.Let D be a continuous dcpo with a basis B.
(1) Assuming that D is pointed, the least element of D is sharp if B satisfies (δ ⊥ ).
(2) Every element of B is sharp if B satisfies (δ ≪ ) or (δ ⊑ ).In particular, in these cases, the sharp elements are a Scott dense subset of D in the sense of Proposition 17.

If D is algebraic, then we can reverse the implications for the basis of compact elements of D: (3) Assuming that D is pointed, the least element of D is sharp if and only if the set of compact elements of D satisfies (δ ⊥ ). (4) The compact elements of D are sharp if and only if the set of compact elements of D satisfies
(δ ≪ ) or (δ ⊑ ).(3): Suppose that ⊥ is sharp and let c ∈ D be compact.By Proposition 62, it is decidable whether c ⊑ ⊥ holds, so the set of compact elements of D satisfies (δ ⊥ ).( 4): If every compact element is sharp, then the set of compact elements satisfies (δ ⊑ ) by Proposition 62.
( Finally, we see that sharp elements are well-behaved with respect to the intrinsic apartness, because we get tightness and cotransitivity when restricting to sharp elements.

1) An element (x, y) of the product of two dcpos D and E is sharp if and only if x and y are sharp elements of D and E respectively. (2) An element f : D → E of the exponential of two bounded complete, algebraic dcpos D and E is sharp if and only if f (c) is sharp in E for
Theorem 68.
(1) If y is a sharp element of a continuous D, then ¬(x ≤ y) implies x ⊑ y for every x ∈ D. In particular, the intrinsic apartness on a continuous dcpo D is tight on sharp elements.(2) The intrinsic apartness on a continuous dcpo D is cotransitive with respect to sharp elements in the following sense: for every x, y ∈ D and sharp element z ∈ D, we have x # y → (x # z ∨ y # z). Proof.
(1): Suppose that y is sharp with ¬(x ≤ y).We use Lemma 19 to prove x ⊑ y.So let u ∈ D with u ≪ x.Using interpolation, there exists v ∈ D with u ≪ v ≪ x.So by sharpness of y, we have u ≪ y or v ⊑ y.If u ≪ y, then we are done; and if v ⊑ y, then x ≤ y, contradicting our assumption.Now if x and y are both sharp and ¬(x # y), then ¬(x ≤ y) and ¬(y ≤ x).Hence, x ⊑ y and y ⊑ x by the above, from which x = y follows using antisymmetry.
(2): Let x, y ∈ D be such that x # y and z ∈ D any sharp element.Assume without loss of generality that x ≤ y.By Lemma 37 and interpolation, there exist u, v ∈ D with u ≪ v ≪ x and u ⊑ y.Since z is sharp, we have u ≪ z or v ⊑ z.If u ≪ z, then by Lemma 37, we have z ≤ y, so z # y and we are done.If v ⊑ z, then x ≤ z by Lemma 37, so x # z, finishing the proof.
By Theorem 61, the basis elements of a continuous dcpo are sharp in many examples of interest.
The following section provides a very different source of sharp elements.Smyth (2006) explored, in a classical setting, the notion of a constructively maximal element, adapted from (Martin-Löf, 1970).In an unpublished manuscript, Heckmann (1998) arrived at an equivalent notion, assuming excluded middle as noted in (Smyth, 2006, Section 8), and called it strong maximality.Whereas Smyth works directly with abstract bases and rounded ideal completions, we instead work with continuous dcpos.We use a simplification of Smyth's definition, but follow Heckmann's terminology.We show that every strongly maximal element is sharp, compare strong maximality to maximality highlighting connections to sharpness, and study the subspace of strongly maximal elements.

Definition 69 (Hausdorff separation). Two points x and y of a dcpo D are Hausdorff separated if we have disjoint Scott open neighbourhoods of x and y respectively.
Definition 70 (Strong maximality).An element x of a continuous dcpo D is strongly maximal if for every u, v ∈ D with u ≪ v, we have u ≪ x or v and x are Hausdorff separated.
The following gives another source of examples of sharp elements.
Proposition 71.Every strongly maximal element of a continuous dcpo is sharp.
Proof.Let x be a strongly maximal element of a continuous dcpo D and let u, v ∈ D be such that u ≪ v.By strong maximality, we have u ≪ x or v and x are Hausdorff separated.In the first case we are done immediately.And if v and x are Hausdorff separated, then v ⊑ x, because Scott opens are upper sets.Hence, x is sharp, as desired.
(1) The intrinsic apartness on a continuous dcpo D is tight on strongly maximal elements.
(2) The intrinsic apartness on a continuous dcpo D is cotransitive with respect to strongly maximal elements in the following sense: for every x, y ∈ D and strongly maximal element z ∈ D, we have x # y → (x # z ∨ y # z).
Proof.By Proposition 71 and Theorem 68.
Similarly to sharpness, the condition of Definition 70 can be restricted to the basis and simplifies in the case of algebraic dcpos: Smyth's formulation of strong maximality (Smyth, 2006, Definition 4.1) (called constructive maximality there) is somewhat more involved than ours, but it is equivalent, as Proposition 78 shows.
Definition 75 (Refinement x ։ y).We say that two elements x and y of a dcpo D can be refined, written x ։ y, if there exists z ∈ D with x ≪ z and y ≪ z.
On (Smyth, 2006, p. 362), refinement is denoted by x ↑ y, but we prefer x ։ y, because one might want to reserve x ↑ y for the weaker statement that there exists z ∈ D with x, y ⊑ z.In (Smyth, 2006, p. 362), the condition in Lemma 76 is taken as a definition (for basis elements) and such elements a and b are said to lie apart and this notion is denoted by a ♯ b.We now translate Definition 4.1 of (Smyth, 2006)  Finally, we how strong maximality is preserved by taking products and exponentials.
(1) An element (x, y) of the product of two dcpos D and E is strongly maximal if and only if both x and y are strongly maximal elements of D and E respectively.( 2 Note that, unlike in Theorem 67, the converse to Item (2) of Proposition 79 does not hold: the identity on L (N) is strongly maximal, but ⊥ is not.Here L (N) denotes the free pointed dcpo on the set of natural numbers (see Section 7.4), which, classically, is simply the flat dcpo N ∪ {⊥}.d ⊑ y.Now suppose that x ⊑ S. Since ¬P implies x = S, we see that ¬¬P must hold in this case.Hence, ¬P is decidable.
Conversely, suppose that ¬P is decidable.If ¬P holds, then S = x, so S must be sharp since x is by Proposition 71.And if ¬¬P holds, then S = y, and sharpness of S follows from Proposition 71 and strong maximality of y.The final claim follows from Proposition 71 and the fact that we just proved that sharpness of S implies decidability of ¬P.
Proposition 82.Let P be the poset with exactly three elements ⊥ ≤ 0, 1 and 0 and 1 unrelated.If every maximal element of the algebraic dcpo Idl(P) is strongly maximal, then weak excluded middle follows.In the other direction, if excluded middle holds, then every maximal element of Idl(P) is strongly maximal.
Proof.We apply Lemma 81 with x := {⊥, 0} and y := {⊥, 1} in Idl(P).Observe that x and y are apart and that they have a greatest lower bound, namely {⊥}.Thus it remains to show that they are both strongly maximal.We do so for x; the proof for y is similar.We apply Lemma 74 with the basis of compact elements {↓ p | p ∈ P} and so distinguish three cases: Thus, x and y are both strongly maximal, so weak excluded middle follows by Lemma 81.If excluded middle holds, then we can easily prove that all maximal elements of Idl(P) are strongly maximal.
Theorem 4.3 of (Smyth, 2006) states that an element x of a continuous dcpo is strongly maximal if and only if every Lawson neighbourhood of x contains a Scott neighbourhood of x.This requirement on neighbourhoods is, assuming excluded middle, equivalent to the Lawson condition (the Scott topology and the Lawson topology coincide on the subset of maximal elements), as used in (Smyth, 2006, Corollary 4.4) and proved in (Gierz et al., 2003, Lemma V-6.5).Inspecting the proof of Gierz et al. (2003), we believe that excluded middle is essential.However, we can still prove a constructive analogue of (Smyth, 2006, Theorem 4.3), but it requires a positive formulation of the subbasic opens of the Lawson topology, using the relation ≤ rather than ⊑.In the presence of excluded middle, the subset {y ∈ D | x ≤ y} is equal to D \ ↑ x, so with excluded middle the above definition is equivalent to the classical definition of the subbasic Lawson opens as in (Gierz et al., 2003, pp. 211-212).
Theorem 84 (cf.(Smyth, 2006, Theorem 4.3)).An element x of a continuous dcpo is strongly maximal if and only if x is sharp and every Lawson neighbourhood of x contains a Scott neighbourhood of x.
Proof.Let x be a strongly maximal element of a continuous dcpo D. Then x is sharp by Proposition 71.It remains to show that every Lawson neighbourhood of x contains a Scott neighbourhood of x.It suffices to do so for the subbasic Lawson open neighbourhoods of x and in particular for those of the form {d ∈ D | y ≤ d} for y ∈ D. So suppose that we have y ∈ D with y ≤ x.Then there exists u ≪ y with u ⊑ x.By strong maximality of x, we have u ≪ x or y and x are Hausdorff separated.Since u ⊑ x, the first case u ≪ x is impossible.Hence, we have disjoint Scott opens U and V containing x and y respectively.We claim that U ⊆ {d ∈ D | y ≤ d}, which would finish the proof.Since V is a Scott open neighbourhood of y, we can use continuity of D to find v ≪ y with v ∈ V .Now if u ∈ U, then because U and V are disjoint and Scott opens are upper sets, we must have v ⊑ u.Hence, v witnesses that y ≤ u, so that U ⊆ {d ∈ D | y ≤ d}.
Conversely, suppose that x is a sharp element of a continuous dcpo D such that every Lawson neighbourhood of x contains a Scott neighbourhood of x.We prove that x is strongly maximal.So let u, v ∈ D such that u ≪ v.By interpolation, there exist u In the first case we are done, so assume that u By Proposition 63, every element is sharp if excluded middle is assumed, so in that case, we can drop the requirement that x is sharp.Hence, in the presence of excluded middle, we recover (Smyth, 2006, Theorem 4.3) from Theorem 84.

The subspace of strongly maximal elements
The classical interest in strong maximality comes from the fact that, while the subspace of maximal elements may fail to be Hausdorff (Heckmann, 1998, Example 4), the subspace of strongly maximal elements with the relative Scott topology is both Hausdorff and regular (Smyth, 2006, Theorem 4.6).We offer constructive proofs of these claims, with the proviso that the Hausdorff condition is formulated with respect to the intrinsic apartness.
Proposition 85.The subspace of strongly maximal elements of a continuous dcpo D with the relative Scott topology is Hausdorff, i.e. if x and y are strongly maximal, then x # y if and only if there are disjoint Scott opens U and V such that x ∈ U and y ∈ V .
Proof.Let x and y be strongly maximal elements.The right-to-left implication is immediate by definition of the intrinsic apartness.Now suppose that x # y.Using Lemma 37, we can assume without loss of generality that we have d ∈ D with d ≪ x and d ⊑ y.Since y is strongly maximal, we have d ≪ y or x and y are Hausdorff separated.But d ≪ y is impossible, because d ⊑ y.So x and y are Hausdorff separated, as desired.
Proposition 86.The subspace of strongly maximal elements of a continuous dcpo D with the relative Scott topology is regular, i.e. every Scott neighbourhood of a point x ∈ D contains a Scott closed neighbourhood of x.
Proof.We adapt the proof of (Smyth, 2006, Theorem 4.6 (i)), avoiding the use of the axiom of choice.Write StrongMax(D) for the subspace of strongly maximal elements of D and let x be a strongly maximal element.It suffices to prove the claim for basic Scott open neighbourhoods of x.So suppose that x ∈ ։ u for some u ∈ D. By interpolation, there exists Define the Scott open subset V by and the Scott closed subset . So let y ∈ C be strongly maximal.Then u ≪ y holds or v and y are Hausdorff separated.If u ≪ y, then y ∈ ։ u and we are done.So suppose that v and y are Hausdorff separated.We prove that this is impossible.Assume for a contradiction that we have disjoint Scott opens U v and U y containing v and y respectively.Since U v is an upper set, we have As U v and U y are disjoint, we thus get

Examples
In this final section before the conclusion, we illustrate the foregoing notions of intrinsic apartness, sharpness and strong maximality, by studying several natural examples.The first three examples are generalized domain environments in the sense of Heckmann (1998): we consider dcpos D and topological spaces X such that X embeds into the subspace of maximal elements of D. In fact, we will see that X is homeomorphic to the subspace of strongly maximal elements of D. Specifically, we will consider Cantor space, Baire space and the real line.The penultimate example shows that sharpness characterizes exactly those lower reals that are located.The final example showcases another natural embedding of Cantor space into a dcpo constructed using exponentials and the lifting monad.

The Cantor and Baire domains
Fix an inhabited set A with decidable equality.Typically, we will be interested in A = 2 := {0, 1} and A = N. Recall that a finite sequence on A is a function {0, 1, . . ., n − 1} → A for a natural number n ∈ N (for n = 0 we get the empty sequence).An infinite sequence on A is simply a function N → A.
Definition 87 (A and A ).
(1) We write (A * , ) for the poset of finite sequences on A ordered by prefix and A for the ideal completion of (A * , ), which is an algebraic dcpo by Lemma 21. (2) For an infinite sequence α, we write ᾱn for the first n elements of α.Given a finite sequence σ , we write σ ≺ α if σ is an initial segment of α.
(3) We write A for the space A N of infinite sequences on A with the product topology, taking the discrete topologies on N and A. The sets {α ∈ A | σ ≺ α} with σ a finite sequence form a basis of opens for A. Furthermore, the space A has a natural notion of apartness: Definition 88 (Cantor and Baire space/domain).If A = 2, then A is Cantor space and we call A the Cantor domain; and if we take A = N, then A is Baire space and we call A the Baire domain.
Definition 89 (ι).We define an injection ι : Theorem 90.The image of ι is exactly the subset of strongly maximal elements of A .
Conversely, suppose that x ∈ A is strongly maximal.Using induction, we will construct for every natural number n, a finite sequence σ n of length n such that σ n σ n+1 ∈ x.Given such finite sequences, we define the infinite sequence α by ᾱn := σ n and we claim that x = ι(α).The inclusion ι(α) ⊆ x is clear.For the other inclusion, suppose that τ ∈ x.Then by directedness of x, we must have σ k = τ where k = length(τ).Hence, τ ∈ ι(α), as desired.We now describe how to inductively construct each σ n , starting with the empty sequence σ 0 .Assume that we are given σ 0 σ 1 • • • σ m ∈ x of length 0, 1, . . ., m for some natural number m.We construct σ m+1 ∈ x of length m + 1 extending σ m .Since A is assumed to be inhabited, we can extend σ m by some element a ∈ A to get a finite sequence τ of length m + 1.By Lemma 74, either τ ∈ x or ↓ τ and x are Hausdorff separated.If τ ∈ x, then we set σ m+1 := τ.If ↓ τ and x are Hausdorff separated, then by Lemma 76, there exists a finite sequence ρ ∈ x such that ρ and τ agree on the first m indices (since σ m ∈ x), but disagree on index m + 1.We now define σ m+1 to be the extension of σ m by ρ(m + 1).Notice that σ m+1 ∈ x, as desired.
Proposition 91.Suppose that A has at least two elements.If every maximal element of A is strongly maximal, then weak excluded middle holds.
Proof.Let a 0 and a 1 be two nonequal elements of A. We use Lemma 81 with the following elements x := ι( a 0 , a 0 , . . . ) and y := ι( a 1 , a 1 , . . . ) of A .By Theorem 90, the elements x and y are both strongly maximal.Moreover, x and y have a greatest lower bound, namely the singleton containing the empty sequence .Finally, x and y are apart, as witnessed by the disjoint Scott opens ։ { , a 0 } and ։ { , a 1 }.
Example 92.Theorem 90 tells us that functions N → A give strongly maximal elements of A .An example of a maximal element that constructively fails to be strongly maximal is given by a ¬¬-total function.More precisely, suppose that R ⊆ N × A is a single-valued binary relation such that (1) membership of R is decidable, and (2) the relation R is ¬¬-total, i.e. we have ¬¬(∀ n∈N ∃ a∈A (n, a) ∈ R).We define R := {σ ∈ A * | (0, σ 0 ), . . . , (n − 1, σ n−1 ) ∈ R with n the length of σ }.
Then R is a lower set and semidirected by single-valuedness of R, so that R ∈ A .Note that, by Theorem 90, R is not necessarily strongly maximal as R is only ¬¬-total.But we claim that R is maximal.For suppose that x ∈ A is such that R ⊆ x; we show that x ⊆ R.So let σ ∈ x.By our assumption that membership of R is decidable it suffices to check that for every natural number i less than the length of σ we have ¬((i, σ i ) ∈ R).So suppose for a contradiction that there exists an i with (i, σ i ) ∈ R. Since membership of R is decidable, we may assume that i is the least such number.We claim that there is no element a ∈ A for which (i, a) ∈ R holds, which contradicts ¬¬-totality of R. For if a ∈ A were such an element, then we define the sequence τ by extending σ i−1 with a.By the choice of i, we have τ ∈ R and hence τ ∈ x since R ⊆ x.But then a = σ i by semidirectedness of x, but we had (i, σ i ) ∈ R.
Definition 93 (Markov's Principle).Markov's Principle is the assertion that for every infinite binary sequence φ we have that Markov's Principle (Bridges and Richman, 1987) follows from excluded middle, but is independent in constructive mathematics, i.e.Markov's Principle is not provable and neither is its negation.
Theorem 94.For the Cantor domain, the strongly maximal elements are exactly those elements that are both sharp and maximal.For the Baire domain, the strongly maximal elements are exactly the elements that are both sharp and maximal if and only if Markov's Principle holds.
Proof.By Propositions 71 and 80, every strongly maximal element of a continuous dcpo is both sharp and maximal, so it's the assertion that strong maximality follows from the conjunction of sharpness and maximality that matters.
Let x be a sharp and maximal element of the Cantor domain.We prove that x is strongly maximal using Lemma 74.So let σ be a finite binary sequence.We must show that ↓ σ ⊑ x or ↓ σ and x are Hausdorff separated.By sharpness of x and Proposition 62, membership of x is decidable.If σ ∈ x, then ↓ σ ⊑ x holds and we are done.So suppose that σ ∈ x.Then using decidability of membership of x and finiteness of σ , we can find the shortest prefix τ of σ for which τ ∈ x.Assume without loss of generality that τ ends with 0 and write ρ for the sequence obtained by replacing the final 0 in τ by 1.By definition of τ and the fact that x is a maximal ideal, it must be the case that ρ ∈ x.But now ։ (↓ τ) and ։ (↓ ρ) are disjoint Scott opens witnessing Hausdorff separation of ↓ σ and x.So x is strongly maximal, as desired.Now suppose that every sharp and maximal element of the Baire domain is strongly maximal.We show that Markov's Principle follows.Let φ be an infinite binary sequence for which ¬(∀ n∈N φ (n) = 0) holds.We need to find k ∈ N such that φ (k) = 1.Define the following element of the Baire domain By Proposition 62 and the fact that x φ has decidable membership, we see that x φ is sharp.We proceed to show that x φ is maximal.So suppose that we have y in the Baire domain with x φ ⊆ y.We must show that y ⊆ x φ , so let σ ∈ y be a finite sequence of natural numbers.We are going to show that σ ∈ x φ is impossible, which suffices, because membership of x φ is decidable.So assume for a contradiction that σ ∈ x φ .Then σ must be nonempty and σ (0) is not the least m ∈ N for which φ (m) = 1.We are going to show that φ must be zero everywhere, contradicting our assumption.Let n ∈ N be arbitrary.Then either φ (n) = 0 in which case we are done, or φ (n) = 1.We show that the the second case is impossible.For if φ (n) = 1, then we can find k ∈ N such that k is the least natural number m ∈ N for which φ (m) = 1.But then k ∈ x φ , so k ∈ y, but also σ ∈ y while σ (0) = k, contradicting directedness of y.Thus, we have proved that x φ is both sharp and maximal.Hence, by assumption, the element x φ is strongly maximal.By Theorem 90, this means that x φ = ι(α) for some infinite sequence α of natural numbers.But then φ (α(0)) = 1, so α(0) is the sought value.
Conversely, suppose that Markov's Principle holds and let x be a sharp and maximal element of the Baire domain.We prove that x is strongly maximal using Lemma 74.So let σ be a finite sequence of natural numbers.We must show that ↓ σ ⊑ x or ↓ σ and x are Hausdorff separated.By sharpness of x and Proposition 62, membership of x is decidable.If σ ∈ x, then ↓ σ ⊑ x holds and we are done.So suppose that σ ∈ x.Then using decidability of membership of x and finiteness of σ , we can find the longest prefix τ of σ for which τ is still in x.Now, using decidability of membership of x again, consider the infinite binary sequence χ given by Notice that χ cannot be zero everywhere, as this would contradict the assumed maximality of x.Hence, by Markov's Principle, there exists k ∈ N such that τ extended by k is in x.We define ρ to be this extension of τ, so that ρ ∈ x.Then ։ (↓ σ ) and ։ (↓ ρ) are disjoint Scott opens witnessing Hausdorff separation of ↓ σ and x.Hence, x is strongly maximal, as we wished to prove.
Lemma 95.The space A is T 0 -separated with respect to # A , i.e. for α, β ∈ A we have α # A β if and only if there exists an open containing x but not y or vice versa.
Proof.If α # A β , then there exists a natural number n such that ᾱn = βn and {γ ∈ A | ᾱn ≺ γ} is an open containing α but not β .Conversely, suppose that U is an open containing α but not β .By the description of basic opens of A, there exists a finite sequence σ such that σ ≺ α, while σ ⊀ β .Hence, if we take n to be the length of σ , then ᾱn = βn , finishing the proof.
Theorem 96.The map ι is a homeomorphism from the space A of infinite sequences to the space of strongly maximal elements of the algebraic dcpo A with the relative Scott topology.Moreover, ι preserves and reflects apartness: α # A β if and only if ι(α) # A ι(β ) for every two infinite sequences α, β ∈ A.
(by definition of the intrinsic apartness) as desired.
Thus, the intrinsic apartness generalizes the well-known apartness on infinite sequences and in particular those on Cantor and Baire space.

Partial Dedekind reals
The previous section illustrated the theory of the intrinsic apartness and sharp and strongly maximal elements in the algebraic case.For the continuous case, the partial Dedekind reals are a very natural example.We begin by recalling the definition of a (two-sided) Dedekind real number.
Definition 97 (Dedekind real).Given a pair x = (L x , U x ) of subsets of Q, we suggestively write p < x for p ∈ L x and x < q for q ∈ U x .A Dedekind real x is a pair (L x , U x ) of subsets of Q satisfying the following properties: (1) boundedness: there exist p, q ∈ Q such that p < x and x < q; (2) roundedness: for every p ∈ Q, we have p < x ⇐⇒ ∃ r∈Q (p < r) ∧ (r < x) and similarly, for every q ∈ Q, we have x < q ⇐⇒ ∃ s∈Q (s < q) ∧ (x < s); (3) transitivity: for every p, q ∈ Q, if p < x and x < q, then p < q; (4) locatedness: for every p, q ∈ Q with p < q we have p < x or x < q.
Definition 98 (Real line R).The real line R is the topological space of all Dedekind real numbers whose basic opens are given by {x ∈ R | p < x and x < q} for p, q ∈ Q.The space R has a natural notion of apartness, namely: x # R y ⇐⇒ ∃ p∈Q (x < p < y) ∨ (y < p < x).
Definition 99 (Partial Dedekind reals R).Consider the set Q × ) is a continuous dcpo and we refer to its elements as partial Dedekind reals.
Lemma 100.For every two rationals p < q and I ∈ R, we have ↓(p, q) ≪ I if and only if (p, q) ∈ I.In particular, ↓(p, q) ≪ ↓(r, s) if and only if p < r < s < q.
Proof.Suppose that ↓(p, q) ≪ I.By a well-known fact (Abramsky and Jung, 1995, Item 2 of Proposition 2.2.22) of rounded ideals, there exists (p ′ , q ′ ) ∈ I such that ↓(p, q) ⊆ ↓(p ′ , q ′ ).Using roundedness, there exists (r, s) ∈ I such that p ′ < r < s < q ′ .We claim that p < r and s < q, from which (p, q) ∈ I follows as I is a lower set.We use trichotomy on the rationals, so assume for a contradiction that r ≤ p. Then p ′ < p, contradicting ↓(p, q) ⊆ ↓(p ′ , q ′ ).Thus p < r and similarly, s < q, as desired.The converse follows directly from (Abramsky and Jung, 1995, Item 2 of Proposition 2.2.22).
Definition 101 (ι).We define an injection ι : R ֒→ R by ι The map ι is well-defined precisely because a Dedekind real is required to be bounded, rounded and transitive.
Theorem 102.The image of ι is exactly the subset of strongly maximal elements of R.
Proof.Suppose that x is a Dedekind real.We show that ι(x) is strongly maximal in R. We use Lemma 73, so assume that we have rationals p, q, r, s ∈ Q such that ↓(p, q) ≪ ↓(r, s).Then we have p < r < s < q by Lemma 100.By locatedness of x, we have p < x or x < r.If x < r, then there exist rationals u < x < v such that u < v < r, so that the intervals (u, v) and (r, s) don't overlap.Hence, ↓(r, s) and x are seen to be Hausdorff separated using Lemma 76.Now suppose that p < x.We use locatedness of x once more to decide whether s < x or x < q.If s < x, then, similarly to the above, we show that ↓(r, s) and x are Hausdorff separated.And if x < q, then (p, q) ∈ ι(x), so ↓(p, q) ≪ ι(x) by Lemma 100.Thus, ι(x) is strongly maximal in R.
Conversely, suppose that I ∈ R is strongly maximal.Define L := {p ∈ Q | ∃ q∈Q (p, q) ∈ I} and U := {q ∈ Q | ∃ p∈Q (p, q) ∈ I} and set x = (L, U).It is straightforward to show that x is bounded, rounded and transitive.We show that x is also located.So suppose that we have rationals p < q.Then there exist rationals r and s such that ↓(p, q) ≪ ↓(r, s), i.e. p < r < s < q.By strong maximality of I, we have ↓(p, q) ≪ I or ↓(r, s) and I can be Hausdorff separated.If ↓(p, q) ≪ I, then p ∈ L (and q ∈ U) by Lemma 100, so we are done.Now if ↓(r, s) and I are Hausdorff separated, then by Lemma 76, there exist u ∈ L and v ∈ U such that the intervals (r, s) and (u, v) don't overlap.So either s < u or v < r.If s < u, then p < x, and if v < r, then x < q.Thus, x = (L, U) is located and indeed a Dedekind real.Finally, one can verify that ι(x) = I, as desired.
With excluded middle, the image of ι is just the set of maximal elements of R. The following result highlights the constructive strength of locatedness of Dedekind reals.
Proposition 103.If every maximal element of R is strongly maximal, then weak excluded middle holds.
We conjecture that R is similar to the Baire domain in that the strongly maximal elements of R only coincide with the elements that are both sharp and maximal if a constructive taboo holds.
Lemma 104.The Dedekind real numbers are T 0 -separated with respect to # R , i.e. for x, y ∈ R we have x # R y if and only if there exists an open U containing x but not y or vice versa.
Classically, every lower real whose complement is inhabited determines a Dedekind real by the construction above.It is well-known that constructively a lower real may fail to be located.The following result offers a domain-theoretic explanation of that phenomenon.
Theorem 109.A lower real L ∈ L is sharp if and only if the pair (L, U) with U as in Lemma 108 is located.
Proof.Suppose that L ∈ L is sharp and let p < q be rationals.Find r ∈ Q such that p < r < q.By Lemma 107, we have ↓ p ≪ ↓ r ≪ ↓ q.By sharpness, we have ↓ p ≪ L or ↓ r ⊆ L. In the first case, p ∈ L and we are done; and if ↓ r ⊆ L, then r ∈ L, so q ∈ U. Hence, (L, U) is located.For the converse, assume that (L, U) is located.We use Lemma 61 to prove that L is sharp.So let p, q ∈ Q with ↓ p ≪ ↓ q.By Lemma 107, this yields p < q.By locatedness, p ∈ L or q ∈ U.If p ∈ L, then ↓ p ≪ L and we are done; and if q ∈ U, then we have s ∈ Q \ L with s < q so that ↓ q ⊆ L. Hence, L is sharp, as desired.

An alternative domain for Cantor space
An alternative domain for Cantor space is given by embedding Cantor space 2 N into the exponential of free pointed dcpos L (2) L (N) ; we study sharpness for this domain.
Classically, the free pointed dcpo on a set X is given by the flat dcpo X ∪ {⊥}.Constructively, we use the lifting (Escardó and Knapp, 2017) of X and we denote it by L (X).We can explicitly describe the elements of L (X) as partial maps from a singleton to X, but for our present purposes it will be easier to work with the lifting abstractly and only use the following properties, which were proved in (de Jong and Escardó, 2021a) and (de Jong, 2022): • The unit η : X → L (X) is injective for every set X.
• The elements in the image of η are all incomparable in the order of L (X).
• For every map of sets f : X → Y , the functor L yields a Scott continuous function L ( f ) that is strict, i.e.L ( f ) preserves the least element.Also, if L ( f ) = L (g), then f = g by injectivity and naturality of η. • The lifting L (X) is algebraic and bounded complete for every set X. Its compact elements are given by {⊥} ∪ {η(x) | x ∈ X}.
The exponential L (2) L (N) is important in higher-type computability (Escardo, 2008) for instance.What is noteworthy about L (2) L (N) is that, unlike in Section 7.1, it are not the (strongly) maximal elements of L (2) L (N) that matter, but the sharp elements still play an important role.
Theorem 111.Every element in the image of ε is sharp, but not all of them are maximal.Also, not every sharp element is in the image of ε. because elements in the image of η are all incomparable.And η(i) = η(α(n)) holds if and only if i = α(n) does, because η is injective.But i = α(n) is decidable, because 2 has decidable equality.
For the second claim, fix an element i ∈ 2 and consider the constant map n → i as an element of 2 N .Notice that the inequality ε(n → i) ⊑ (x → η(i)) holds in L (2) L (N) .But ε(n → i) is strict, while x → η(i) is not, so ε(n → i) and x → η(i) are not equal and hence, ε(n → i) is not maximal.
Finally, one can check that, for any i ∈ 2, the element x → η(i) in L (2) L (N) is sharp (in fact, it is strongly maximal).But it's not strict, so it cannot be in the image of ε.
Theorem 112.The map ε is a homeomorphism from Cantor space to the image of ε.Moreover, ε preserves and reflects apartness.

Conclusion
Working constructively, we studied continuous dcpos and the Scott topology and introduced notions of intrinsic apartness and sharp elements.We showed that our apartness relation is particularly well-suited for continuous dcpos that have a basis satisfying certain decidability conditions, which hold in examples of interest.For instance, for such continuous dcpos, the Bridges-Vît ¸ǎ apartness topology and the Scott topology coincide.We proved that no apartness on a nontrivial dcpo can be cotransitive or tight unless (weak) excluded middle holds.But the intrinsic apartness is tight and cotransitive when restricted to sharp elements.If a continuous dcpos has a basis satisfying the previously mentioned decidability conditions, then every basis element is sharp.Another class of examples of sharp elements is given by the strongly maximal elements.In fact, strong maximality is closely connected to sharpness and the Lawson topology.For example, an element x is strongly maximal if and only if x is sharp and every Lawson neighbourhood of x contains a Scott neighbourhood of x.Finally, we presented several natural examples of continuous dcpos that illustrated the intrinsic apartness, strong maximality and sharpness.
In future work, it would be interesting to explore whether a constructive and predicative treatment is possible, in particular, in univalent foundations without Voevodsky's resizing axioms as in (de Jong and Escardó, 2021a).Steve Vickers also pointed out two directions for future research.The first is to consider formal ball domains (Gierz et al., 2003, Example V-6.8), which may subsume the partial Dedekind reals example.The second is to explore the ramifications of Vickers' observation that refinability (Definition 75) is decidable, even when the order is not, if the dcpo is algebraic and 2/3 SFP (Vickers, 1989, p. 157).Related to the examples, there is still the question of whether we can derive a constructive taboo from the assumption that strong maximality of a partial Dedekind real follows from having both sharpness and maximality, as discussed right after Proposition 103.Finally, the Lawson topology deserves further investigation within a constructive framework.

Definition 23 (
Product of dcpos D × E).The product D × E of two dcpos D and E is given by their Cartesian product ordered pairwise.The supremum of a directed subset S ⊆ D × E is given by the pair of suprema {x ∈ D | ∃ y∈E (x, y) ∈ S} and {y ∈ D | ∃ x∈D (x, y) ∈ S}.Proposition 24.If D and E are continuous dcpos with bases B D and B E , then B D × B E is a basis for the product D × E. Also, if B D and B E both satisfy (δ ⊥ ), then so does B D × B E , and similarly for (δ ≪ ) and (δ ⊑ ).

Definition 27 (
Step function).Given an element x of a dcpo D and an element y of a pointed dcpo E, the single-step function x ⇒ y : D → E is defined as x ⇒ y (d) := {y | x ⊑ d}.A stepfunction is the supremum of a Kuratowski finite (recall Example 14) subset of single-step functions.Lemma 28.If x is a compact element of D and y is any element of a pointed dcpo E, then the single-step function x ⇒ y : D → E is Scott continuous.If y is also compact, then x ⇒ y is a compact element of the exponential E D .Lemma 29.For every element x of a dcpo D, element y of a pointed dcpo E and Scott continuous function f : D → E, we have x ⇒ y ⊑ f if and only if y ⊑ f (x).

Proposition 32 .
If D is an inhabited algebraic dcpo with basis of compact elements B D and E is a pointed bounded complete algebraic dcpo with basis of compact elements B E , then B := S | S is a bounded Kuratowski finite subset of single-step functions of the form a ⇒ b with a ∈ B D and b ∈ B E .

Lemma 36 .
If x ⊑ y in a dcpo D, then x ≤ y, where ≤ is the specialization order of the Scott topology on D. If D is continuous, then the converse holds too, so ⊑ and ≤ coincide in that case.Proof.The first claim follows because Scott opens are upper sets.Now assume that D is continuous and that x ≤ y.Then ∀ z∈X (x ∈ ։ z → y ∈ ։ z) by Example 9 and hence, x ⊑ y by Lemma 19.Lemma 37.For a continuous dcpo D we have x ≤ y if and only if there exists b ∈ D such that b ≪ x, but b ⊑ y.Moreover, if D has a basis B, then there exists such an element b in B. Proof.Suppose that B (which may be all of D) is a basis for D. If we have b ∈ B with b ≪ x and b ⊑ y, then ։ b is a Scott open containing x, but not y, so x ≤ y.Conversely, if there exists a Scott open U with x ∈ U and y ∈ U, then by Lemma 16, there exists b ∈ B such that x ∈ ։ b ⊆ U. Hence, b ≪ x, but b ⊑ y, for if b ⊑ y, then y ∈ U as U is an upper set, contradicting our assumption.
): If c is compact and c ⊑ x, then ։ c is a Scott open containing c, but not x.With excluded middle, complements of Scott closed subsets are Scott open.In particular, the subset {x ∈ D | x ⊑ y} is Scott open for any element y of a dcpo D. Constructively, we have the following result: Lemma 40.For any element y of a dcpo D, the Scott interior of {x ∈ D | x ⊑ y} is given by the subset {x ∈ D | x ≤ y}, where we recall that x ≤ y means that there exists a Scott open containing x but not y.Proof.Notice that {x ∈ D | x ≤ y} is the same thing as {U ⊆ D | U is Scott open and y ∈ U}, which is a union of opens and therefore open itself.Moreover, {x ∈ D | x ≤ y} is contained in {x ∈ D | x ⊑ y} by Proposition 39.Finally, if V is a Scott open contained in {x ∈ D | x ⊑ y}, then y ∈ V , since y ⊑ y is false.Hence, V ⊆ {U ⊆ D | U is Scott open and y ∈ U} = {x ∈ D | x ≤ y}, completing the proof.Proposition 41.If the complement of every Scott closed subset of the Sierpiński domain S is Scott open, then excluded middle follows.Proof.If the complement of every Scott closed subset of S is Scott open, then x ⊑ y implies x ≤ y for every two points x, y ∈ S by Lemma 40.Hence, excluded middle would follow by Proposition 39.
inhabited, then we see that x # ⊥ by Lemma 37, which would finish the proof.As x is positive, it suffices to prove that x ⊑ S. Since B is a basis, it is enough to prove that b ⊑ S for every b ∈ B with b ≪ x.So suppose that we have b ∈ B with b ≪ x.By the decidability condition (δ ⊥ ), either b = ⊥ or b = ⊥.In the first case, we get b = ⊥ ⊑ S, as desired; and in the second case, we get b ⊑ S because b ∈ S.

Theorem 51 .
Let D be a continuous dcpo with a basis B. Each of the following conditions on the basis B implies that { ։ b | b ∈ B} is a ¬¬-stable basis for the Scott topology on D: (1) For every a, b ∈ B, if ¬¬(a ≪ b), then (a ≪ b).(2) For every a, b ∈ B, if ¬¬(a ⊑ b), then (a ⊑ b).(3) B satisfies (δ ≪ ) (4) B satisfies (δ ⊑ ) Hence, if one of these conditions holds, then the Scott topology on D coincides with the apartness topology on D with respect to the intrinsic apartness, i.e. a subset of D is Scott open if and only if it is nearly open.Proof.The final claim follows from Lemma 50 and the fact that the intrinsic apartness satisfies the reverse Kolmogorov property (by definition).Moreover, (3) implies (1) and (4) implies (2).So it suffices to show that if (1) or (2) holds, then { ։ a | a ∈ B} is a ¬¬-stable basis for the Scott topology on D, viz. that (¬¬ ։ a) • ⊆ ։ a for every a ∈ B. Let a ∈ B be arbitrary and suppose that x ∈ (¬¬ ։ a) • .Using Scott openness and continuity of D, there exists b ∈ B such that b ≪ x and b ∈ ¬¬ ։ a.The latter just says that ¬¬(a ≪ b).So if condition (1) holds, then we get a ≪ b, so a ≪ x and x ∈ ։ a, as desired.Now suppose that condition (2) holds.From ¬¬(a ≪ b), we get ¬¬(a ⊑ b) and hence, a ⊑ b by condition (2).So a ⊑ b ≪ x and x ∈ ։ a, as wished.

Proposition 55 .
If x ⊑ y are elements of a dcpo D with x # y, then x ⊏ y.Proof.Suppose we have x ⊑ y and x # y.Then y ≤ x and hence by Lemma 37, there exists b ∈ D with b ≪ y but b ⊑ x.Now let z ⊒ y be arbitrary and P be a proposition with z = ({x} ∪ {z | P}).We must prove that P holds.Since b ≪ y ⊑ z, we have b ≪ z = ({x} ∪ {z | P}) and hence b ⊑ x or b ⊑ y and P holds.But b ⊑ x, so P must hold, as desired.

Lemma 61 .
An element x of a continuous dcpo D with a basis B is sharp if and only if for every a, b ∈ B with a ≪ b we have a ≪ x or b ⊑ x.
Proof.(1): Suppose first that B satisfies (δ ⊥ ) and let a, b ∈ B with a ≪ b be arbitrary.By assumption, either a = ⊥ or a = ⊥.If a = ⊥, then a ≪ ⊥, by compactness of ⊥ and we are done.If a = ⊥, then a ⊑ ⊥, so b ⊑ ⊥ and we are finished too.(2): Suppose that x ∈ B and let a, b ∈ B with a ≪ b.If B satisfies (δ ≪ ), then either a ≪ x or ¬(a ≪ x).In the first case we are done.In the second case we get b ⊑ x, for if b ⊑ x, then a ≪ b ⊑ x, so a ≪ x, contradicting our assumption.If B satisfies (δ ⊑ ), then either b ⊑ x or b ⊑ x.In the second case we are done.In the first case we get a ≪ b ⊑ x, so a ≪ x and we are done too.Scott density of the sharp elements now follows at once from Proposition 17.
every compact element c : D. Proof.(1): Straightforward as the order is component-wise.(2): Suppose that f : D → E is sharp and let c ∈ D be an arbitrary compact element.By Proposition 62 we have to show that e ⊑ f (c) is decidable for every compact element e ∈ E. But e ⊑ f (c) holds exactly when c ⇒ e ⊑ f by Lemma 29, which is decidable by sharpness of f and Proposition 62 again.For the converse, it suffices, by Propositions 32 and 62, to show that a ⇒ b ⊑ f is decidable for a ∈ D and b ∈ E compact elements.But again this reduces to decidability of b ⊑ f (a) which is implied by the assumed sharpness of f (a).

Lemma 73 .
If a continuous dcpo D has a basis B, then an element x ∈ D is strongly maximal if and only if for every a, b ∈ B with a ≪ b, we have a ≪ x or b and x are Hausdorff separated.Proof.The left-to-right implication is immediate.Conversely, suppose that x satisfies the criterion in the lemma and let u, v ∈ D with u ≪ v. Using interpolation twice, there are a, b ∈ B such that u ≪ a ≪ b ≪ v.By assumption, we have a ≪ x or b and x are Hausdorff separated.If a ≪ x, then u ≪ a ≪ x and we are done.And if b and x are Hausdorff separated, then so are v and x, because Scott opens are upper sets.Lemma 74.An element x of an algebraic dcpo D is strongly maximal if and only if for every compact element c ∈ D, either c ⊑ x or c and x are Hausdorff separated.Proof.The left-to-right implication is clear.So suppose that x satisfies the condition in the lemma.We use Lemma 73 on the basis B of compact elements.So suppose that we have a, b ∈ B with a ≪ b.By assumption and compactness of a, either a ≪ x or a and x are Hausdorff separated.If a ≪ x, then we are done.And if a and x are Hausdorff separated, then so are b and x, because Scott opens are upper sets.

Lemma 76 .
Two elements x and y of a continuous dcpo D are Hausdorff separated if and only if there exist a, b ∈ D with a ≪ x and b ≪ y such that ¬(a ։ b).Moreover, if D has a basis B, then x and y are Hausdorff separated if and only if there exist such elements a and b in B. Proof.Suppose that D has a basis B (which may be all of D) and let x and y be Hausdorff separated elements of D. Then there are two disjoint basic opens containing x and y respectively.Hence, by Lemma 16, there exist a, b ∈ B such that x ∈ ։ aConversely, if we have a, b ∈ B with a ≪ x, b ≪ y and ¬(a ։ b), then ։ a and ։ b are disjoint Scott opens containing x and y respectively.
from ideal completions of abstract bases to continuous dcpos.Definition 77 (Smyth maximality).An element x of a continuous dcpo D is Smyth maximal if for every u, v ∈ D with u ≪ v, there exists d ≪ x such that u ≪ d or the condition in Lemma 76 holds for v and d.Proposition 78.An element x of a continuous D is strongly maximal if and only if x is Smyth maximal.Proof.The right-to-left implication is straightforward thanks to Lemma 76.So suppose that x is strongly maximal and that we have u ≪ v. Then u ≪ x holds or v and x are Hausdorff separated.Suppose first that u ≪ x.Then by interpolation there exists d ∈ D with u ≪ d ≪ x and we are done.Now suppose that v and x are Hausdorff separated.Then we have disjoint Scott opens V and U containing v and x respectively.By continuity of D and Scott openness of U, there exists d ≪ x with d ∈ U.But the opens V and U then witness Hausdorff separation of v and d too, so that Lemma 76 finishes the proof.
) An element f : D → E of the exponential of two bounded complete, algebraic dcpos D and E is strongly maximal if f (c) is strongly maximal in E for every compact element c : D.Proof.(1) is easily verified, so we only give the details for (2).Suppose that f (c) is strongly maximal for every compact element c ∈ D. We show that f is strongly maximal in the exponential E D .By Lemma 74 and Proposition 32, it is enough to prove that for every two compact elements a ∈ D and b ∈ E, we have a ⇒ b ⊑ f or a ⇒ b and f can be Hausdorff separated.Given such elements a and b, we have either b ⊑ f (a) or b and f (a) can be Hausdorff separated by strong maximality of f (a).In the first case we get a ⇒ b ⊑ f by Lemma 29, as desired.In the second case, we get, using Lemma 16, compact elements c, d ∈ E such that f (a) ∈ ։ c and b ∈ ։ d while ։ c ∩ ։ d = / 0. But now ։ a ⇒ c and ։ a ⇒ d are disjoint open neighbourhoods of respectively f and a ⇒ b in E D , finishing the proof.

Definition 83 (
Lawson topology).The subbasic Lawson closed subsets of a dcpo D are the Scott closed subsets and the upper sets of the form ↑ x for x ∈ D. The subbasic Lawson opens are the Scott opens and the sets of the form {y ∈ D | x ≤ y} for x ∈ D.
is a Lawson neighbourhood of x.So by assumption on x, there exists a Scott open neighbourhood U of x contained in {d ∈ D | v ′ ≤ d}.But then U and ։ v ′ are disjoint Scott opens containing x and v respectively.So x and v are Hausdorff separated.
Proof.Let StrongMax(A ) be the space of strongly maximal elements of A with the relative Scott topology.By Theorem 90, the map ι : A → StrongMax(A ) is a bijection.Now let σ be a finite sequence and consider the basic open ։ (↓ σ ) = {x ∈ A | ↓ σ ⊆ x} of A .By Theorem 90, we have ։ (↓ σ ) ∩ StrongMax(A ) = {ι(α) | σ ≺ α}, which is ι applied to a basic open of A. It follows that ι is both open and continuous.Finally, note that α # A β ⇐⇒ ∃ U ⊆ A open separating α and β (by Lemma 95) ⇐⇒ ∃ U ⊆ A open separating ι(α) and ι

Proof.
The basic opens of L (2) L (N) are of the form։ s = ↑ s = { f ∈ L (2) L (N) | s ⊑ f } with s the join of some Kuratowski finite subset {a i ⇒ b i | 0 ≤ i ≤ n − 1} of single-step functions, where a k ∈ {⊥} ∪ {η(n) | n ∈ N} and b k ∈ {⊥} ∪ {η(i) | i ∈ 2}.By Lemma 29, we have s ⊑ f for a function f ∈ L (2) L (N) if and only if b k ⊑ f (a k ) for every 0 ≤ k ≤ n − 1 if and only if i k = α(n k ) for every such k, where β k = η(i k ).Now define the set of indices K := {0 ≤ k ≤ n − 1 | a k , b k = ⊥}.Because ε(α) is strict for every α ∈ 2 N , we see that s ⊑ ε(α) if and only if b k ⊑ ε(α)(a k ) for every k ∈ K.If i ∈ 2 and n ∈ N, then η(i) ⊑ ε(α)(η(n)) holds if and only if i = α(n), by naturality of ε, injectivity of η, and the fact that elements in the image of η are incomparable.Hence, the set ։ s ∩ image(ε) is seen to be ε applied to a basic open of Cantor space.It follows that ε is open and continuous.The proof that ε preserves and reflects apartness is similar to the proof of the second part of Theorem 96.
Suppose that B is a basis of the continuous dcpo D and let U ⊆ D be an arbitrary Scott open.We claim that U as desired.
Lemma 21.If the relation ≺ of an abstract basis (B, ≺) is reflexive, then Idl(B, ≺) is algebraic and its compact elements are exactly those of the form ↓ b for b ∈ B.
).An abstract basis is a pair (B, ≺) such that ≺ is transitive and interpolative: for every b ∈ B, the subset ↓ b := {a ∈ B | a ≺ b} is directed.The rounded ideal completion Idl(B, ≺) of an abstract basis (B, ≺) consists of directed lower sets of (B, ≺), known as (rounded) ideals, ordered by subset inclusion.It is a continuous dcpo with basis {↓ b | b ∈ B} and directed suprema given by unions.
Subsets of the form −A are called nearly open.The apartness topology on X is the topology whose basic opens are the nearly open subsets of X.While the name "nearly open" may suggest otherwise, the apartness topology is coarser than the original topology: Lemma 48 (Proposition 2.2.7 in ibid).Every nearly open subset of X is open in the original topology of X. Definition 49 (¬¬-stable basis).We say that a basis B for a topological space X is ¬¬-stable if U = (¬¬U) • for every open U ∈ B. Note that U ⊆ (¬¬U) • holds for every open U, so the relevant condition is that (¬¬U) • ⊆ U for every basic open U. Examples of such bases will be provided by Theorem 51 below.Lemma 50.If a topological space X equipped with an apartness # satisfies the reverse Kolmogorov property and has a ¬¬-stable basis, then the original topology on X and the apartness topology on X coincide, i.e. a subset of X is open (in the original topology) if and only if it is nearly open.Proof.By Lemma 48, every nearly open subset of X is open in the original topology.So it remains to prove the converse.For this it suffices to prove that every basic open of X is nearly open.So let U be an arbitrary basic open of X.We are going to show that U = −(¬U), which proves the claim, as the latter is nearly open.To this end, observe that