INTRODUCTION to CATEGORY THEORY, II Homework 4, Due

Total Page：16

File Type：pdf, Size：1020Kb

INTRODUCTION TO CATEGORY THEORY, II Homework 4, due Tuesday Aug 21. More adjunctions. 1. (Riehl 4.5.v) Show that a morphism f : x ! y in C is a monomorphism if and only if the square (∗) 1 x x > x 1x f _ _ x > y f is a pullback. Conclude that right adjoints preserve monomorphisms and that left adjoints preserve epimorphisms. 2. For a group G, let [G; G] denote the commutator subgroup of G. That is, [G; G] is the group generated by the elements of the form ghg−1h−1, where g; h 2 G. Let F : Ab ! Group be a the forgetful functor. Let A: Group ! Ab be the functor taking each group G to G=[G; G] (called the abelianization of G), and each homomorphism f : H ! G to the induced homomorphism A(f): H=[H; H] ! G=[G; G]: (1) Show that [G; G] is a normal subgroup of G and that G=[G; G] is abelian. (2) Show that A is a left adjoint of F . 3. Let F : Ab ! Group be the forgetful functor. Does F have a right adjoint? 4. Let X be a fixed set. Show that the functor X × −: Set ! Set cannot have a left adjoint unless X is a one-point set. 5. Let I : Set ! Top be the right adjoint to the forgetful functor Top ! Set. Show that I has no right adjoint. 6. (Riehl, 4.5 vii, parts i and ii) Consider a reflective subcategory inclusion D ,!C with reflector L: C!D. (1) Show that ηL = Lη and that these natural transformations are isomorphisms. (2) Show that an object c 2 C is in the essential image of the inclusion D ,!C, meaning that it is isomorphic to an object in the subcategory D, if and only if ηc is an isomorphism. Date: August 14, 2018. 1 2 INTRODUCTION TO CATEGORY THEORY, II 7. (Riehl, 4.5 vii, part iii) Show that the essential image of D consists of those objects c that are local for the class of morphisms that are inverted by L. That is, c is in the essential image if and only if the pre-composition functions f ∗ C(b; c) −! C(a; c) are isomorphisms for all maps f : a ! b in C for which Lf is an isomorphism in D. This explains why the reflector is also referred to as "localization"..

Copy Link

Recommended publications

