Abstract
A function f is continuous iff the pre-image f - 1 [ V ] of any open set V is open again. Dual to this topological property, f is called open iff the image f [ U ] of any open set U is open again. Several classical open mapping theorems in analysis provide a variety of sufficient conditions for openness. By the main theorem of recursive analysis, computable real functions are necessarily continuous. In fact they admit a well-known characterization in terms of the mapping V ↦ f - 1 [ V ] being effective: given a list of open rational balls exhausting V, a Turing Machine can generate a corresponding list for f - 1 [ V ] . Analogously, effective openness requires the mapping U ↦ f [ U ] on open real subsets to be effective. The present work combines real analysis with algebraic topology and Tarski's quantifier elimination to effectivize classical open mapping theorems and to establish several rich classes of real functions as effectively open.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.