Abstract: For an additive category we provide an explict construction of a category whose objects can be thought of as formally representing for given morphisms and in , even though does not need to admit quotients or images. We show how it is possible to calculate effectively within , provided that a basic problem related to syzygies can be handled algorithmically. We prove an equivalence of with the subcategory of the category of contravariant functors from to the category of abelian groups which contains all finitely presented functors and is closed under the operation of taking images. Moreover, we characterize the abelian case: is abelian if and only if it is equivalent to , the category of all finitely presented functors, which in turn, by a theorem of Freyd, is abelian if and only if has weak kernels. The category is a categorical abstraction of the data structure for finitely presented -modules employed by the computer algebra system Macaulay2, where 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.
