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 ω-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 ω-continuous lattice of closed subsets of the compact Hausdorff space. We demonstrate the applicability of this result with several examples involving Banach spaces.
Original language | English |
---|---|
Pages (from-to) | 536–572 |
Number of pages | 37 |
Journal | Mathematical Structures in Computer Science |
Volume | 33 |
Issue number | 6 |
DOIs | |
Publication status | Published - 4 Aug 2023 |
Keywords
- Robustness
- Continuous Lattices
- Category Theory
- Topology