DOCSLIB.ORG

The Realizability Approach to Computable Analysis and Topology

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Realizability Approach to Computable Analysis and Topology The Realizability Approach to Computable Analysis and Topology Andrej Bauer September 2000 CMU-CS-00-164 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee Dana S. Scott, chair Steven M. Awodey Lenore Blum Abbas Edalat Frank Pfenning Submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy This research was sponsored by the National Science Foundation (NSF) under Grant No. CCR-9217549 and the NAFSA Association of International Educators through a generous fellowship. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of the NSF, NAFSA, or the U.S. government. Keywords: computability, realizability, modest sets, constructive and computable analysis and topology To disertacijo posveˇcammojemu oˇcetu, ki je moj prvi in najvplivnejˇsiuˇciteljmatematike. I dedicate this dissertation to my father, who is my first and most influential teacher of mathematics. Abstract In this dissertation, I explore aspects of computable analysis and topology in the frame- work of relative realizability. The computational models are partial combinatory alge- bras with subalgebras of computable elements, out of which categories of modest sets are constructed. The internal logic of these categories is suitable for developing a theory of computable analysis and topology, because it is equipped with a computability pred- icate and it supports many constructions needed in topology and analysis. In addition, a number of previously studied approaches to computable topology and analysis are special cases of the general theory of modest sets. In the first part of the dissertation, I present categories of modest sets and axiomatize their internal logic, including the computability predicate. The logic is a predicative intuitionistic first-order logic with dependent types, subsets, quotients, inductive and coinductive types. The second part of the dissertation investigates examples of categories of modest sets. I focus on equilogical spaces, and their relationship with domain theory and Type Two Effectivity (TTE). I show that domains with totality embed in equilogical spaces, and that the embedding preserves both simple and dependent types. I relate equilogical spaces and TTE in three ways: there is an applicative retraction between them, they share a common cartesian closed subcategory that contains all countably based T0- spaces, and they are related by a logical transfer principle. These connections explain why domain theory and TTE agree so well. In the last part of the dissertation, I demonstrate how to develop computable analysis and topology in the logic of modest sets. The theorems and constructions performed in this logic apply to all categories of modest sets. Furthermore, by working in the internal logic, rather than directly with specific examples of modest sets, we argue abstractly and conceptually about computability in analysis and topology, avoiding the unpleasant details of the underlying computational models, such as G¨odelencodings and representations by sequences. Acknowledgements I thank Professor Dana Scott for being my doctoral advisor. He has treated me with a great deal of kindness, wisdom, and patience. I can only hope to be able to pass the favor on to a student of mine one day. I thank my doctoral committee members for their work and support. I thank Profes- sor Lenore Blum for stimulating discussions and excellent suggestions for future topics of research|I wish I had the time to include them in this dissertation. I thank Professor Abbas Edalat for supporting my work, and for his hospitality when I visited him at the Imperial College in London. I thank Professor Steve Awodey for his friendship and self- less and excellent teaching of category theory and categorical logic. I thank Professor Frank Pfenning for introducing me to constructive and intuitionistic logic, and con- vincing me with exquisite elegance and clarity of thought to embrace the intuitionistic logic. There are numerous research colleagues that I thank for their hospitality, friendship, and working with me: Peter Andrews, Jeremy Avigad, Ulrich Berger, Lars Birkedal, Jens Blanck, Vasco Brattka, Chad Brown, Stephen Brookes, Aurelio Carboni, Douglas Cenzer, Edmund Clarke, Yuri Ershov, Mart´ın Escard´o,Marcelo Fiore, Peter Freyd, Harvey Friedman, Robert Harper, Reinhold Heckmann, Jeff Helzner, Peter Hertling, Jesse Hughes, Martin Hyland, Achim Jung, Elham Kashefi, Mathias Kegelmann, Klaus Keimel, Michal Konecny, Marko Krznari´cJohn Langford, David Lester, Peter Lietz, F. William Lawvere, John Longley, Keye Martin, Mat´ıasMenni, Mike Mislove, Aleks Nanevski, Dag Normann, Jaap van Oosten, Marko Petkovˇsek,TomaˇzPisanski, Martin Raiˇc,Mike Reed, DuˇsanRepovˇs,John Reynolds, Edmund Robinson, Alexander Rohr, Giuseppe Rosolini, Steven Rudich, Matthias Schr¨oder,Alex Simpson, Dieter Spreen, Chris Stone, Thomas Streicher, Matthew Szudzik, AleˇsVavpetiˇc,Klaus Weihrauch, Kevin Watkins, Stephen Wolfram, Xudong Zhao, and anyone else I might have forgotten. My writing a dissertation was as much of an endeavor for me as it was for my friends who stood by me. I am most grateful to my good friend and companion Vandi, my friend and officemate Elly, my housemates, all my other friends in Pittsburgh, my soon-to-be-rich friends in Slovenia, and my family. Contents Introduction 11 1 Categories of Modest Sets 21 1.1 Partial Combinatory Algebras . 21 1.1.1 The First Kleene Algebra N ............................ 23 1.1.2 Reflexive Continuous Posets . 23 1.1.3 The Graph Model P ................................ 24 1.1.4 The Universal Domain U ............................. 27 1.1.5 The Partial Universal Domain V ......................... 28 1.1.6 The Second Kleene Algebra B ........................... 30 1.1.7 PCA over a First-order Structure . 32 1.2 Modest Sets . 35 1.2.1 Modest Sets as Partial Equivalence Relations . 36 1.2.2 Modest Sets as Representations . 37 1.3 Properties of Modest Sets . 37 1.3.1 Finite Limits and Colimits . 38 1.3.2 The Locally Cartesian Closed Structure . 40 1.3.3 The Regular Structure . 42 1.3.4 Projective Modest Sets . 43 1.3.5 Factorization of Morphisms . 45 1.3.6 Inductive and Coinductive Types . 45 1.3.7 The Computability Operator . 51 1.4 Applicative Morphisms . 51 1.4.1 Applicative Adjunction between N and P] .................... 55 1.4.2 Applicative Retraction from (P; P]) to (B; B]).................. 55 1.4.3 Applicative Inclusion from (P; P]) to (U; U])................... 56 1.4.4 Equivalence of (P; P]) and (V; V])......................... 57 1.4.5 Equivalence of Reflexive Continuous Lattices . 58 2 A Logic for Modest Sets 61 2.1 The Logic of Simple Types . 62 2.1.1 First-order Predicate Logic . 62 2.1.2 Maps and Function Spaces . 63 2.1.3 Products . 65 2.1.4 Disjoint Sums . 66 8 2.1.5 The Empty and the Unit Spaces . 67 2.1.6 Subspaces . 68 2.1.7 Quotient Spaces . 70 2.1.8 Factorization of Maps . 72 2.2 The Logic of Complex Types . 74 2.2.1 Dependent Sums and Products . 74 2.2.2 Inductive Spaces . 75 2.2.3 Coinductive Spaces . 77 2.3 Computability, Decidability, and Choice . 80 2.3.1 Computability . 80 2.3.2 Decidable Spaces . 84 2.3.3 Choice Principles . 85 3 The Realizability Interpretation of the Logic in Modest Sets 89 3.1 The Interpretation of Logic . 89 3.2 Simple Types . 93 3.2.1 Function Spaces . 93 3.2.2 Products . 93 3.2.3 Disjoint Sums . 94 3.2.4 The Empty and the Unit Spaces . 94 3.2.5 Subspaces . 94 3.2.6 Quotient Spaces . 95 3.3 Complex Types . 96 3.3.1 Dependent Sums and Products . 96 3.3.2 Inductive and Coinductive Spaces . 96 3.4 The Computability Predicate . 97 3.5 Choice Principles . 98 3.5.1 Markov's Principle . 98 3.5.2 Choice Principles . 98 3.6 The Realizability Operator . 98 4 Equilogical Spaces and Related Categories 105 4.1 Equilogical Spaces . 105 4.1.1 Equilogical Spaces . 106 4.1.2 Effective Equilogical Spaces . 111 4.1.3 Effectively Presented Domains as a Subcategory of Equeff . 117 4.1.4 Domains with Totality as a Subcategory of Equilogical Spaces . 118 4.1.5 Equilogical Spaces as a Subcategory of Domain Representations . 133 4.2 Equilogical Spaces and Type Two Effectivity . 136 4.2.1 Mod(B; B]) as a Subcategory of Effective Equilogical Spaces . 137 4.2.2 Sequential Spaces . 139 4.2.3 Admissible Representations . 141 4.2.4 A Common Subcategory of Equilogical Spaces and Mod(B) . 144 4.3 Sheaves on Partial Combinatory Algebras . 148 4.3.1 Sheaves over a PCA . 148 Contents 9 4.3.2 Functors Induced by Applicative Morphisms . 150 4.3.3 Applicative Retractions Induce Local Maps of Toposes . 151 4.3.4 A Forcing Semantics for Realizability . 151 4.3.5 A Transfer Principle for Modest Sets . 152 5 Computable Topology and Analysis 155 5.1 Countable Spaces . 156 5.2 The Generic Convergent Sequence . 158 5.3 Semidecidable Predicates . 161 5.3.1 Σ-partial Maps and Lifting . 172 5.4 Countably Based Spaces . 175 5.4.1 Countably Based Spaces in Mod(N) . 180 5.5 Real Numbers . 187 5.5.1 Integers and Rational Numbers . 187 5.5.2 The Construction of Cauchy Reals . 188 5.5.3 The Algebraic Structure of Reals . 192 5.5.4 Discontinuity of Real Maps . 201 5.6 Metric Spaces . ..
Load more

