Hostname: page-component-77f85d65b8-8v9h9 Total loading time: 0 Render date: 2026-04-22T14:49:29.084Z Has data issue: false hasContentIssue false

Robustness, Scott continuity, and computability

Published online by Cambridge University Press:  04 August 2023

Amin Farjudian
Affiliation:
School of Computer Science, University of Nottingham Ningbo China, Ningbo, China, 315100
Eugenio Moggi*
Affiliation:
DIBRIS, Genova Univ., Genova, Italy
*
Corresponding author: Eugenio Moggi; Email: moggi@unige.it
Rights & Permissions [Opens in a new window]

Abstract

Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system’s state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust analyses cannot discriminate between a subset of the metric space and its closure; therefore, one can restrict to the complete lattice of closed subsets. When the metric space is compact, the complete lattice of closed subsets ordered by reverse inclusion is $\omega$-continuous, and robust analyses are exactly the Scott-continuous maps. Thus, one can also ask whether a robust analysis is computable (with respect to a countable base). The main result of this paper establishes a relation between robustness and Scott continuity when the metric space is not compact. The key idea is to replace the metric space with a compact Hausdorff space, and relate robustness and Scott continuity by an adjunction between the complete lattice of closed subsets of the metric space and the $\omega$-continuous lattice of closed subsets of the compact Hausdorff space. We demonstrate the applicability of this result with several examples involving Banach spaces.

Information

Type
Paper
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press
Figure 0

Figure 1. Categories of spaces.

Figure 1

Figure 2. Poset-enriched categories.

Figure 2

Figure 3. Partial diagrammatic recast of Proposition 3.6.

Figure 3

Figure 4. Partial diagrammatic recast of Theorem 3.10.

Figure 4

Figure 5. Summary of Examples of Section 4.

Figure 5

Table 1. Some duals and double duals (up to iso)