Morphisms

Any GAP object satisfying IsCapCategoryMorphism can be added to a category and then becomes a morphism in this category. Any morphism can belong to one or no category. After a GAP object is added to the category, it knows which things can be computed in its category and to which category it belongs. It knows categorical properties and attributes, and the functions for existential quantifiers can be applied to the morphism.
Attributes for the Type of Morphisms a category The argument is a morphism \alpha. The output is the category \mathbf{C} to which \alpha was added. an object The argument is a morphism \alpha: a \rightarrow b. The output is its source a. an object The argument is a morphism \alpha: a \rightarrow b. The output is its range b. an object The argument is a morphism \alpha: a \rightarrow b. The output is its target b.
Morphism constructors a morphism in \mathrm{Hom}(S,T) The arguments are two objects S and T in a category, and a morphism datum a (type and semantics of the morphism datum depend on the category). The output is a morphism in \mathrm{Hom}(S,T) defined by a. Note that by default this CAP operation is not cached. You can change this behaviour by calling `SetCachingToWeak( C, "MorphismConstructor" )` resp. `SetCachingToCrisp( C, "MorphismConstructor" )`. depends on the category The argument is a CAP category morphism mor. The output is a datum which can be used to construct mor, that is, `IsEqualForMorphisms(` mor`, MorphismConstructor( Source(` mor`), MorphismDatum(` mor`), Range(` mor`) ) )`. Note that by default this CAP operation is not cached. You can change this behaviour by calling `SetCachingToWeak( C, "MorphismDatum" )` resp. `SetCachingToCrisp( C, "MorphismDatum" )`.
Categorical Properties of Morphisms a boolean The argument is a morphism \alpha. The output is true if \alpha is a monomorphism, otherwise the output is false. a boolean The argument is a morphism \alpha. The output is true if \alpha is an epimorphism, otherwise the output is false. a boolean The argument is a morphism \alpha. The output is true if \alpha is an isomorphism, otherwise the output is false. a boolean The argument is a morphism \alpha. The output is true if \alpha is a split monomorphism, otherwise the output is false. a boolean The argument is a morphism \alpha. The output is true if \alpha is a split epimorphism, otherwise the output is false. a boolean The argument is a morphism \alpha: a \rightarrow a. The output is true if \alpha is congruent to the identity of a, otherwise the output is false. a boolean The argument is a morphism \alpha: a \rightarrow a. The output is true if \alpha^2 \sim_{a,a} \alpha, otherwise the output is false.
Random Morphisms CAP provides two principal methods to generate random morphisms with or without fixed source and range: By integers: The integer is simply a parameter that can be used to create a random morphism. By lists: The list is used when creating a random morphism would need more than one parameter. Lists offer more flexibility at the expense of the genericity of the methods. This happens because lists that are valid as input in some category may be not valid for other categories. Hence, these operations are not thought to be used in generic categorical algorithms. a morphism in \mathrm{Hom}(a,b) The arguments are an object a in a category C and an integer n. The output is a random morphism \alpha: a \rightarrow b for some object b in C. If C is equipped with the methods RandomObjectByInteger and RandomMorphismWithFixedSourceAndRangeByInteger and C is an Ab-category, then RandomMorphismWithFixedSourceByInteger(C,a,n) can be derived as RandomMorphismWithFixedSourceAndRangeByInteger(C,a,b,1+Log2Int(n)) where b is computed via RandomObjectByInteger(C,n). a morphism in \mathrm{Hom}(a,b) The arguments are an object a in a category C and a list L. The output is a random morphism \alpha: a \rightarrow b for some object b in C. If C is equipped with the methods RandomObjectByList and RandomMorphismWithFixedSourceAndRangeByList and C is an Ab-category, then RandomMorphismWithFixedSourceByList(C,a,L) can be derived as RandomMorphismWithFixedSourceAndRangeByList(C,a,b,L[2]) where b is computed via RandomObjectByList(C,L[1]). a morphism in \mathrm{Hom}(a,b) The arguments are an object b in a category C and an integer n. The output is a random morphism \alpha: a \rightarrow b for some object a in C. If C is equipped with the methods RandomObjectByInteger and RandomMorphismWithFixedSourceAndRangeByInteger and C is an Ab-category, then RandomMorphismWithFixedRangeByInteger(C,b,n) can be derived as RandomMorphismWithFixedSourceAndRangeByInteger(C,a,b,1+Log2Int(n)) where a is computed via RandomObjectByInteger(C,n). a morphism in \mathrm{Hom}(a,b) The arguments are an object b in a category C and a list L. The output is a random morphism \alpha: a \rightarrow b for some object a in C. If C is equipped with the methods RandomObjectByList and RandomMorphismWithFixedSourceAndRangeByList and C is an Ab-category, then RandomMorphismWithFixedRangeByList(C,b,L) can be derived as RandomMorphismWithFixedSourceAndRangeByList(C,a,b,L[2]) where a is computed via RandomObjectByList(C,L[1]). a morphism in \mathrm{Hom}(a,b) The arguments are two objects a and b in a category C and an integer n. The output is a random morphism \alpha: a \rightarrow b in C. a morphism in \mathrm{Hom}(a,b) This operation is not a CAP basic operation The arguments are two objects a and b in a category C and a list L. The output is a random morphism \alpha: a \rightarrow b in C. a morphism in C The arguments are a category C and an integer n. The output is a random morphism in C. The operation can be derived in three different ways: If C is equipped with the methods RandomObjectByInteger and RandomMorphismWithFixedSourceAndRangeByInteger and C is an Ab-category, then RandomMorphism(C,n) can be derived as RandomMorphismWithFixedSourceAndRangeByInteger(C,a,b,1+Log2Int(n)) where a and b are computed via RandomObjectByInteger(C,n). If C is equipped with the methods RandomObjectByInteger and RandomMorphismWithFixedSourceByInteger, then RandomMorphism(C,n) can be derived as RandomMorphismWithFixedSourceByInteger(C,a,1+Log2Int(n)) where a is computed via RandomObjectByInteger(C,n). If C is equipped with the methods RandomObjectByInteger and RandomMorphismWithFixedRangeByInteger, then RandomMorphism(C,n) can be derived as RandomMorphismWithFixedRangeByInteger(C,b,1+Log2Int(n)) where b is computed via RandomObjectByInteger(C,n). a morphism in C The arguments are a category C and a list L. The output is a random morphism in C. The operation can be derived in three different ways: If C is equipped with the methods RandomObjectByList and RandomMorphismWithFixedSourceAndRangeByList and C is an Ab-category, then RandomMorphism(C,L) can be derived as RandomMorphismWithFixedSourceAndRangeByList(C,a,b,L[3])) where a and b are computed via RandomObjectByList(C,L[i]) for i=1,2 respectively. If C is equipped with the methods RandomObjectByList and RandomMorphismWithFixedSourceByList, then RandomMorphism(C,L) can be derived as RandomMorphismWithFixedSourceByList(C,a,L[2]) where a is computed via RandomObjectByList(C,L[1]). If C is equipped with the methods RandomObjectByList and RandomMorphismWithFixedRangeByList, then RandomMorphism(C,L) can be derived as RandomMorphismWithFixedRangeByList(C,b,L[2]) where b is computed via RandomObjectByList(C,L[1]). These are convenient methods and they, depending on the input, delegate to one of the above methods.