Recommended publications
  • On the Topological Aspects of the Theory of Represented Spaces∗
    On the topological aspects of the theory of represented spaces∗ Arno Pauly Clare College University of Cambridge, United Kingdom [email protected] Represented spaces form the general setting for the study of computability derived from Turing ma- chines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented spaces is well-known to exhibit a strong topological flavour. We present an abstract and very succinct introduction to the field; drawing heavily on prior work by ESCARDO´ ,SCHRODER¨ , and others. Central aspects of the theory are function spaces and various spaces of subsets derived from other represented spaces, and – closely linked to these – properties of represented spaces such as compactness, overtness and separation principles. Both the derived spaces and the properties are introduced by demanding the computability of certain mappings, and it is demonstrated that typically various interesting mappings induce the same property. 1 Introduction ∗ Just as numberings provide a tool to transfer computability from N (or f0;1g ) to all sorts of countable structures; representations provide a means to introduce computability on structures of the cardinality of the continuum based on computability on Cantor space f0;1gN. This is of course essential for com- n m k n m putable analysis [66], dealing with spaces such as R, C (R ;R ), C (R ;R ) or general Hilbert spaces [8]. Computable measure theory (e.g. [65, 58, 44, 30, 21]), or computability on the set of countable ordinals [39, 48] likewise rely on representations as foundation. Essentially, by equipping a set with a representation, we arrive at a represented space – to some extent1 the most general structure carrying a notion of computability that is derived from Turing ma- chines2.
    [Show full text]
  • Arxiv:1703.04075V2 [Cs.LO] 14 Mar 2017 Osbc Ote15sadfcsso H Leri Operation Called Algebraic So the the Al Is the 10]
    COMPUTABLE STRUCTURES ON TOPOLOGICAL MANIFOLDS MARCELO A. AGUILAR AND RODOLFO CONDE Instituto de Matem´aticas, Universidad Nacional Aut´onoma de M´exico, Ciudad Universitaria, M´exico D.F. 04510, M´exico e-mail address: [email protected] Instituto de Matem´aticas, Universidad Nacional Aut´onoma de M´exico, Ciudad Universitaria, M´exico D.F. 04510, M´exico e-mail address: [email protected] Abstract. We propose a definition of computable manifold by introducing computabil- ity as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL manifolds respec- tively. Using the framework of computable topology and Type-2 theory of effectivity, we develop computable versions of all the basic concepts needed to define manifolds, like com- putable atlases and (computably) compatible computable atlases. We prove that given a computable atlas Φ defined on a set M, we can construct a computable topological space (M,τΦ, βΦ,νΦ), where τΦ is the topology on M induced by Φ and that the equivalence class of this computable space characterizes the computable structure determined by Φ. The concept of computable submanifold is also investigated. We show that any compact computable manifold which satisfies a computable version of the T2-separation axiom, can be embedded as a computable submanifold of some euclidean space Rq, with a computable embedding, where Rq is equipped with its usual topology and some canonical computable encoding of all open rational balls. 1. Introduction Computability theory over continuous structures began formally in 1936 with the landmark paper of Alan Turing [1] where he defined the notion of a single computable real number: x ∈ R is computable if its decimal expansion can be calculated in the discrete sense, that arXiv:1703.04075v2 [cs.LO] 14 Mar 2017 is, output by a Turing machine.
    [Show full text]
  • Computable Analysis with Applications to Dynamic Systems
    Mathematical Structures in Computer Science (2020), 30, pp. 173–233 doi:10.1017/S096012952000002X ARTICLE Computable analysis with applications to dynamic systems Pieter Collins∗ Department of Data Science and Knowledge Engineering, Maastricht University, Maastricht, The Netherlands ∗Corresponding author. Email: [email protected] (Received 22 December 2018; revised 4 December 2019; accepted 7 January 2020) Abstract Numerical computation is traditionally performed using floating-point arithmetic and truncated forms of infinite series, a methodology which allows for efficient computation at the cost of some accuracy. For most applications, these errors are entirely acceptable and the numerical results are considered trustwor- thy, but for some operations, we may want to have guarantees that the numerical results are correct, or explicit bounds on the errors. To obtain rigorous calculations, floating-point arithmetic is usually replaced by interval arithmetic and truncation errors are explicitly contained in the result. We may then ask the question of which mathematical operations can be implemented in a way in which the exact result can be approximated to arbitrary known accuracy by a numerical algorithm. This is the subject of computable analysis and forms a theoretical underpinning of rigorous numerical computation. The aim of this article is to provide a straightforward introduction to this subject that is powerful enough to answer questions arising in dynamic system theory. Keywords: Computable analysis; Turing machine; dynamic system 1. Introduction In this paper, we develop a theory of computation for continuous mathematics. The aim of this paper is to give an exposition which is explicitly based on Turing machine model of computation, is powerful enough to study real computational problems arising in practice (taken from the areas of dynamical systems and control theory), yet is as straightforward and direct as possible, and uses terminology which is natural in classical topology and analysis.
    [Show full text]
  • A Topological and Domain Theoretical Study of Total Computable Functions
    FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE CENTRE OF EXACT AND EARTH SCIENCES DEPARTMENT OF INFORMATICS AND APPLIED MATHEMATICS GRADUATE PROGRAM IN SYSTEMS AND COMPUTATION A topological and domain theoretical study of total computable functions Claudio Andr´esCallejas Olgu´ın Natal{RN July, 2016 Claudio Andr´esCallejas Olgu´ın A topological and domain theoretical study of total computable functions Doctoral thesis presented to the Graduate Program in Systems and Computation in the Department of Informatics and Applied Mathematics of the Federal University of Rio Grande do Norte as a partial fulfilment for obtaining the degree of Doctor in Computer Science. Line of research: Foundations of Computation Supervisor: Benjam´ınRen´eCallejas Bedregal, PhD Natal{RN July, 2016 Catalogação da Publicação na Fonte. UFRN / SISBI / Biblioteca Setorial Centro de Ciências Exatas e da Terra – CCET. Callejas Olguín, Claudio Andrés. A topological and domain theoretical study of total computable functions / Claudio Andrés Callejas Olguín. - Natal, 2016. 71 f. Advisor: PhD Benjamín René Callejas Bedregal. Thesis (Doctorate degree) – Federal University of Rio Grande do Norte. Centre of Exact and Earth Sciences. Departament of Informatics and Applied Mathematics. Graduate Program in Systems and Computation. 1. Topology – Computer theory – Thesis. 2. Computability – Thesis. 3. Total computable functions – Thesis. 4. Topological spaces – Thesis. 5. Domain theory – Thesis. 6. Algebraic quasi-domains – Thesis. 7. Scott topology – Thesis. I. Bedregal, Benjamín René Callejas. II. Title. RN/UF/BSE-CCET CDU: 004:515.1 To Rafaela, my parents, my brothers and my uncle Benjam´ın. Acknowledgement I am truly thankful to my girlfriend Rafaela without whose permanent encour- agement and support given during the whole path of this doctorate I would not have been able to finish this thesis.
    [Show full text]
  • A Lambda Calculus for Real Analysis
    Journal of Logic & Analysis 2:5 (2010) 1–115 1 ISSN 1759-9008 A lambda calculus for real analysis PAUL TAYLOR Abstract: Abstract Stone Duality is a new paradigm for general topology in which computable continuous functions are described directly, without using set theory, infinitary lattice theory or a prior theory of discrete computation. Every expression in the calculus denotes both a continuous function and a program, and the reasoning looks remarkably like a sanitised form of that in classical topology. This is an introduction to ASD for the general mathematician, with application to elementary real analysis. This language is applied to the Intermediate Value Theorem: the solution of equations for continuous functions on the real line. As is well known from both numerical and constructive considerations, the equation cannot be solved if the function “hovers” near 0, whilst tangential solutions will never be found. In ASD, both of these failures, and the general method of finding solutions of the equation when they exist, are explained by the new concept of overtness. The zeroes are captured, not as a set, but by higher-type modal operators. Unlike the Brouwer degree of a mapping, these are naturally defined and (Scott) continuous across singularities of a parametric equation. Expressing topology in terms of continuous functions rather than using sets of points leads to treatments of open and closed concepts that are very closely lattice- (or de Morgan-) dual, without the double negations that are found in intuitionistic approaches. In this, the dual of compactness is overtness. Whereas meets and joins in locale theory are asymmetrically finite and infinite, they have overt and compact indices in ASD.
    [Show full text]
  • Computable Functional Analysis and Probabilistic Computation with Applications to Numerical Analysis
    Computable Functional Analysis and Probabilistic Computability Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) vorgelegt von Dipl.-Math. Volker Bosserhoff am 2. Oktober 2008 Tag der mündlichen Prüfung: 18. Dezember 2008 Vorsitzender der Kommission: Prof. Dr. Markus Siegle 1. Berichterstatter: Prof. Dr. Peter Hertling 2. Berichterstatter: Prof. Dr. Vasco Brattka 3. Berichterstatter: Prof. Dr. Cornelius Greither 4. Berichterstatter: Prof. DDr. Stefan Schäffler Universität der Bundeswehr München Fakultät für Informatik 2 实事求是 邓小平 „Be practical and realistic.“ Deng Xiaoping 4 Contents 1 Introduction & Overview9 2 Representation-Based Computable Analysis 23 2.1 Computability and naming systems........................ 23 2.1.1 Computability on N and N! ....................... 23 2.1.2 Computability via naming systems.................... 24 2.1.3 Some constructions with naming systems................ 24 2.1.4 Decidability and enumerability via multi-naming systems....... 27 2.2 Computing on topological spaces......................... 28 2.2.1 Spaces with continuous representations are Lindelöf.......... 28 2.2.2 Admissibility............................... 28 2.2.3 Computable T0-spaces.......................... 29 2.2.4 Representations of R ........................... 33 2.3 Computing on metric and regular spaces..................... 33 2.3.1 Computable metric spaces........................ 33 2.3.2 Computably regular spaces and metrization............... 35 2.4 Computing on Banach spaces........................... 36 2.4.1 Computable normed and Banach spaces................. 37 2.4.2 Effective independence.......................... 38 5 6 CONTENTS 2.4.3 Representations of the space of bounded linear operators........ 42 2.4.4 Computable Hilbert spaces........................ 43 2.5 Computing on locally finite Borel measures................... 43 2.5.1 The standard representations....................... 43 2.5.2 The strong representation........................
    [Show full text]
  • Computable Analysis with Applications to Dynamic Systems
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CWI's Institutional Repository Computable Analysis with Applications to Dynamic Systems P.J. Collins MAC-1002 Centrum Wiskunde & Informatica Centrum Wiskunde & Informatica (CWI) is the national research institute for Mathematics and Computer Science. It is sponsored by the Netherlands Organisation for Scientific Research (NWO). CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. Probability, Networks and Algorithms (PNA) Software Engineering (SEN) Modelling, Analysis and Computing (MAC) Information Systems (INS) Copyright © 2010, Centrum Wiskunde & Informatica P.O. Box 94079, 1090 GB Amsterdam (NL) Science Park 123, 1098 XG Amsterdam (NL) Telephone +31 20 592 9333 Telefax +31 20 592 4199 ISSN 1386-3703 Computable Analysis with Applications to Dynamic Systems Pieter Collins 19 May 2010 Abstract In this article we develop a theory of computation for continuous math- ematics. The theory is based on earlier developments of computable analysis, especially that of the school of Weihrauch, and is presented as a model of intuitionistic type theory. Every effort has been made to keep the presentation as simple yet general as possible. The core sub- ject matter of Turing computability and computable analysis should be accessible to non-specialists with a solid background in general topol- ogy and analysis, but important technical results are also proved. To show the potential use of the theory, some simple applications are given to dynamical systems and control theory.
    [Show full text]
  • Foundations for Computable Topology
    Foundations for Computable Topology Paul Taylor 8 April 2009 Abstract Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence between category theory and logic and is potentially applicable to several mathematical disciplines. This method is applied to devising a new paradigm for general topology, called Abstract Stone Duality. We express the duality between algebra and geometry as an abstract monadic adjunction that we turn into a new type theory. To this we add an equation that is satisfied by the Sierpi´nskispace, which plays a key role as the classifier for both open and closed subspaces. In the resulting theory there is a duality between open and closed concepts. This captures many basic properties of compact and closed subspaces, despite the absence of any explicitly infinitary axiom. It offers dual results that link general topology to recursion theory. The extensions and applications of ASD elsewhere that this paper survey include a purely recursive theory of elementary real analysis in which, unlike in previous approaches, the real closed interval [0; 1] in ASD is compact. \In these days the angel of topology and the devil of abstract algebra fight for the soul of every individual discipline of mathematics." (Hermann Weyl.) \Point-set topology is a disease from which the human race will soon recover." (Henri Poincar´e,quoted in Comic Sections by Des MacHale.) \Logic is the hygiene that the mathematician practises to keep his ideas healthy and strong." (Hermann Weyl, quoted in American Mathematical Monthly, volume 100, p 93.) \Mathematics is the queen of the sciences and number theory is the queen of mathematics." (Carl Friedrich Gauss) \Such is the advantage of a well constructed language that its simplified notation often becomes the source of profound theories." (Pierre-Simon Laplace, quoted in Mathematical Maxims and Minims by N.
    [Show full text]