Sharp Elements and the Scott Topology of Continuous Dcpos

06/09/2021
by   Tom de Jong, et al.
0

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îţǎ 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2021

Sharp Elements and Apartness in Domains

Working constructively, we study continuous directed complete posets (dc...
research
12/16/2019

Synthetic topology in Homotopy Type Theory for probabilistic programming

The ALEA Coq library formalizes measure theory based on a variant of the...
research
09/19/2023

Stabilizer-free polygonal and polyhedral virtual elements

Stabilizer-free P_k virtual elements are constructed on polygonal and po...
research
10/08/2019

Sharp uniform lower bounds for the Schur product theorem

By a result of Schur [J. Reine Angew. Math. 1911], the entrywise product...
research
10/11/2019

Constructive Domains with Classical Witnesses

We develop a constructive theory of continuous domains from the perspect...
research
09/03/2021

Continuous Tasks and the Chromatic Simplicial Approximation Theorem

The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy ...

Please sign up or login with your details

Forgot password? Click here to reset