Non-Categorical Properties of Morphisms Non-categorical properties are not stable under equivalences of categories. a boolean The argument is a morphism \alpha: a \rightarrow b. The output is true if \alpha = \mathrm{id}_a, otherwise the output is false. a boolean The argument is a morphism \alpha: a \rightarrow b. The output is true if \alpha = 0, otherwise the output is false. a boolean The argument is a morphism \alpha. The output is true if \alpha is an endomorphism, otherwise the output is false. a boolean The argument is a morphism \alpha. The output is true if \alpha is an automorphism, otherwise the output is false.
Adding Morphisms to a Category Adds morphism as a morphism to category. Adds morphism as a morphism to category. If morphism already lies in the filter IsCapCategoryMorphism, the operation can be used instead. Deprecated: use instead. The argument filter is used to create a morphism type for the category category, which is then used in ObjectifyMorphismWithSourceAndRangeForCAPWithAttributes to objectify morphisms for this category. filter must imply `IsCapCategoryMorphism`. a morphism Deprecated: use instead. a morphism Creates a morphism in category with the given attributes. a morphism EXPERIMENTAL: This specification might change any time without prior notice. Views value as a morphism from source to range in category. a value EXPERIMENTAL: This specification might change any time without prior notice. Views a morphism obtained via as a primitive value again. Here, the word primitive means primitive from the perspective of the category. For example, from the perspective of an opposite category, morphisms of the underlying category are primitive values. The attribute is chosen according to the morphism datum type: For `IsInt`, the attribute `AsInteger` is used. For `IsHomalgMatrix`, the attribute `AsHomalgMatrix` is used.

In all other cases or if no morphism datum type is given, the attribute `AsPrimitiveValue` is used.

