DOCSLIB.ORG

The Fixed-Point Property for Represented Spaces Mathieu Hoyrup

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Fixed-Point Property for Represented Spaces Mathieu Hoyrup The fixed-point property for represented spaces Mathieu Hoyrup To cite this version: Mathieu Hoyrup. The fixed-point property for represented spaces. 2021. hal-03117745v1 HAL Id: hal-03117745 https://hal.inria.fr/hal-03117745v1 Preprint submitted on 21 Jan 2021 (v1), last revised 28 Jan 2021 (v2) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The fixed-point property for represented spaces Mathieu Hoyrup Universit´ede Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France [email protected] January 21, 2021 Abstract We investigate which represented spaces enjoy the fixed-point property, which is the property that every continuous multi-valued function has a fixed-point. We study the basic theory of this notion and of its uniform version. We provide a complete characterization of countable-based spaces with the fixed-point property, showing that they are exactly the pointed !-continuous dcpos. We prove that the spaces whose lattice of open sets enjoys the fixed-point property are exactly the countably-based spaces. While the role played by fixed-point free functions in the diagonal argument is well-known, we show how it can be adapted to fixed-point free multi-valued functions, and apply the technique to identify the base-complexity of the Kleene-Kreisel spaces, which was an open problem. 1 Introduction 1.1 The fixed-point property A mathematical space X has the fixed-point property if every function f : X ! X in a certain class has a fixed-point, i.e. some x 2 X such that f(x) = x. This property plays an important role in several branches of mathematics, witnessed by a number of fixed-point theorems asserting identifying spaces enjoying this property. Among the most celebrated results let us cite Brouwer's fixed-point theorem in topology, Schauder's fixed-point theorem in convex analysis, Knaster-Tarski's and Kleene's fixed-point theorems in order theory, Rogers's fixed- point theorem (also called the Recursion theorem) in computability theory. In this article we work in the setting of computable analysis [Wei00], where the main struc- ture is a represented space, and the associated functions are the multi-valued functions (also called multifunctions) that are computable, or more generally continuously realizable (contin- uous for short). If X is a set and h : X ⇒ X is a multifunction then a point x 2 X is a fixed-point of h if x 2 h(x). Therefore, the version of the fixed-point property for computable analysis is the following: Definition 1.1. A represented space X has the fixed-point property if every continuous multifunction h : X ⇒ X has a fixed-point. This paper is an investigation of the following question: Question 1.1. Which represented spaces X enjoy the fixed-point property? It turns out that most represented spaces satisfying the fixed-point property actually enjoy a stronger, uniform version of it, where a fixed-point can be continuously found from the multi- function. We therefore introduce a uniform version of the fixed-point property, which will prove useful. 1 We give a first characterization of the uniform fixed-point property, which implies in par- ticular that its computable version is equivalent to the notion of multi-retraceable represented space recently introduced by Brattka and Gherardi in [BG21]. Theorem (Theorem 4.1). Let X be a represented space. The following conditions are equivalent: • X has the (computable) uniform fixed-point property, • Every (computable) continuous function f :⊆ N ! X has a total (computable) continuous extension. We relate the uniform fixed-point property to the notion of effective discontinuity introduced by Brattka in [Bra20] where it is proved, assuming the Axiom of Determinacy, that discontinuity is equivalent to effective discontinuity. It translates into the following result, explaining why in practice, spaces enjoying the fixed-point property actually enjoy its uniform version. Theorem (Theorem 4.2). Let X be a represented space. Assuming the Axiom of Determinacy, the following conditions are equivalent: • X has the fixed-point property, • X has the uniform fixed-point property. We next give a simple criterion which can be particularly helpful to disprove the fixed- point property, without having to explicitly build a fixed-point free continuous multifunction (here, [Γ](X) is the class of subsets of X whose preimage under the representation has complex- ity Γ, see Definition 2.1). Theorem (Theorem 4.3). Let Γ be a class of the Borel, Hausdorff-Kuratowski or hyperprojective hierarchy on N which is not self-dual, and assume that equality on X has complexity [Γ](X×X). For A ⊆ X: • If A has the fixed-point property then A is not Γˇ-hard, • If A has the uniform fixed-point property then A 2 [Γ](X). We then turn our attention to restricted classes of represented spaces, for which we can give an elegant characterization of the fixed-point property and at the same time show its equivalence with the uniform fixed-point property, without assuming the Axiom of Determinacy. We focus on the class of countably-based T0-spaces, on which a subsequent part of com- putable analysis was first developed (they are central in the book of Weihrauch [Wei00]). We show that among these spaces, the ones with the fixed-point property are exactly the pointed !- continuous dcpos, a very important class of partial orders studied in domain theory (the state- ment involves the notion of t-continuity, which will be explained in due time). Theorem (Theorem 5.1). Let X be a countably-based T0-space. The following statements are equivalent: 1. X has the fixed-point property, 2. X has the uniform fixed-point property, 3. X is a multivalued retract of P(!), 4. X is quasiPolish, has a least element and is t-continuous, 2 5. X is homeomorphic to a pointed !-continuous dcpo endowed with the Scott topology. We also focus on spaces of open sets, on which one can take advantage of the lattice structure to give a very neat characterization of the fixed-point property and again prove its equivalence with its uniform version, without assuming the Axiom of Determinacy. Theorem (Theorem 6.1). Let X be admissibly represented. The following conditions are equiv- alent: • X is countably-based, •O (X) has the uniform fixed-point property, •O (X) has the fixed-point property. 1.2 Diagonal argument In a second part of the article, we give applications of the failure of the fixed-point property. It is well-known that the diagonal argument is related to the fixed-point property, let us give two famous examples: • Cantor's diagonal argument uses the boolean negation : : f0; 1g ! f0; 1g which has no fixed-point to prove that there is no surjection from X to f0; 1gX , • By contraposition, and letting P be the class of partial computable functions, Rogers fixed- point theorem uses the existence of a computable surjection from N to the computable elements of PN to prove that every computable multifunction f : P ⇒ P has a fixed-point. This very general argument has been abstracted by Lawvere in [Law69] using the language of categories. However, applying the diagonal argument using fixed-point free multifunctions is not always straightforward, because it produces a multifunction rather than a function. We show how to overcome this problem and give a few applications of the technique, in particular we identify the base-complexity of Kleene-Kreisel spaces, which we explain now. For each k 2 N (actually, for each countable ordinal), one can define the Kleene-Kreisel hki space Nhki of continuous functionals of order k as follows: Nh0i = N and Nhk + 1i = NN , so that Nh1i = N and Nh2i = (NN)N for instance. It is known that the topology on the Kleene-Kreisel spaces is difficult to understand. It is strictly stronger than the compact-open topology [Hyl79]. It was conjectured for a long time that it is zero-dimensional, but Schr¨odereventually proved in [Sch09b] that it is neither zero-dimensional nor regular. The definition of the topology is implicit, and no explicit char- acterization is currently known. A way to tackle this problem is to understand the intrinsic difficulty of describing the open sets. This is what the base-complexity of a topological space, introduced in [dBSS16], is about: given a topological space, it measures the minimal descriptive complexity of a subset of N from which a basis of the topology can be continuously obtained. 1 The complexity is naturally measured in terms of the (hyper)projective hierarchy (Σα)α over the countable ordinals α. e The base-complexity of Nhαi was essentially unknown, except for the natural upper bound: Nhαi 1 is Σα+1-based, but no lower bound was known. A related problem is about the structure of 1 thee base-complexity hierarchy. It is proved in [dBSS16] that the Σα-based spaces are a proper 1 subclass of the Σα+3-based spaces (Corollary 6.12 in [dBSS16]),e but whether the gap can be reduced is left opene (Problem 6.2 in [dBSS16]). 3 Applying our version of the diagonal argument and the existence of a fixed-point free contin- uous multifunction on O(Nhαi), we prove that for α ≥ 2 the upper bound on the base-complexity 1 1 of Nhαi is optimal, giving an instance of a space that is Σα+1-based but not Σα-based, which shows that the base-complexity hierarchy does not collapse.e e 1 Theorem (Theorem 7.1).
Load more

