This thesis is a contribution to computable analysis in the tradition of Grzegorczyk, Lacombe, and Weihrauch. The main theorem of computable analysis asserts that any computable function is continuous. The solution operators for many interesting problems encountered in practice turn out to be discontinuous, however. It hence is a natural question how much partial information may be obtained on the solutions of a problem with discontinuous solution operator in a continuous or computable way. We formalise this idea by introducing the notion of continuous envelopes of discontinuous functions. The envelopes of a given function can be partially ordered in a natural way according to the amount of information they encode. We show that for any function between computably admissible represented spaces this partial order has a greatest element, which we call the universal envelope. We develop some basic techniques for the calculation of a suitable representation of the universal envelope in practice. We apply the ideas we have developed to the problem of locating the fixed point set of a continuous self-map of the unit ball in finite-dimensional Euclidean space, and the problem of locating the fixed point set of a nonexpansive self-map of the unit ball in infinite-dimensional separable real Hilbert space.
Date of Award | 5 Mar 2019 |
---|
Original language | English |
---|
Awarding Institution | |
---|
Supervisor | Michal Konecny (Supervisor) |
---|
- computable analysis
- set-valued function
- hyperspace topology
- QCB-space
- complete lattice
Universal envelopes of discontinuous functions
Neumann, E. (Author). 5 Mar 2019
Student thesis: Doctoral Thesis › Doctor of Philosophy