Search arXivSearch

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

Explore connections, maps & timelines

BibTeXRIS

Marco Abbadini, Achim Jung. 2026-07-09. 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO