Uniformly computable aspects of inner functions: estimation and factorization

Mathematical Logic Quarterly 54 (5):508-518 (2008)

Abstract

The theory of inner functions plays an important role in the study of bounded analytic functions. Inner functions are also useful in applied mathematics. Two foundational results in this theory are Frostman's Theorem and the Factorization Theorem. We prove a uniformly computable version of Frostman's Theorem. We then show that the Factorization Theorem is not uniformly computably true. We then show that for an inner function u with infinitely many zeros, the Blaschke sum of u provides the exact amount of information necessary to compute the factorization of u. Along the way, we prove some uniform computability results for Blaschke products; these results play a key role in the analysis of factorization. We also give some computability results concerning zeros and singularities of analytic functions. We use Type-Two Effectivity as our foundation

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,856

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
12 (#817,014)

6 months
1 (#386,040)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

Similar books and articles

Bounded Iteration and Unary Functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
How Incomputable Is the Separable Hahn-Banach Theorem?Guido Gherardi & Alberto Marcone - 2009 - Notre Dame Journal of Formal Logic 50 (4):393-425.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
A Feasible Theory for Analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Admissible Closures of Polynomial Time Computable Arithmetic.Dieter Probst & Thomas Strahm - 2011 - Archive for Mathematical Logic 50 (5-6):643-660.
Effective Borel Measurability and Reducibility of Functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.
Subrecursion: Functions and Hierarchies.H. E. Rose - 1984 - Oxford University Press.