Finite-valuation approximable structures: a solution to the Jung--Tix problem of probabilistic powerdomains
arXiv:2608.03073
Abstract
We introduce the category of finite-valuation approximable domains, a full subcategory of continuous domains contained in the category of pointed countably based FS-domains. We prove that is Cartesian closed and closed under both the subprobabilistic and probabilistic valuation powerdomains. Hence the valuation monads and restrict to , yielding a positive answer to the category-existence form of the Jung--Tix problem, a long-standing open problem in domain theory since the 1990s. In particular, we develop a new factorization-approximation framework for constructing objects from a given class of known objects or structures. Applying this method to the class of subprobabilistic powerdomains over finite posets, we construct the class and show that it is closed under Scott-continuous retracts, finite products, function spaces, and monads.
arXiv comment68 pages