Recommended publications
  • EPIREFLECTIONS WHICH ARE COMPLETIONS by G
    CAHIERS DE TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES G. C. L. BRUMMER E. GIULI H. HERRLICH Epireflections which are completions Cahiers de topologie et géométrie différentielle catégoriques, tome 33, no 1 (1992), p. 71-93 <http://www.numdam.org/item?id=CTGDC_1992__33_1_71_0> © Andrée C. Ehresmann et les auteurs, 1992, tous droits réservés. L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ CAHIERS DE TOPOLOGIE VOL. XXXIII-1 (1992) ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES EPIREFLECTIONS WHICH ARE COMPLETIONS by G. C. L. BRUMMER, E. GIULI and H. HERRLICH We dedicate this paper to the memory of Siegfried Grässer Resume. Nous axiomatisons la situation ou tout ob jet d’une categorie X a un complete et ou tout plongement dense dans un objet complet quelconque est une r6flexion dans la sous- categorie pleine des objets complets. On dit alors que X admet une sous-categorie S-fermement E-r6flexive. Ici, S est une classe de morphismes de X ayant des propri6t6s analogues aux plongements, et la classe E represente la densite appro- pri6e. Pour le cas E = EpiX nous relions cette notion avec celles de fermeture S-absolue, de S-saturation, et de (E n S)- injectivit6; nous en donnons plusieurs caract6risations, en par- ticulier la pr6servation des S-morphismes; et nous considerons beaucoup d’exemples topologiques et alg6briques.
    [Show full text]
  • [DRAFT] a Peripatetic Course in Algebraic Topology
    [DRAFT] A Peripatetic Course in Algebraic Topology Julian Salazar [email protected]• http://slzr.me July 22, 2016 Abstract These notes are based on lectures in algebraic topology taught by Peter May and Henry Chan at the 2016 University of Chicago Math REU. They are loosely chrono- logical, having been reorganized for my benefit and significantly annotated by my personal exposition, plus solutions to in-class/HW exercises, plus content from read- ings (from May’s Finite Book), books (e.g. May’s Concise Course, Munkres’ Elements of Algebraic Topology, and Hatcher’s Algebraic Topology), Wikipedia, etc. I Foundations + Weeks 1 to 33 1 Topological notions3 1.1 Topological spaces.................................3 1.2 Separation properties...............................4 1.3 Continuity and operations on spaces......................4 2 Algebraic notions5 2.1 Rings and modules................................6 2.2 Tensor products..................................7 3 Categorical notions 11 3.1 Categories..................................... 11 3.2 Functors...................................... 13 3.3 Natural transformations............................. 15 3.4 [DRAFT] Universal properties.......................... 17 3.5 Adjoint functors.................................. 20 1 4 The fundamental group 21 4.1 Connectedness and paths............................. 21 4.2 Homotopy and homotopy equivalence..................... 22 4.3 The fundamental group.............................. 24 4.4 Applications.................................... 26
    [Show full text]
  • Admissibly Represented Spaces and Qcb-Spaces
    Admissibly Represented Spaces and Qcb-Spaces∗ Matthias Schr¨oder Abstract A basic concept of Type Two Theory of Effectivity (TTE) is the notion of an admissibly represented space. Admissibly represented spaces are closely related to qcb-spaces. The latter form a well-behaved subclass of topological spaces. We give a survey of basic facts about Type Two Theory of Effectivity, admissibly represented spaces, qcb-spaces and effective qcb-spaces. Moreover, we discuss the relationship of qcb-spaces to other categories relevant to Computable Analysis. 1 Introduction Computable Analysis investigates computability on real numbers and related spaces. Type Two Theory of Effectivity (TTE) constitutes a popular approach to Com- putable Analysis, providing a rigorous computational framework for non-discrete spaces with cardinality of the continuum (cf. [48, 49]). The basic tool of this frame- work are representations. A representation equips the objects of a given space with names, giving rise to the concept of a represented space. Computable functions be- tween represented spaces are those which are realized by a computable function on the names. The ensuing category of represented spaces and computable functions enjoys excellent closure properties. Any represented space is equipped with a natural topology, turning it into a arXiv:2004.09450v1 [cs.LO] 20 Apr 2020 qcb-space. Qcb-spaces form a subclass of topological spaces with a remarkably rich structure. For example it is cartesian closed, hence products and function spaces can be formed. Admissibility is a notion of topological well-behavedness for representations. The category of admissibly represented spaces and continuously realizable functions is equivalent to the category QCB0 of qcb-spaces with the T0-property.
    [Show full text]
  • Topological Spaces and Observation Frames
    Theoretical Computer Science ELSEVIER Theoretical Computer Science 151 (1995) 79-124 Duality beyond sober spaces: Topological spaces and observation frames Marcello M. Bonsangue a,*, Bart Jacobs b, Joost N. Kok” a Department of Computer Science, Vrge Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam. Netherlands b Centrum voor Wiskunde en Informatica, P.O. Box 94079, 1090 GB Amsterdam, Netherlands c Department of Computer Science, Utrecht University, P.O. Box 80089, 3508 TB Utrecht, Netherlands Abstract We introduce observation frames as an extension of ordinary frames. The aim is to give an abstract representation of a mapping from observable predicates to all predicates of a specific system. A full subcategory of the category of observation frames is shown to be dual to the category of F! topological spaces. The notions we use generalize those in the adjunction between frames and topological spaces in the sense that we generalize finite meets to infinite ones. We also give a predicate logic of observation frames with both infinite conjunctions and disjunctions, just like there is a geometric logic for (ordinary) frames with infinite disjunctions but only finite conjunctions. This theory is then applied to two situations: firstly to upper power spaces, and secondly we restrict the adjunction between the categories of topological spaces and of observation frames in order to obtain dualities for various subcategories of .Fo spaces. These involve nonsober spaces. 1. Introduction A topological duality is a correspondence between two mathematical structures in- volving points and predicates such that isomorphic structures can be identified. Stone [31] first found such a duality between topology and logic.
    [Show full text]
  • The Topology of Path Component Spaces
    The topology of path component spaces Jeremy Brazas October 26, 2012 Abstract The path component space of a topological space X is the quotient space of X whose points are the path components of X. This paper contains a general study of the topological properties of path component spaces including their relationship to the zeroth dimensional shape group. Path component spaces are simple-to-describe and well-known objects but only recently have recieved more attention. This is primarily due to increased qtop interest and application of the quasitopological fundamental group π1 (X; x0) of a space X with basepoint x0 and its variants; See e.g. [2, 3, 5, 7, 8, 9]. Recall qtop π1 (X; x0) is the path component space of the space Ω(X; x0) of loops based at x0 X with the compact-open topology. The author claims little originality here but2 knows of no general treatment of path component spaces. 1 Path component spaces Definition 1. The path component space of a topological space X, is the quotient space π0(X) obtained by identifying each path component of X to a point. If x X, let [x] denote the path component of x in X. Let qX : X π0(X), q(x) = [x2] denote the canonical quotient map. We also write [A] for the! image qX(A) of a set A X. Note that if f : X Y is a map, then f ([x]) [ f (x)]. Thus f determines a well-defined⊂ function f !: π (X) π (Y) given by⊆f ([x]) = [ f (x)].
    [Show full text]
  • Arxiv:2004.02357V2 [Econ.TH] 22 Jun 2021 Final Topology for Preference
    Final topology for preference spaces Pablo Schenone∗ June 23, 2021 Abstract We say a model is continuous in utilities (resp., preferences) if small per- turbations of utility functions (resp., preferences) generate small changes in the model’s outputs. While similar, these two concepts are equivalent only when the topology satisfies the following universal property: for each continuous mapping from preferences to model’s outputs there is a unique mapping from utilities to model’s outputs that is faithful to the preference map and is continuous. The topologies that satisfy such a universal prop- erty are called final topologies. In this paper we analyze the properties of the final topology for preference sets. This is of practical importance since most of the analysis on continuity is done via utility functions and not the primitive preference space. Our results allow the researcher to extrapolate continuity in utility to continuity in the underlying preferences. Keywords: decision theory, topology JEL classification: C02, D5, D01 arXiv:2004.02357v2 [econ.TH] 22 Jun 2021 ∗I wish to thank Kim Border, Laura Doval, Federico Echenique, Mallesh Pai, Omer Tamuz, and participants of the LA theory fest for insightful discussions that helped shape this paper. All remaining errors are, of course, my own. 1 1 Introduction All economic models may be thought of as a mapping from exogenous variables to endogenous variables (henceforth, model outputs or outcomes). For example, in classical demand theory, the exogenous variables are the market prices, the consumer’s wealth, and the consumer’s preferences; the model output is the con- sumer’s demand function.
    [Show full text]
  • A Topological View on Algebraic Computation Models
    © 2017, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ Accepted Manuscript A topological view on algebraic computation models Eike Neumann, Arno Pauly PII: S0885-064X(17)30076-6 DOI: http://dx.doi.org/10.1016/j.jco.2017.08.003 Reference: YJCOM 1338 To appear in: Journal of Complexity Received date : 4 March 2016 Accepted date : 2 August 2017 Please cite this article as: E. Neumann, A. Pauly, A topological view on algebraic computation models, Journal of Complexity (2017), http://dx.doi.org/10.1016/j.jco.2017.08.003 This is a PDF file of an unedited manuscript that has been accepted for publication. As aserviceto our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. A topological view on algebraic computation models Eike Neumanna, Arno Paulyb,c,1 aAston University, Birmingham, UK bUniversity of Cambridge, Cambridge, UK cBirmingham University, Birmingham, UK Abstract We investigate the topological aspects of some algebraic computation mod- els, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable anal- ysis can be. The framework for this is Weihrauch reducibility. As a conse- quence of our characterizations, we establish that the solvability complexity index is (mostly) independent of the computational model, and that there thus is common ground in the study of non-computability between the BSS and TTE setting.
    [Show full text]
  • Arxiv:Math/0603537V3 [Math.GR] 16 Jul 2008
    Final Group Topologies, Kac-Moody Groups and Pontryagin Duality Helge Gl¨ockner, Ralf Gramlich and Tobias Hartnick Abstract. We study final group topologies and their relations to compactness properties. In particular, we are interested in situations where a colimit or direct limit is locally compact, a kω-space, or locally kω. As a first application, we show that unitary forms of complex Kac-Moody groups can be described as the colimit of an amalgam of subgroups (in the category of Hausdorff topological groups, and the category of kω-groups). Our second application concerns Pontryagin duality theory for the classes of almost metrizable topological abelian groups, resp., locally kω topological abelian groups, which are dual to each other. In particular, we explore the relations between countable projective limits of almost metrizable abelian groups and countable direct limits of locally kω abelian groups. Introduction Given a group G and a family (fi)i∈I of maps fi : Xi → G from certain topological spaces to G, there exists a finest group topology on G making all of the maps fi continuous, the so-called final group topology with respect to the family (fi)i∈I . Such topologies arise naturally in connection with colimits of topological groups (notably, direct limits), which carry the final group topology with respect to the family of limit maps. Although a final group topology O always exists, it may be quite elusive in the sense that it may not be clear at all how one could check whether a given subset U ⊆ G belongs to O. For example, consider an ascending sequence G1 ⊆ G2 ⊆ ··· of topological groups such that all inclusion maps are continuous homomorphisms.
    [Show full text]
  • Neighbourhood and Lattice Models of Second-Order Intuitionistic Propositional Logic
    Fundamenta Informaticae 170 (2019) 223–240 223 DOI 10.3233/FI-2019-1861 IOS Press Neighbourhood and Lattice Models of Second-Order Intuitionistic Propositional Logic Toshihiko Kurata∗† Faculty of Business Administration Hosei University 2-17-1 Fujimi, Chiyoda-ku, Tokyo 102-8160, Japan [email protected] Ken-etsu Fujita† Department of Computer Science Gunma University 1-5-1 Tenjin-cho, Kiryu-shi, Gunma 376-8515, Japan [email protected] Abstract. We study a version of the Stone duality between the Alexandrov spaces and the com- pletely distributive algebraic lattices. This enables us to present lattice-theoretical models of second-order intuitionistic propositional logic which correlates with the Kripke models intro- duced by Sobolev. This can be regarded as a second-order extension of the well-known corre- spondence between Heyting algebras and Kripke models in the semantics of intuitionistic propo- sitional logic. Keywords: second-order intuitionistic propositional logic, complete Heyting algebra, complete- ness theorem ∗Address for correspondence: Faculty of Business Administration, Hosei University, 2-17-1 Fujimi, Chiyoda-ku, Tokyo 102-8160, Japan. †This research is dedicated to Professor Paweł Urzyczyn on the occasion of his 65th birthday. The authors are supported by JSPS KAKENHI Grant Number JP17K05343. They also would like to thank the referees for their valuable comments and suggestions. Th is article is published online with Open Access and distributed under the terms of the Creative Commons Attribution Non-Commercial License (CC BY-NC 4.0). 224 T. Kurata and K. Fujita / Neighbourhood and Lattice Models 1. Introduction Taking into account semantic aspects of intuitionistic propositional logic, we can find at least two types of model presentation [1, 2, 3], both of which enable us to show soundness and completeness of the formal system.
    [Show full text]
  • SOBER SPACES and CONTINUATIONS 1. Computational
    Theory and Applications of Categories, Vol. 10, No. 12, 2002, pp. 248–300. SOBER SPACES AND CONTINUATIONS PAUL TAYLOR ABSTRACT. A topological space is sober if it has exactly the points that are dictated by its open sets. We explain the analogy with the way in which computational values are determined by the observations that can be made of them. A new definition of sobriety is formulated in terms of lambda calculus and elementary category theory, with no reference to lattice structure, but, for topological spaces, this coincides with the stan- dard lattice-theoretic definition. The primitive symbolic and categorical structures are extended to make their types sober. For the natural numbers, the additional structure provides definition by description and general recursion. We use the same basic categorical construction that Thielecke, F¨uhrmann and Selinger use to study continuations, but our emphasis is completely different: we concentrate on the fragment of their calculus that excludes computational effects, but show how it nevertheless defines new denotational values. Nor is this “denotational semantics of continuations using sober spaces”, though that could easily be derived. On the contrary, this paper provides the underlying λ-calculus on the basis of which abstract Stone duality will re-axiomatise general topology. The leading model of the new axioms is the category of locally compact locales and continuous maps. Contents 6 Enforcing sobriety 272 1 Computational values 248 7 The structure of SC 277 2 The restricted λ-calculus 255 8 A lambda calculus for sobriety 281 3 Algebras and homomorphisms 259 9 Theory of descriptions 285 4 Sobriety and monadicity 263 10 Sobriety and description 289 5 Topology revisited 267 11 Directions 292 1.
    [Show full text]
  • Time-Varying Vector Fields and Their Flows 3
    Springer Briefs in Mathematics Springer-Verlag, 2014, ISBN 978-3-319-10138-5 http://dx.doi.org/10.1007/978-3-319-10138-5 Time-varying vector fields and their flows Saber Jafarpour∗ Andrew D. Lewisy 26/01/2014 Last updated: 12/06/2014 Abstract Time-varying vector fields on manifolds are considered with measurable time de- pendence and with varying degrees of regularity in state; e.g., Lipschitz, finitely dif- ferentiable, smooth, holomorphic, and real analytic. Classes of such vector fields are described for which the regularity of the flow's dependence on initial condition matches the regularity of the vector field. It is shown that the way in which one characterises these classes of vector fields corresponds exactly to the vector fields, thought of as being vector field valued functions of time, having measurability and integrability properties associated with appropriate topologies. For this reason, a substantial part of the de- velopment is concerned with descriptions of these appropriate topologies. To this end, geometric descriptions are provided of locally convex topologies for Lipschitz, finitely differentiable, smooth, holomorphic, and real analytic sections of vector bundles. In all but the real analytic case, these topologies are classically known. The description given for the real analytic topology is new. This description allows, for the first time, a characterisation of those time-varying real analytic vector fields whose flows depend real analytically on initial condition. Keywords. Time-varying vector fields, topologies for spaces of vector fields, real ana- lyticity AMS Subject Classifications (2010). 32C05, 34A12, 46E10 Contents 1. Introduction2 1.1 Motivation. .2 1.2 An outline of the monograph.
    [Show full text]
  • General Topology Summer Term 2016
    General Topology Summer Term 2016 Michael Kunzinger [email protected] Universit¨atWien Fakult¨atf¨urMathematik Oskar-Morgenstern-Platz 1 A-1090 Wien Preface These are lecture notes for a four hour advanced course on general topology. They assume familiarity with the foundations of the subject, as taught in the two-hour introductory course offered at our faculty. In fact, a number of topics from the introductory course will be repeated here to keep prerequisites minimal. Based on this, detailed proofs are supplied for all results. Nevertheless, the approach taken is rather advanced and theory-oriented, and the overall style is in the Bourbaki spirit (which the subject matter lends itself to quite naturally). Throughout, we mainly follow the standard text [5], with occasional input from other sources (mainly [1] and [3]). Michael Kunzinger, summer term 2016 i Contents Preface i 1 New spaces from old 1 1.1 Subspaces and products . 1 1.2 Initial topologies . 4 1.3 Final topology, quotient topology . 6 1.4 Identification topology, gluing of topological spaces . 8 1.5 Manifolds and topological groups . 10 2 Filters and convergence 13 2.1 Nets . 13 2.2 Filters . 14 2.3 Convergence . 19 3 Separation properties 25 3.1 Separation axioms . 25 3.2 Inheritability of separation properties . 29 3.3 Extension by continuity . 32 4 Normal spaces 35 4.1 Urysohn's lemma . 35 4.2 Extension of continuous maps . 38 4.3 Locally finite systems and partitions of unity . 40 5 Compactness 43 5.1 Compact spaces . 43 5.2 Locally compact spaces .
    [Show full text]