Category of G-Groups and Its Spectral Category
Communications in Algebra ISSN: 0092-7872 (Print) 1532-4125 (Online) Journal homepage: http://www.tandfonline.com/loi/lagb20 Category of G-Groups and its Spectral Category María José Arroyo Paniagua & Alberto Facchini To cite this article: María José Arroyo Paniagua & Alberto Facchini (2017) Category of G-Groups and its Spectral Category, Communications in Algebra, 45:4, 1696-1710, DOI: 10.1080/00927872.2016.1222409 To link to this article: http://dx.doi.org/10.1080/00927872.2016.1222409 Accepted author version posted online: 07 Oct 2016. Published online: 07 Oct 2016. Submit your article to this journal Article views: 12 View related articles View Crossmark data Full Terms & Conditions of access and use can be found at http://www.tandfonline.com/action/journalInformation?journalCode=lagb20 Download by: [UNAM Ciudad Universitaria] Date: 29 November 2016, At: 17:29 COMMUNICATIONS IN ALGEBRA® 2017, VOL. 45, NO. 4, 1696–1710 http://dx.doi.org/10.1080/00927872.2016.1222409 Category of G-Groups and its Spectral Category María José Arroyo Paniaguaa and Alberto Facchinib aDepartamento de Matemáticas, División de Ciencias Básicas e Ingeniería, Universidad Autónoma Metropolitana, Unidad Iztapalapa, Mexico, D. F., México; bDipartimento di Matematica, Università di Padova, Padova, Italy ABSTRACT ARTICLE HISTORY Let G be a group. We analyse some aspects of the category G-Grp of G-groups. Received 15 April 2016 In particular, we show that a construction similar to the construction of the Revised 22 July 2016 spectral category, due to Gabriel and Oberst, and its dual, due to the second Communicated by T. Albu. author, is possible for the category G-Grp.
[Show full text]
Abelian Categories
Abelian Categories Lemma. In an Ab-enriched category with zero object every finite product is coproduct and conversely. π1 Proof. Suppose A × B //A; B is a product. Define ι1 : A ! A × B and π2 ι2 : B ! A × B by π1ι1 = id; π2ι1 = 0; π1ι2 = 0; π2ι2 = id: It follows that ι1π1+ι2π2 = id (both sides are equal upon applying π1 and π2). To show that ι1; ι2 are a coproduct suppose given ' : A ! C; : B ! C. It φ : A × B ! C has the properties φι1 = ' and φι2 = then we must have φ = φid = φ(ι1π1 + ι2π2) = ϕπ1 + π2: Conversely, the formula ϕπ1 + π2 yields the desired map on A × B. An additive category is an Ab-enriched category with a zero object and finite products (or coproducts). In such a category, a kernel of a morphism f : A ! B is an equalizer k in the diagram k f ker(f) / A / B: 0 Dually, a cokernel of f is a coequalizer c in the diagram f c A / B / coker(f): 0 An Abelian category is an additive category such that 1. every map has a kernel and a cokernel, 2. every mono is a kernel, and every epi is a cokernel. In fact, it then follows immediatly that a mono is the kernel of its cokernel, while an epi is the cokernel of its kernel. 1 Proof of last statement. Suppose f : B ! C is epi and the cokernel of some g : A ! B. Write k : ker(f) ! B for the kernel of f. Since f ◦ g = 0 the map g¯ indicated in the diagram exists.
[Show full text]
Monomorphism - Wikipedia, the Free Encyclopedia
Monomorphism - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Monomorphism Monomorphism From Wikipedia, the free encyclopedia In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from X to Y is often denoted with the notation . In the more general setting of category theory, a monomorphism (also called a monic morphism or a mono) is a left-cancellative morphism, that is, an arrow f : X → Y such that, for all morphisms g1, g2 : Z → X, Monomorphisms are a categorical generalization of injective functions (also called "one-to-one functions"); in some categories the notions coincide, but monomorphisms are more general, as in the examples below. The categorical dual of a monomorphism is an epimorphism, i.e. a monomorphism in a category C is an epimorphism in the dual category Cop. Every section is a monomorphism, and every retraction is an epimorphism. Contents 1 Relation to invertibility 2 Examples 3 Properties 4 Related concepts 5 Terminology 6 See also 7 References Relation to invertibility Left invertible morphisms are necessarily monic: if l is a left inverse for f (meaning l is a morphism and ), then f is monic, as A left invertible morphism is called a split mono. However, a monomorphism need not be left-invertible. For example, in the category Group of all groups and group morphisms among them, if H is a subgroup of G then the inclusion f : H → G is always a monomorphism; but f has a left inverse in the category if and only if H has a normal complement in G.
[Show full text]
Mathematical Morphology Via Category Theory 3
Mathematical Morphology via Category Theory Hossein Memarzadeh Sharifipour1 and Bardia Yousefi2,3 1 Department of Computer Science, Laval University, Qubec, CA [email protected] 2 Department of Electrical and Computer Engineering, Laval University, Qubec, CA 3 Address: University of Pennsylvania, Philadelphia PA 19104 [email protected] Abstract. Mathematical morphology contributes many profitable tools to image processing area. Some of these methods considered to be basic but the most important fundamental of data processing in many various applications. In this paper, we modify the fundamental of morphological operations such as dilation and erosion making use of limit and co-limit preserving functors within (Category Theory). Adopting the well-known matrix representation of images, the category of matrix, called Mat, can be represented as an image. With enriching Mat over various semirings such as Boolean and (max, +) semirings, one can arrive at classical defi- nition of binary and gray-scale images using the categorical tensor prod- uct in Mat. With dilation operation in hand, the erosion can be reached using the famous tensor-hom adjunction. This approach enables us to define new types of dilation and erosion between two images represented by matrices using different semirings other than Boolean and (max, +) semirings. The viewpoint of morphological operations from category the- ory can also shed light to the claimed concept that mathematical mor- phology is a model for linear logic. Keywords: Mathematical morphology · Closed monoidal categories · Day convolution. Enriched categories, category of semirings 1 Introduction Mathematical morphology is a structure-based analysis of images constructed on set theory concepts.
[Show full text]
Classifying Categories the Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories
U.U.D.M. Project Report 2018:5 Classifying Categories The Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories Daniel Ahlsén Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Juni 2018 Department of Mathematics Uppsala University Classifying Categories The Jordan-Holder¨ and Krull-Schmidt-Remak theorems for abelian categories Daniel Ahlsen´ Uppsala University June 2018 Abstract The Jordan-Holder¨ and Krull-Schmidt-Remak theorems classify finite groups, either as direct sums of indecomposables or by composition series. This thesis defines abelian categories and extends the aforementioned theorems to this context. 1 Contents 1 Introduction3 2 Preliminaries5 2.1 Basic Category Theory . .5 2.2 Subobjects and Quotients . .9 3 Abelian Categories 13 3.1 Additive Categories . 13 3.2 Abelian Categories . 20 4 Structure Theory of Abelian Categories 32 4.1 Exact Sequences . 32 4.2 The Subobject Lattice . 41 5 Classification Theorems 54 5.1 The Jordan-Holder¨ Theorem . 54 5.2 The Krull-Schmidt-Remak Theorem . 60 2 1 Introduction Category theory was developed by Eilenberg and Mac Lane in the 1942-1945, as a part of their research into algebraic topology. One of their aims was to give an axiomatic account of relationships between collections of mathematical structures. This led to the definition of categories, functors and natural transformations, the concepts that unify all category theory, Categories soon found use in module theory, group theory and many other disciplines. Nowadays, categories are used in most of mathematics, and has even been proposed as an alternative to axiomatic set theory as a foundation of mathematics.[Law66] Due to their general nature, little can be said of an arbitrary category.
[Show full text]
Math 395: Category Theory Northwestern University, Lecture Notes
Math 395: Category Theory Northwestern University, Lecture Notes Written by Santiago Can˜ez These are lecture notes for an undergraduate seminar covering Category Theory, taught by the author at Northwestern University. The book we roughly follow is “Category Theory in Context” by Emily Riehl. These notes outline the specific approach we’re taking in terms the order in which topics are presented and what from the book we actually emphasize. We also include things we look at in class which aren’t in the book, but otherwise various standard definitions and examples are left to the book. Watch out for typos! Comments and suggestions are welcome. Contents Introduction to Categories 1 Special Morphisms, Products 3 Coproducts, Opposite Categories 7 Functors, Fullness and Faithfulness 9 Coproduct Examples, Concreteness 12 Natural Isomorphisms, Representability 14 More Representable Examples 17 Equivalences between Categories 19 Yoneda Lemma, Functors as Objects 21 Equalizers and Coequalizers 25 Some Functor Properties, An Equivalence Example 28 Segal’s Category, Coequalizer Examples 29 Limits and Colimits 29 More on Limits/Colimits 29 More Limit/Colimit Examples 30 Continuous Functors, Adjoints 30 Limits as Equalizers, Sheaves 30 Fun with Squares, Pullback Examples 30 More Adjoint Examples 30 Stone-Cech 30 Group and Monoid Objects 30 Monads 30 Algebras 30 Ultrafilters 30 Introduction to Categories Category theory provides a framework through which we can relate a construction/fact in one area of mathematics to a construction/fact in another. The goal is an ultimate form of abstraction, where we can truly single out what about a given problem is specific to that problem, and what is a reflection of a more general phenomenom which appears elsewhere.
[Show full text]
Category Theory and Diagrammatic Reasoning 3 Universal Properties, Limits and Colimits
Category theory and diagrammatic reasoning 13th February 2019 Last updated: 7th February 2019 3 Universal properties, limits and colimits A division problem is a question of the following form: Given a and b, does there exist x such that a composed with x is equal to b? If it exists, is it unique? Such questions are ubiquitious in mathematics, from the solvability of systems of linear equations, to the existence of sections of fibre bundles. To make them precise, one needs additional information: • What types of objects are a and b? • Where can I look for x? • How do I compose a and x? Since category theory is, largely, a theory of composition, it also offers a unifying frame- work for the statement and classification of division problems. A fundamental notion in category theory is that of a universal property: roughly, a universal property of a states that for all b of a suitable form, certain division problems with a and b as parameters have a (possibly unique) solution. Let us start from universal properties of morphisms in a category. Consider the following division problem. Problem 1. Let F : Y ! X be a functor, x an object of X. Given a pair of morphisms F (y0) f 0 F (y) x , f does there exist a morphism g : y ! y0 in Y such that F (y0) F (g) f 0 F (y) x ? f If it exists, is it unique? 1 This has the form of a division problem where a and b are arbitrary morphisms in X (which need to have the same target), x is constrained to be in the image of a functor F , and composition is composition of morphisms.
[Show full text]
Category Theory Course
Category Theory Course John Baez September 3, 2019 1 Contents 1 Category Theory: 4 1.1 Definition of a Category....................... 5 1.1.1 Categories of mathematical objects............. 5 1.1.2 Categories as mathematical objects............ 6 1.2 Doing Mathematics inside a Category............... 10 1.3 Limits and Colimits.......................... 11 1.3.1 Products............................ 11 1.3.2 Coproducts.......................... 14 1.4 General Limits and Colimits..................... 15 2 Equalizers, Coequalizers, Pullbacks, and Pushouts (Week 3) 16 2.1 Equalizers............................... 16 2.2 Coequalizers.............................. 18 2.3 Pullbacks................................ 19 2.4 Pullbacks and Pushouts....................... 20 2.5 Limits for all finite diagrams.................... 21 3 Week 4 22 3.1 Mathematics Between Categories.................. 22 3.2 Natural Transformations....................... 25 4 Maps Between Categories 28 4.1 Natural Transformations....................... 28 4.1.1 Examples of natural transformations........... 28 4.2 Equivalence of Categories...................... 28 4.3 Adjunctions.............................. 29 4.3.1 What are adjunctions?.................... 29 4.3.2 Examples of Adjunctions.................. 30 4.3.3 Diagonal Functor....................... 31 5 Diagrams in a Category as Functors 33 5.1 Units and Counits of Adjunctions................. 39 6 Cartesian Closed Categories 40 6.1 Evaluation and Coevaluation in Cartesian Closed Categories. 41 6.1.1 Internalizing Composition................. 42 6.2 Elements................................ 43 7 Week 9 43 7.1 Subobjects............................... 46 8 Symmetric Monoidal Categories 50 8.1 Guest lecture by Christina Osborne................ 50 8.1.1 What is a Monoidal Category?............... 50 8.1.2 Going back to the definition of a symmetric monoidal category.............................. 53 2 9 Week 10 54 9.1 The subobject classifier in Graph.................
[Show full text]
Notes on Category Theory (In Progress)
Notes on Category Theory (in progress) George Torres Last updated February 28, 2018 Contents 1 Introduction and Motivation 3 2 Deﬁnition of a Category 3 2.1 Examples . .4 3 Functors 4 3.1 Natural Transformations . .5 3.2 Adjoint Functors . .5 3.3 Units and Counits . .6 3.4 Initial and Terminal Objects . .7 3.4.1 Comma Categories . .7 4 Representability and Yoneda's Lemma 8 4.1 Representables . .9 4.2 The Yoneda Embedding . 10 4.3 The Yoneda Lemma . 10 4.4 Consequences of Yoneda . 11 5 Limits and Colimits 12 5.1 (Co)Products, (Co)Equalizers, Pullbacks and Pushouts . 13 5.2 Topological limits . 15 5.3 Existence of limits and colimits . 15 5.4 Limits as Representable Objects . 16 5.5 Limits as Adjoints . 16 5.6 Preserving Limits and GAFT . 18 6 Abelian Categories 19 6.1 Homology . 20 6.1.1 Biproducts . 21 6.2 Exact Functors . 23 6.3 Injective and Projective Objects . 26 6.3.1 Projective and Injective Modules . 27 6.4 The Chain Complex Category . 28 6.5 Homological dimension . 30 6.6 Derived Functors . 32 1 CONTENTS CONTENTS 7 Triangulated and Derived Categories 35 ||||||||||| Note to the reader: This is an ongoing collection of notes on introductory category theory that I have kept since my undergraduate years. They are aimed at students with an undergraduate level background in topology and algebra. These notes started as lecture notes for the Fall 2015 Category Theory tutorial led by Danny Shi at Harvard. There is no single textbook that these notes follow, but Categories for the Working Mathematician by Mac Lane and Lang's Algebra are good standard resources.
[Show full text]
ELEMENTARY TOPOI: SETS, GENERALIZED Contents 1. Categorical Basics 1 2. Subobject Classifiers 6 3. Exponentials 7 4. Elementary
ELEMENTARY TOPOI: SETS, GENERALIZED CHRISTOPHER HENDERSON Abstract. An elementary topos is a nice way to generalize the notion of sets using categorical language. If we restrict our world to categories which satisfy a few simple requirements we can discuss and prove properties of sets without ever using the word \set." This paper will give a short background of category theory in order to prove some interesting properties about topoi. Contents 1. Categorical Basics 1 2. Subobject Classiﬁers 6 3. Exponentials 7 4. Elementary Topoi 9 5. Lattices and Heyting Algebras 10 6. Factorizing Arrows 12 7. Slice Categories as Topoi 13 8. Lattice Objects and Heyting Algebra Objects 17 9. Well-Pointed Topoi 22 10. Concluding Remarks 22 Acknowledgments 23 References 23 1. Categorical Basics Deﬁnition 1.1. A category, C is made up of: • Objects: A; B; C; : : : • Morphisms: f; g; h; : : : This is a generalization of \functions" between objects. If f is a mor- phism in a category C then there are objects A; B in C such that f is a morphism from A to B, as below. We call A = dom(f) (the \domain") and B = cod(f) (the \codomain"). f A / B Date: August 5, 2009. 1 2 CHRISTOPHER HENDERSON If we have morphisms f : A ! B and g : B ! C then there exists an arrow h : A ! C such that the following diagram commutes: f A / B @@ @@ g h @@ @ C Here we are only asserting some rule of composition. We denote h = g ◦ f. This rule of composition must satisfy associativity, so that for f : A ! B; g : B ! C; h : C ! D, we have that: h ◦ (g ◦ f) = (h ◦ g) ◦ f Lastly, for every object A in C, there is a morphism idA : A ! A such that for any other morphisms g : A ! B and h : B ! A, we have that: g = g ◦ idA; h = idA ◦ h Remark 1.2.
[Show full text]
1 Direct and Inverse Image 2 Morphisms of (Locally) Ringed Spaces
18.726: Algebraic Geometry (K.S. Kedlaya, MIT, Spring 2009) Morphisms of schemes (updated 20 Feb 09) We next introduce morphisms of locally ringed spaces and schemes. Same references as the previous handout. Missing remark from last time: when EGA was written, what we now call a scheme was called a prescheme. EGA’s “scheme” is what we will call a separated scheme. 1 Direct and inverse image To define morphisms of ringed spaces, I need the direct and inverse image functors for sheaves. I had these on a previous handout, but didn’t discuss them in class, so let me review. Let f : X → Y be a continuous map. For F a sheaf on X, the formula −1 (f∗F)(V )= F(f (V )) obviously defines a sheaf f∗F on Y . It is called the direct image of F. −1 Now let G be a sheaf on Y . Define a presheaf f− G on X as follows: for U open in X, −1 let (f− G)(U) be the stalk of G at f(U), i.e., the direct limit of G(V ) over open sets V ⊆ X containing f(U). This is general not a sheaf; its sheafification is called the inverse image of G, denoted f −1G. (The notation f ∗ is reserved for something else; see below.) −1 Proposition. The functors f and f∗ form an adjoint pair. Proof. Exercise. Using the inverse image, we can define the restriction of F to an arbitrary subset Z of X, as the sheaf i−1F for i : Z → X the inclusion map (with Z given the subspace topology).
[Show full text]
Basic Category Theory
Basic Category Theory TOMLEINSTER University of Edinburgh arXiv:1612.09375v1 [math.CT] 30 Dec 2016 First published as Basic Category Theory, Cambridge Studies in Advanced Mathematics, Vol. 143, Cambridge University Press, Cambridge, 2014. ISBN 978-1-107-04424-1 (hardback). Information on this title: http://www.cambridge.org/9781107044241 c Tom Leinster 2014 This arXiv version is published under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International licence (CC BY-NC-SA 4.0). Licence information: https://creativecommons.org/licenses/by-nc-sa/4.0 c Tom Leinster 2014, 2016 Preface to the arXiv version This book was ﬁrst published by Cambridge University Press in 2014, and is now being published on the arXiv by mutual agreement. CUP has consistently supported the mathematical community by allowing authors to make free ver- sions of their books available online. Readers may, in turn, wish to support CUP by buying the printed version, available at http://www.cambridge.org/ 9781107044241. This electronic version is not only free; it is also freely editable. For in- stance, if you would like to teach a course using this book but some of the examples are unsuitable for your class, you can remove them or add your own. Similarly, if there is notation that you dislike, you can easily change it; or if you want to reformat the text for reading on a particular device, that is easy too. In legal terms, this text is released under the Creative Commons Attribution- NonCommercial-ShareAlike 4.0 International licence (CC BY-NC-SA 4.0). The licence terms are available at the Creative Commons website, https:// creativecommons.org/licenses/by-nc-sa/4.0.
[Show full text]