SearcharxivSearch

arXiv · 2607.25832

Scott Function Spaces under One-Sided FS Assumptions: Counterexamples, Positive Results, and New Directions

Abstract

The class of FS-domains is known to be closed under Scott function spaces when both the source and target are FS-domains. This paper investigates what remains true under one-sided FS assumptions, with particular emphasis on the role of Plotkin's tie. We establish two complementary continuity theorems. First, whenever \(X\) is an FS-domain, the Scott function space \([X\to T]\) is a continuous dcpo. The proof introduces finite-layer truncation maps on Plotkin's tie, which generate directed families of way-below approximants below every Scott-continuous map. Secondly, whenever \(L\) is an FS-domain, the Scott function space \([T\to L]\) is again a continuous dcpo. Here the argument is based on finitely separating approximate identities, together with a finite-control analysis of the two-branch order structure of Plotkin's tie. These two approximation mechanisms are conceptually different but both produce the directed families of way-below approximants required for continuity. To determine the limits of these positive results, we consider the Lawson closed-disk domain. Although \(\Disk^{\top}\) is an FS-domain, the Scott function space \([\Disk^{\top}\to T]\) is shown to be continuous but not itself an FS-domain. This establishes that preservation of continuity is strictly weaker than preservation of the FS property. The paper concludes by identifying the boundaries of the present methods and proposing a unified approximation principle that may provide a general characterization of continuity for Scott function spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Chong Shen, Weng Kin Ho, Xiaoyong Xi, Dongsheng Zhao. 2026-07-28. Scott Function Spaces under One-Sided FS Assumptions: Counterexamples, Positive Results, and New Directions. https://arxiv.org/abs/2607.25832

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

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN