Abstract
Purchase PDF (325 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (1489 K)
doi:10.1016/j.jco.2006.05.002 
Copyright © 2006 Elsevier Inc. All rights reserved.
Effectively open real functions
Received 12 December 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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 Uf[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.
Keywords: Recursion theory; Computable analysis; Open mapping; Topology; Quantifier elimination
Mathematical subject codes: 03F60; 54H05
