Abstract

For an additive category P we provide an explicit construction of a category Q(P) whose objects can be thought of as formally representing im(γ)im(ρ)∩im(γ) for given morphisms γ:A→B and ρ:C→B in P, even though P does not need to admit quotients or images. We show how it is possible to calculate effectively within Q(P), provided that a basic problem related to syzygies can be handled algorithmically. We prove an equivalence of Q(P) with the smallest subcategory of the category of contravariant functors from P to the category of abelian groups Ab which contains all finitely presented functors and is closed under the operation of taking images. Moreover, we characterize the abelian case: Q(P) is abelian if and only if it is equivalent to fp(Pop,Ab), the category of all finitely presented functors, which in turn, by a theorem of Freyd, is abelian if and only if P has weak kernels.The category Q(P) is a categorical abstraction of the data structure for finitely presented R-modules employed by the computer algebra system Macaulay2, where R is a ring. By our generalization to arbitrary additive categories, we show how this data structure can also be used for modeling finitely presented graded modules, finitely presented functors, and some not necessarily finitely presented modules over a non-coherent ring.

Highlights

  • The purpose of constructive category theory lies in finding categorical representations of mathematical objects such that effective computations become possible [17]

  • The same is true for the category fppPop, Abq: it is equivalent to the so-called Freyd category ApPq whose objects are given by morphisms pA

  • We give a simplification of the syzygy inclusion problem for an arbitrary additive category P (Corollary 5.4)

Read more

Summary

Introduction

The purpose of constructive category theory lies in finding categorical representations (data structures) of mathematical objects such that effective computations become possible [17]. If P has decidable syzygy inclusion, we show how to compute cokernels, universal epi-mono factorizations, lifts along monomorphisms, and colifts along epimorphisms in QpPq. In Section 3, we prove (Corollary 3.9) that QpPq identifies with the smallest full and replete subcategory of the category of all additive functors Pop Ñ Ab (mapping to the category of abelian groups Ab) which contains the representable functors HomPp, Aq for A P P and is closed under the operations of taking cokernels and images. If P “ RowsR, contravariant additive functors to Ab identify with R-modules, and fppRowsoRp, Abq with the category of finitely presented R-modules In this case, QpRowsRq can be seen as the smallest full and replete subcategory of all R-modules that contains the row modules R1ˆn for all n ě 0 and is closed under cokernels and images. The symbol Zě0 denotes the set of non-negative integers

The category QpPq
The category of syzygies
The syzygy inclusion problem
An auxiliary category
Definition of the category QpPq
Cokernels
Lifts along monomorphisms
Universal epi-mono factorizations
Colifts along epimorphisms
The category QpPq as a subcategory of the category of modules
A Ñα A1 such that there exists a morphism R Ñω R1 which renders the diagram ρ
The abelian case
A weakening of weak pullbacks
Kernels
Proof of the characterization of the abelian case
Suppose given a short exact sequence
A non-coherent ring with decidable syzygy inclusion
Simplifying the syzygy inclusion problem
Describing row syzygies of matrices over R
Solving the syzygy inclusion problem for R
Subcategories of graded modules and functors
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call