Monads and Algebras - an Introduction
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Notes and Solutions to Exercises for Mac Lane's Categories for The
Stefan Dawydiak Version 0.3 July 2, 2020 Notes and Exercises from Categories for the Working Mathematician Contents 0 Preface 2 1 Categories, Functors, and Natural Transformations 2 1.1 Functors . .2 1.2 Natural Transformations . .4 1.3 Monics, Epis, and Zeros . .5 2 Constructions on Categories 6 2.1 Products of Categories . .6 2.2 Functor categories . .6 2.2.1 The Interchange Law . .8 2.3 The Category of All Categories . .8 2.4 Comma Categories . 11 2.5 Graphs and Free Categories . 12 2.6 Quotient Categories . 13 3 Universals and Limits 13 3.1 Universal Arrows . 13 3.2 The Yoneda Lemma . 14 3.2.1 Proof of the Yoneda Lemma . 14 3.3 Coproducts and Colimits . 16 3.4 Products and Limits . 18 3.4.1 The p-adic integers . 20 3.5 Categories with Finite Products . 21 3.6 Groups in Categories . 22 4 Adjoints 23 4.1 Adjunctions . 23 4.2 Examples of Adjoints . 24 4.3 Reflective Subcategories . 28 4.4 Equivalence of Categories . 30 4.5 Adjoints for Preorders . 32 4.5.1 Examples of Galois Connections . 32 4.6 Cartesian Closed Categories . 33 5 Limits 33 5.1 Creation of Limits . 33 5.2 Limits by Products and Equalizers . 34 5.3 Preservation of Limits . 35 5.4 Adjoints on Limits . 35 5.5 Freyd's adjoint functor theorem . 36 1 6 Chapter 6 38 7 Chapter 7 38 8 Abelian Categories 38 8.1 Additive Categories . 38 8.2 Abelian Categories . 38 8.3 Diagram Lemmas . 39 9 Special Limits 41 9.1 Interchange of Limits . -
Dynamic Algebras: Examples, Constructions, Applications
Dynamic Algebras: Examples, Constructions, Applications Vaughan Pratt∗ Dept. of Computer Science, Stanford, CA 94305 Abstract Dynamic algebras combine the classes of Boolean (B ∨ 0 0) and regu- lar (R ∪ ; ∗) algebras into a single finitely axiomatized variety (BR 3) resembling an R-module with “scalar” multiplication 3. The basic result is that ∗ is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residu- ally finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper originally appeared as Technical Memo #138, Laboratory for Computer Science, MIT, July 1979, and was subsequently revised, shortened, retitled, and published as [Pra80b]. After more than a decade of armtwisting I. N´emeti and H. Andr´eka finally persuaded the author to publish TM#138 itself on the ground that it contained a substantial body of interesting material that for the sake of brevity had been deleted from the STOC-80 version. The principal changes here to TM#138 are the addition of footnotes and the sections at the end on retrospective citations and reflections. ∗This research was supported by the National Science Foundation under NSF grant no. -
Algebra + Homotopy = Operad
Symplectic, Poisson and Noncommutative Geometry MSRI Publications Volume 62, 2014 Algebra + homotopy = operad BRUNO VALLETTE “If I could only understand the beautiful consequences following from the concise proposition d 2 0.” —Henri Cartan D This survey provides an elementary introduction to operads and to their ap- plications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher homotopies. We try to show how universal this theory is by giving many applications in algebra, geometry, topology, and mathematical physics. (This text is accessible to any student knowing what tensor products, chain complexes, and categories are.) Introduction 229 1. When algebra meets homotopy 230 2. Operads 239 3. Operadic syzygies 253 4. Homotopy transfer theorem 272 Conclusion 283 Acknowledgements 284 References 284 Introduction Galois explained to us that operations acting on the solutions of algebraic equa- tions are mathematical objects as well. The notion of an operad was created in order to have a well defined mathematical object which encodes “operations”. Its name is a portemanteau word, coming from the contraction of the words “operations” and “monad”, because an operad can be defined as a monad encoding operations. The introduction of this notion was prompted in the 60’s, by the necessity of working with higher operations made up of higher homotopies appearing in algebraic topology. Algebra is the study of algebraic structures with respect to isomorphisms. Given two isomorphic vector spaces and one algebra structure on one of them, 229 230 BRUNO VALLETTE one can always define, by means of transfer, an algebra structure on the other space such that these two algebra structures become isomorphic. -
On Minimally Free Algebras
Can. J. Math., Vol. XXXVII, No. 5, 1985, pp. 963-978 ON MINIMALLY FREE ALGEBRAS PAUL BANKSTON AND RICHARD SCHUTT 1. Introduction. For us an "algebra" is a finitary "universal algebra" in the sense of G. Birkhoff [9]. We are concerned in this paper with algebras whose endomorphisms are determined by small subsets. For example, an algebra A is rigid (in the strong sense) if the only endomorphism on A is the identity id^. In this case, the empty set determines the endomorphism set E(A). We place the property of rigidity at the bottom rung of a cardinal-indexed ladder of properties as follows. Given a cardinal number K, an algebra .4 is minimally free over a set of cardinality K (K-free for short) if there is a subset X Q A of cardinality K such that every function f\X —-> A extends to a unique endomorphism <p e E(A). (It is clear that A is rigid if and only if A is 0-free.) Members of X will be called counters; and we will be interested in how badly counters can fail to generate the algebra. The property "«-free" is a solipsistic version of "free on K generators" in the sense that A has this property if and only if A is free over a set of cardinality K relative to the concrete category whose sole object is A and whose morphisms are the endomorphisms of A (thus explaining the use of the adverb "minimally" above). In view of this we see that the free algebras on K generators relative to any variety give us examples of "small" K-free algebras. -
Arxiv:1005.0156V3
FOUR PROBLEMS REGARDING REPRESENTABLE FUNCTORS G. MILITARU C Abstract. Let R, S be two rings, C an R-coring and RM the category of left C- C C comodules. The category Rep (RM, SM) of all representable functors RM→ S M is C shown to be equivalent to the opposite of the category RMS . For U an (S, R)-bimodule C we give necessary and sufficient conditions for the induction functor U ⊗R − : RM→ SM to be: a representable functor, an equivalence of categories, a separable or a Frobenius functor. The latter results generalize and unify the classical theorems of Morita for categories of modules over rings and the more recent theorems obtained by Brezinski, Caenepeel et al. for categories of comodules over corings. Introduction Let C be a category and V a variety of algebras in the sense of universal algebras. A functor F : C →V is called representable [1] if γ ◦ F : C → Set is representable in the classical sense, where γ : V → Set is the forgetful functor. Four general problems concerning representable functors have been identified: Problem A: Describe the category Rep (C, V) of all representable functors F : C→V. Problem B: Give a necessary and sufficient condition for a given functor F : C→V to be representable (possibly predefining the object of representability). Problem C: When is a composition of two representable functors a representable functor? Problem D: Give a necessary and sufficient condition for a representable functor F : C → V and for its left adjoint to be separable or Frobenius. The pioneer of studying problem A was Kan [10] who described all representable functors from semigroups to semigroups. -
The Freealg Package: the Free Algebra in R
The freealg package: the free algebra in R Robin K. S. Hankin 2021-04-19 Introduction The freealg package provides some functionality for the free algebra, using the Standard Template library of C++, commonly known as the STL. It is very like the mvp package for multivariate polynomials, but the indeterminates do not commute: multiplication is word concatenation. The free algebra A vector space over a commutative field F (here the reals) is a set V together with two binary operations, addition and scalar multiplication. Addition, usually written +, makes (V, +) an Abelian group. Scalar multiplication is usually denoted by juxtaposition (or sometimes ×) and makes (V, ·) a semigroup. In addition, for any a, b ∈ F and u, v ∈ V, the following laws are satisfied: • Compatibility: a (bv) = (ab)v • Identity: 1v = v, where 1 ∈ F is the multiplicative identity • Distributivity of vector addition: a (u + v) = au + bv • Distributivity of field addition: (a + b)v = av + bv An algebra is a vector space endowed with a binary operation, usually denoted by either a dot or juxtaposition of vectors, from V × V to V satisfying: • Left distributivity: u · (v + w) = u · v + u · w. • Right distributivity: (u + v) · w = u · w + v · w. • Compatibility: (au) · (bv) = (ab)(u · v). There is no requirement for vector multiplication to be commutative. Here we assume associativity so in addition to the axioms above we have • Associativity: (u · v) · w = u · (v · w). The free associative algebra is, in one sense, the most general associative algebra. Here we follow standard terminology and drop the word ‘associative’ while retaining the assumption of associativity. -
The Clifford Algebra and the Group of Similitudes
THE CLIFFORD ALGEBRA AND THE GROUP OF SIMILITUDES MARIA J. WONENBURGER Let C(M, Q) be the Clifford algebra of an even dimensional vector space M relative to a quadratic form Q. When Q is non-degenerate, it is well known that there exists an isomorphism of the orthogonal group 0(Q) onto the group of those automorphisms of C(M, Q) which leave invariant the space M C C(M, Q). These automorphisms are inner and the group of invertible elements of C(M, Q) which define such inner automorphisms is called the Clifford group. If instead of the group 0(Q) we take the group of similitudes y(Q) or even the group of semi-similitudes Ty(Q), it is possible to associate in a natural way with any element of these groups an automorphism or semi-automorphism, respectively, of the subalgebra of even elements C+(M, Q) C C(M, Q). Each one of the automorphisms of C+(M, Q) so defined can be extended, as it is shown here (Theorem 2), to an inner automorphism of C(M, Q), although the extension is not unique. A semi-automorphism of C+(M, Q) associated to a semi-similitude of Q can be extended to all of C(M, Q) if and only if the ratio of the semi-similitude satisfies the conditions given in Theorem 3. Although the extension is not unique, Theorem 3 gives all the possible ex tensions. We do not know if there exist semi-similitudes whose ratios do not satisfy the conditions of Theorem 3. -
Gorenstein Subrings of Invariants Under Hopf Algebra Actions ∗ E
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Algebra 322 (2009) 3640–3669 Contents lists available at ScienceDirect Journal of Algebra www.elsevier.com/locate/jalgebra Gorenstein subrings of invariants under Hopf algebra actions ∗ E. Kirkman a, J. Kuzmanovich a, J.J. Zhang b, a Department of Mathematics, PO Box 7388, Wake Forest University, Winston-Salem, NC 27109, United States b Department of Mathematics, Box 354350, University of Washington, Seattle, WA 98195, United States article info abstract Article history: This paper concerns conditions on the action of a finite dimensional Received 19 November 2008 semisimple Hopf algebra on an Artin–Schelter regular algebra Available online 24 September 2009 that force the subring of invariants to satisfy the Artin–Schelter Communicated by Michel Van den Bergh Gorenstein condition. Classical results such as Watanabe’s Theorem and Stanley’s Theorem are extended from the case of a group Keywords: Artin–Schelter regular algebra action to the context of a Hopf algebra action. A Hopf algebra Hopf algebra action version of the homological determinant is introduced, and it Invariant subring becomes an important tool in the generalization from group actions to Hopf algebra actions. © 2009 Elsevier Inc. All rights reserved. Contents Introduction.................................................................... 3641 1. Preliminariesongradedrings.................................................. 3642 2. PreliminariesonHopfactions................................................. -
Equational Theories of Tropical Semirings Basic Research in Computer Science
BRICS Basic Research in Computer Science BRICS RS-01-21 Aceto et al.: Equational Theories of Tropical Semirings Equational Theories of Tropical Semirings Luca Aceto Zoltan´ Esik´ Anna Ingolfsd´ ottir´ BRICS Report Series RS-01-21 ISSN 0909-0878 June 2001 Copyright c 2001, Luca Aceto & Zoltan´ Esik´ & Anna Ingolfsd´ ottir.´ BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus Ny Munkegade, building 540 DK–8000 Aarhus C Denmark Telephone: +45 8942 3360 Telefax: +45 8942 3255 Internet: [email protected] BRICS publications are in general accessible through the World Wide Web and anonymous FTP through these URLs: http://www.brics.dk ftp://ftp.brics.dk This document in subdirectory RS/01/21/ Equational Theories of Tropical Semirings Luca Aceto∗ Zolt´an Esik´ y Anna Ing´olfsd´ottir∗ Abstract This paper studies the equational theory of various exotic semirings presented in the literature. Exotic semirings are semirings whose un- derlying carrier set is some subset of the set of real numbers equipped with binary operations of minimum or maximum as sum, and addition as product. Two prime examples of such structures are the (max; +) semiring and the tropical semiring. It is shown that none of the exotic semirings commonly considered in the literature has a finite basis for its equations, and that similar results hold for the commutative idempotent weak semirings that underlie them. -
Monomial Orderings, Rewriting Systems, and Gröbner Bases for The
Monomial orderings, rewriting systems, and Gr¨obner bases for the commutator ideal of a free algebra Susan M. Hermiller Department of Mathematics and Statistics University of Nebraska-Lincoln Lincoln, NE 68588 [email protected] Xenia H. Kramer Department of Mathematics Virginia Polytechnic Institute and State University Blacksburg, VA 24061 [email protected] Reinhard C. Laubenbacher Department of Mathematics New Mexico State University Las Cruces, NM 88003 [email protected] 0Key words and phrases. non-commutative Gr¨obner bases, rewriting systems, term orderings. 1991 Mathematics Subject Classification. 13P10, 16D70, 20M05, 68Q42 The authors thank Derek Holt for helpful suggestions. The first author also wishes to thank the National Science Foundation for partial support. 1 Abstract In this paper we consider a free associative algebra on three gen- erators over an arbitrary field K. Given a term ordering on the com- mutative polynomial ring on three variables over K, we construct un- countably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of normal forms. Then we show that the commutator ideal has an infinite re- duced Gr¨obner basis with respect to these monomial orderings, and all initial ideals are distinct. Hence, the commutator ideal has at least uncountably many distinct reduced Gr¨obner bases. A Gr¨obner basis of the commutator ideal corresponds to a complete rewriting system for the free commutative monoid on three generators; our result also shows that this monoid has at least uncountably many distinct mini- mal complete rewriting systems. -
Lie Algebras by Shlomo Sternberg
Lie algebras Shlomo Sternberg April 23, 2004 2 Contents 1 The Campbell Baker Hausdorff Formula 7 1.1 The problem. 7 1.2 The geometric version of the CBH formula. 8 1.3 The Maurer-Cartan equations. 11 1.4 Proof of CBH from Maurer-Cartan. 14 1.5 The differential of the exponential and its inverse. 15 1.6 The averaging method. 16 1.7 The Euler MacLaurin Formula. 18 1.8 The universal enveloping algebra. 19 1.8.1 Tensor product of vector spaces. 20 1.8.2 The tensor product of two algebras. 21 1.8.3 The tensor algebra of a vector space. 21 1.8.4 Construction of the universal enveloping algebra. 22 1.8.5 Extension of a Lie algebra homomorphism to its universal enveloping algebra. 22 1.8.6 Universal enveloping algebra of a direct sum. 22 1.8.7 Bialgebra structure. 23 1.9 The Poincar´e-Birkhoff-Witt Theorem. 24 1.10 Primitives. 28 1.11 Free Lie algebras . 29 1.11.1 Magmas and free magmas on a set . 29 1.11.2 The Free Lie Algebra LX ................... 30 1.11.3 The free associative algebra Ass(X). 31 1.12 Algebraic proof of CBH and explicit formulas. 32 1.12.1 Abstract version of CBH and its algebraic proof. 32 1.12.2 Explicit formula for CBH. 32 2 sl(2) and its Representations. 35 2.1 Low dimensional Lie algebras. 35 2.2 sl(2) and its irreducible representations. 36 2.3 The Casimir element. 39 2.4 sl(2) is simple. -
Finitely Generated Simple Algebras: a Question of Bi Plotkin
FINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN A. I. LICHTMAN AND D. S. PASSMAN Abstract. In his recent series of lectures, Prof. B. I. Plotkin discussed ge- ometrical properties of the variety of associative K-algebras. In particular, he studied geometrically noetherian and logically noetherian algebras and, in this connection, he asked whether there exist uncountably many sim- ple K-algebras with a fixed finite number of generators. We answer this question in the affirmative using both crossed product constructions and HNN extensions of division rings. Specifically, we show that there exist un- countably many nonisomorphic 4-generator simple Ore domains, and also uncountably many nonisomorphic division algebras having 2 generators as a division algebra. 1. Introduction In his recent series of lectures [Pl], B. I. Plotkin discussed some geometrical properties of the variety of associative K-algebras. In particular, he considered geometrically noetherian and logically noetherian algebras and, in this connec- tion, he asked whether there exist uncountably many simple K-algebras with a fixed finite number of generators. We answer this question in the affirmative using both crossed product constructions and HNN extensions of division rings. To be precise, we show that there exist uncountably many nonisomorphic 4-generator simple Ore domains, and also uncountably many nonisomorphic division algebras having 2 generators as a division algebra. These results can be viewed as algebra analogs of the well-known theorem [N] which asserts that there exist uncount- ably many nonisomorphic 2-generator groups. Indeed, it was shown in [H] that there exist uncountably many nonisomorphic 6-generator simple groups (see [LS, Theorems IV.3.3 and IV.3.5]).