DOCSLIB.ORG

Domain Theory Corrected and Expanded Version Samson Abramsky1 and Achim Jung2

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Domain Theory Corrected and Expanded Version Samson Abramsky1 and Achim Jung2 Domain Theory Corrected and expanded version Samson Abramsky1 and Achim Jung2 This text is based on the chapter Domain Theory in the Handbook for Logic in Computer Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, published by Clarendon Press, Oxford in 1994. While the numbering of all theorems and definitions has been kept the same, we have included comments and corrections which we have received over the years. For ease of reading, small typo- graphical errors have simply been corrected. Where we felt the original text gave a misleading impression, we have included additional explanations, clearly marked as such. If you wish to refer to this text, then please cite the published original version where possible, or otherwise this on-line version which we try to keep available from the page http://www.cs.bham.ac.uk/˜axj/papers.html We will be grateful to receive further comments or suggestions. Please send them to [email protected] So far, we have received comments and/or corrections from Joseph D. Darcy, Mo- hamed El-Zawawy, Weng Kin Ho, Homeira Pajoohesh, and Dominic van der Zypen. 1Computing Laboratory, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, Eng- land. 2School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT, England. Contents 1 Introduction and Overview 5 1.1 Origins . 5 1.2 Our approach . 7 1.3 Overview . 7 2 Domains individually 10 2.1 Convergence . 10 2.1.1 Posets and preorders . 10 2.1.2 Notation from order theory . 11 2.1.3 Monotone functions . 13 2.1.4 Directed sets . 13 2.1.5 Directed-complete partial orders . 14 2.1.6 Continuous functions . 15 2.2 Approximation . 17 2.2.1 The order of approximation . 18 2.2.2 Bases in dcpo’s . 18 2.2.3 Continuous and algebraic domains . 19 2.2.4 Comments on possible variations . 22 2.2.5 Useful properties . 24 2.2.6 Bases as objects . 25 2.3 Topology . 29 2.3.1 The Scott-topology on a dcpo . 29 2.3.2 The Scott-topology on domains . 30 3 Domains collectively 34 3.1 Comparing domains . 34 3.1.1 Retractions . 34 3.1.2 Idempotents . 35 3.1.3 Adjunctions . 36 3.1.4 Projections and sub-domains . 39 3.1.5 Closures and quotient domains . 40 3.2 Finitary constructions . 41 3.2.1 Cartesian product . 42 3.2.2 Function space . 43 3.2.3 Coalesced sum . 44 3.2.4 Smash product and strict function space . 45 3.2.5 Lifting . 45 3.2.6 Summary . 45 3.3 Infinitary constructions . 46 3.3.1 Limits and colimits . 46 3.3.2 The limit-colimit coincidence . 47 3.3.3 Bilimits of domains . 51 2 4 Cartesian closed categories of domains 54 4.1 Local uniqueness: Lattice-like domains . 55 4.2 Finite choice: Compact domains . 57 4.2.1 Bifinite domains . 57 4.2.2 FS-domains . 60 4.2.3 Coherence . 61 4.3 The hierarchy of categories of domains . 63 4.3.1 Domains with least element . 63 4.3.2 Domains without least element . 65 5 Recursive domain equations 68 5.1 Examples . 68 5.1.1 Genuine equations . 68 5.1.2 Recursive definitions . 68 5.1.3 Data types . 69 5.2 Construction of solutions . 70 5.2.1 Continuous functors . 70 5.2.2 Local continuity . 71 5.2.3 Parameterized equations . 73 5.3 Canonicity . 74 5.3.1 Invariance and minimality . 74 5.3.2 Initiality and finality . 76 5.3.3 Mixed variance . 77 5.4 Analysis of solutions . 79 5.4.1 Structural induction on terms . 79 5.4.2 Admissible relations . 80 5.4.3 Induction with admissible relations . 81 5.4.4 Co-induction with admissible relations . 82 6 Equational theories 85 6.1 General techniques . 85 6.1.1 Free dcpo-algebras . 85 6.1.2 Free continuous domain-algebras . 87 6.1.3 Least elements and strict algebras . 92 6.2 Powerdomains . 93 6.2.1 The convex or Plotkin powerdomain . 93 6.2.2 One-sided powerdomains . 96 6.2.3 Topological representation theorems . 97 6.2.4 Hyperspaces and probabilistic powerdomains . 103 7 Domains and logic 106 7.1 Stone duality . 106 7.1.1 Approximation and distributivity . 106 7.1.2 From spaces to lattices . 109 7.1.3 From lattices to topological spaces . 110 7.1.4 The basic adjunction . 111 3 7.2 Some equivalences . 112 7.2.1 Sober spaces and spatial lattices . 112 7.2.2 Properties of sober spaces . 114 7.2.3 Locally compact spaces and continuous lattices . 116 7.2.4 Coherence . 117 7.2.5 Compact-open sets and spectral spaces . 117 7.2.6 Domains . 119 7.2.7 Summary . 121 7.3 The logical viewpoint . 121 7.3.1 Working with lattices of compact-open subsets . 121 7.3.2 Constructions: The general technique . 126 7.3.3 The function space construction . 130 7.3.4 The Plotkin powerlocale . 132 7.3.5 Recursive domain equations . 136 7.3.6 Languages for types, properties, and points . 137 8 Further directions 145 8.1 Further topics in “Classical Domain Theory” . 145 8.1.1 Effectively given domains . 145 8.1.2 Universal Domains . 145 8.1.3 Domain-theoretic semantics of polymorphism . 146 8.1.4 Information Systems . 146 8.2 Stability and Sequentiality . 147 8.3 Reformulations of Domain Theory . 147 8.3.1 Predomains and partial functions . 148 8.3.2 Computational Monads . 149 8.3.3 Linear Types . 149 8.4 Axiomatic Domain Theory . 150 8.5 Synthetic Domain Theory . 151 9 Guide to the literature 152 References 153 Index 165 4 1 Introduction and Overview 1.1 Origins Let us begin with the problems which gave rise to Domain Theory: 1. Least fixpoints as meanings of recursive definitions. Recursive definitions of procedures, data structures and other computational entities abound in program- ming languages. Indeed, recursion is the basic effective mechanism for describ- ing infinite computational behaviour in finite terms. Given a recursive definition: X = :::X::: (1) How can we give a non-circular account of its meaning? Suppose we are work- ing inside some mathematical structure D. We want to find an element d 2 D such that substituting d for x in (1) yields a valid equation. The right-hand-side of (1) can be read as a function of X, semantically as f : D ! D. We can now see that we are asking for an element d 2 D such that d = f(d)—that is, for a fixpoint of f. Moreover, we want a uniform canonical method for constructing such fixpoints for arbitrary structures D and functions f : D ! D within our framework. Elementary considerations show that the usual categories of math- ematical structures either fail to meet this requirement at all (sets, topological spaces) or meet it in a trivial fashion (groups, vector spaces). 2. Recursive domain equations. Apart from recursive definitions of computa- tional objects, programming languages also abound, explicitly or implicitly, in recursive definitions of datatypes. The classical example is the type-free ¸- calculus [Bar84]. To give a mathematical semantics for the ¸-calculus is to find a mathematical structure D such that terms of the ¸-calculus can be interpreted as elements of D in such a way that application in the calculus is interpreted by function application. Now consider the self-application term ¸x:xx. By the usual condition for type-compatibility of a function with its argument, we see that if the second occurrence of x in xx has type D, and the whole term xx has type D, then the first occurrence must have, or be construable as having, type [D ¡! D]. Thus we are led to the requirement that we have [D ¡! D] =» D: If we view [: ¡! :] as a functor F : Cop £ C ! C over a suitable category C of mathematical structures, then we are looking for a fixpoint D =» F (D; D). Thus recursive datatypes again lead to a requirement for fixpoints, but now lifted to the functorial level. Again we want such fixpoints to exist uniformly and canonically. This second requirement is even further beyond the realms of ordinary mathemati- cal experience than the first. Collectively, they call for a novel mathematical theory to serve as a foundation for the semantics of programming languages. 5 A first step towards Domain Theory is the familiar result that every monotone function on a complete lattice, or more generally on a directed-complete partial or- der with least element, has a least fixpoint. (For an account of the history of this result, see [LNS82].) Some early uses of this result in the context of formal lan- guage theory were [Ard60, GR62]. It had also found applications in recursion theory [Kle52, Pla64]. Its application to the semantics of first-order recursion equations and flowcharts was already well-established among Computer Scientists by the end of the 1960’s [dBS69, Bek69, Bek71, Par69]. But Domain Theory proper, at least as we un- derstand the term, began in 1969, and was unambiguously the creation of one man, Dana Scott [Sco69, Sco70, Sco71, Sco72, Sco93]. In particular, the following key insights can be identified in his work: 1. Domains as types. The fact that suitable categories of domains are cartesian closed, and hence give rise to models of typed ¸-calculi. More generally, that domains give mathematical meaning to a broad class of data-structuring mecha- nisms. 2. Recursive types.
Load more

Recommended publications
  • Compact Topologically Torsion Elements of Topological Abelian Groups Peter Loth Sacred Heart University, [email protected]
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Sacred Heart University: DigitalCommons@SHU Sacred Heart University DigitalCommons@SHU Mathematics Faculty Publications Mathematics 2005 Compact Topologically Torsion Elements of Topological Abelian Groups Peter Loth Sacred Heart University, [email protected] Follow this and additional works at: http://digitalcommons.sacredheart.edu/math_fac Part of the Algebra Commons, and the Set Theory Commons Recommended Citation Loth, P. (2005). Compact topologically torsion elements of topological abelian groups. Rendiconti del Seminario Matematico della Università di Padova, 113, 117-123. This Peer-Reviewed Article is brought to you for free and open access by the Mathematics at DigitalCommons@SHU. It has been accepted for inclusion in Mathematics Faculty Publications by an authorized administrator of DigitalCommons@SHU. For more information, please contact [email protected], [email protected]. REND. SEM. MAT. UNIV. PADOVA, Vol. 113 (2005) Compact Topologically Torsion Elements of Topological Abelian Groups. PETER LOTH (*) ABSTRACT - In this note, we prove that in a Hausdorff topological abelian group, the closed subgroup generated by all compact elements is equal to the closed sub­ group generated by all compact elements which are topologically p-torsion for some prime p. In particular, this yields a new, short solution to a question raised by Armacost [A]. Using Pontrjagin duality, we obtain new descriptions of the identity component of a locally compact abelian group. 1. Introduction. All considered groups in this paper are Hausdorff topological abelian groups and will be written additively. Let us establish notation and ter­ minology. The set of all natural numbers is denoted by N, and P is the set of all primes.
    [Show full text]
  • Z-Continuous Posets
    DISCRETE MATHEMATICS ELSEVIERI Discrete Mathematics 152 (1996) 33-45 Z-continuous posets Andrei Baranga Department ofMathematics, University ofBucharest, Str. Academiei 14, 70109, Bucharest, Romania Received 19 July 1994 Abstract The concept of 'subset system on the category Po of posets (Z-sets) was defined by Wright, Wagner and Thatcher in 1978. The term Z-set becomes meaningful if we replace Z by 'directed', 'chain', 'finite'. At the end of the paper (Wright et al. 1978), the authors suggested an attempt to study the generalized counterpart of the term 'continuous poset (lattice)' obtained by replacing directed sets by Z-sets, Z being an arbitary subset system on Po. We present here some results concerning this investigation. These results are generalized counterparts of some purely order theoretical facts about continuous posets. Keywords: Poset; Subset system; Z-set; Continuous poset; Continuous lattice; Algebraic poset; Algebraic lattice; Moore family; Closure operator; Ideal; Z-inductive poset Introduction The concept of 'subset system on the category Po of posets' (Z-sets) was defined by Wright et al. in [12]. The term Z-set becomes meaningful if we replace Z by 'directed', 'chain', 'finite', etc. On the other hand, the concept of continuous lattice was defined by Scott in [9] in a topological manner as a mathematical tool in computation theory (see [10, 11]) although it has appeared in other fields of mathematics as well, such as general topology, analysis, algebra, category theory, logic and topological algebra (see [4]), This concept was defined later in purely order theoretical terms (see [8]) and now this definition has became the one used in almost all references.
    [Show full text]
  • Completeness and Compact Generation in Partially Ordered Sets
    Available online at www.isr-publications.com/jmcs J. Math. Computer Sci. 16 (2016), 69{76 Research Article Completeness and compact generation in partially ordered sets A. Vaezia, V. Kharatb aDepartment of Mathematics, University of Mazandaran, P. O. Box 95447, Babolsar, Iran. bDepartment of Mathematics, University of Pune, Pune 411007, India. Abstract In this paper we introduce a notion of density in posets in a more general fashion. We also introduce completeness in posets and study compact generation in posets based on such completeness and density. c 2016 All rights reserved. Keywords: U-density, U-complete poset, U-compactly generated poset, U-regular interval. 1. Introduction We begin with the necessary definitions and terminologies in a poset P . An element x of a poset P is an upper bound of A ⊆ P if a ≤ x for all a 2 A. A lower bound is defined dually. The set of all upper bounds of A is denoted by Au (read as, A upper cone), where Au = fx 2 P : x ≤ a for every a 2 Ag and dually, we have the concept of a lower cone Al of A. If P contains a finite number of elements, it is called a finite poset. A subset A of a poset P is called a chain if all the elements of A are comparable. A poset P is said to be of length n, where n is a natural number, if there is a chain in P of length n and all chains in P are of length n. A poset P is of finite length if it is of length n for some natural number n.
    [Show full text]
  • Part II Topological Dualities
    Part II Top ological dualities Chapter Top ology and armative predicates In the rst part of this monograph we considered predicates to be subsets of an abstract set of states If we think of the states as the denotations of results of computations of programs then predicates b ecome computationally mean ingful in the sense that we can use partial information ab out a computation to tell whether or not a predicate holds for that computation A predicate for which only nite information ab out a computation is needed to arm whether it holds is called an armative predicate The set of armative predicates is closed under nite intersections and ar bitrary unions Hence armative predicates can be identied with the op en sets of a top ological space The idea that op en sets are observable predi cates was prop osed by Smyth in although it is also brie y mentioned in Smyth interprets op en sets as semidecidable prop erties in some eectively given top ological space More generally op en sets can be inter preted as nitely observable predicates Alp ern and Schneider and Kwiatkowska use op en sets as nite liveness predicates and closed sets as safety predicates to formalize the informal characterization of liveness and safety prop erties of Lamp ort The name armative predicates has b een intro duced by Vickers for denoting the abstract op en sets of a frame Armative predicates are also called veriable predicates by Rewitzky who uses the term observable for predicates which are b oth armative and refutative Bonsangue In this chapter we intro
    [Show full text]
  • Spatio-Temporal Domains: an Overview David Janin
    Spatio-temporal domains: an overview David Janin To cite this version: David Janin. Spatio-temporal domains: an overview. 2018. hal-01634897v2 HAL Id: hal-01634897 https://hal.archives-ouvertes.fr/hal-01634897v2 Preprint submitted on 17 Jul 2018 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. Spatio-temporal domains: an overview David Janin? UMR LaBRI, Bordeaux INP Université de Bordeaux [email protected] Abstract. We consider the possibility of defining a general mathemat- ical framework for the homogeneous modeling and analysis of hetero- geneous spatio-temporal computations as they occur more and more in modern computerized systems of systems. It appears that certain fibra- tions of posets into posets, called here spatio-temporal domains, eventu- ally provide a fully featured category that extends to space and time the category of cpos and continuous functions, aka Scott Domains, used in classical denotational semantics. 1 Introduction Research context. Program semantics is classically divided between two com- plementary approaches : denotational semantics and operational semantics. De- notational semantics generally refers to what the partial functions encoded by programs are : what is the relationship between (models of) their input val- ues (or input memory state) and their output values (or output memory state).
    [Show full text]
  • ORDER-TOPOLOGICAL LATTICES ' by MARCEL ERNE
    ORDER-TOPOLOGICAL LATTICES ' by MARCEL ERNE (Received 31 October, 1978) 1. Introduction and basic concepts. The observation that convergence of real sequ- ences may be defined in terms of limits inferior and limits superior as by means of neighbourhoods in the Euclidean topology leads to the question: for which lattices does order convergence coincide with convergence in the order topology? This problem has been attacked by D. C. Kent [10], A. Gingras [7] and others. We hope to present a satisfactory solution in this paper. Although there are known several characterizations of lattices, with topological order convergence (cf. Propositions 1, 2), an evaluation of these criteria already requires some knowledge of the order topology of the given lattice. In the i present paper, we establish a purely lattice-theoretical description of those lattices for which order convergence is not only topological, but moreover, the lattice operations are continuous. Henceforth, such lattices will be referred to as order-topological lattices. All convergence statements will be formulated in terms of filters rather than nets. For an introduction to convergence functions, the reader may consult D. C. Kents's paper [9]. Let L be any lattice, partially ordered by an order relation <. For a subset Y of L, let Yl and YT denote the set of all lower and upper bounds for Y, respectively. If x is the join (i.e. the least upper bound) of Y then we indicate this by the symbol x = V Y. Similarly, we write x = A, Y if x is the meet (i.e. the greatest lower bound) of Y.
    [Show full text]
  • On the Categorical Semantics of Elementary Linear Logic
    Theory and Applications of Categories, Vol. 22, No. 10, 2009, pp. 269{301. ON THE CATEGORICAL SEMANTICS OF ELEMENTARY LINEAR LOGIC OLIVIER LAURENT Abstract. We introduce the notion of elementary Seely category as a notion of cate- gorical model of Elementary Linear Logic (ELL) inspired from Seely's de¯nition of models of Linear Logic (LL). In order to deal with additive connectives in ELL, we use the ap- proach of Danos and Joinet [DJ03]. From the categorical point of view, this requires us to go outside the usual interpretation of connectives by functors. The ! connective is decomposed into a pre-connective ] which is interpreted by a whole family of functors (generated by id, ­ and &). As an application, we prove the strati¯ed coherent model and the obsessional coherent model to be elementary Seely categories and thus models of ELL. Introduction The goal of implicit computational complexity is to give characterizations of complexity classes which rely neither on a particular computation model nor on explicit bounds. In linear logic (LL) [Gir87], the introduction of the exponential connectives gives a precise status to duplication and erasure of formulas (the qualitative analysis). It has been shown that putting constraints on the use of exponentials permits one to give a quantitative analysis of the cut elimination procedure of LL and to de¯ne light sub-systems of LL characterizing complexity classes (for example BLL [GSS92], LLL [Gir98] or SLL [Laf04] for polynomial time and ELL [Gir98, DJ03] for elementary time). In order to have a better understanding of the mathematical structures underlying these systems, various proposals have been made in the last years with the common goal of de¯ning denotational models of light systems [MO00, Bai04, DLH05, LTdF06, Red07].
    [Show full text]
  • Compact Topologies on Locally Presentable Categories Cahiers De Topologie Et Géométrie Différentielle Catégoriques, Tome 38, No 3 (1997), P
    CAHIERS DE TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES PANAGIS KARAZERIS Compact topologies on locally presentable categories Cahiers de topologie et géométrie différentielle catégoriques, tome 38, no 3 (1997), p. 227-255 <http://www.numdam.org/item?id=CTGDC_1997__38_3_227_0> © Andrée C. Ehresmann et les auteurs, 1997, 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/ CAHIER DE TOPOLOGIE ET J Illume XXXVIII-3 (1997) GEOMETRIE DIFFERENTIELLE CATEGORIQUES COMPACT TOPOLOGIES ON LOCALLY PRESENTABLE CATEGORIES by Panagis KARAZERIS RESUME. Les topologies sur les categories localement pr6sentables g6n6rallsent les notions famill6res suivantes, d’une part les topologies de Grothendieck sur des petites categories, d’autre part les topologies de Gabriel sur des categories abéliennes à generateurs. Dans cet article on introduit une condition, qui peut être v6rifi6e pour les topologies pr6c6dentes, appel6e "compacit6". Dans le cas des topologies de Grothendieck, cette condition signifie qu’un recouvrement quelconque a un sous-recouvrement fini. Les topologies compactes correspondantes ont des localisations ferm6es dans la cat6gorie donnee pour des colimites filtrantes monomorphiques. On examine aussi la fermeture des objets s6par6s et des faisceaux pour les colimites filtrantes. Les topologies compactes sur une cat6gorie localement de presentation finie forment un locale. Si cette cat6gorie est un topos coherent, alors le locale est compact et localement compact.
    [Show full text]
  • The Strength of the Gr\" Atzer-Schmidt Theorem
    The Strength of the Gr¨atzer-Schmidt theorem Katie Brodhead Mushfeq Khan Bjørn Kjos-Hanssen William A. Lampe Paul Kim Long V. Nguyen Richard A. Shore January 8, 2019 Abstract The Gr¨atzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. We study the reverse mathematics of this theorem. We also show that 1 1. the set of indices of computable lattices that are complete is Π1-complete; 1 2. the set of indices of computable lattices that are algebraic is Π1-complete; 1 1 3. the set of compact elements of a computable lattice is Π1 and can be Π1-complete; and 0 4. the set of compact elements of a distributive computable lattice is Π3, and there is an algebraic 0 distributive computable lattice such that the set of its compact elements is Π3-complete. Keywords: lattice theory, computability theory. Contents 1 Introduction 2 2 Computability-theoretic analysis of lattice theoretic concepts 2 1 2.1 Index set of complete lattices is Π1-complete . .2 1 2.2 Compact elements of a lattice can be Π1-complete . .3 1 2.3 Index set of algebraic lattices is Π1-complete . .5 3 Lattices of equivalence relations 6 3.1 Congruence lattices . .7 3.2 Principal congruences can be Turing complete . .8 arXiv:1408.2167v2 [math.LO] 4 Jan 2019 4 Reverse mathematics 8 5 Compact elements in algebraic lattices of restricted kinds 9 5.1 Distributive lattices . .9 5.2 Modular lattices . 16 1 1 Introduction The Gr¨atzer-Schmidt theorem [3], also known as the congruence lattice representation theorem, states that each algebraic lattice is isomorphic to the congruence lattice of an algebra.
    [Show full text]
  • Morphisms on Closure Spaces and Moore Spaces B
    International Journal of Pure and Applied Mathematics Volume 91 No. 2 2014, 197-207 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu AP doi: http://dx.doi.org/10.12732/ijpam.v91i2.6 ijpam.eu MORPHISMS ON CLOSURE SPACES AND MOORE SPACES B. Venkateswarlu1 §, R. Vasu Babu2, Getnet Alemu3 1Department of Mathematics GIT, GITAM University Visakhapatnam, 530 045, A.P., INDIA 2Department of Mathematics Shri Vishnu Engineering college for Women Bhimavaram, 534201, W.G. Dist., A.P., INDIA 3Department of Mathematics Gondar University Gondar, ETHIOPIA Abstract: We discuss an equivalence of the concepts of complete lattices, Moore classes, and a one-to-one correspondence between Moore classes of sub- sets of a set X and closure operators on X. Also, we establish a correspon- dence between closure operators on sets and complete lattices. We describe morphisms among partially ordered sets, lattices, Moore classes, closure opera- tors and complete lattices and discuss certain inter-relationships between these objects. AMS Subject Classification: 06A15, 06F30, 54H12 Key Words: closure operator, Moore class, compact element, complete lat- tice, algebraic Lattice, frame, morphisms 1. Introduction and Preliminaries A partially ordered set (poset) is a pair (X, ≤), where X is a non empty set and c 2014 Academic Publications, Ltd. Received: September 26, 2013 url: www.acadpubl.eu §Correspondence author 198 B. Venkateswarlu, R.V. Babu, G. Alemu ≤ is a partial order (a reflexive, transitive and antisymmetric binary relation) on X. For any subset A of X and x ∈ X, x is called a lower bound (upper bound) of A if x ≤ a (a ≤ x respectively) for all a ∈ A.
    [Show full text]
  • Introduction to Coherent Spaces
    Introduction to coherent spaces Arnold Neumaier Fakult¨at f¨ur Mathematik, Universit¨at Wien Oskar-Morgenstern-Platz 1, A-1090 Wien, Austria email: [email protected] WWW: http://www.mat.univie.ac.at/~neum arXiv:1804.01402 September 28, 2018 Abstract. The notion of a coherent space is a nonlinear version of the notion of a complex Euclidean space: The vector space axioms are dropped while the notion of inner product is kept. Coherent spaces provide a setting for the study of geometry in a different direction than traditional metric, topological, and differential geometry. Just as it pays to study the properties of manifolds independently of their embedding into a Euclidean space, so it appears fruitful to study the properties of coherent spaces independent of their embedding into a Hilbert space. Coherent spaces have close relations to reproducing kernel Hilbert spaces, Fock spaces, and unitary group representations, and to many other fields of mathematics, statistics, and physics. This paper is the first of a series of papers and defines concepts and basic theorems about coherent spaces, associated vector spaces, and their topology. Later papers in the series dis- cuss symmetries of coherent spaces, relations to homogeneous spaces, the theory of group representations, C∗-algebras, hypergroups, finite geometry, and applications to quantum physics. While the applications to quantum physics were the main motiviation for develop- ing the theory, many more applications exist in complex analysis, group theory, probability theory, statistics, physics, and engineering. For the discussion of questions concerning coherent spaces, please use the discussion forum https://www.physicsoverflow.org.
    [Show full text]
  • On Lattices and Their Ideal Lattices, and Posets and Their Ideal Posets
    This is the final preprint version of a paper which appeared at Tbilisi Math. J. 1 (2008) 89-103. Published version accessible to subscribers at http://www.tcms.org.ge/Journals/TMJ/Volume1/Xpapers/tmj1_6.pdf On lattices and their ideal lattices, and posets and their ideal posets George M. Bergman 1 ∗ 1 Department of Mathematics, University of California, Berkeley, CA 94720-3840, USA E-mail: [email protected] Abstract For P a poset or lattice, let Id(P ) denote the poset, respectively, lattice, of upward directed downsets in P; including the empty set, and let id(P ) = Id(P )−f?g: This note obtains various results to the effect that Id(P ) is always, and id(P ) often, \essentially larger" than P: In the first vein, we find that a poset P admits no <-respecting map (and so in particular, no one-to-one isotone map) from Id(P ) into P; and, going the other way, that an upper semilattice P admits no semilattice homomorphism from any subsemilattice of itself onto Id(P ): The slightly smaller object id(P ) is known to be isomorphic to P if and only if P has ascending chain condition. This result is strength- ened to say that the only posets P0 such that for every natural num- n ber n there exists a poset Pn with id (Pn) =∼ P0 are those having ascending chain condition. On the other hand, a wide class of cases is noted where id(P ) is embeddable in P: Counterexamples are given to many variants of the statements proved.
    [Show full text]