Equality and Congruence for Morphisms a boolean The arguments are two morphisms \alpha, \beta: a \rightarrow b. The output is true if \alpha \sim_{a,b} \beta, otherwise the output is false. a boolean The arguments are two morphisms \alpha, \beta: a \rightarrow b. The output is true if \alpha = \beta, otherwise the output is false. a boolean The arguments are two morphisms \alpha: a \rightarrow b, \beta: c \rightarrow d. The output is true if \alpha = \beta, otherwise the output is false.
Basic Operations for Morphisms in Ab-Categories a boolean The argument is a morphism \alpha: a \rightarrow b. The output is true if \alpha \sim_{a,b} 0, otherwise the output is false. a morphism in \mathrm{Hom}(a,b) The arguments are two morphisms \alpha, \beta: a \rightarrow b. The output is the addition \alpha + \beta. Note: The addition has to be compatible with the congruence of morphisms. a morphism in \mathrm{Hom}(a,b) The arguments are two morphisms \alpha, \beta: a \rightarrow b. The output is the addition \alpha - \beta. Note: The addition has to be compatible with the congruence of morphisms. a morphism in \mathrm{Hom}(a,b) The argument is a morphism \alpha: a \rightarrow b. The output is its additive inverse -\alpha. Note: The addition has to be compatible with the congruence of morphisms. a morphism in \mathrm{Hom}(a,b) The arguments are an element r of a commutative ring and a morphism \alpha: a \rightarrow b. The output is the multiplication with the ring element r \cdot \alpha. Note: The multiplication has to be compatible with the congruence of morphisms. a morphism in \mathrm{Hom}(a,b) This is a convenience method. It has two arguments. The first argument is either a rational number q or an element r of a commutative ring R. The second argument is a morphism \alpha: a \rightarrow b in a linear category over the commutative ring R. In the case where the first element is a rational number, this method tries to interpret q as an element r of R via R!.interpret_rationals_func. If no such interpretation exists, this method throws an error. The output is the multiplication with the ring element r \cdot \alpha. a morphism in \mathrm{Hom}(a,b) The arguments are two objects a and b. The output is the zero morphism 0: a \rightarrow b.
Subobject and Factorobject Operations Subobjects of an object c are monomorphisms with range c and a special function for comparision. Similarly, factorobjects of an object c are epimorphisms with source c and a special function for comparision. a boolean The arguments are two subobjects \alpha: a \rightarrow c, \beta: b \rightarrow c. The output is true if there exists an isomorphism \iota: a \rightarrow b such that \beta \circ \iota \sim_{a,c} \alpha, otherwise the output is false. a boolean The arguments are two factorobjects \alpha: c \rightarrow a, \beta: c \rightarrow b. The output is true if there exists an isomorphism \iota: b \rightarrow a such that \iota \circ \beta \sim_{c,a} \alpha, otherwise the output is false. a boolean \begin{center} \begin{tikzpicture} \def\w{2} \def\h{1} \node (a) at (0,\h) {$a$}; \node (b) at (0,-\h) {$b$}; \node (c) at (\w,0) {$c$}; \draw[right hook-latex] (a) to node[pos=0.45, above] {$\alpha$} (c); \draw[right hook-latex] (b) to node[pos=0.45, below] {$\beta$} (c); \draw[-latex, dashed] (a) to node[pos=0.45, left] {$\exists \iota$} (b); \end{tikzpicture} \end{center} In short: Returns true iff \alpha is smaller than \beta. Full description: The arguments are two subobjects \alpha: a \rightarrow c, \beta: b \rightarrow c. The output is true if there exists a morphism \iota: a \rightarrow b such that \beta \circ \iota \sim_{a,c} \alpha, otherwise the output is false. a boolean \begin{center} \begin{tikzpicture} \def\w{2} \def\h{1} \node (c) at (0,0) {$c$}; \node (a) at (\w,\h) {$a$}; \node (b) at (\w,-\h) {$b$}; \draw[-twohead] (c) to node[pos=0.45, above] {$\alpha$} (a); \draw[-twohead] (c) to node[pos=0.45, below] {$\beta$} (b); \draw[-latex, dashed] (b) to node[pos=0.45, right] {$\exists \iota$} (a); \end{tikzpicture} \end{center} In short: Returns true iff \alpha is smaller than \beta. Full description: The arguments are two factorobjects \alpha: c \rightarrow a, \beta: c \rightarrow b. The output is true if there exists a morphism \iota: b \rightarrow a such that \iota \circ \beta \sim_{c,a} \alpha, otherwise the output is false.
Identity Morphism and Composition of Morphisms a morphism in \mathrm{Hom}(a,a) The argument is an object a. The output is its identity morphism \mathrm{id}_a. a morphism in \mathrm{Hom}( a, c ) The arguments are two morphisms \alpha: a \rightarrow b, \beta: b \rightarrow c. The output is the composition \beta \circ \alpha: a \rightarrow c. a morphism in \mathrm{Hom}(a_1, a_{n+1}) This is a convenience method. The argument is a list of morphisms L = ( \alpha_1: a_1 \rightarrow a_2, \alpha_2: a_2 \rightarrow a_3, \dots, \alpha_n: a_n \rightarrow a_{n+1} ). The output is the composition \alpha_{n} \circ ( \alpha_{n-1} \circ ( \dots ( \alpha_2 \circ \alpha_1 ) ) ). a morphism in \mathrm{Hom}(s, r) The arguments are two objects s = a_1, r = a_{n+1}, and a list of morphisms L = ( \alpha_1: a_1 \rightarrow a_2, \alpha_2: a_2 \rightarrow a_3, \dots, \alpha_n: a_n \rightarrow a_{n+1} ) in C. The output is the composition \alpha_{n} \circ ( \alpha_{n-1} \circ ( \dots ( \alpha_2 \circ \alpha_1 ) ) ). If L is empty, then s must be equal to r and the output is congruent to the identity morphism of s. a morphism in \mathrm{Hom}( a, c ) The arguments are two morphisms \beta: b \rightarrow c, \alpha: a \rightarrow b. The output is the composition \beta \circ \alpha: a \rightarrow c. a morphism in \mathrm{Hom}(a_1, a_{n+1}) This is a convenience method. The argument is a list of morphisms L = ( \alpha_n: a_n \rightarrow a_{n+1}, \alpha_{n-1}: a_{n-1} \rightarrow a_n, \dots, \alpha_1: a_1 \rightarrow a_2 ). The output is the composition ((\alpha_{n} \circ \alpha_{n-1}) \circ \dots \alpha_2) \circ \alpha_1. a morphism in \mathrm{Hom}(s, r) The arguments are two objects s = a_1, r = a_{n+1}, and a list of morphisms L = ( \alpha_n: a_n \rightarrow a_{n+1}, \alpha_{n-1}: a_{n-1} \rightarrow a_n, \dots, \alpha_1: a_1 \rightarrow a_2 ). The output is the composition ((\alpha_{n} \circ \alpha_{n-1}) \circ \dots \alpha_2) \circ \alpha_1. If L is empty, then s must be equal to r and the output is congruent to the identity morphism of s. a morphism in \mathrm{Hom}(s,r) The arguments are two objects s, r and a list morphisms of morphisms from s to r. The output is the sum of all elements in morphisms, or the zero-morphism from s to r if morphisms is empty. a morphism in \mathrm{Hom}(s,r) The arguments are two objects s, r in some linear category over a ring R, a list coeffs of ring elements in R and a list mors of morphisms from s to r. The output is the linear combination of the morphisms in mors with respect to the coefficients list coeffs, or the zero morphism from s to r if coeffs and mors are the empty lists.
Well-Definedness of Morphisms a boolean The argument is a morphism \alpha. The output is true if \alpha is well-defined, otherwise the output is false. a boolean The arguments are two well-defined objects S and T and a morphism \alpha. The output is true if \alpha is a well-defined morphism from S to T, otherwise the output is false.
Lift/Colift For any pair of morphisms \alpha: a \rightarrow c, \beta: b \rightarrow c, we call each morphism \alpha / \beta: a \rightarrow b such that \beta \circ (\alpha / \beta) \sim_{a,c} \alpha a lift of \alpha along \beta. \begin{center} \begin{tikzpicture} \def\w{2} \def\h{1} \node (a) at (0,\h) {$a$}; \node (b) at (0,-\h) {$b$}; \node (c) at (\w,0) {$c$}; \draw[-latex] (a) to node[pos=0.45, above] {$\alpha$} (c); \draw[-latex] (b) to node[pos=0.45, below] {$\beta$} (c); \draw[-latex, dashed] (a) to node[pos=0.45, left] {$\alpha/\beta$} (b); \end{tikzpicture} \end{center} For any pair of morphisms \alpha: a \rightarrow c, \beta: a \rightarrow b, we call each morphism \alpha \backslash \beta: c \rightarrow b such that (\alpha \backslash \beta) \circ \alpha \sim_{a,b} \beta a colift of \beta along \alpha. \begin{center} \begin{tikzpicture} \def\w{2} \def\h{1} \node (a) at (0,0) {$a$}; \node (c) at (\w,\h) {$c$}; \node (b) at (\w,-\h) {$b$}; \draw[-latex] (a) to node[pos=0.45, above] {$\alpha$} (c); \draw[-latex] (a) to node[pos=0.45, below] {$\beta$} (b); \draw[-latex, dashed] (c) to node[pos=0.45, right] {$\alpha \backslash \beta$} (b); \end{tikzpicture} \end{center} Note that such lifts (or colifts) do not have to be unique. So in general, we do not expect that algorithms computing lifts (or colifts) do this in a functorial way. Thus the operations \mathtt{Lift} and \mathtt{Colift} are not regarded as categorical operations, but only as set-theoretic operations. a morphism in \mathrm{Hom}(t,k) The arguments are a monomorphism \iota: k \hookrightarrow a and a morphism \tau: t \rightarrow a such that there is a morphism u: t \rightarrow k with \iota \circ u \sim_{t,a} \tau. The output is such a u. a morphism in \mathrm{Hom}(c,t) The arguments are an epimorphism \epsilon: a \rightarrow c and a morphism \tau: a \rightarrow t such that there is a morphism u: c \rightarrow t with u \circ \epsilon \sim_{a,t} \tau. The output is such a u. a boolean The arguments are a monomorphism \iota: k \hookrightarrow a and a morphism \tau: t \rightarrow a. The output is true if there exists a morphism u: t \rightarrow k with \iota \circ u \sim_{t,a} \tau. Otherwise, the output is false. a boolean The arguments are an epimorphism \epsilon: a \rightarrow c and a morphism \tau: a \rightarrow t. The output is true if there exists a morphism u: c \rightarrow t with u \circ \epsilon \sim_{a,t} \tau. Otherwise, the output is false. a morphism in \mathrm{Hom}(a,b) The arguments are two morphisms \alpha: a \rightarrow c, \beta: b \rightarrow c such that a lift \alpha / \beta: a \rightarrow b of \alpha along \beta exists. The output is such a lift \alpha / \beta: a \rightarrow b. Recall that a lift \alpha / \beta: a \rightarrow b of \alpha along \beta is a morphism such that \beta \circ (\alpha / \beta) \sim_{a,c} \alpha. a morphism in \mathrm{Hom}(a,b) + \{ \mathtt{fail} \} The arguments are two morphisms \alpha: a \rightarrow c, \beta: b \rightarrow c. The output is a lift \alpha / \beta: a \rightarrow b of \alpha along \beta if such a lift exists or \mathtt{fail} if it doesn't. Recall that a lift \alpha / \beta: a \rightarrow b of \alpha along \beta is a morphism such that \beta \circ (\alpha / \beta) \sim_{a,c} \alpha. a boolean The arguments are two morphisms \alpha: a \rightarrow c, \beta: b \rightarrow c. The output is true if there exists a lift \alpha / \beta: a \rightarrow b of \alpha along \beta, i.e., a morphism such that \beta \circ (\alpha / \beta) \sim_{a,c} \alpha. Otherwise, the output is false. a morphism in \mathrm{Hom}(c,b) The arguments are two morphisms \alpha: a \rightarrow c, \beta: a \rightarrow b such that a colift \alpha \backslash \beta: c \rightarrow b of \beta along \alpha exists. The output is such a colift \alpha \backslash \beta: c \rightarrow b. Recall that a colift \alpha \backslash \beta: c \rightarrow b of \beta along \alpha is a morphism such that (\alpha \backslash \beta) \circ \alpha \sim_{a,b} \beta. a morphism in \mathrm{Hom}(c,b) + \{ \mathtt{fail} \} The arguments are two morphisms \alpha: a \rightarrow c, \beta: a \rightarrow b. The output is a colift \alpha \backslash \beta: c \rightarrow b of \beta along \alpha if such a colift exists or \mathtt{fail} if it doesn't. Recall that a colift \alpha \backslash \beta: c \rightarrow b of \beta along \alpha is a morphism such that (\alpha \backslash \beta) \circ \alpha \sim_{a,b} \beta. a boolean The arguments are two morphisms \alpha: a \rightarrow c, \beta: a \rightarrow b. The output is true if there exists a colift \alpha \backslash \beta: c \rightarrow b of \beta along \alpha., i.e., a morphism such that (\alpha \backslash \beta) \circ \alpha \sim_{a,b} \beta. Otherwise, the output is false.
Inverses Let \alpha: a \rightarrow b be a morphism. An inverse of \alpha is a morphism \alpha^{-1}: b \rightarrow a such that \alpha \circ \alpha^{-1} \sim_{b,b} \mathrm{id}_b and \alpha^{-1} \circ \alpha \sim_{a,a} \mathrm{id}_a. \begin{center} \begin{tikzpicture} \def\w{2} \def\h{1} \node (a) at (0,0) {$a$}; \node (b) at (\w,0) {$b$}; \draw[-latex] (a) to node[pos=0.45, above] {$\alpha$} (b); \draw[-latex] (b) to [out = -135, in = -45] node[pos=0.45, below] {$\alpha^{-1}$} (a); \draw [-latex] (a.135) arc (45:45+280:4mm) node[pos=0.5,left] {$\mathrm{id}_a$} (a); \draw [-latex] (b.45) arc (-240:-240-280:4mm) node[pos=0.5,right] {$\mathrm{id}_b$} (b); \end{tikzpicture} \end{center} a morphism in \mathrm{Hom}(b,a) The argument is an isomorphism \alpha: a \rightarrow b. The output is its inverse \alpha^{-1}: b \rightarrow a. a morphism in \mathrm{Hom}(b,a) The argument is a split-epimorphism \alpha: a \rightarrow b. The output is a pre-inverse \iota: b \rightarrow a of \alpha, i.e., \iota satisfies \alpha \circ \iota \sim_{b,b} \mathrm{id}_b. The morphism \iota is also known as a section or a right-inverse of \alpha. a morphism in \mathrm{Hom}(b,a) The argument is a split-monomorphism \alpha: a \rightarrow b. The output is a post-inverse \pi: b \rightarrow a of \alpha, i.e., \pi satisfies \pi \circ \alpha \sim_{a,a} \mathrm{id}_a. The morphism \pi is also known as a contraction or a left-inverse of \alpha.
Tool functions for caches true or false By default, CAP uses caches to store the values of Categorical operations. To get a value out of the cache, one needs to compare the input of a basic operation with its previous input. To compare morphisms in the category, IsEqualForCacheForMorphisms is used. By default, IsEqualForCacheForMorphisms falls back to IsEqualForCache (see ToolsForHomalg), which in turn defaults to recursive comparison for lists and `IsIdenticalObj` in all other cases. If you add a function via `AddIsEqualForCacheForMorphisms`, that function is used instead. A function F: a,b \mapsto bool is expected there. The output has to be true or false. Fail is not allowed in this context.
IsHomSetInhabited a boolean The arguments are two objects A and B. The output is true if there exists a morphism from A to B, otherwise the output is false.
Homomorphism structures Homomorphism structures are way to "oversee" the homomorphisms between two given objects. Let C, D be categories. A D-homomorphism structure for C consists of the following data: a functor H: C^{\mathrm{op}} \times C \rightarrow D (when C and D are Ab-categories, H is assumed to be bilinear). an object 1 \in D, called the distinguished object, a bijection \nu: \mathrm{Hom}_{C}(a,b) \simeq \mathrm{Hom}_{D}(1, H(a,b)) natural in a,b \in C. an object in D The arguments are two objects a, b in C. The output is the value of the homomorphism structure on objects H(a,b). a morphism in \mathrm{Hom}_{D}(H(a',b), H(a,b')) The arguments are two morphisms \alpha: a \rightarrow a', \beta: b \rightarrow b' in C. The output is the value of the homomorphism structure on morphisms H(\alpha, \beta ). a morphism in \mathrm{Hom}_{D}(H(a',b), H(a,b')) The arguments are an object s = H(a',b) in D, two morphisms \alpha: a \rightarrow a', \beta: b \rightarrow b' in C, and an object r = H(a,b') in D. The output is the value of the homomorphism structure on morphisms H(\alpha, \beta ). an object in D The argument is a category C. The output is the distinguished object 1 in D of the homomorphism structure. a morphism in \mathrm{Hom}_{D}(1, H(a,a')) The argument is a morphism \alpha: a \rightarrow a' in C. The output is the corresponding morphism \nu( \alpha ): 1 \rightarrow H(a,a') in D of the homomorphism structure. a morphism in \mathrm{Hom}_{D}(1, r) The arguments are the distinguished object 1, a morphism \alpha: a \rightarrow a', and the object r = H(a,a'). The output is the corresponding morphism \nu( \alpha ): 1 \rightarrow r in D of the homomorphism structure. a morphism in \mathrm{Hom}_{C}(a,a') The arguments are objects a,a' in C and a morphism \iota: 1 \rightarrow H(a,a') in D. The output is the corresponding morphism \nu^{-1}(\iota): a \rightarrow a' in C of the homomorphism structure. a list of morphisms [X_1, \dots, X_n] The arguments are three lists \alpha, \beta, and \gamma. The first list \alpha (the left coefficients) is a list of list of morphisms \alpha_{ij}: A_i \rightarrow B_j, where i = 1 \dots m and j = 1 \dots n for integers m,n \geq 1. The second list \beta (the right coefficients) is a list of list of morphisms \beta_{ij}: C_j \rightarrow D_i, where i = 1 \dots m and j = 1 \dots n. The third list \gamma (the right side) is a list of morphisms \gamma_i: A_i \rightarrow D_i, where i = 1, \dots, m. Assumes that a solution to the linear system defined by \alpha, \beta, \gamma exists, i.e., there exist morphisms X_j: B_j \rightarrow C_j for j=1\dots n such that \sum_{j = 1}^n \alpha_{ij}\cdot X_j \cdot \beta_{ij} = \gamma_i for all i = 1 \dots m. The output is list of such morphisms X_j: B_j \rightarrow C_j for j=1\dots n. a list of morphisms [X_1, \dots, X_n] or `fail` Like SolveLinearSystemInAbCategory, but without the assumption that a solution exists. If no solution exists, `fail` is returned. a boolean Like SolveLinearSystemInAbCategory, but the output is simply true if a solution exists, false otherwise. a morphism in \mathrm{Hom}_{D}(H(a',b), H(a,b')) This is a convenience method. The arguments are two morphisms \alpha: a \rightarrow a', \beta: b \rightarrow b' in C. The output is HomomorphismStructureOnMorphisms called on \alpha, \beta. a morphism in \mathrm{Hom}_{D}(H(a',b), H(a,b)) This is a convenience method. The arguments are a morphism \alpha: a \rightarrow a' and an object b in C. The output is HomomorphismStructureOnMorphisms called on \alpha, \mathrm{id}_b. a morphism in \mathrm{Hom}_{D}(H(a,b), H(a,b')) This is a convenience method. The arguments are an object a and a morphism \beta: b \rightarrow b' in C. The output is HomomorphismStructureOnMorphisms called on \mathrm{id}_a, \beta. an object This is a convenience method. The arguments are two objects a and b in C. The output is HomomorphismStructureOnObjects called on a,b. This is a convenience method for InterpretMorphismAsMorphismFromDistinguishedObjectToHomomorphismStructure. This is a convenience method for InterpretMorphismFromDistinguishedObjectToHomomorphismStructureAsMorphism. This is a convenience method for DistinguishedObjectOfHomomorphismStructure. nothing If \iota\colon D \to E is a full embedding of categories, every D-homomorphism structure for a category C extends to a E-homomorphism structure for C. This operations accepts four functions and installs operations `DistinguishedObjectOfHomomorphismStructureExtendedByFullEmbedding`, `HomomorphismStructureOnObjectsExtendedByFullEmbedding` etc. which correspond to the E-homomorphism structure for C. Note: To distinguish embeddings in different categories, in addition to C also E is passed to the operations. When using this with different embeddings with the range category E, only the last embedding will be used. The arguments are: `object_function` gets the categories C and E and an object in D. `morphism_function` gets the categories C and E, an object in E, a morphism in D and another object in E. The objects are the results of `object_function` applied to the source and range of the morphism. `object_function_inverse` gets the categories C and E and an object in E. `morphism_function_inverse` gets the categories C and E, an object in D, a morphism in E and another object in D. The objects are the results of `object_function_inverse` applied to the source and range of the morphism. `object_function` and `morphism_function` define the embedding. `object_function_inverse` and `morphism_function_inverse` define the inverse of the embedding on its image.

