Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Colimits of a graded additive functor equal right exactness plus coproduct preservation

Statement

Let k be a field, A,B graded k-algebras and F:GrMod⁡0(A)→GrMod⁡0(B) additive. Then F preserves all small colimits if and only if F preserves cokernels and all coproducts; equivalently, F is cocontinuous if and only if it is right exact and coproduct preserving. No choice is used.

Facts & Assumptions

Given: A field k, graded k-algebras A,B, an additive functor F:GrMod⁡0(A)→GrMod⁡0(B), and a small diagram D:J→GrMod⁡0(A) with coproducts R=∐u:j→kD(j), S=∐jD(j) and canonical maps d,c:R⇉S as in [L5].

[L1]

GrMod⁡0(A) is abelian, and its kernels, images, cokernels and finite biproducts are computed degreewise, so exactness is equivalent to exactness degreewise (Graded modules with degree-zero maps form an abelian category).

[L2]

For every family the degreewise direct sum is the coproduct in GrMod⁡0(A), so that category has all small coproducts, and a family of degree-zero maps out of the summands assembles uniquely (Degreewise direct sums and homogeneous free covers in graded modules).

[L3]

A functor preserves J-colimits when the image of every colimiting cocone is colimiting, and it is cocontinuous when it preserves all small colimits (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

[L4]

A functor is right exact when it preserves every finite colimit that exists in its source category; left and right exactness assert preservation, not existence (Left exact and right exact functors).

[L5]

For a small diagram D:J→C, if the coproducts R=∐u:j→kD(j) and S=∐jD(j) and the coequalizer of the canonical maps d,c:R⇉S exist, then that coequalizer is a colimit of D (Every small colimit can be constructed as a coequalizer between coproducts over the arrows and objects of the index category).

[L6]

In a preadditive category a coequalizer of a parallel pair f,g:A⇉B is exactly a cokernel of f−g, and conversely (In a preadditive category, the coequalizer of a parallel pair is the cokernel of their difference).

[L7]

An additive functor between additive categories preserves finite biproducts (An additive functor preserves finite biproducts).

[L8]

An additive category in which every morphism has a kernel and a cokernel has all finite limits and all finite colimits (An additive category with all kernels and cokernels has all finite limits and colimits).

[L9]

An abelian category is an additive category in which every morphism has a kernel and a cokernel and the canonical coimage-to-image comparison is an isomorphism (Abelian category).

[L10]

An additive category is a preadditive category with all finite biproducts, equivalently one with a zero object and binary biproducts (Additive category).

[L11]

A preadditive category has abelian groups of morphisms with bilinear composition (Preadditive category).

[L12]

A functor between preadditive categories is additive when each induced map on hom-groups is a group homomorphism, equivalently F(f+g)=Ff+Fg for parallel f,g (Additive functor).

Proof

technique · direct
1.1L1L2L5L6L9L10L11

By [L1] and [L9] the category GrMod⁡0(A) is abelian, hence additive [L10] and preadditive [L11], and by [L2] it has all small coproducts; for a small diagram D the coproducts R and S and the coequalizer of (d,c) therefore exist, and by [L5] that coequalizer, which by [L6] is the cokernel of c−d, is a colimit of D. In particular every small diagram has a colimit in GrMod⁡0(A).

2.1step 1.1L3L5L6L12

Assume F preserves cokernels and all coproducts, and let Q=coker⁡(c−d) be the colimit of D from step 1.1 with its canonical cocone. Since F preserves coproducts, the maps F(ȷu) exhibit F(R) as a coproduct of the F(D(j)) and the maps F(ȷj) exhibit F(S) as a coproduct of the F(D(j)), so F(d) and F(c) are the canonical maps of the same recipe for the composite FD; since F preserves cokernels, F(Q) with F of the canonical map is a cokernel of F(c−d), and F(c−d)=F(c)−F(d) by additivity [L12]; by [L6] that cokernel is a coequalizer of (F(d),F(c)), so by [L5] applied to FD the object F(Q) with the image cocone is a colimit of FD.

2.2step 1.1L3L6

Conversely, if F is cocontinuous then it preserves every coproduct, because a coproduct of a family is the colimit of the discrete diagram on its index set, and it preserves every cokernel, because the cokernel of a morphism f is the coequalizer of (f,0) by [L6] and hence a colimit over a parallel pair; both index categories are small.

3.1step 2.1step 2.2L3

Since the small diagram D of step 2.1 was arbitrary, F preserves every small colimit, that is, F is cocontinuous; together with step 2.2 this shows that preservation of all small colimits is equivalent to preservation of cokernels and all coproducts.

3.2step 2.1step 2.2L2L4L7L8L10

For the right-exact reformulation: a right exact functor preserves cokernels, since a cokernel is a finite colimit [L4]; conversely, if F preserves cokernels and all coproducts, then it preserves the colimit of every finite diagram, because for finite J the coproducts R and S are finite and are finite biproducts of GrMod⁡0(A) [L2, L10] and all finite colimits of the source exist [L8], so the computation of step 2.1 with finite index sets applies verbatim; hence such an F is right exact.

4.1step 1.1step 3.1step 3.2L3L4∎

Combining steps 3.1 and 3.2: F preserves all small colimits if and only if F preserves cokernels and all coproducts if and only if F is right exact and coproduct preserving, so cocontinuity of F is exactly right exactness together with coproduct preservation; the coproducts and cokernels used are the canonical ones of step 1.1, so no choice is made.

Remarks

The object class of Graded Eilenberg-Watts theorem with coherent shifts may be described either by the right exactness-and-sums condition or by cocontinuity. This is an application of this lemma, not a prerequisite for its proof.

Depends on

Used by

Dependency tree · two levels

40 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources