DOCSLIB.ORG

Homological Algebra in Abelian Categories

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Homological Algebra in Abelian Categories Homological Algebra in Abelian Categories Rylee Lyman March 3, 2019 1 Preliminaries Recall that a category is a collection of objects with arrows between them. We use the word \collection" advisedly, making no claim that we are dealing with sets. We require each object A to have an associated arrow A 1A A called the identity. We also require composition of arrows to be defined whenever it makes sense, and we require this composition to be associative. Furthermore, given f : A ! B, f1A = f = 1Bf We follow the treatment in [Mac71] to which the curious reader is referred. In category theory, a dual statement is one in which all the arrows have been reversed. For example, an arrow m is monic if it is \right-cancellative," i.e. mf = mg =) f = g The dual notion is an epi. An isomorphism is an arrow that has a two-sided inverse. Exercise 1. Isomorphisms are both monic and epi The converse does not always hold. A standard example is the inclusion Z ! Q in the category of rings. An object z is initial if, given another object t, there is a unique arrow z A: Dually, an object is terminal if there is a unique arrow to the object from any given object. A zero object is one that is both initial and terminal. Exercise 2. If z and w are both initial, terminal, or zero objects, there exists a unique isomorphism z ! w. We will denote our zero objects as 0, as well as any arrow that factors through the zero object. 1 A kernel for a map f : A ! B is an object ker f together with an arrow m: ker f ! A (sometimes also denoted ker f) such that the following diagram commutes. ker f m A 0 f B We say a diagram commutes when following any directed path in the diagram yields equal arrows, so the content of the statement here is just that fm = 0 as arrows ker f ! B. Actually that's not all that's required. A kernel must also be universal for this property. That is, for any other choice of object and arrow that makes the diagram commute, there is a unique arrow (indicated as dashed in the figure below) that makes the diagram commute. K ker f m A 0 f 0 B The dual notion is a cokernel. The following are good practice, and facts we need. Exercise 3. Kernels and cokernels, when they exist, are unique up to unique isomorphism. Moreover, kernels are monic and cokernels are epi. Exercise 4. If m: A ! B is monic in a category with a zero object, 0 ! A is a kernel for m. Dually, if e: A ! B is epi in a category with a zero object, B ! 0 is a cokernel for e. Exercise 5. In a category with a zero object, 1B : B ! B is a cokernel for 0: A ! B. Therefore any cokernel of a zero arrow is an isomorphism. Finally, a (binary) product of two objects A and B is a third object A × B and morphisms π1 : A × B ! A, π2 : A × B ! B, that satisfies the universal property that given maps f : C ! A and g : C ! B, there exists a unique map f × g : C ! A × B that makes the following diagram commute. C f g f×g A A × B B π1 π2 The dual notion is a coproduct, A q B, for which the diagram is A ι1 A q B ι2 B fqg f g C 2 Exercise 6. Products and coproducts, when they exist, are unique up to unique isomorphism. 2 Abelian Categories Definition 1. An abelian category is a category which 1. has a zero object 2. every pair of objects has a product and a coproduct and the unique map [(1A × 0) q (0 × 1B)]: A q B ! A × B is an isomorphism. 3. every arrow has a kernel and a cokernel 4. every monic arrow is a kernel and every epi arrow is a cokernel. Because the dual of each statement is itself, proving a statement about abelian categories proves the dual statement as well. Rather than binary co- products and products, we will think instead of an object A ⊕ B that is both a product and a coproduct. Exercise 7. Given A⊕B in an abelian category, use [(1A×0)q(0×1B)] = 1A⊕B to show that π1ι1 = 1A, π2ι2 = 1B, π1ι2 = 0 and π2ι1 = 0. Conclude that πi and ιi are epi and monic, respectively. Show also that [(1A q 0) × (0 q 1A)] = 1A⊕B. Exercise 8. The unique map ∆ = (1A × 1A) described below is a monomor- phism. A 1 1 A ∆ A A A ⊕ A A π1 π2 We would like to prove the following Theorem 1. Given arrows f : A ! B, g : A ! B in an abelian category, there is a third arrow f +g : A ! B. This new arrow is uniquely determined by f and g as (f + g) = (f q g)∆, and gives the collection of arrows A ! B the structure of an abelian group. Before we can, we need some preliminaries. Exercise 9. In an abelian category, a monic arrow is the kernel of its cokernel. Dually, an epi is the cokernel of its kernel. Proposition 1. In an abelian category, an arrow that is both monic and epi is an isomorphism. (Proposition 1.5.1 in [Bor94].) Proof. In view of the previous exercises, note that if f : A ! B is both monic and epi, then 0 ! A is a kernel of f, and since f is epi, f = coker(ker f) = coker 0, which is an isomorphism. 3 Exercise 10. Show that ι1π1 + ι2π2 = 1A⊕B, and that addition of arrows distributes over function composition, i.e. that (f + g)h = (fh) + (gh), similarly k(f + g) = (kf) + (kg). Use the above to show that f q g = fπ1 + gπ2, f × g = ι1f + ι2g and thus in particular ∆ = ι1 + ι2. Use symmetry of the diagram for ∆ to show addition of arrows is commutative. Exercise 11. Show that (A ⊕ B) ⊕ C and A ⊕ (B ⊕ C) are isomorphic, and thus that addition of arrows is associative. Proposition 2. 0: A ! B is the identity for addition of arrows. Proof. We note that the following diagram commutes because π1ι2 = 0 and π1ι1 = 1 A ι1 A ⊕ A ι2 A fπ1 f 0 B and conclude that fπ1 = f q 0. Now observe that fπ1∆ = fπ1(1A × 1A) = f1A = f. So far we have constructed a commutative monoid structure on arrows A ! B, and to do it we have only needed biproducts and zero objects. It is the existence of inverses for which we will need the extra hypotheses. Proposition 3. In an abelian category with a biproduct A ⊕ B, ι1 = ker π2, π2 = coker ι1, and similarly for pairs with indices swapped. Proof. Suppose we have f : C ! A⊕B with π2f = 0. Now, f = (ι1π1+ι2π2)f = ι1π1f +ι20 = ι1π1f. since ι1 is monic, the factorization (π1f) is unique, proving that ι1 is a kernel for π2. Now if g : A⊕B ! C is such that fι1 = 0, f = f(ι1π1+ι2π2) = 0π1+fι2π2 = fι2π2, and since π2 is epic, this factorization is unique. Proposition 4. In an abelian category, every pair of arrows A ! B has an equalizer and a coequalizer. Moreover, the following are equivalent: 1. m is monic 2. ker m = 0 3. mf = 0 =) f = 0. Indeed, dually if fe = 0 =) f = 0, then e is epi. (Propositions 1.5.3 and 1.5.4 in [Bor94].) Proof. by an equalizer for f; g : A ! B we mean an arrow m: M ! A such that fm = gm, such that for any other arrow c: C ! A with fc = gc, there is a unique arrow (dashed), which makes the diagram commute. f M m A B g c C 4 As usual, a coequalizer is the dual notion, and when equalizers or coequalizers exist they are unique up to unique isomorphism. So given f; g : A ! B, consider the map f × g : A ! B ⊕ B together with ∆: B ! B ⊕ B, and write F = coker ∆(f × g). Since ∆ is monic, ∆ = ker(coker ∆), so we get a map e: ker F ! B such that the diagram commutes. ker F e B ker F ∆ f×g A B ⊕ B F coker ∆ coker ∆ Indeed this is a universal filling of the square (a pullback), for if we have another object and pair of arrows A c C d B such (f × g)c = ∆d, then F c = coker ∆(f × g)c = (coker ∆)∆d = 0, so c factors through ker f and one checks that the remaining upper triangle commutes. d C ker F e B c ker F ∆ f×g A B ⊕ B F coker ∆ coker ∆ We claim that the map ker F is the desired equalizer. Indeed, f ker F = π1(f ×g) ker F = π1∆e = e, and similarly g ker F = π2(f ×g) ker F = π2∆e = e. If c is another map with fc = gc, then (fc) × (gc) = (f × g)c factors as ∆fc, so F c = coker ∆(f × g)c = (coker ∆)∆fc = 0, so c factors through ker F , as desired. By duality, we have also constructed coequalizers. Note that our proof actually shows that equalizers are kernels, and thus monic, so coequalizers will be cokernels, and thus epi. Certainly if m is monic, then ker m = 0, and mf = 0 =) f = 0. Moreover, if mf = 0 =) f = 0, m ker m = 0 tells us that ker m = 0.
Load more

