Journal article 668 views 56 downloads
Uniform Envelopes
Logical Methods in Computer Science, Volume: 18, Issue: 3, Pages: 8:1 - 8:34
Swansea University Author: Eike Neumann
-
PDF | Version of Record
This work is licensed under the Creative Commons Attribution License.
Download (529.92KB)
DOI (Published version): 10.46298/lmcs-18(3:8)2022
Abstract
In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function f: X → Y between qcb₀-spaces one can assign a so-called universal envelope which, in a well-defined sense, encodes all...
| Published in: | Logical Methods in Computer Science |
|---|---|
| ISSN: | 1860-5974 |
| Published: |
Centre pour la Communication Scientifique Directe (CCSD)
2022
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa60705 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function f: X → Y between qcb₀-spaces one can assign a so-called universal envelope which, in a well-defined sense, encodes all continuously obtainable information on the function. A universal envelope consists of two continuous functions F: X → L and ξL: Y → L with values in a Σ-split injective space L. Any continuous function with values in an injective space whose composition with the original function is again continuous factors through the universal envelope. However, it is not possible in general to uniformly compute this factorisation. In this paper we propose the notion of uniform envelopes. A uniform envelope is additionally endowed with a map uL: L → ²(Y) that is compatible with the multiplication of the double powerspace monad ² in a certain sense. This yields for every continuous map with values in an injective space a choice of uniformly computable extension. Under a suitable condition which we call uniform universality, this extension yields a uniformly computable solution for the above factorisation problem. Uniform envelopes can be endowed with a composition operation. We establish criteria that ensure that the composition of two uniformly universal envelopes is again uniformly universal. These criteria admit a partial converse and we provide evidence that they cannot be easily improved in general. Not every function admits a uniformly universal uniform envelope. We can however assign to every function a canonical envelope that is in some sense as close as possible to a uniform envelope. We obtain a composition theorem similar to the uniform case. |
|---|---|
| Keywords: |
computable analysis, discontinuous functions, envelopes, complete lattices |
| College: |
Faculty of Science and Engineering |
| Funders: |
This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 731143. |
| Issue: |
3 |
| Start Page: |
8:1 |
| End Page: |
8:34 |