vix.ing · top · new · best · stats

Finite-valuation approximable structures: a solution to the Jung--Tix problem of probabilistic powerdomains

2026/08/04 by Yuxu Chen, Hui Kou, Zhenchao Lyu
Computer Science · #cs.LO #msc:06B35 #msc:06F30 #msc:18D15 #msc:68Q55 #msc:60B05

paper · pdf

43pages

arxiv created 2026/08/04 · arxiv updated 2026/08/05

Abstract

We introduce the category \(\FVA\) of finite-valuation approximable domains, a full subcategory of continuous domains contained in the category of pointed countably based FS-domains. We prove that \(\FVA\) is Cartesian closed and closed under both the subprobability and probability valuation powerdomains. Hence the valuation monads \(\Vsub\) and \(\Vone\) restrict to \(\FVA\), yielding a positive answer to the generalized form of Jung--Tix problem, one of the longest-standing open problem in domain theory since 1990s. The proof is divided into two steps. First, for every finite poset \(P\), we construct an increasing FS approximate identity on \(\Vsub(P)\), and thereby show that \(\Vsub(P)\) is a countably based FS-domain. Second, we call a domain finite-valuation approximable when its identity is the pointwise supremum of an increasing sequence of maps factoring through spaces \(\Vsub(Pn)\), where each \(Pn\) is finite. A finite-separation saturation theorem and a unified kernel-lifting theorem then show that \(\FVA\) is closed under Scott-continuous retracts, finite products, function spaces, \(\Vsub\), and \(\Vone\).

Citations