We show that an additive category is abelian if and only if its functorial nerve is a double décalage of a pseudo-simplicial object in Cat. In this characterization, the canonical isomorphism between the image and coimage is encoded by a coherent pseudo-simplicial identity.
Introduction
Abelian categories [4, 6] are fundamental in modern mathematics, offering an abstract setting for exactness and thus enabling the systematic study of homology, derived functors, and derived categories. They provide a unifying framework for structures arising in diverse areas such as algebraic topology, representation theory, and algebraic geometry, as well as powerful tools and results for these fields.
For this reason, abelian categories have been extensively studied, leading to fundamental results such as the Freyd–Mitchell embedding theorem [4], which states that every small abelian category admits a fully faithful exact embedding into a category of modules over a ring. Considerable attention has also been devoted to the definition itself, resulting in several equivalent characterizations in terms of kernels and cokernels, normal monomorphisms and epimorphisms, and the relationship between images and coimages. This last characterization is our starting point:
An additive category C is abelian if every morphism f:a→b in C has a kernel and a cokernel, and the unique induced map
coimf≅coker(kerfκfa)∃!ker(bπfcokerf)≅imf(1)
is invertible.
Our recent work [9] provided a new characterization in terms of lax and colax algebras over 2-monads, and the present work continues this line of research by introducing a characterization using (pseudo)simplicial language in Theorem 10.
Let us briefly explain the results and the content of this paper. In [8], categories with kernels were characterized simplicially by the equation N∙(C)≅decT(X)∙, meaning that the (categorical) nerve of C is the upper décalage of an almost strict pseudo-simplicial object X∙. In effect, this equation equips the nerve with a (coherent) family of new functors dn+1:Nn(C)→Nn−1(C), which determine the kernels via ker=d2:N1(C)→N0(C).
Dually, cokernels are characterized by the equation N(C)≅dec⊥X, which yields new functors d−1:Nn(C)→Nn−1(C). Combining the two, we arrive at the double decalage construction dec⊥T(−) (upper and lower), which explains our title. As we show, the equation N(C)≅dec⊥TX equips the category C with both kernels and cokernels, and the isomorphism in (1) is encoded precisely by the coherent (pseudo)simplicial identity
d−1d3≅d2d−1:N2(C)⟶N0(C).
Our results emerged from the theory of operadic categories—they complete the observations made in [7]. Furthermore, the décalage construction and the pseudosimplicial setting align with the recent fundamental work [1] on simplicial characterization of the category of operadic categories, inspired by [5].
Plan of the paper. In Section 1, we recall supercoherent structures and introduce the upper, lower, and double decalage constructions. Section 2 describes the functorial nerve of a category and its basic properties. In Section 3, we recall the notions of kernels and cokernels and their simplicial characterizations in terms of upper and lower decalage, respectively. Finally, Section 4 establishes the main theorem, characterizing abelian categories by means of the double décalage construction.
Conventions. We denote by f⋅g the morphism g followed by f, that is, the composite f(g). We use the same convention for the composites of functors and functors pre- or postcomposed with a morphism. The symbol 1, with or without a subscript, denotes—depending on the context—the identity endomorphism, functor, or transformation.
Supercoherent structures, décalages, &c.
Here we recall Jardine’s supercoherent structures [3], their variants, and upper, lower and double décalage constructions.
Definition 1. A pseudo-simplicial category is a pseudofunctor X:Δop→Cat.
According to [3], a pseudo-simplicial category is generated by the following pieces of data, which constitute a coherent higher-dimensional analogue to simplicial identities.
Definition 2. A supercoherent structureX∙ consists of categories Xn, n≥0, functors
subject to coherence conditions (1.4.1)–(1.4.17) of [3].
Note that arrows go in the opposite direction as in [3]. In particular we assume the orientation of the top-bottom simplicial isomorphism as
αm:d0dn⟹dn−1d0,(5)
which is a transformation of functors Xn→Xn−2, n≥2. This convention is better suited for our purposes and, since all α’s are isomorphisms, the direction does not really matter.
To improve readability we shall use d⊤⊤=dn for the top face operators dn:Xn→Xn−1 and s⊤⊤=sn−1 for the top degeneracy operators sn−1:Xn−1→Xn, for any n≥1. Similarly, we denote d⊤=dn−1, d⊥⊥=d0, d⊥=d1, s⊤=sn−2, s⊥=s1, s⊥⊥=s0.
For the promised characterization we single out those supercoherent structures, for which most of the simplicial transformations remain strict.
Definition 3. A supercoherent structure U∙ is called upper almost strict if U0 equals the terminal category 1 and all the simplicial isomorphisms of (2) are identities, except the top ones
(4b)
α⊤:d⊤⊤d⊤⊤⟹d⊤⊤d⊤
which are transformations between the functors Un→Un−2, n≥2.
A supercoherent structure L∙ is called lower almost strict if L0=1 and if all the simplicial isomorphisms of (2) are identities, except the bottom ones
(4c)
α⊥:d⊥⊥d⊥⟹d⊥⊥d⊥⊥
which are transformations between the functors Ln→Ln−2, n≥2.
A supercoherent structure X∙ is called almost strict if X0=X1=1, and all the simplicial isomorphisms of (2) are identities, except three families of coherent simplicial isomorphisms (4a), (4b), and (4c).
For almost strict structures some of the coherence conditions (1.4.1)–(1.4.17) of [3] become trivial and the rest simplifies to the following two groups of equalities. The group (i)–(vii) relates 2-cells between functors Xn+3→Xn, for n≥0:
(i) α⊥d⊥⊥⋅α⊥d2=d⊥⊥α⊥⋅α⊥d⊥,
(ii) αmd⊥⊥⋅d⊥⊥αm⋅α⊥d⊤⊤=d⊤⊤α⊥⋅αmd⊥,
(iii) α⊤d⊥⊥⋅d⊤⊤αm⋅αmd⊤⊤=αmd⊤⋅d⊥⊥α⊤,
(iv) α⊤dn−2⋅α⊤d⊤⊤=α⊤d⊤⋅d⊤⊤α⊤,
(v) diα⊥=α⊥di+2, for 1≤i≤n,
(vi) diαm=αmdi+1, for 1≤i≤n,
(vii) diα⊤=α⊤di, for 0≤i≤n.
Since X0=X1=1 by assumption, for n=0,1 the above equalities hold trivially. The group (viii)–(x) below relates 2-cells between functors Xn+1→Xn, for n≥1:
(viii) α⊥s⊥=1, α⊥s⊥⊥=1, α⊥sj=sj−2α⊥, for 2≤j≤n+1,
(ix) αms⊤⊤=1, αms⊥⊥=1, αmsj=sj−1αm, for 1≤j≤n,
(x) α⊤s⊤=1, α⊤s⊤⊤=1, α⊤sj=sjα⊤, for 0≤j≤n−1.
Definition 4. The upper décalagedec⊤(X)∙ of a supercoherent structure X∙ is the supercoherent structure with
dec⊤(X)n:=Xn+1,n≥0,
and with the simplicial operators di⊤,sj⊤ given by the simplicial operators of di,sj of X∙, as
the bottom operators d0:Xn+1→Xn and s0:Xn+1→Xn+2 of X∙ are forgotten. The coherence isomorphisms of dec⊥(X)∙ are inherited from X∙.
The double decalagedec⊥⊤(X)∙ of a supercoherent structure X∙ is obtained by applying both upper and lower decalage to the structure X∙. Note that the order does not matter:
dec⊤(dec⊥(X))∙=dec⊥⊤(X)∙=dec⊥(dec⊤(X))∙.
The functorial nerve of a category
In this section we introduce the functorial nerve N∙(C) and investigate transformations between functors acting on its components.
Definition 5. Let n be the ordered set {0<1<⋯<n} considered as a category, and let Nn(C):=[n→C] be the nth piece of the categorical version of the standard simplicial nerve of a category C. The latter is the category of chains of composable arrows
[f1,…,fn]:=∙f1∙f2⋯∙fn−1∙fn∙.(7)
The morphisms of Nn(C) are commutative ladders in C
Each commutative ladder of length n≥2 is determined by two overlapping ladders of length n−1; namely one without φ0 and one without φn. This Segal-type condition is expressed via the isomorphism
where the right hand side is the pullback of d0 and dn−1. It will be helpful to spell out that Φn sends a morphism X of Nn(C) to the pair
Φn(X):=(dnX,d0X)
of morphisms of Nn−1(C). Conversely, given morphisms U,V of Nn−1(C) such that d0U=dn−1V, there exists a unique morphism W of Nn(C) such that Φ(W)=(U,V).
If we extend the definition of the nerve by declaring N−1(C) to be the terminal category, the functor in (7a) becomes
to the pair (φ0,φ1). Notice that while Φ1 is no longer an isomorphism, it is still faithful.
The following statement prepares the ground for Lemma 12, which forms the main ingredient of the proof of Theorem 10.
Lemma 6. Let c∈{0,1,2} and let F={ξn}n≥0 be a family whose member ξn is a natural transformation between functors Nn+2(C)→Nn(C) such that
di⋅ξn+1=ξn⋅di+c,0≤i≤n+1,n≥0.(11)
Then
(i) the family F is uniquely determined by ξ0. If ξ0 is invertible, then all higher ξn’s are invertible too.
(ii) Any ξ0,ξ1 satisfying (8) with n=0 are pieces of a unique family F={ξn}n≥0 satisfying (8) for all $n \geq 1.
Proof. Let us start with the first part by proving that, given n≥0, ξn determines ξn+1. By (7a) and by the faithfulness of Φ1 in (7b), it suffices to prove that ξn determines dn+1⋅ξn+1 and d0⋅ξn+1. However, this follows from (8), since
dn+1⋅ξn+1=ξn⋅dn+1+candd0⋅ξn+1=ξn⋅dc.
The invertibility follows from the obvious fact that ξn+1 is invertible if and only if dn⋅ξn+1 and d0⋅ξn+1 are invertible. Let us prove the second part of the lemma.
Assume that we have already constructed ξn and ξn+1 satisfying (8) with some n≥0. By (7a), ξn+2 will be determined by transformations ω,λ of functors Nn+4(C)→Nn+1(C) that fulfill
d0⋅ω=dn+1⋅λ.(12)
Such an ξn+2 will then be determined by the equalities
ω=dn+2⋅ξn+2andλ=d0⋅ξn+2.
Let us take ω:=ξn+1⋅dn+2+c, λ:=ξn+1⋅dc. Then
d0⋅ω=d0⋅ξn+1⋅dn+2+c=ξn⋅dcdn+2+c,and
dn+1⋅λ=dn+1⋅ξn+1⋅dc=ξn⋅dn+1+cdc.
Since dcdn+2+c=dn+1+cdc, (9) follows. Notice that, by construction,
dj⋅ξn+2=ξn+1⋅dj+c
for j=0 and j=n+2. To verify this equation for the remaining 0<j<n+2 is an easy exercise on simplicial identities. □
Simplicial characterization of kernels and cokernels.
In this section we recall the simplicial characterizations of categories with kernels and cokernels in terms of upper and lower décalage, respectively.
A pointed category C is a category with a chosen object 0 which is both initial and terminal. We denote the initial map of an object a∈C by !a:0→a and the terminal map by !a:a→0. A pointed category has kernels if every map f of the category has a chosen kernel
kerfκfafb
We also assume that κ!a=!a and κ!a=1a, for every object a. Similarly, a pointed category has cokernels if every map f has a chosen cokernel
afbπfcokerf,
assuming that π!a=!a and π!a=1a, for every object a of the category. If a pointed category has both kernels and cokernels, we additionally assume π!a=κ!a=10.
Theorem 7 (Theorem 26 of [8]). A pointed category C has kernels if and only if there is an isomorphism N∙(C)≅dec⊤(U)∙, where U∙ is an upper almost strict supercoherent structure. The kernels are given by the values of d⊤⊤:N1(C)→N0(C).
The following definition uses the fact that each natural transformation ξ:p⇒q between functors p,q:A→B induces a natural transformation ξop:qop⇒pop between opposite functors between opposite categories with components
ξaop:=(ξa)op:qop(a)→pop(a),a∈A
where ξa:p(a)→q(a) are the components of ξ.
Definition 8. The opposite of an upper almost strict supercoherent structure U∙ is a lower almost strict supercoherent structure (Uop)∙ given by
(Uop)n:=(Un)op,
the opposite category of Un, the operators in dimension n are
diop:=(dn−i)op:(Un)op⟶(Un−1)op,n≥1,0≤i≤n,
sjop:=(sn−j)op:(Un)op⟶(Un+1)op,n≥0,0≤j≤n.
In particular, d⊤⊤op=(d⊥⊥)op and d⊥⊥op=(d⊤⊤)op. The coherence isomorphisms for (Uop)∙ are
α⊥op:=(α⊤)op:d⊥⊥opd⊥op⟶d⊥opd⊥⊥op.
Dually, the opposite of a lower almost strict supercoherent structure L∙ is an upper almost strict supercoherent structure (Lop)∙. With the above definition available, we formulate a version of Theorem 7 for cokernels.
Theorem 9. A pointed category C has cokernels if and only if there exists an isomorphism
N∙(C)≅dec⊥(L)∙.
with some lower almost strict supercoherent structure L∙. The cokernels are given by the values of d⊥⊥:N1(C)→N0(C).
Proof. A pointed category C has cokernels if and only if Cop has kernels. By Theorem 7, this is equivalent to the isomorphism N∙(Cop)≅dec⊤(U)∙, with U∙ an upper almost strict coherent structure. Then L∙:=(Uop)∙ is a lower almost strict coherent structure and, clearly, (Lop)∙=U∙. Taking into account the isomorphisms (N(C)op)∙≅N∙(Cop) and dec⊤(Lop)∙≅(dec⊥(L)op)∙ we conclude that
which gives the isomorphism (N(C)op)∙≅(dec⊥(L)op)∙, equivalent to N∙(C)≅dec⊥(L)∙. □
Simplicial characterization of abelian categories
This section contains Theorem 10, the main result of the paper. It combines the results of the previous section to obtain a simplicial characterization of abelian categories in terms of the double décalage construction.
Theorem 10. An additive category C is abelian if and only if dec⊥⊤(X)∙≅N∙(C), where X∙ is an almost strict supercoherent structure of Definition 3.
In the proof of Theorem 10, we need two auxiliary lemmas. The first concerns the naturality of induced maps between kernels and between cokernels. Its proof is straightforward, and we leave it to the reader.
Lemma 11. Consider two adjacent commutative squares as in the diagram
The second auxiliary lemma is a corollary of Lemma 6. It refers to the families α⊥, αm and α⊤ introduced in (4a), (4b) and (4c) in § 2, satisfying the equalities listed on page 4 before Definition 4. In this lemma, we will denote, for n≥0, the members of the families α⊥, αm and α⊤ which are transformations of functors Xn+4→Xn+2 more specifically by α⊥n, αmn and α⊤n, respectively. Notice that, since X0=X1=1, α⊥0, αm0 and α⊤0 are the first nontrivial members of the corresponding families. We will also make the crucial assumption that dec⊥⊤(X)∙≅N∙(C) for some category C.
Lemma 12. The families α⊥, αm and α⊤ are uniquely determined by α⊥0, αm0 and α⊤0. The members of the families α⊥, αm and α⊤ are invertible if and only if the transformations α⊥0, αm0 and α⊤0 are invertible.
The first two members α⊥i, αmi and α⊤i, i=0,1, uniquely extend to the corresponding full families satisfying (v), (vi) and (vii), respectively. Moreover, these unique extensions automatically satisfy all the remaining conditions (i)–(x) if and only if these conditions are satisfied by the first two members of the families.
Proof. Condition (v) relates, for n≥0, α⊥n with α⊥n+1 via the equality
diα⊥n+1=α⊥ndi+2,1≤i≤n+2.
which, using the isomorphism dec⊥⊤(X)∙≅N∙(C), can be rewritten as
diNα⊥n+1=α⊥ndi+2N,0≤i≤n+1.
where diN=di+1:Nn(C)→Nn−1(C), 0≤i≤n, are the simplicial operators of the nerve. Comparing this with the condition in (8), with ξn:=α⊥n, n≥0, Lemma 6 shows that the family α⊥ is uniquely determined by α⊥0, and that α⊥0 together with α⊥1 uniquely extend to the whole family α⊥ satisfying (v) as claimed. The characterization of invertibility also follows from Lemma 6. The arguments for αm and α⊤ are similar.
Let us prove the last part of the lemma. Assume for instance that (i) is satisfied for the first two members of the family α⊥, that is
α⊥0d0⋅α⊥0d2=d0α⊥0⋅α⊥0d1.(13)
We need to verify that
α⊥nd0⋅α⊥nd2=d0α⊥n+1⋅α⊥nd1(14)
holds for all n≥1. Since (in) is an equality of transformations between functors Xn+5→Xn+2, that is between functors Nn+3(C)→Nn(C), it is enough, by (7a) if n≥2 resp. (7b) if n=1, to compare the two sides of (in) after applying d0N=d1 and dnN=dn+1. The application of d1 to the left hand side gives
We see that, for n≥1, (in−1) implies (in), so (in) holds inductively for all n≥0, as claimed. The remaining items of the list can be discussed similarly. □
Proof of Theorem 10. Assume that C is abelian, in particular, that it has kernels and cokernels. Then by Theorems 7 and 9 there is an upper almost strict supercoherent structure U∙ and a lower almost strict supercoherent structure L∙ with dec⊤(U)∙≅N∙(C) and dec⊥(L)∙≅N∙(C), such that Un+1≅Nn(C)≅Ln+1, n≥0. Moreover, the simplicial operators of U∙ and L∙ that come from the nerve agree, and U0=L0=1 by assumption.
We construct the required almost strict supercoherent structure X∙ as follows. We define
as well as the coherence isomorphisms that involve them. The operators s0,s1:X1→X2 send the unique object of X1=1 to the null object 0∈X2=C. For n≥2 we put Xn:=Nn−2(C), with the top and bottom simplicial operators d⊤⊤,s⊤⊤ and d⊥⊥,s⊥⊥ transferred from U∙ and L∙, along with the accompanying coherent simplicial isomorphisms α⊤,α⊥.
The last missing pieces are the mixed isomorphism αm:d⊥⊥d⊤⊤⇒d⊤⊤d⊥⊥. Their construction is divided into three steps. First, we construct the transformations αm between functors Xn→Xn−2 for n=4,5 and then we extend them to all n≥4 using Lemma 6. In the second step we show that αm’s are invertible, and in the last step we verify the coherences (i)–(x) listed before Definition 4.
Step 1: Construction of αm. The first nontrivial αm is a transformation between functors X4→X2. For x=[f,g]∈N2(C), the component αm(x) is the unique morphism in X2=N0(C)=C in the top tight corner in the diagram
in which coker(d⊤⊤x)=d⊥⊥d⊤⊤x, ker(d⊥⊥x)=d⊤⊤d⊥⊥x and the dashed arrows are induced by universal properties of kernels and cokernels. Let us prove the naturality of αm. Namely, given a morphism x′→x′′ from x′=[f′,g′] to x′′=[f′′,g′′], we must verify the commutativity of the diagram
For n=5, let y∈X5=N3(C), y=AfBgChD. Equality (vi) before Definition 4 gives d1αm(y)=αm(d2y) and d2αm(y)=αm(d3y), so αm(y) is represented by the diagram
with some objects O,P,Q,R∈C. Notice that the operators d2 and d3 of X are the shifted operators d1N and d2N of the nerve. To show that the square in (17) commutes, we draw in Figure 1 the diagram describing the construction of αm(y). In that diagram, E→F→G=d⊥⊥y, and H→I→J=d⊤⊤y. Applying the kernel version of Lemma 11 to the diagram
in which I→J is the induced morphism between kernels, and E→F is the induced morphism between cokernels, we verify that the square (IJOP) commutes. Finally, the cokernel version of Lemma 11 applied to
HHd5d3yd5d2yI↓⏐Jφ′φ′′O↓⏐P
gives the required commutativity of (12). The naturality of αm on X5 follows from the fact that it is determined by αm(d2) and αm(d3), cf. (12), and that αm is natural on X4 as we already established.
We have constructed the two initial terms of the family αm. Lemma 12 tells us that they extend uniquely to the full family satisfying (vi). It remains to prove that the families α⊥, αm and α⊤ together satisfy all conditions (i)–(x). By Lemma 12 again, it will suffice to check that they are satisfied by the first two members of the families. This will be done in Step 3 below.
Step 2: Invertibility of αm. By Lemma 12, it suffices to show that αm(x) is an invertible morphism for any x=[h,g]∈N2(C). If C is an abelian category of modules over a ring R, this was already observed in [7 Proposition 26]. The morphisms hZ, gS, and ϱ in diagram (25) of [7] are precisely morphisms d⊤⊤(x), d⊥⊥(x), and the component αm(x), respectively.
If C is arbitrary abelian, we consider its small abelian subcategory generated by the diagram ShTgZ. Freyd–Mitchell’s embedding theorem [4 Theorem 4.44 & page 104] gives an exact fully faithful embedding of this subcategory into the category of modules, proving invertibility of ϱ in the general case.
Step 3: Coherence. We need to verify equalities (ii), (iii) and (ix) only. Indeed, equalities (i), (v) and (viii) hold because L is lower almost strict, while (iv), (vii) and (x) hold because U is upper almost strict. Moreover, since the higher αm’s are inductively constructed from the lower ones, equality (vi) follows from the second part of Lemma 12.
Condition (ii) is dual to (iii), so it suffices to prove one of them, say (iii). By Lemma 12 again, it is enough to verify (iii) for the first two members of the families, where it is an equality of transformations of functors X5→X2, that is, of functors N3(C)→N0(C). Let therefore
y=afbgchd∈N3(C).
Equality (iii) evaluated at y appears as the equality
S→T→U=S→W→V→U(18)
of the composites of morphisms of C in the diagram in Figure 2. The arrow N→S is a cokernel map, hence an epimorphism, and the arrow U→E is a kernel map, hence a monomorphism. Therefore, (13) is equivalent to
Figure 2. The coherence.
N→S→T→U→E=N→S→W→V→U→E,
which can be verified by the standard diagram chase. Notice that all other regions of the diagram commute. Thus (iii), and hence also (ii), have been verified.
By Lemma 12, it is enough to prove the equalities in (ix) only when they compare transformations of functors X3→X2, that is, functors N1(C)→N0(C). Let us evaluate, for example, αms⊥⊥=1 at f:a→b∈N1(C). Diagram (10) defining αmx for x=s⊥⊥f=[!a,f] becomes
so clearly αms⊥⊥f=1 as required. The remaining equalities in (ix) can be verified analogously.
This concludes the proof that, for an abelian category C, N∙(C)≅dec⊥⊤(X)∙ for some almost strict supercoherent structure X∙.
Opposite implication. Assume that dec⊥⊤(X)∙≅N∙(C) for an almost strict supercoherent structure X∙. Since then N∙(C)≅dec⊥⊤(dec⊥(X))∙, Theorem 7 implies that the category C has kernels. Dually, Theorem 9 implies the existence of cokernels. It remains to establish the isomorphism (1). To this end, we use the factorization
ιf:=a1a⊕fa⊕b0+1bb(19)
regarded as an object of X4=N2(C), and the associated diagram (10) with x=ιf. As in the proof of [9 Theorem 24], we observe that this diagram holds for an arbitrary choice of concrete (co)kernels in C, which leads to
in which the isomorphism αm(ιf) comes from the supercoherent structure. This concludes the proof of Theorem 10. □
The additivity of the category C was used in the second part of the proof of Theorem 10 merely to construct the factorization in (14). Factorizations of the same type exist under weaker assumptions, formulated in
Definition 13. A category with kernels and cokernels has a KC-factorization if every morphism f:a→b can be written as f=em with a monomorphism m and an epimorphism e, such that there are isomorphisms ξ:a≅ker(e) and ζ:coker(m)≅b satisfying mκf=κeξκf and πfe=πfζπm.
Factorization (14) is clearly of the type required by the above definition. Recall from [2 S. 1.1.] that a Puppe-exact category is a pointed category with kernels and cokernels such that the canonical map coker(κf)→ker(πf) is an isomorphism for every morphism f. Our theory provides the following characterization.
Theorem 14. A category C with a KC-factorization is Puppe-exact if and only if there is an isomorphism dec⊥⊤(X)∙≅N∙(C) for some almost strict supercoherent structure X∙.
INSTITUTE OF MATHEMATICS, THE CZECH ACADEMY OF SCIENCES, ŽITNA 25, 110 00 PRAHA, CZECH REPUBLIC
References
[1]M. Batanin, J. Kock, and M. Weber. Operadic categories as (pseudo)-simplicial groupoids. Preprint arXiv:2606.15671, 2026.arxiv.org/abs/2606.15671
[2]F. Borceux and M. Grandis. Jordan-Hölder, modularity and distributivity in non-commutative algebra. Journal of Pure and Applied Algebra, 208:665–689, 2007.DOI
[3]J.F. Jardine. Supercoherence. J. Pure Appl. Algebra, 75, 103–194, 1991.DOI
[4]P. Freyd. Abelian Categories. Harper & Row, New York, 1964.
[5]R. Garner, J. Kock and M. Weber. Operadic categories and décalage. Adv. Math., 377:107440, 2021.DOI
[6]S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, New York, 1971. Graduate Texts in Mathematics, Vol. 5.