nothing Chooses the identity on D as the full embedding in . This is useful to handle this case as a degenerate case of . a list of morphisms in \mathrm{Hom}( a, b ) The argument are two objects a, b. The output is a list of all morphisms from a to b. a list of morphisms in \mathrm{Hom}_{C}(a,b) The arguments are objects a,b in a k-linear category C. The output is a list L of morphisms which is a basis of \mathrm{Hom}_{C}(a,b) in the sense that any given morphism \alpha: a \to b can uniquely be written as a linear combination of L with the coefficients in CoefficientsOfMorphism(\alpha). a list of elements in k This is a convenience method. The argument is a morphism \alpha: a \to b in a k-linear category C. The output is a list of coefficients of \alpha with respect to the list BasisOfExternalHom(a,b).
Simplified Morphisms Let \phi: A \rightarrow B be a morphism. There are several different natural ways to look at \phi as an object in an ambient category: \mathrm{Hom}( A, B ), the set of homomorphisms with the equivalence relation \mathtt{IsCongruentForMorphisms} regarded as a category, \sum_{A}\mathrm{Hom}( A, B ), the category of morphisms where the range is fixed, \sum_{B}\mathrm{Hom}( A, B ), the category of morphisms where the source is fixed, \sum_{A,B}\mathrm{Hom}( A, B ), the category of morphisms where neither source nor range is fixed, and furthermore, if \phi happens to be an endomorphism A \rightarrow A, we also have \sum_{A}\mathrm{Hom}(A,A), the category of endomorphisms. Let \mathbf{C} be one of the categories above in which \phi may reside as an object, and let i be a non-negative integer or \infty. CAP provides commands for passing from \phi to \phi_i, where \phi_i is isomorphic to \phi in \mathbf{C}, but "simpler". The idea is that the greater the i, the "simpler" the \phi_i (but this could mean the harder the computation), with \infty as a possible value. The case i = 0 defaults to the identity operator for all simplifications. For the Add-operatations, only the cases i \geq 1 have to be given as functions.

\

If we regard \phi as an object in the category \mathrm{Hom}( A, B ), \phi_i is again in \mathrm{Hom}( A, B ) such that \phi \sim_{A,B} \phi_i. This case is handled by the following commands: a morphism in \mathrm{Hom}(A,B) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is a simplified morphism \phi_i. \

If we regard \phi as an object in the category \sum_{A}\mathrm{Hom}( A, B ), then \phi_i is a morphism of type A_i \rightarrow B and there is an isomorphism \sigma_i: A \rightarrow A_i such that \phi_i \circ \sigma_i \sim_{A,B} \phi. This case is handled by the following commands: a morphism in \mathrm{Hom}(A_i,B) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is a simplified morphism with simplified source \phi_i: A_i \rightarrow B. a morphism in \mathrm{Hom}(A_i,A) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism (\sigma_i)^{-1}: A_i \rightarrow A. a morphism in \mathrm{Hom}(A,A_i) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism \sigma_i: A \rightarrow A_i. \

If we regard \phi as an object in the category \sum_{B}\mathrm{Hom}( A, B ), then \phi_i is a morphism of type A \rightarrow B_i and there is an isomorphism \rho_i: B \rightarrow B_i such that \rho_i^{-1} \circ \phi_i\sim_{A,B} \phi. This case is handled by the following commands: a morphism in \mathrm{Hom}(A,B_i) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is a simplified morphism with simplified range \phi_i: A \rightarrow B_i. a morphism in \mathrm{Hom}(B_i,B) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism (\rho_i)^{-1}: B_i \rightarrow B. a morphism in \mathrm{Hom}(B,B_i) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism \rho_i: B \rightarrow B_i. \

If we regard \phi as an object in the category \sum_{A, B}\mathrm{Hom}( A, B ), then \phi_i is a morphism of type A_i \rightarrow B_i and there is are isomorphisms \sigma_i: A \rightarrow A_i and \rho_i: B \rightarrow B_i such that \rho_i^{-1} \circ \phi_i \circ \sigma_i \sim_{A,B} \phi. This case is handled by the following commands: a morphism in \mathrm{Hom}(A_i,B_i) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is a simplified morphism with simplified source and range \phi_i: A_i \rightarrow B_i. a morphism in \mathrm{Hom}(B_i,B) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism (\rho_i)^{-1}: B_i \rightarrow B. a morphism in \mathrm{Hom}(B,B_i) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism \rho_i: B \rightarrow B_i. a morphism in \mathrm{Hom}(A_i,A) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism (\sigma_i)^{-1}: A_i \rightarrow A. a morphism in \mathrm{Hom}(A,A_i) The arguments are a morphism \phi: A \rightarrow B and a non-negative integer i or infinity. The output is the isomorphism \sigma_i: A \rightarrow A_i. \

If \phi:A \rightarrow A is an endomorphism, we may regard it as an object in the category \sum_{A}\mathrm{Hom}( A, A ). In this case \phi_i is a morphism of type A_i \rightarrow A_i and there is an isomorphism \sigma_i: A \rightarrow A_i such that \sigma_i^{-1} \circ \phi_i \circ \sigma_i \sim_{A,A} \phi. This case is handled by the following commands: a morphism in \mathrm{Hom}(A_i,A_i) The arguments are an endomorphism \phi: A \rightarrow A and a non-negative integer i or infinity. The output is a simplified endomorphism \phi_i: A_i \rightarrow A_i. a morphism in \mathrm{Hom}(A_i,A) The arguments are an endomorphism \phi: A \rightarrow A and a non-negative integer i or infinity. The output is the isomorphism (\sigma_i)^{-1}: A_i \rightarrow A. a morphism in \mathrm{Hom}(A,A_i) The arguments are an endomorphism \phi: A \rightarrow A and a non-negative integer i or infinity. The output is the isomorphism \sigma_i: A \rightarrow A_i. a morphism in \mathrm{Hom}(A_{\infty},B_{\infty}) This is a convenient method. The argument is a morphism \phi: A \rightarrow B. The output is a "simplified" version of \phi that may change the source and range of \phi (up to isomorphism). To be precise, the output is an \infty-th simplified morphism of (\iota_A^{\infty})^{-1}\circ \phi \circ \iota_A^{\infty}.
Reduction by split epi summands Let \alpha: A \rightarrow B be a morphism in an additive category. Suppose we are given direct sum decompositions of A \simeq A' \oplus A'' and B \simeq B' \oplus B'' such that \begin{center} \begin{tikzpicture} \def\w{4} \def\h{2} \node (A) at (0,0) {$A$}; \node (B) at (\w,0) {$B$}; \node (Ap) at (0,\h) {$A' \oplus A''$}; \node (Bp) at (\w,\h) {$B' \oplus B''$}; \draw[-latex] (A) to node[pos=0.45, above] {$\alpha$} (B); \draw[-latex] (Ap) to node[pos=0.45, above] {$\alpha' \oplus \alpha''$} (Bp); \draw[-latex] (A) to (Ap); \draw[-latex] (B) to (Bp); \end{tikzpicture} \end{center} If \alpha'' is a split epimorphism, then we call \alpha': A' \rightarrow B' some reduction of \alpha by split epi summands. The inclusions/projections of the decompositions into direct sums induce commutative diagrams \begin{center} \begin{tikzpicture} \def\w{4} \def\h{2} \node (A) at (0,0) {$A$}; \node (B) at (\w,0) {$B$}; \node (Ap) at (0,\h) {$A'$}; \node (Bp) at (\w,\h) {$B'$}; \draw[-latex] (A) to node[pos=0.45, above] {$\alpha$} (B); \draw[-latex] (Ap) to node[pos=0.45, above] {$\alpha'$} (Bp); \draw[-latex] (A) to (Ap); \draw[-latex] (B) to node[pos=0.45, right] {$\beta$} (Bp); \end{tikzpicture} \end{center} and \begin{center} \begin{tikzpicture} \def\w{4} \def\h{2} \node (A) at (0,0) {$A$}; \node (B) at (\w,0) {$B$}; \node (Ap) at (0,\h) {$A'$}; \node (Bp) at (\w,\h) {$B'$}; \draw[-latex] (A) to node[pos=0.45, above] {$\alpha$} (B); \draw[-latex] (Ap) to node[pos=0.45, above] {$\alpha'$} (Bp); \draw[-latex] (Ap) to (A); \draw[-latex] (Bp) to node[pos=0.45, right] {$\beta'$} (B); \end{tikzpicture} \end{center} a morphism in \mathrm{Hom}(A',B') The argument is a morphism \alpha: A \rightarrow B. The output is some reduction of \alpha by split epi summands \alpha': A' \rightarrow B'. a morphism in \mathrm{Hom}(B',B) The argument is a morphism \alpha: A \rightarrow B. The output is the morphism \beta': B' \rightarrow B linking \alpha with some reduction by split epi summands. a morphism in \mathrm{Hom}(B,B') The argument is a morphism \alpha: A \rightarrow B. The output is the morphism \beta: B \rightarrow B' linking \alpha with some reduction by split epi summands.