Recommended publications
  • Homological Algebra
    Homological Algebra Donu Arapura April 1, 2020 Contents 1 Some module theory3 1.1 Modules................................3 1.6 Projective modules..........................5 1.12 Projective modules versus free modules..............7 1.15 Injective modules...........................8 1.21 Tensor products............................9 2 Homology 13 2.1 Simplicial complexes......................... 13 2.8 Complexes............................... 15 2.15 Homotopy............................... 18 2.23 Mapping cones............................ 19 3 Ext groups 21 3.1 Extensions............................... 21 3.11 Projective resolutions........................ 24 3.16 Higher Ext groups.......................... 26 3.22 Characterization of projectives and injectives........... 28 4 Cohomology of groups 32 4.1 Group cohomology.......................... 32 4.6 Bar resolution............................. 33 4.11 Low degree cohomology....................... 34 4.16 Applications to finite groups..................... 36 4.20 Topological interpretation...................... 38 5 Derived Functors and Tor 39 5.1 Abelian categories.......................... 39 5.13 Derived functors........................... 41 5.23 Tor functors.............................. 44 5.28 Homology of a group......................... 45 1 6 Further techniques 47 6.1 Double complexes........................... 47 6.7 Koszul complexes........................... 49 7 Applications to commutative algebra 52 7.1 Global dimensions.......................... 52 7.9 Global dimension of
    [Show full text]
  • Diagram Chasing in Abelian Categories
    Diagram Chasing in Abelian Categories Daniel Murfet October 5, 2006 In applications of the theory of homological algebra, results such as the Five Lemma are crucial. For abelian groups this result is proved by diagram chasing, a procedure not immediately available in a general abelian category. However, we can still prove the desired results by embedding our abelian category in the category of abelian groups. All of this material is taken from Mitchell’s book on category theory [Mit65]. Contents 1 Introduction 1 1.1 Desired results ...................................... 1 2 Walks in Abelian Categories 3 2.1 Diagram chasing ..................................... 6 1 Introduction For our conventions regarding categories the reader is directed to our Abelian Categories (AC) notes. In particular recall that an embedding is a faithful functor which takes distinct objects to distinct objects. Theorem 1. Any small abelian category A has an exact embedding into the category of abelian groups. Proof. See [Mit65] Chapter 4, Theorem 2.6. Lemma 2. Let A be an abelian category and S ⊆ A a nonempty set of objects. There is a full small abelian subcategory B of A containing S. Proof. See [Mit65] Chapter 4, Lemma 2.7. Combining results II 6.7 and II 7.1 of [Mit65] we have Lemma 3. Let A be an abelian category, T : A −→ Ab an exact embedding. Then T preserves and reflects monomorphisms, epimorphisms, commutative diagrams, limits and colimits of finite diagrams, and exact sequences. 1.1 Desired results In the category of abelian groups, diagram chasing arguments are usually used either to establish a property (such as surjectivity) of a certain morphism, or to construct a new morphism between known objects.
    [Show full text]
  • Arxiv:Math/9407203V1 [Math.LO] 12 Jul 1994 Notbr 1993
    REDUCTIONS BETWEEN CARDINAL CHARACTERISTICS OF THE CONTINUUM Andreas Blass Abstract. We discuss two general aspects of the theory of cardinal characteristics of the continuum, especially of proofs of inequalities between such characteristics. The first aspect is to express the essential content of these proofs in a way that makes sense even in models where the inequalities hold trivially (e.g., because the continuum hypothesis holds). For this purpose, we use a Borel version of Vojt´aˇs’s theory of generalized Galois-Tukey connections. The second aspect is to analyze a sequential structure often found in proofs of inequalities relating one characteristic to the minimum (or maximum) of two others. Vojt´aˇs’s max-min diagram, abstracted from such situations, can be described in terms of a new, higher-type object in the category of generalized Galois-Tukey connections. It turns out to occur also in other proofs of inequalities where no minimum (or maximum) is mentioned. 1. Introduction Cardinal characteristics of the continuum are certain cardinal numbers describing combinatorial, topological, or analytic properties of the real line R and related spaces like ωω and P(ω). Several examples are described below, and many more can be found in [4, 14]. Most such characteristics, and all those under consideration ℵ in this paper, lie between ℵ1 and the cardinality c =2 0 of the continuum, inclusive. So, if the continuum hypothesis (CH) holds, they are equal to ℵ1. The theory of such characteristics is therefore of interest only when CH fails. That theory consists mainly of two sorts of results. First, there are equations and (non-strict) inequalities between pairs of characteristics or sometimes between arXiv:math/9407203v1 [math.LO] 12 Jul 1994 one characteristic and the maximum or minimum of two others.
    [Show full text]
  • Arxiv:2001.09075V1 [Math.AG] 24 Jan 2020
    A topos-theoretic view of difference algebra Ivan Tomašić Ivan Tomašić, School of Mathematical Sciences, Queen Mary Uni- versity of London, London, E1 4NS, United Kingdom E-mail address: [email protected] arXiv:2001.09075v1 [math.AG] 24 Jan 2020 2000 Mathematics Subject Classification. Primary . Secondary . Key words and phrases. difference algebra, topos theory, cohomology, enriched category Contents Introduction iv Part I. E GA 1 1. Category theory essentials 2 2. Topoi 7 3. Enriched category theory 13 4. Internal category theory 25 5. Algebraic structures in enriched categories and topoi 41 6. Topos cohomology 51 7. Enriched homological algebra 56 8. Algebraicgeometryoverabasetopos 64 9. Relative Galois theory 70 10. Cohomologyinrelativealgebraicgeometry 74 11. Group cohomology 76 Part II. σGA 87 12. Difference categories 88 13. The topos of difference sets 96 14. Generalised difference categories 111 15. Enriched difference presheaves 121 16. Difference algebra 126 17. Difference homological algebra 136 18. Difference algebraic geometry 142 19. Difference Galois theory 148 20. Cohomologyofdifferenceschemes 151 21. Cohomologyofdifferencealgebraicgroups 157 22. Comparison to literature 168 Bibliography 171 iii Introduction 0.1. The origins of difference algebra. Difference algebra can be traced back to considerations involving recurrence relations, recursively defined sequences, rudi- mentary dynamical systems, functional equations and the study of associated dif- ference equations. Let k be a commutative ring with identity, and let us write R = kN for the ring (k-algebra) of k-valued sequences, and let σ : R R be the shift endomorphism given by → σ(x0, x1,...) = (x1, x2,...). The first difference operator ∆ : R R is defined as → ∆= σ id, − and, for r N, the r-th difference operator ∆r : R R is the r-th compositional power/iterate∈ of ∆, i.e., → r r ∆r = (σ id)r = ( 1)r−iσi.
    [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]
  • 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]
  • Weak Subobjects and Weak Limits in Categories and Homotopy Categories Cahiers De Topologie Et Géométrie Différentielle Catégoriques, Tome 38, No 4 (1997), P
    CAHIERS DE TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES MARCO GRANDIS Weak subobjects and weak limits in categories and homotopy categories Cahiers de topologie et géométrie différentielle catégoriques, tome 38, no 4 (1997), p. 301-326 <http://www.numdam.org/item?id=CTGDC_1997__38_4_301_0> © Andrée C. Ehresmann et les auteurs, 1997, tous droits réservés. L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ CAHIERS DE TOPOLOGIE ET Volume XXXVIII-4 (1997) GEOMETRIE DIFFERENTIELLE CATEGORIQUES WEAK SUBOBJECTS AND WEAK LIMITS IN CATEGORIES AND HOMOTOPY CATEGORIES by Marco GRANDIS R6sumi. Dans une cat6gorie donn6e, un sousobjet faible, ou variation, d’un objet A est defini comme une classe d’6quivalence de morphismes A valeurs dans A, de faqon a étendre la notion usuelle de sousobjet. Les sousobjets faibles sont lies aux limites faibles, comme les sousobjets aux limites; et ils peuvent 8tre consid6r6s comme remplaqant les sousobjets dans les categories "a limites faibles", notamment la cat6gorie d’homotopie HoTop des espaces topologiques, ou il forment un treillis de types de fibration sur 1’espace donn6. La classification des variations des groupes et des groupes ab£liens est un outil important pour d6terminer ces types de fibration, par les foncteurs d’homotopie et homologie. Introduction We introduce here the notion of weak subobject in a category, as an extension of the notion of subobject.
    [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]
  • The Freyd-Mitchell Embedding Theorem States the Existence of a Ring R and an Exact Full Embedding a Ñ R-Mod, R-Mod Being the Category of Left Modules Over R
    The Freyd-Mitchell Embedding Theorem Arnold Tan Junhan Michaelmas 2018 Mini Projects: Homological Algebra arXiv:1901.08591v1 [math.CT] 23 Jan 2019 University of Oxford MFoCS Homological Algebra Contents 1 Abstract 1 2 Basics on abelian categories 1 3 Additives and representables 6 4 A special case of Freyd-Mitchell 10 5 Functor categories 12 6 Injective Envelopes 14 7 The Embedding Theorem 18 1 Abstract Given a small abelian category A, the Freyd-Mitchell embedding theorem states the existence of a ring R and an exact full embedding A Ñ R-Mod, R-Mod being the category of left modules over R. This theorem is useful as it allows one to prove general results about abelian categories within the context of R-modules. The goal of this report is to flesh out the proof of the embedding theorem. We shall follow closely the material and approach presented in Freyd (1964). This means we will encounter such concepts as projective generators, injective cogenerators, the Yoneda embedding, injective envelopes, Grothendieck categories, subcategories of mono objects and subcategories of absolutely pure objects. This approach is summarised as follows: • the functor category rA, Abs is abelian and has injective envelopes. • in fact, the same holds for the full subcategory LpAq of left-exact functors. • LpAqop has some nice properties: it is cocomplete and has a projective generator. • such a category embeds into R-Mod for some ring R. • in turn, A embeds into such a category. 2 Basics on abelian categories Fix some category C. Let us say that a monic A Ñ B is contained in another monic A1 Ñ B if there is a map A Ñ A1 making the diagram A B commute.
    [Show full text]
  • Homological Algebra Over the Representation Green Functor
    Homological Algebra over the Representation Green Functor SPUR Final Paper, Summer 2012 Yajit Jain Mentor: John Ullman Project suggested by: Mark Behrens February 1, 2013 Abstract In this paper we compute Ext RpF; F q for modules over the representation Green functor R with F given to be the fixed point functor. These functors are Mackey functors, defined in terms of a specific group with coefficients in a commutative ring. Previous work by J. Ventura [1] computes these derived k functors for cyclic groups of order 2 with coefficients in F2. We give computations for general cyclic groups with coefficients in a general field of finite characteristic as well as the symmetric group on three elements with coefficients in F2. 1 1 Introduction Mackey functors are algebraic objects that arise in group representation theory and in equivariant stable homotopy theory, where they arise as stable homotopy groups of equivariant spectra. However, they can be given a purely algebraic definition (see [2]), and there are many interesting problems related to them. In this paper we compute derived functors Ext of the internal homomorphism functor defined on the category of modules over the representation Green functor R. These Mackey functors arise in Künneth spectral sequences for equivariant K-theory (see [1]). We begin by giving definitions of the Burnside category and of Mackey functors. These objects depend on a specific finite group G. It is possible to define a tensor product of Mackey functors, allowing us to identify ’rings’ in the category of Mackey functors, otherwise known as Green functors. We can then define modules over Green functors.
    [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]
  • Groups and Categories
    \chap04" 2009/2/27 i i page 65 i i 4 GROUPS AND CATEGORIES This chapter is devoted to some of the various connections between groups and categories. If you already know the basic group theory covered here, then this will give you some insight into the categorical constructions we have learned so far; and if you do not know it yet, then you will learn it now as an application of category theory. We will focus on three different aspects of the relationship between categories and groups: 1. groups in a category, 2. the category of groups, 3. groups as categories. 4.1 Groups in a category As we have already seen, the notion of a group arises as an abstraction of the automorphisms of an object. In a specific, concrete case, a group G may thus consist of certain arrows g : X ! X for some object X in a category C, G ⊆ HomC(X; X) But the abstract group concept can also be described directly as an object in a category, equipped with a certain structure. This more subtle notion of a \group in a category" also proves to be quite useful. Let C be a category with finite products. The notion of a group in C essentially generalizes the usual notion of a group in Sets. Definition 4.1. A group in C consists of objects and arrows as so: m i G × G - G G 6 u 1 i i i i \chap04" 2009/2/27 i i page 66 66 GROUPSANDCATEGORIES i i satisfying the following conditions: 1.
    [Show full text]