Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Module diagrams have projective representables and computable derived colimits

Statement

Assume the Axiom of Choice (AC). For a small category C (Covariant functor, identity functor, composite functor, and contravariant functor), a commutative ring R and AR(C)=Fun⁡(Cop,R-Mod), the category AR(C) is abelian (Abelian category) with pointwise exactness. The diagrams RU=R[Hom⁡C(−,U)] are projective (Projective object), and every diagram has a canonical epimorphism from a direct sum of them. Bounded-above projective replacements can therefore be supplied in this category (Bounded above complexes admit projective replacements), and Lcolim⁡Cop exists there using the published supplied-replacement derived-functor interfaces (Projective complexes model the bounded above derived category, Existence of the bounded above left total derived functor). Moreover colim⁡RU=R, and for a diagram F in degree zero its derived colimit is computed by the bar complex Kn(F)=⨁Un→⋯→U0F(U0) with alternating face differential (the face dropping U0 uses the restriction of coefficients F(U0)→F(U1)); this complex is constructed with the direct-sum total complex of a double complex (Direct sum total complex of a double complex).

Facts & Assumptions

Given: AC; a small category C; a commutative ring R; the functor category AR(C)=Fun⁡(Cop,R-Mod); a diagram F and, where needed, an object U of C.

[F1]

AC: every family of nonempty sets indexed by a set has a choice function (The Axiom of Choice).

[F2]

An abelian category is an additive category in which every morphism has a kernel and a cokernel and the canonical comparison coim⁡(f)→im⁡(f) is an isomorphism; an object P is projective when every morphism P→M lifts along every epimorphism onto M (Abelian category, Projective object).

[F3]

If an abelian category has enough projectives and Xn=0 for n>b, then there is a termwise epic quasi-isomorphism p:P→X with each Pn projective and Pn=0 for n>b, assuming DC for the successive objectwise choices or supplying the successive projective epimorphisms explicitly (Bounded above complexes admit projective replacements).

[F4]

With supplied bounded-above projective replacements (and DC or supplied homotopy lifts), the functor K−(Proj⁡A)→D−(A) is an equivalence of triangulated categories with a quasi-inverse determined by those data (Projective complexes model the bounded above derived category).

[F5]

For an additive functor F and supplied bounded-above projective replacements satisfying the model-equivalence hypotheses, the replacement construction is a functor LF:D−(A)→D−(B) with the terminal universal property in its definition; right exactness of F is not needed (Existence of the bounded above left total derived functor).

[F6]

The direct-sum total complex of a double complex Cp,q has Tn=∐p+q=nCp,q with dnιp,qn=ιp−1,qn−1hp,q+ιp,q−1n−1vp,q (Direct sum total complex of a double complex).

Proof

technique · constructive, with objectwise constructions on functor categories
1.1F2givenconstruct

Abelian structure and pointwise exactness. For objects F,G and a natural transformation φ:F→G, define ker⁡φ, coker⁡φ, im⁡φ and coim⁡φ degreewise by the corresponding constructions in R-Mod, with the unique induced maps making these into functors; the objectwise universal properties provide the required natural transformations, and the identity maps and componentwise addition give the additive structure. A natural transformation is zero exactly when all its components are zero, so it is a monomorphism (epimorphism) exactly when all components are injective (surjective). Every morphism therefore has a kernel and a cokernel, and the canonical comparison coim⁡φ→im⁡φ is an isomorphism because each of its components is; hence AR(C) is abelian, and a sequence in it is exact exactly when it is exact at every object of C.

1.2given

The Yoneda isomorphism. For U∈C put RU=R[Hom⁡C(−,U)], so RU(V) is the free R-module on the set Hom⁡C(V,U) and RU(a), for a:V′→V, sends [b] to [b∘a]. The map η:Nat⁡(RU,F)→F(U), φ↦φU([id⁡U]), is bijective: given s∈F(U) define φVs(∑ca[a])=∑ca F(a)(s), where F(a):F(U)→F(V) is the functoriality of the contravariant diagram F; naturality of φs follows from associativity in C, and the two composites s↦φs↦s and φ↦φφU([id⁡U]) are the identity because [a]=RU(a)([id⁡U]).

1.3given

The colimit of a representable. For fixed U, the maps σV:RU(V)→R, ∑ca[a]↦∑ca, form a cocone over Cop: for a:V′→V one has σV′(RU(a)([b]))=σV′([b∘a])=1=σV([b]) for every basis element. Given any cocone τV:RU(V)→M, the cocone condition applied to the morphism a:U→V of Cop opposite to a:V→U gives τV([a])=τV(RU(a)([id⁡U]))=τU([id⁡U]), so the induced map R→M is forced to send 1 to τU([id⁡U]), and this prescription is well defined and unique; hence the cocone is a colimit cocone and colim⁡RU=R.

2.1F2step 1.2

Representables are projective. Evaluation evU:AR(C)→R-Mod, F↦F(U), is exact by step 1.1 and is represented by RU by step 1.2. If q:E↠M is an epimorphism and f:RU→M, choose s∈E(U) with qU(s)=fU([id⁡U]) and let f~:RU→E correspond to s under step 1.2; then qf~=f after evaluating on [id⁡U], since both sides are natural and RU is generated by that element. Hence RU is projective.

2.2F2step 1.1

The bar complex. For a diagram F put Kn(F)=⨁Un→Un−1→⋯→U0F(U0) for n≥0 and Kn(F)=0 for n<0, the sum over composable chains in C, and define d=∑i=0n(−1)i∂i on degree n by dropping Ui: for i≥1 compose the two adjacent arrows leaving the coefficients F(U0) fixed, while for i=0 drop U0 and apply the map F(U1→U0):F(U0)→F(U1). The simplicial identities for the drop maps give ∂i∂j=∂j−1∂i for i<j and the usual face relations, hence d2=0. Each degree Kn is a direct sum of evaluations, so K is an exact functor of F by step 1.1, and a natural transformation F→F′ induces the evident chain map because it is natural with respect to the coefficient restrictions.

