DOCSLIB.ORG

Continuous Monoids and Semirings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Continuous Monoids and Semirings View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 318 (2004) 355–372 www.elsevier.com/locate/tcs Continuous monoids and semirings Georg Karner∗ Alcatel Austria, Scheydgasse 41, A-1211 Vienna, Austria Received 30 October 2002; received in revised form 11 December 2003; accepted 19 January 2004 Communicated by Z. Esik Abstract Di1erent kinds of monoids and semirings have been deÿned in the literature, all of them named “continuous”. We show their relations. The main technical tools are suitable topologies, among others a variant of the well-known Scott topology for complete partial orders. c 2004 Elsevier B.V. All rights reserved. MSC: 68Q70; 16Y60; 06F05 Keywords: Distributive -algebras; Distributive multioperator monoids; Complete semirings; Continuous semirings; Complete partial orders; Scott topology 1. Introduction Continuous semirings were deÿned by the “French school” (cf. e.g. [16,22]) using a purely algebraic deÿnition. In a recent paper, Esik and Kuich [6] deÿne continuous semirings via the well-known concept of a CPO (complete partial order) and claim that this is a generalisation of the established notion. However, they do not give any proof to substantiate this claim. In a similar vein, Kuich deÿned continuous distributive multioperator monoids (DM-monoids) ÿrst algebraically [17,18] and then, again with Esik, via CPOs. (In the latter paper, DM-monoids are called distributive -algebras.) Also here the relation between the two notions of continuity remains unclear. The present paper clariÿes these issues and discusses also more general concepts. A lot of examples are included. For the sake of clarity and conciseness, the presentation is restricted to monoids and semirings. ∗ Corresponding author. E-mail address: [email protected] (G. Karner). 0304-3975/$ - see front matter c 2004 Elsevier B.V. All rights reserved. doi:10.1016/j.tcs.2004.01.020 356 G.Karner / Theoretical Computer Science 318 (2004) 355–372 The main technical tool are some topological concepts presented ÿrst by the author in [13]. At that time the topological approach was used mainly to justify the algebraic deÿnition. In the present paper, however, the topologies used serve as tools in the proofs. The paper is organised as follows. Section 2 collects the necessary deÿnitions from the papers mentioned above. In Section 3, we discuss the transition from the CPO- based deÿnition to the purely algebraic one. Section 4 presents results converse to the previous one. Section 5 summarises our results in the framework of category theory. Finally, we consider yet another notion of continuity, this time from the realm of CPOs, and relate it to our results. 2. Basic concepts The presentation in this section follows [5] but covers also related work. For basic topological notions, we refer the reader to standard textbooks on the topic, e.g. [14]. We consider monoids (A; ·; 1), which are commutative in most cases and will then be written additively, i.e. as (A; +; 0). Non-commutative monoids will occur as the multiplicative structure of semirings. A function f : An → A, n¿1, on a commutative monoid (A; +; 0) is distributive,if for all j6n and all a1;:::;an;b1;b2 ∈ A, f(a1;:::;aj−1; 0;aj+1;:::;an)=0; (1) f(a1;:::;aj−1;b1 + b2;aj+1;:::;an)=f(a1;:::;aj−1;b1;aj+1;:::;an) + f(a1;:::;aj−1;b2;aj+1;:::;an): (2) A commutative monoid (A; +; 0) together with a number of constants and distributive functions on A is a distributive algebra (or DM-monoid [17,18]). For the sake of conciseness and clarity, we will consider only one such class of algebras explicitly, viz. the semirings. A semiring (A; +; 0; ·; 1) is a distributive algebra such that (A; ·; 1) is a monoid. 2.1. Complete monoids A complete monoid (A; +; 0;) is a commutative monoid together with sums for all families (ai|i ∈ I) of elements of A, where I is an arbitrary index set, such that the following conditions are satisÿed: ai =0; ai = aj; (3) i∈∅ i∈{j} ai = aj + ak for j = k; (4) i∈{j;k} ai = ai if Ij = I and Ij ∩ Ij = ∅ for j = j : (5) j∈J i∈Ij i∈I j∈J G.Karner / Theoretical Computer Science 318 (2004) 355–372 357 Complete monoids have been studied in detail by Krob [15]. Given a family (ai|i ∈ I), we write F ⊆ÿn I for ÿnite subsets F ⊆ I, and aF for i∈F ai, and (aF |F ⊆ÿn I) for the net of all aF ’s over the partially ordered index set ({F|F ⊆ÿn I}; ⊆). A function f : An → A, n¿1 on a complete monoid (A; +; 0;)iscomplete or -preserving, if for all j6n, all a1;:::;an ∈ A, and families (bi|i ∈ I)onA, f a1;:::;aj−1; bi;aj+1;:::;ak = f(a1;:::;aj−1;bi;aj+1;:::;ak ): (6) i∈I i∈I Note that every -preserving function is distributive. A complete semiring (A; +; ·; 0; 1;) is a complete monoid (A; +; 0;) which is at the same time a semiring (A; +; ·; 0; 1) such that · is -preserving. If (A; +; 0;) is complete, the summation topology on A is the collection of all sets O ⊆ A satisfying the following condition. If i∈I ai ∈ O then there is F0 ⊆ÿn I such that aF ∈ O for each F with F0 ⊆ F ⊆ÿn I. The following characterization follows directly from the deÿnitions. Lemma 1. Let (A; +; 0;) be a complete monoid. A subset X ⊆ A is closed in the summation topology i0, for every net (aF |F ⊆ÿn I) which is frequently in X we have i∈I ai ∈ X . The summation topology is not Hausdor1, in general, see [13]. In the case of semir- ings, the topology has been named Karner topology in [9]. We now give an example for a complete monoid and semiring. A semitopological monoid (A; ·; 1;) is a monoid (A; ·; 1) with a Hausdor1 topology such that · is continuous in each argument. (Note: Golan [9] uses the term with a di1erent meaning.) A commutative semitopological monoid (A; +; 0;)isst-complete, if all nets (aF |F ⊆ÿn I) converge. Theorem 2 (Karner [13, Property 3]). Every st-complete monoid (A; +; 0;) becomes a complete monoid (A; +; 0;) under ai = lim(aF |F ⊆ÿn I); (7) i∈I where lim is taken with respect to . Moreover, every distributive, argumentwise continuous function on (A; +; 0;) is -preserving. Theorem 2 generalises easily, cf. again [13, Property 3]. A semitopological semiring (A; +; ·; 0; 1;) is a semiring (A; +; ·; 0; 1) with a topology such that both (A; +; 0;) and (A; ·; 1;) are semitopological monoids. A semitopological semiring is st-complete if the underlying semitopological monoid is. Corollary 3. Every st-complete semiring (A; +; ·; 0; 1;) is a complete semiring (A; +; ·; 0; 1;), where the summation is given by (7). 358 G.Karner / Theoretical Computer Science 318 (2004) 355–372 In fact, Corollary 3 only uses the fact that · is distributive and argumentwise contin- uous. This allows us to use Corollary 3 for arbitrary st-complete distributive algebras. Such generalisations will be possible for other results as well but will be stated for semirings only. ∞ Example 4. Let Q =(Q+ ; +; ·; 0; 1; 6;) be the one-point compactiÿcation of the dis- crete space Q+ of non-negative rational numbers and let 6 denote the usual order. ∞ Let the semiring operations be extended for x ∈ Q+ as follows: 0ifx =0; x + ∞ = ∞ + x = ∞;x·∞= ∞·x = (8) ∞ otherwise: Then Q is an st-complete semiring, hence complete by Corollary 3. The summation is given as follows: aF if F := {ai =0} is ÿnite; ai = (9) i∈I ∞ otherwise: Proof. All points x ∈ Q+ are isolated in . Furthermore, the neighbourhoods of ∞ are ∞ ∞ the sets with ÿnite complements, i.e. all sets Y ⊆ Q+ with ∞∈Y and Q+ \Y ÿnite. ∞ Let (ai|i ∈ I) be a family of elements of Q+ .Ifai = 0 for all but ÿnitely many i ∈ I or ai = ∞ for at least one i ∈ I, the net (aF |F ⊆ÿn I) converges trivially. So let us assume that ai¿0 for inÿnitely many i ∈ I and that ai¡∞ for all i ∈ I. Set ∞ s = sup(aF |F ⊆ÿn I) where sup is taken in R+ . By our assumptions, the sup cannot be attained, i.e. aF ¡s for all F ⊆ÿn I. Let now b ∈ Q.Ifb¡s then there is Fb ⊆ÿn I with a ¿b and thus a ¿b for all F ⊆ F ⊆ I.Ifb¿s, a = b for all F ⊆ I.Weset Fb F b ÿn F ÿn ∞ Fb = ∅ in this case. Let now Y ⊆ Q+ be a neighbourhood of ∞ and set FY = b=∈Y Fb. ∞ Since the complement of Y in Q+ is ÿnite, FY is a ÿnite set. Then for FY ⊆ F ⊆ÿn I, aF ∈ Y . This shows that lim(aF |F ⊆ÿn I)=∞ as required. 2.2. Finitary and continuous monoids A partially ordered ( p.o.) monoid (A; +; 0; 6) is a commutative monoid (A; +; 0) together with a partial order 6 on A such that for all a; b and c ∈ A,06a, and a6b implies a+c6b+c. A is called sum-ordered if a6b holds i1 a+c = b for some c ∈ A. (This is also called natural order or di1erence order.) A p.o. semiring (A; +; ·; 0; 1; 6) is a semiring where (A; +; 0; 6) is a p.o. monoid and · is monotone in each argument. 1 According to Goldstern [10], a ÿnitary monoid (A; +; 0; 6;) is a p.o. monoid (A; +; 0; 6) which is a complete monoid (A; +; 0;) under the deÿnition ai := sup(aF |F ⊆ÿn I): (10) i∈I More precisely, A is ÿnitary if all the sups on the right-hand side of (10) exist and the thus deÿned satisÿes (3)–(5).
Load more

Recommended publications
  • Directed Sets and Topological Spaces Definable in O-Minimal Structures
    Directed sets and topological spaces definable in o-minimal structures. Pablo And´ujarGuerrero∗ Margaret E. M. Thomas ∗ Erik Walsbergy 2010 Mathematics Subject Classification. 03C64 (Primary), 54A20, 54A05, 54D30 (Secondary). Key words. o-minimality, directed sets, definable topological spaces. Abstract We study directed sets definable in o-minimal structures, show- ing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue holds in full generality. We use the theory of tame pairs to extend the results in the field case to definable families of sets with the finite intersection property. We then apply our results to the study of definable topologies. We prove that all de- finable topological spaces display properties akin to first countability, and give several characterizations of a notion of definable compactness due to Peterzil and Steinhorn [PS99] generalized to this setting. 1 Introduction The study of objects definable in o-minimal structures is motivated by the notion that o-minimality provides a rich but \tame" setting for the theories of said objects. In this paper we study directed sets definable in o-minimal structures, focusing on expansions of groups and fields. By \directed set" we mean a preordered set in which every finite subset has a lower (if downward ∗Department of Mathematics, Purdue University, 150 N. University Street, West Lafayette, IN 47907-2067, U.S.A. E-mail addresses: [email protected] (And´ujarGuer- rero), [email protected] (Thomas) yDepartment of Mathematics, Statistics, and Computer Science, Department of Math- ematics, University of California, Irvine, 340 Rowland Hall (Bldg.# 400), Irvine, CA 92697-3875, U.S.A.
    [Show full text]
  • Scott Spaces and the Dcpo Category
    SCOTT SPACES AND THE DCPO CATEGORY JORDAN BROWN Abstract. Directed-complete partial orders (dcpo’s) arise often in the study of λ-calculus. Here we investigate certain properties of dcpo’s and the Scott spaces they induce. We introduce a new construction which allows for the canonical extension of a partial order to a dcpo and give a proof that the dcpo introduced by Zhao, Xi, and Chen is well-filtered. Contents 1. Introduction 1 2. General Definitions and the Finite Case 2 3. Connectedness of Scott Spaces 5 4. The Categorical Structure of DCPO 6 5. Suprema and the Waybelow Relation 7 6. Hofmann-Mislove Theorem 9 7. Ordinal-Based DCPOs 11 8. Acknowledgments 13 References 13 1. Introduction Directed-complete partially ordered sets (dcpo’s) often arise in the study of λ-calculus. Namely, they are often used to construct models for λ theories. There are several versions of the λ-calculus, all of which attempt to describe the ‘computable’ functions. The first robust descriptions of λ-calculus appeared around the same time as the definition of Turing machines, and Turing’s paper introducing computing machines includes a proof that his computable functions are precisely the λ-definable ones [5] [8]. Though we do not address the λ-calculus directly here, an exposition of certain λ theories and the construction of Scott space models for them can be found in [1]. In these models, computable functions correspond to continuous functions with respect to the Scott topology. It is thus with an eye to the application of topological tools in the study of computability that we investigate the Scott topology.
    [Show full text]
  • A Guide to Topology
    i i “topguide” — 2010/12/8 — 17:36 — page i — #1 i i A Guide to Topology i i i i i i “topguide” — 2011/2/15 — 16:42 — page ii — #2 i i c 2009 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 2009929077 Print Edition ISBN 978-0-88385-346-7 Electronic Edition ISBN 978-0-88385-917-9 Printed in the United States of America Current Printing (last digit): 10987654321 i i i i i i “topguide” — 2010/12/8 — 17:36 — page iii — #3 i i The Dolciani Mathematical Expositions NUMBER FORTY MAA Guides # 4 A Guide to Topology Steven G. Krantz Washington University, St. Louis ® Published and Distributed by The Mathematical Association of America i i i i i i “topguide” — 2010/12/8 — 17:36 — page iv — #4 i i DOLCIANI MATHEMATICAL EXPOSITIONS Committee on Books Paul Zorn, Chair Dolciani Mathematical Expositions Editorial Board Underwood Dudley, Editor Jeremy S. Case Rosalie A. Dance Tevian Dray Patricia B. Humphrey Virginia E. Knight Mark A. Peterson Jonathan Rogness Thomas Q. Sibley Joe Alyn Stickles i i i i i i “topguide” — 2010/12/8 — 17:36 — page v — #5 i i The DOLCIANI MATHEMATICAL EXPOSITIONS series of the Mathematical Association of America was established through a generous gift to the Association from Mary P. Dolciani, Professor of Mathematics at Hunter College of the City Uni- versity of New York. In making the gift, Professor Dolciani, herself an exceptionally talented and successfulexpositor of mathematics, had the purpose of furthering the ideal of excellence in mathematical exposition.
    [Show full text]
  • Semiring Frameworks and Algorithms for Shortest-Distance Problems
    Journal of Automata, Languages and Combinatorics u (v) w, x–y c Otto-von-Guericke-Universit¨at Magdeburg Semiring Frameworks and Algorithms for Shortest-Distance Problems Mehryar Mohri AT&T Labs – Research 180 Park Avenue, Rm E135 Florham Park, NJ 07932 e-mail: [email protected] ABSTRACT We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently clas- sical shortest paths problems or to find the k-shortest distances in a directed graph. It can be used to solve single-source shortest-distance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity. Keywords: semirings, finite automata, shortest-paths algorithms, rational power series Classical shortest-paths problems in a weighted directed graph arise in various contexts. The problems divide into two related categories: single-source shortest- paths problems and all-pairs shortest-paths problems. The single-source shortest-path problem in a directed graph consists of determining the shortest path from a fixed source vertex s to all other vertices. The all-pairs shortest-distance problem is that of finding the shortest paths between all pairs of vertices of a graph.
    [Show full text]
  • Subset Semirings
    University of New Mexico UNM Digital Repository Faculty and Staff Publications Mathematics 2013 Subset Semirings Florentin Smarandache University of New Mexico, [email protected] W.B. Vasantha Kandasamy [email protected] Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebraic Geometry Commons, Analysis Commons, and the Other Mathematics Commons Recommended Citation W.B. Vasantha Kandasamy & F. Smarandache. Subset Semirings. Ohio: Educational Publishing, 2013. This Book is brought to you for free and open access by the Mathematics at UNM Digital Repository. It has been accepted for inclusion in Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. Subset Semirings W. B. Vasantha Kandasamy Florentin Smarandache Educational Publisher Inc. Ohio 2013 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA Toll Free: 1-866-880-5373 Copyright 2013 by Educational Publisher Inc. and the Authors Peer reviewers: Marius Coman, researcher, Bucharest, Romania. Dr. Arsham Borumand Saeid, University of Kerman, Iran. Said Broumi, University of Hassan II Mohammedia, Casablanca, Morocco. Dr. Stefan Vladutescu, University of Craiova, Romania. Many books can be downloaded from the following Digital Library of Science: http://www.gallup.unm.edu/eBooks-otherformats.htm ISBN-13: 978-1-59973-234-3 EAN: 9781599732343 Printed in the United States of America 2 CONTENTS Preface 5 Chapter One INTRODUCTION 7 Chapter Two SUBSET SEMIRINGS OF TYPE I 9 Chapter Three SUBSET SEMIRINGS OF TYPE II 107 Chapter Four NEW SUBSET SPECIAL TYPE OF TOPOLOGICAL SPACES 189 3 FURTHER READING 255 INDEX 258 ABOUT THE AUTHORS 260 4 PREFACE In this book authors study the new notion of the algebraic structure of the subset semirings using the subsets of rings or semirings.
    [Show full text]
  • On Free Quasigroups and Quasigroup Representations Stefanie Grace Wang Iowa State University
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2017 On free quasigroups and quasigroup representations Stefanie Grace Wang Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Mathematics Commons Recommended Citation Wang, Stefanie Grace, "On free quasigroups and quasigroup representations" (2017). Graduate Theses and Dissertations. 16298. https://lib.dr.iastate.edu/etd/16298 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. On free quasigroups and quasigroup representations by Stefanie Grace Wang A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Jonathan D.H. Smith, Major Professor Jonas Hartwig Justin Peters Yiu Tung Poon Paul Sacks The student author and the program of study committee are solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2017 Copyright c Stefanie Grace Wang, 2017. All rights reserved. ii DEDICATION I would like to dedicate this dissertation to the Integral Liberal Arts Program. The Program changed my life, and I am forever grateful. It is as Aristotle said, \All men by nature desire to know." And Montaigne was certainly correct as well when he said, \There is a plague on Man: his opinion that he knows something." iii TABLE OF CONTENTS LIST OF TABLES .
    [Show full text]
  • Generalized Inverse Limits and Topological Entropy
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repository of Faculty of Science, University of Zagreb FACULTY OF SCIENCE DEPARTMENT OF MATHEMATICS Goran Erceg GENERALIZED INVERSE LIMITS AND TOPOLOGICAL ENTROPY DOCTORAL THESIS Zagreb, 2016 PRIRODOSLOVNO - MATEMATICKIˇ FAKULTET MATEMATICKIˇ ODSJEK Goran Erceg GENERALIZIRANI INVERZNI LIMESI I TOPOLOŠKA ENTROPIJA DOKTORSKI RAD Zagreb, 2016. FACULTY OF SCIENCE DEPARTMENT OF MATHEMATICS Goran Erceg GENERALIZED INVERSE LIMITS AND TOPOLOGICAL ENTROPY DOCTORAL THESIS Supervisors: prof. Judy Kennedy prof. dr. sc. Vlasta Matijevic´ Zagreb, 2016 PRIRODOSLOVNO - MATEMATICKIˇ FAKULTET MATEMATICKIˇ ODSJEK Goran Erceg GENERALIZIRANI INVERZNI LIMESI I TOPOLOŠKA ENTROPIJA DOKTORSKI RAD Mentori: prof. Judy Kennedy prof. dr. sc. Vlasta Matijevic´ Zagreb, 2016. Acknowledgements First of all, i want to thank my supervisor professor Judy Kennedy for accept- ing a big responsibility of guiding a transatlantic student. Her enthusiasm and love for mathematics are contagious. I thank professor Vlasta Matijevi´c, not only my supervisor but also my role model as a professor of mathematics. It was privilege to be guided by her for master's and doctoral thesis. I want to thank all my math teachers, from elementary school onwards, who helped that my love for math rises more and more with each year. Special thanks to Jurica Cudina´ who showed me a glimpse of math theory already in the high school. I thank all members of the Topology seminar in Split who always knew to ask right questions at the right moment and to guide me in the right direction. I also thank Iztok Baniˇcand the rest of the Topology seminar in Maribor who welcomed me as their member and showed me the beauty of a teamwork.
    [Show full text]
  • Irreducible Representations of Finite Monoids
    U.U.D.M. Project Report 2019:11 Irreducible representations of finite monoids Christoffer Hindlycke Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Mars 2019 Department of Mathematics Uppsala University Irreducible representations of finite monoids Christoffer Hindlycke Contents Introduction 2 Theory 3 Finite monoids and their structure . .3 Introductory notions . .3 Cyclic semigroups . .6 Green’s relations . .7 von Neumann regularity . 10 The theory of an idempotent . 11 The five functors Inde, Coinde, Rese,Te and Ne ..................... 11 Idempotents and simple modules . 14 Irreducible representations of a finite monoid . 17 Monoid algebras . 17 Clifford-Munn-Ponizovski˘ıtheory . 20 Application 24 The symmetric inverse monoid . 24 Calculating the irreducible representations of I3 ........................ 25 Appendix: Prerequisite theory 37 Basic definitions . 37 Finite dimensional algebras . 41 Semisimple modules and algebras . 41 Indecomposable modules . 42 An introduction to idempotents . 42 1 Irreducible representations of finite monoids Christoffer Hindlycke Introduction This paper is a literature study of the 2016 book Representation Theory of Finite Monoids by Benjamin Steinberg [3]. As this book contains too much interesting material for a simple master thesis, we have narrowed our attention to chapters 1, 4 and 5. This thesis is divided into three main parts: Theory, Application and Appendix. Within the Theory chapter, we (as the name might suggest) develop the necessary theory to assist with finding irreducible representations of finite monoids. Finite monoids and their structure gives elementary definitions as regards to finite monoids, and expands on the basic theory of their structure. This part corresponds to chapter 1 in [3]. The theory of an idempotent develops just enough theory regarding idempotents to enable us to state a key result, from which the principal result later follows almost immediately.
    [Show full text]
  • Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1
    Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1: A directed set I is a set with a partial order ≤ such that for every i; j 2 I there is k 2 I such that i ≤ k and j ≤ k. Let R be a ring. A directed system of R-modules indexed by I is a collection of R modules fMi j i 2 Ig with a R module homomorphisms µi;j : Mi ! Mj for each pair i; j 2 I where i ≤ j, such that (i) for any i 2 I, µi;i = IdMi and (ii) for any i ≤ j ≤ k in I, µi;j ◦ µj;k = µi;k. We shall denote a directed system by a tuple (Mi; µi;j). The direct limit of a directed system is defined using a universal property. It exists and is unique up to a unique isomorphism. Theorem 2 (Direct limits). Let fMi j i 2 Ig be a directed system of R modules then there exists an R module M with the following properties: (i) There are R module homomorphisms µi : Mi ! M for each i 2 I, satisfying µi = µj ◦ µi;j whenever i < j. (ii) If there is an R module N such that there are R module homomorphisms νi : Mi ! N for each i and νi = νj ◦µi;j whenever i < j; then there exists a unique R module homomorphism ν : M ! N, such that νi = ν ◦ µi. The module M is unique in the sense that if there is any other R module M 0 satisfying properties (i) and (ii) then there is a unique R module isomorphism µ0 : M ! M 0.
    [Show full text]
  • Algebras of Boolean Inverse Monoids – Traces and Invariant Means
    C*-algebras of Boolean inverse monoids { traces and invariant means Charles Starling∗ Abstract ∗ To a Boolean inverse monoid S we associate a universal C*-algebra CB(S) and show that it is equal to Exel's tight C*-algebra of S. We then show that any invariant mean on S (in the sense of Kudryavtseva, Lawson, Lenz and Resende) gives rise to a ∗ trace on CB(S), and vice-versa, under a condition on S equivalent to the underlying ∗ groupoid being Hausdorff. Under certain mild conditions, the space of traces of CB(S) is shown to be isomorphic to the space of invariant means of S. We then use many known results about traces of C*-algebras to draw conclusions about invariant means on Boolean inverse monoids; in particular we quote a result of Blackadar to show that any metrizable Choquet simplex arises as the space of invariant means for some AF inverse monoid S. 1 Introduction This article is the continuation of our study of the relationship between inverse semigroups and C*-algebras. An inverse semigroup is a semigroup S for which every element s 2 S has a unique \inverse" s∗ in the sense that ss∗s = s and s∗ss∗ = s∗: An important subsemigroup of any inverse semigroup is its set of idempotents E(S) = fe 2 S j e2 = eg = fs∗s j s 2 Sg. Any set of partial isometries closed under product and arXiv:1605.05189v3 [math.OA] 19 Jul 2016 involution inside a C*-algebra is an inverse semigroup, and its set of idempotents forms a commuting set of projections.
    [Show full text]
  • On Kleene Algebras and Closed Semirings
    On Kleene Algebras and Closed Semirings y Dexter Kozen Department of Computer Science Cornell University Ithaca New York USA May Abstract Kleene algebras are an imp ortant class of algebraic structures that arise in diverse areas of computer science program logic and semantics relational algebra automata theory and the design and analysis of algorithms The literature contains several inequivalent denitions of Kleene algebras and related algebraic structures In this pap er we establish some new relationships among these structures Our main results are There is a Kleene algebra in the sense of that is not continuous The categories of continuous Kleene algebras closed semirings and Salgebras are strongly related by adjunctions The axioms of Kleene algebra in the sense of are not complete for the universal Horn theory of the regular events This refutes a conjecture of Conway p Righthanded Kleene algebras are not necessarily lefthanded Kleene algebras This veries a weaker version of a conjecture of Pratt In Rovan ed Proc Math Found Comput Scivolume of Lect Notes in Comput Sci pages Springer y Supp orted by NSF grant CCR Intro duction Kleene algebras are algebraic structures with op erators and satisfying certain prop erties They have b een used to mo del programs in Dynamic Logic to prove the equivalence of regular expressions and nite automata to give fast algorithms for transitive closure and shortest paths in directed graphs and to axiomatize relational algebra There has b een some disagreement
    [Show full text]
  • Directed Sets and Cofinal Types by Stevo Todorcevic
    transactions of the american mathematical society Volume 290, Number 2, August 1985 DIRECTED SETS AND COFINAL TYPES BY STEVO TODORCEVIC Abstract. We show that 1, w, ax, u x ux and ["iF" are the only cofinal types of directed sets of size S,, but that there exist many cofinal types of directed sets of size continuum. A partially ordered set D is directed if every two elements of D have an upper bound in D. In this note we consider some basic problems concerning directed sets which have their origin in the theory of Moore-Smith convergence in topology [12, 3, 19, 9]. One such problem is to determine "all essential kind of directed sets" needed for defining the closure operator in a given class of spaces [3, p. 47]. Concerning this problem, the following important notion was introduced by J. Tukey [19]. Two directed sets D and E are cofinally similar if there is a partially ordered set C in which both can be embedded as cofinal subsets. He showed that this is an equivalence relation and that D and E are cofinally similar iff there is a convergent map from D into E and also a convergent map from E into D. The equivalence classes of this relation are called cofinal types. This concept has been extensively studied since then by various authors [4, 13, 7, 8]. Already, from the first introduc- tion of this concept, it has been known that 1, w, ccx, w X cox and [w1]<" represent different cofinal types of directed sets of size < Kls but no more than five such types were known.
    [Show full text]