Journal article 519 views 36 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!
|
first_indexed |
2022-08-02T12:10:43Z |
---|---|
last_indexed |
2023-01-13T19:21:02Z |
id |
cronfa60705 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2022-08-26T15:48:34.1222995</datestamp><bib-version>v2</bib-version><id>60705</id><entry>2022-08-02</entry><title>Uniform Envelopes</title><swanseaauthors><author><sid>1bf535eaa8d6fcdfbd464a511c1c0c78</sid><firstname>Eike</firstname><surname>Neumann</surname><name>Eike Neumann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2022-08-02</date><deptcode>SCS</deptcode><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.</abstract><type>Journal Article</type><journal>Logical Methods in Computer Science</journal><volume>18</volume><journalNumber>3</journalNumber><paginationStart>8:1</paginationStart><paginationEnd>8:34</paginationEnd><publisher>Centre pour la Communication Scientifique Directe (CCSD)</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint/><issnElectronic>1860-5974</issnElectronic><keywords>computable analysis, discontinuous functions, envelopes, complete lattices</keywords><publishedDay>28</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2022</publishedYear><publishedDate>2022-07-28</publishedDate><doi>10.46298/lmcs-18(3:8)2022</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm>Not Required</apcterm><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.</funders><projectreference/><lastEdited>2022-08-26T15:48:34.1222995</lastEdited><Created>2022-08-02T12:51:14.8111784</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Eike</firstname><surname>Neumann</surname><order>1</order></author></authors><documents><document><filename>60705__25028__ad382d696e9d474f8fa88ea95351fa4d.pdf</filename><originalFilename>60705_VoR.pdf</originalFilename><uploaded>2022-08-26T15:47:31.7421631</uploaded><type>Output</type><contentLength>542635</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>This work is licensed under the Creative Commons Attribution License.</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>https://creativecommons.org/licenses/by/4.0/</licence></document></documents><OutputDurs/></rfc1807> |
spelling |
2022-08-26T15:48:34.1222995 v2 60705 2022-08-02 Uniform Envelopes 1bf535eaa8d6fcdfbd464a511c1c0c78 Eike Neumann Eike Neumann true false 2022-08-02 SCS 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. Journal Article Logical Methods in Computer Science 18 3 8:1 8:34 Centre pour la Communication Scientifique Directe (CCSD) 1860-5974 computable analysis, discontinuous functions, envelopes, complete lattices 28 7 2022 2022-07-28 10.46298/lmcs-18(3:8)2022 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University Not Required 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. 2022-08-26T15:48:34.1222995 2022-08-02T12:51:14.8111784 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Eike Neumann 1 60705__25028__ad382d696e9d474f8fa88ea95351fa4d.pdf 60705_VoR.pdf 2022-08-26T15:47:31.7421631 Output 542635 application/pdf Version of Record true This work is licensed under the Creative Commons Attribution License. true eng https://creativecommons.org/licenses/by/4.0/ |
title |
Uniform Envelopes |
spellingShingle |
Uniform Envelopes Eike Neumann |
title_short |
Uniform Envelopes |
title_full |
Uniform Envelopes |
title_fullStr |
Uniform Envelopes |
title_full_unstemmed |
Uniform Envelopes |
title_sort |
Uniform Envelopes |
author_id_str_mv |
1bf535eaa8d6fcdfbd464a511c1c0c78 |
author_id_fullname_str_mv |
1bf535eaa8d6fcdfbd464a511c1c0c78_***_Eike Neumann |
author |
Eike Neumann |
author2 |
Eike Neumann |
format |
Journal article |
container_title |
Logical Methods in Computer Science |
container_volume |
18 |
container_issue |
3 |
container_start_page |
8:1 |
publishDate |
2022 |
institution |
Swansea University |
issn |
1860-5974 |
doi_str_mv |
10.46298/lmcs-18(3:8)2022 |
publisher |
Centre pour la Communication Scientifique Directe (CCSD) |
college_str |
Faculty of Science and Engineering |
hierarchytype |
|
hierarchy_top_id |
facultyofscienceandengineering |
hierarchy_top_title |
Faculty of Science and Engineering |
hierarchy_parent_id |
facultyofscienceandengineering |
hierarchy_parent_title |
Faculty of Science and Engineering |
department_str |
School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science |
document_store_str |
1 |
active_str |
0 |
description |
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. |
published_date |
2022-07-28T04:19:02Z |
_version_ |
1763754264331550720 |
score |
11.013619 |