3.1F1F2step 1.1step 1.2step 2.1

A canonical epimorphism; enough projectives. Let ε:∐(U,s), s∈F(U)RU→F have the component RU→F adjoint to s under step 1.2 (send the basis element [id⁡U] to s). For V and t∈F(V), the summand indexed by (V,t) sends [id⁡V] to t, so εV is surjective; by step 1.1 ε is an epimorphism. Every diagram therefore receives an epimorphism from a direct sum of representables. This sum is projective: for a map from it to the target of an epimorphism, each component map has a lift by step 2.1; AC chooses these lifts simultaneously, and the coproduct universal property combines them. Thus AR(C) has enough projectives, and the construction is canonical because its index set consists of all elements of all values of F.

3.2F1F2step 2.1

Direct sums of projectives are projective under AC. Let (Pi)i∈I be a set-indexed family of projective objects with coproduct ∐iPi, let q:E↠M be an epimorphism and f:∐iPi→M. For each i the morphism fιi:Pi→M lifts along q; the set of such lifts is nonempty, so by [F1] there is a choice function on the family of nonempty lift sets. The universal property of the coproduct combines the chosen lifts into f~:∐iPi→E with qf~=f. Hence any direct sum of the objects RU is projective.

3.3step 1.3step 2.2

Contractibility on representables. For F=RW, the complex K(RW) has as a basis the pairs consisting of a chain Un→⋯→U0 and a morphism a:U0→W; adjoining W at the coefficient end gives the chain Un→⋯→U0→aW, with coefficient [id⁡W]. Denote this operator by h; dropping the new W returns the original generator, while all remaining faces cancel against hd, so dh+hd=id⁡ on the augmented complex. In degree −1, send 1∈R to [id⁡W] in the summand at W. This extends the augmentation K0(RW)→colim⁡RW=R of step 1.3. Since the coefficient end is face 0 in the convention of step 2.2, no additional sign is needed. Thus Hn(K(RW))=0 for n>0 and H0(K(RW))=R, and a direct sum of representables, being a degreewise direct sum of these complexes, has the same homology with the direct sum of the contractions.

4.1F1F3F4F5step 3.1

Bounded-above replacements and the left total derived functor. Applying step 3.1 to the kernel of ε and iterating produces, for a bounded-above complex X of diagrams, a successive supply of projective objects and epimorphisms onto the successive kernels; AC implies Dependent Choice, since a choice function on the set of nonempty subsets of the relevant set produces the required dependent sequence by recursion. Hence the hypotheses of [F3] are met with an explicit supply, and [F3] gives a termwise epic quasi-isomorphism P→X with Pn projective and vanishing above the same bound. With these supplied replacements the hypotheses of [F4] and [F5] are satisfied for A=AR(C) and the additive colimit functor, so D−(AR(C)) is modeled by bounded-above projective complexes and the left total derived functor Lcolim⁡Cop:D−(AR(C))→D−(R-Mod) exists with its terminal universal property.

5.1F6step 1.1step 4.1step 2.2step 3.3

The double complex and its two augmentations. For a degree-zero diagram F, choose by step 4.1 a bounded-above projective resolution G∙→F, with Gp a direct sum of representables (using the canonical epimorphism at every stage), Gp=0 for p<0, and each row exact by pointwise exactness of step 1.1. Form the double complex Cp,q=Kq(Gp) for p,q≥0 with the horizontal differential induced by the resolution and the vertical differential (−1)pd of step 2.2; these anticommute, and let T=Tot⁡⊕C be its direct-sum total complex (Direct sum total complex of a double complex). Two augmentations are available: the row augmentation Kq(G0)→Kq(F) makes the rows exact except at p=0, because every G∙(U)→F(U) is a resolution and each Kq is a direct sum of evaluations; and the column augmentation K0(Gp)→colim⁡Gp makes the columns exact except at q=0 by step 3.3. The finite-diagonal elimination for a first-quadrant double complex then shows that both augmentation maps are quasi-isomorphisms: the cone of the augmentation to K(F) is the total complex of the horizontally augmented rows, with the augmented column at p=−1 and a harmless shift/sign. For a cycle in this total, its component of largest q is a horizontal cycle, since no vertical differential enters from a larger q; exactness of the augmented row supplies a horizontal bounding component. Subtracting its total boundary removes that row component and introduces terms only at q−1. Iterating terminates at q=0, where no further vertical term is introduced. Thus the cone is acyclic. For the augmentation to colim⁡G∙, instead augment vertically at q=−1 and eliminate components of largest p using exact columns, decreasing p. Every degree has finitely many contributing bidegrees, so both processes terminate. Consequently K(F) and colim⁡G∙ are canonically isomorphic in D(R), and the latter computes Lcolim⁡CopF by step 4.1.

6.1F4F5step 2.2step 5.1discharge-construct∎

Canonicality and functoriality. Two projective resolutions of F admit comparison chain maps lifting the identity, and any two such comparisons are chain homotopic by projectivity of the terms, so the isomorphism of step 5.1 does not depend on the chosen resolution; the supplied projective-model equivalence of [F4] and the terminal universal property of [F5] identify these comparisons with the canonical maps of the localized category, and the bar description of step 2.2 is natural in F, so the identification is functorial in F. This completes the proof of every clause, the last face being the coefficient restriction described in step 2.2.

Depends on

Used by

Dependency tree · two levels

26 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