A Short Introduction to Category Theory

Total Page:16

File Type:pdf, Size:1020Kb

A Short Introduction to Category Theory A SHORT INTRODUCTION TO CATEGORY THEORY September 4, 2019 Contents 1. Category theory 1 1.1. Definition of a category 1 1.2. Natural transformations 3 1.3. Epimorphisms and monomorphisms 5 1.4. Yoneda Lemma 6 1.5. Limits and colimits 7 1.6. Free objects 9 References 9 1. Category theory 1.1. Definition of a category. Definition 1.1.1. A category C is the following data (1) a class ob(C), whose elements are called objects; (2) for any pair of objects A; B of C a set HomC(A; B), called set of morphisms; (3) for any three objects A; B; C of C a function HomC(A; B) × HomC(B; C) −! HomC(A; C) (f; g) −! g ◦ f; called composition of morphisms; which satisfy the following axioms (i) the sets of morphisms are all disjoints, so any morphism f determines his domain and his target; (ii) the composition is associative; (iii) for any object A of C there exists a morphism idA 2 Hom(A; A), called identity morphism, such that for any object B of C and any morphisms f 2 Hom(A; B) and g 2 Hom(C; A) we have f ◦ idA = f and idA ◦ g = g. Remark 1.1.2. The above definition is the definition of what is called a locally small category. For a general category we should admit that the set of morphisms is not a set. If the class of object is in fact a set then the category is called small. For a general category we should admit that morphisms form a class. We do not really need this definition even if it is useful in general. We remark that in the above definition, for any object A, the identity morphism is unique. Definition 1.1.3. A morphism f : A −! B is invertible if there exists a morphism g : B −! A, called inverse, such that g ◦ f = idA and f ◦ g = idB. In such a case we will say that A is isomorphic to B and f is also called an isomorphism. Even if ob(C) is not in general a set we will use sometimes the notation A 2 ob(C) to say that A is an object of C. Exercise 1.1.4. Prove that the inverse of an invertible morphism is unique. We observe that given a category C we can construct a category Co which has the same objects of C and such that for any two objects A; B we set HomCo (A; B) = HomC(B; A). So essentially we reverse all the arrows Examples 1.1.5. Here is some examples of categories. (1) Given a set X we can consider the category X whose objects are the elements of X and any morphism is the identity. If X is empty we obtain the empty category. (2) Set whose objects are sets and morphisms are functions. 1 2 A SHORT INTRODUCTION TO CATEGORY THEORY (3) Grp whose objects are groups and morphisms are group homomorphisms. (4) Ab whose objects are abelian groups and morphisms are group homomorphisms (5) Rng whose objects are rings with unity and morphisms are ring homomorphisms preserving unity. (6) CRng whose objects are commutative rings with unity and morphisms are ring homomorphisms preserving unity. (7) R-Mod whose objects are left R-modules and morphisms are left R-module homomorphisms. if R is a field k we call this category Vectk. We call FVectk the category of finite dimensional vector spaces. (8) Mod-R whose objects are right R-modules and morphisms are right R-module homomorphisms. (9) Top whose objects are topological spaces and morphisms are continuous functions. (10) Top∗ whose objects are topological spaces with a selected base point and morphisms are contin- uous functions which preserve base points. (11) Every pre-order set, i.e. every pair (X; ≤) with X a non-empty set and ≤ a transitive and reflexive relation on X, gives arise to a category whose objects are the elements of x and for any pair of elements x and y one defines Hom(x; y) as follows : it has an element (x; y) if x ≤ y and it is empty otherwise. The composition is given by (y; z) ◦ (x; y) := (x; z). The opposite category is the category which arises by (X; ≥). The preorder is a partial order, i.e. is anti-symmetric, if and only if the identities are the only isomorphisms. (12) A group G can be considered as a category BG with one object and where the morphisms are given by the elements of the group and the composition is given by the multiplication. Clearly any morphism has a two-sided inverse under composition. Definition 1.1.6. Given two categories C and D, a functor F : C −! D is a map that assigns to each object A of C an object F (A) of D and to each morphism f : A −! B of C a morphism F (f): F (A) −! F (B) such that F (f ◦ g) = F (f) ◦ F (g) and F (idA) = idA. We remark that one can sometimes speak about covariant functor and contravariant functor. In fact a covariant functor from C to D is just a functor as defined before, while a contravariant functor from C to D is a functor from Co to D and it is often denoted F : C −! D specifying that it is contravariant. So a contravariant functor just reverses arrows. Examples 1.1.7. (1) For any category C we have the functor identity idC defined in the obvious way. (2) For any category C and any set X to give a functor X !C is equivalent to give a set of objects fAxgx2X of C parametrized by X. (3) For any category C and any group G to give a functor BG !C is equivalent to give an object A of C with a group morphism G ! AutC(A), where AutC(A) is the set of isomorphisms of A in A, called automorphisms of A, which is clearly a group. We say that G acts over A. So if, for instance, C = Sets to give a functor BG !C is equivalent to give a G-set A. If H is another group then to give a functor BG ! BH is equivalent to give a group morphism G ! H since H = AutBH(?). A (4) For any object of a category C we can construct the covariant functor h := HomC(A; −) from C 0 to Sets which associates to any object B the set HomC(A; B) and to any morphism f : B ! B the function 0 f∗ : HomC(A; B) −! HomC(A; B ) g 7−! f ◦ g Similarly we can construct the contravariant functor hA := HomC(−;A) from C to Sets which 0 associates to any object B the set HomC(B; A) and to any morphism f : B ! B in C the function ∗ 0 f : HomC(B ;A) −! HomC(B; A) g 7−! g ◦ f (5) We have a natural functor F or : Grp −! Sets called forgetful. This functor forgets the group structure, so to any group it associates its underline set and to any group homomorphism it associates the same homomorphism seen as set function. In general a forgetful functor is a functor which simply forget some additional structure or property. Of course there are many other examples of forgetful functors. For instance F or : Rng −! Grp, F or : R-Mod −! Ab or F or : Ab −! Grp. (6) We have the functor Ab : Grp −! Ab which associates to any group G his abelianized Gab. Prove that it is a functor. A SHORT INTRODUCTION TO CATEGORY THEORY 3 (7) The topological fundamental group gives a functor Π1 : Top∗ −! Grp. (8) Taking the dual of a vector space over a field k gives a contravariant functor k-Mod −! k-Mod. (9) For any commutative ring with unity R we can consider the group GLn(R) which consists of invertible matrices with coefficients in R. It is easy to verify that in fact this gives a functor GLn : Crng −! Grp. If n = 1 this functor associates to any ring R the group of invertible elements R∗. In this case we denote it by (−)∗. (10) The construction of the dual of a vector space gives arise to a contravariant functor (−)_ : Vectk −! Vectk. (11) For any object X of a category D and for any category C we can construct the constant functor X which associates to any object of C the object X and to any morphism the identity morphism idX . Remark that if we have two functors F : C −! D and G : D −! E we can construct the composition G ◦ F . In fact if A is an object of C we define (G ◦ F )(A) := G(F (A)) and, if f : A −! B is a morphism of C, we define G ◦ F (f) := G(F (f)). Exercise 1.1.8. Prove that the above composition of functors is well defined and prove that it verifies the associative property. Remark 1.1.9. So we can consider the category Cat of small categories, where morphisms are the functors. If we consider locally small categories then we obtain a large category. Definition 1.1.10. A functor F : C −! D is (i) an isomorphism of categories if there exists a functor G : D −! C such that F ◦ G = idD and G ◦ F = idC . Any such a G is called inverse of F ; (ii) full if, for any pair of objects A and B of C, the function FA;B : HomC(A; B) −! HomD(F (A);F (B)) is surjective; (iii) faithful if FA;B is injective for any pair of objects A; B of C.
Recommended publications
  • Table of Contents
    UNIVERSAL PROPERTY & CASUALTY INSURANCE COMPANY MASSACHUSETTS PERSONAL PROPERTY MANUAL HOMEOWNERS PROGRAM EDITION 02/15 TABLE OF CONTENTS RULE CONTENT PAGE NO. 1 Application of Program Rules 1 2 Reserved for Future Use 1 3 Extent of Coverage 1 4 Reserved for Future Use 1 5 Policy Fee 1 6 Reserved for Future Use 1 7 Policy Period, Minimum Premium and Waiver of Premium 1 8 Rounding of Premiums 1 9 Changes and Mid-Term Premium Adjustments 2 10 Effective Date and Important Notices 2 11 Protective Device Credits 2 12 Townhouses or Rowhouses 2 13 Underwriting Surcharges 3 14 Mandatory Additional Charges 3 15 Payment and Payment Plan Options 4 16 Building Code Compliance 5 100 Reserved for Future Use 5 101 Limits of Liability and Coverage Relationship 6 102 Description of Coverages 6 103 Mandatory Coverages 7 104 Eligibility 7 105 Secondary Residence Premises 9 106 Reserved for Future Use 9 107 Construction Definitions 9 108 Seasonal Dwelling Definition 9 109 Single Building Definition 9 201 Policy Period 9 202 Changes or Cancellations 9 203 Manual Premium Revision 9 204 Reserved for Future Use 10 205 Reserved for Future Use 10 206 Transfer or Assignment 10 207 Reserved for Future Use 10 208 Premium Rounding Rule 10 209 Reserved for Future Use 10 300 Key Factor Interpolation Computation 10 301 Territorial Base Rates 11 401 Reserved for Future Use 20 402 Personal Property (Coverage C ) Replacement Cost Coverage 20 403 Age of Home 20 404 Ordinance or Law Coverage - Increased Limits 21 405 Debris Removal – HO 00 03 21 406 Deductibles 22 407 Additional
    [Show full text]
  • Chapter 4. Homomorphisms and Isomorphisms of Groups
    Chapter 4. Homomorphisms and Isomorphisms of Groups 4.1 Note: We recall the following terminology. Let X and Y be sets. When we say that f is a function or a map from X to Y , written f : X ! Y , we mean that for every x 2 X there exists a unique corresponding element y = f(x) 2 Y . The set X is called the domain of f and the range or image of f is the set Image(f) = f(X) = f(x) x 2 X . For a set A ⊆ X, the image of A under f is the set f(A) = f(a) a 2 A and for a set −1 B ⊆ Y , the inverse image of B under f is the set f (B) = x 2 X f(x) 2 B . For a function f : X ! Y , we say f is one-to-one (written 1 : 1) or injective when for every y 2 Y there exists at most one x 2 X such that y = f(x), we say f is onto or surjective when for every y 2 Y there exists at least one x 2 X such that y = f(x), and we say f is invertible or bijective when f is 1:1 and onto, that is for every y 2 Y there exists a unique x 2 X such that y = f(x). When f is invertible, the inverse of f is the function f −1 : Y ! X defined by f −1(y) = x () y = f(x). For f : X ! Y and g : Y ! Z, the composite g ◦ f : X ! Z is given by (g ◦ f)(x) = g(f(x)).
    [Show full text]
  • Arxiv:1705.02246V2 [Math.RT] 20 Nov 2019 Esyta Ulsubcategory Full a That Say [15]
    WIDE SUBCATEGORIES OF d-CLUSTER TILTING SUBCATEGORIES MARTIN HERSCHEND, PETER JØRGENSEN, AND LAERTIS VASO Abstract. A subcategory of an abelian category is wide if it is closed under sums, summands, kernels, cokernels, and extensions. Wide subcategories provide a significant interface between representation theory and combinatorics. If Φ is a finite dimensional algebra, then each functorially finite wide subcategory of mod(Φ) is of the φ form φ∗ mod(Γ) in an essentially unique way, where Γ is a finite dimensional algebra and Φ −→ Γ is Φ an algebra epimorphism satisfying Tor (Γ, Γ) = 0. 1 Let F ⊆ mod(Φ) be a d-cluster tilting subcategory as defined by Iyama. Then F is a d-abelian category as defined by Jasso, and we call a subcategory of F wide if it is closed under sums, summands, d- kernels, d-cokernels, and d-extensions. We generalise the above description of wide subcategories to this setting: Each functorially finite wide subcategory of F is of the form φ∗(G ) in an essentially φ Φ unique way, where Φ −→ Γ is an algebra epimorphism satisfying Tord (Γ, Γ) = 0, and G ⊆ mod(Γ) is a d-cluster tilting subcategory. We illustrate the theory by computing the wide subcategories of some d-cluster tilting subcategories ℓ F ⊆ mod(Φ) over algebras of the form Φ = kAm/(rad kAm) . Dedicated to Idun Reiten on the occasion of her 75th birthday 1. Introduction Let d > 1 be an integer. This paper introduces and studies wide subcategories of d-abelian categories as defined by Jasso. The main examples of d-abelian categories are d-cluster tilting subcategories as defined by Iyama.
    [Show full text]
  • The General Linear Group
    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
    [Show full text]
  • A Category-Theoretic Approach to Representation and Analysis of Inconsistency in Graph-Based Viewpoints
    A Category-Theoretic Approach to Representation and Analysis of Inconsistency in Graph-Based Viewpoints by Mehrdad Sabetzadeh A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto Copyright c 2003 by Mehrdad Sabetzadeh Abstract A Category-Theoretic Approach to Representation and Analysis of Inconsistency in Graph-Based Viewpoints Mehrdad Sabetzadeh Master of Science Graduate Department of Computer Science University of Toronto 2003 Eliciting the requirements for a proposed system typically involves different stakeholders with different expertise, responsibilities, and perspectives. This may result in inconsis- tencies between the descriptions provided by stakeholders. Viewpoints-based approaches have been proposed as a way to manage incomplete and inconsistent models gathered from multiple sources. In this thesis, we propose a category-theoretic framework for the analysis of fuzzy viewpoints. Informally, a fuzzy viewpoint is a graph in which the elements of a lattice are used to specify the amount of knowledge available about the details of nodes and edges. By defining an appropriate notion of morphism between fuzzy viewpoints, we construct categories of fuzzy viewpoints and prove that these categories are (finitely) cocomplete. We then show how colimits can be employed to merge the viewpoints and detect the inconsistencies that arise independent of any particular choice of viewpoint semantics. Taking advantage of the same category-theoretic techniques used in defining fuzzy viewpoints, we will also introduce a more general graph-based formalism that may find applications in other contexts. ii To my mother and father with love and gratitude. Acknowledgements First of all, I wish to thank my supervisor Steve Easterbrook for his guidance, support, and patience.
    [Show full text]
  • 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 .
    [Show full text]
  • Derived Functors and Homological Dimension (Pdf)
    DERIVED FUNCTORS AND HOMOLOGICAL DIMENSION George Torres Math 221 Abstract. This paper overviews the basic notions of abelian categories, exact functors, and chain complexes. It will use these concepts to define derived functors, prove their existence, and demon- strate their relationship to homological dimension. I affirm my awareness of the standards of the Harvard College Honor Code. Date: December 15, 2015. 1 2 DERIVED FUNCTORS AND HOMOLOGICAL DIMENSION 1. Abelian Categories and Homology The concept of an abelian category will be necessary for discussing ideas on homological algebra. Loosely speaking, an abelian cagetory is a type of category that behaves like modules (R-mod) or abelian groups (Ab). We must first define a few types of morphisms that such a category must have. Definition 1.1. A morphism f : X ! Y in a category C is a zero morphism if: • for any A 2 C and any g; h : A ! X, fg = fh • for any B 2 C and any g; h : Y ! B, gf = hf We denote a zero morphism as 0XY (or sometimes just 0 if the context is sufficient). Definition 1.2. A morphism f : X ! Y is a monomorphism if it is left cancellative. That is, for all g; h : Z ! X, we have fg = fh ) g = h. An epimorphism is a morphism if it is right cancellative. The zero morphism is a generalization of the zero map on rings, or the identity homomorphism on groups. Monomorphisms and epimorphisms are generalizations of injective and surjective homomorphisms (though these definitions don't always coincide). It can be shown that a morphism is an isomorphism iff it is epic and monic.
    [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]
  • AN INTRODUCTION to CATEGORY THEORY and the YONEDA LEMMA Contents Introduction 1 1. Categories 2 2. Functors 3 3. Natural Transfo
    AN INTRODUCTION TO CATEGORY THEORY AND THE YONEDA LEMMA SHU-NAN JUSTIN CHANG Abstract. We begin this introduction to category theory with definitions of categories, functors, and natural transformations. We provide many examples of each construct and discuss interesting relations between them. We proceed to prove the Yoneda Lemma, a central concept in category theory, and motivate its significance. We conclude with some results and applications of the Yoneda Lemma. Contents Introduction 1 1. Categories 2 2. Functors 3 3. Natural Transformations 6 4. The Yoneda Lemma 9 5. Corollaries and Applications 10 Acknowledgments 12 References 13 Introduction Category theory is an interdisciplinary field of mathematics which takes on a new perspective to understanding mathematical phenomena. Unlike most other branches of mathematics, category theory is rather uninterested in the objects be- ing considered themselves. Instead, it focuses on the relations between objects of the same type and objects of different types. Its abstract and broad nature allows it to reach into and connect several different branches of mathematics: algebra, geometry, topology, analysis, etc. A central theme of category theory is abstraction, understanding objects by gen- eralizing rather than focusing on them individually. Similar to taxonomy, category theory offers a way for mathematical concepts to be abstracted and unified. What makes category theory more than just an organizational system, however, is its abil- ity to generate information about these abstract objects by studying their relations to each other. This ability comes from what Emily Riehl calls \arguably the most important result in category theory"[4], the Yoneda Lemma. The Yoneda Lemma allows us to formally define an object by its relations to other objects, which is central to the relation-oriented perspective taken by category theory.
    [Show full text]
  • N-Quasi-Abelian Categories Vs N-Tilting Torsion Pairs 3
    N-QUASI-ABELIAN CATEGORIES VS N-TILTING TORSION PAIRS WITH AN APPLICATION TO FLOPS OF HIGHER RELATIVE DIMENSION LUISA FIOROT Abstract. It is a well established fact that the notions of quasi-abelian cate- gories and tilting torsion pairs are equivalent. This equivalence fits in a wider picture including tilting pairs of t-structures. Firstly, we extend this picture into a hierarchy of n-quasi-abelian categories and n-tilting torsion classes. We prove that any n-quasi-abelian category E admits a “derived” category D(E) endowed with a n-tilting pair of t-structures such that the respective hearts are derived equivalent. Secondly, we describe the hearts of these t-structures as quotient categories of coherent functors, generalizing Auslander’s Formula. Thirdly, we apply our results to Bridgeland’s theory of perverse coherent sheaves for flop contractions. In Bridgeland’s work, the relative dimension 1 assumption guaranteed that f∗-acyclic coherent sheaves form a 1-tilting torsion class, whose associated heart is derived equivalent to D(Y ). We generalize this theorem to relative dimension 2. Contents Introduction 1 1. 1-tilting torsion classes 3 2. n-Tilting Theorem 7 3. 2-tilting torsion classes 9 4. Effaceable functors 14 5. n-coherent categories 17 6. n-tilting torsion classes for n> 2 18 7. Perverse coherent sheaves 28 8. Comparison between n-abelian and n + 1-quasi-abelian categories 32 Appendix A. Maximal Quillen exact structure 33 Appendix B. Freyd categories and coherent functors 34 Appendix C. t-structures 37 References 39 arXiv:1602.08253v3 [math.RT] 28 Dec 2019 Introduction In [6, 3.3.1] Beilinson, Bernstein and Deligne introduced the notion of a t- structure obtained by tilting the natural one on D(A) (derived category of an abelian category A) with respect to a torsion pair (X , Y).
    [Show full text]
  • Coreflective Subcategories
    transactions of the american mathematical society Volume 157, June 1971 COREFLECTIVE SUBCATEGORIES BY HORST HERRLICH AND GEORGE E. STRECKER Abstract. General morphism factorization criteria are used to investigate categorical reflections and coreflections, and in particular epi-reflections and mono- coreflections. It is shown that for most categories with "reasonable" smallness and completeness conditions, each coreflection can be "split" into the composition of two mono-coreflections and that under these conditions mono-coreflective subcategories can be characterized as those which are closed under the formation of coproducts and extremal quotient objects. The relationship of reflectivity to closure under limits is investigated as well as coreflections in categories which have "enough" constant morphisms. 1. Introduction. The concept of reflections in categories (and likewise the dual notion—coreflections) serves the purpose of unifying various fundamental con- structions in mathematics, via "universal" properties that each possesses. His- torically, the concept seems to have its roots in the fundamental construction of E. Cech [4] whereby (using the fact that the class of compact spaces is productive and closed-hereditary) each completely regular F2 space is densely embedded in a compact F2 space with a universal extension property. In [3, Appendice III; Sur les applications universelles] Bourbaki has shown the essential underlying similarity that the Cech-Stone compactification has with other mathematical extensions, such as the completion of uniform spaces and the embedding of integral domains in their fields of fractions. In doing so, he essentially defined the notion of reflections in categories. It was not until 1964, when Freyd [5] published the first book dealing exclusively with the theory of categories, that sufficient categorical machinery and insight were developed to allow for a very simple formulation of the concept of reflections and for a basic investigation of reflections as entities themselvesi1).
    [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]