SearcharxivSearch

arXiv · 2507.18245

On the symmetry behind duality

Abstract

Dualities such as Stone duality and the duality between sober spaces and spatial frames hinge on an interaction between open sets and compact saturated sets. In several important classes of spaces-Stone spaces, spectral spaces, and stably compact spaces-this interaction forms a perfect symmetry, reflected dually as order self-duality. But the class of sober spaces, despite being central to Stone-like dualities, exhibits only a partial symmetry between openness and compactness. This raises a central question: can we enlarge the setting enough to recover a perfect symmetry, while still retaining sober spaces and preserving the conditions that make the sober-spatial-frame duality work? We answer this question affirmatively. We introduce ko-spaces, whose families of open and compact saturated sets satisfy the compatibility needed for duality, and bi-dcpos, a pointfree companion generalizing both spatial frames and continuous domains. We prove that the categories of ko-spaces and distributive bi-dcpos are equivalent (and dually equivalent, too), and that each category carries a symmetry in the form of a self-duality. On spaces, this extends de Groot duality; on domains, it extends Lawson duality. Classical results fall out as special cases: the sober-spatial-frame duality reappears inside our symmetric framework, and continuous domains acquire a presentation akin to that of d-frames. Our work suggests that an appropriate home for Stone-like duality is a fully symmetric two-sorted world in which openness and compactness play on equal footing.

Explore related subjects

Keep this discovery

BibTeXRIS

Marco Abbadini, Achim Jung. 2025-07-24. On the symmetry behind duality. https://arxiv.org/abs/2507.18245

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO