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.

Contractible cosimplicial evaluation computes diagram derived colimits

Statement

Assume the Axiom of Choice (AC) (The Axiom of Choice). Let C be a small category, R a commutative ring, and U ⁣:Δ→C a cosimplicial object. Suppose that for every V∈C the simplicial set n↦Hom⁡C(Un,V) is contractible (Simplicial sets, homotopies and trivial Kan fibrations). Then for every contravariant R-module diagram F on C the simplicial module chain complex F(U∙) is canonically isomorphic to Lcolim⁡CopF in D(R). The isomorphism is functorial in F, and it is a canonical derived-category roof built from projective resolutions; the contraction choices are used only to prove that the arrows of the roof are quasi-isomorphisms.

Facts & Assumptions

Given: AC; a small category C; a commutative ring R; a cosimplicial U ⁣:Δ→C with Hom⁡C(U∙,V) contractible for every V; a contravariant R-module diagram F.

[F1]

The representable diagrams RV=R[Hom⁡C(−,V)] are projective, evaluation is exact, and F admits a bounded-above projective resolution G∙→F whose terms are direct sums of representables; K(F) is the bar complex and Lcolim⁡CopF is computed by K(F) (Module diagrams have projective representables and computable derived colimits).

[F2]

A homotopy of simplicial sets induces a chain homotopy on free chains, and a homomorphism of simplicial abelian groups which is a homotopy equivalence of underlying simplicial sets induces a quasi-isomorphism of associated complexes (Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion).

[F3]

The direct-sum total complex of a double complex has Tn=∐p+q=nCp,q and differential h+v (Direct sum total complex of a double complex).

[F4]

Two supplied projective replacement systems for the same additive functor give a natural isomorphism of left total derived functors, unique among natural comparisons commuting with the augmentations (Left total derived functor is independent up to a unique augmentation-compatible natural isomorphism).

Proof

1.1F1F3given

The double complex. Choose the supplied representable-sum projective resolution G∙→F of [F1], with Gp=0 for p<0. Form the first-quadrant double complex Ap,q=Gp(Uq) for p,q≥0, with horizontal differential induced by the resolution G∙ and vertical differential induced by the cosimplicial operators of U, one of the two signed so that the total differential squares to zero; let T=Tot⁡⊕A be the direct-sum total complex of [F3]. Each Ap,q is an R-module and each bidegree with p+q=n contributes to a finite direct sum in total degree n.

2.1F1step 1.1

Exact rows. For fixed q the evaluation functor at Uq is exact by [F1], so the row G∙(Uq)→F(Uq) is an exact augmented complex with augmentation F(Uq) in degree zero. Hence the rows of A are exact except for the augmentation to the degree-zero row q↦F(Uq).

2.2F1F2step 1.1

Exact columns. For fixed p the term Gp is a direct sum of representables RV, and RV(U∙)=R[Hom⁡C(U∙,V)] is the free R-module on the simplicial set Hom⁡C(U∙,V). By hypothesis that simplicial set is contractible, so by the prism argument of [F2] its free chain complex is chain homotopy equivalent to R[Δ[0]]. The latter has R in every nonnegative degree, differential zero in odd degrees and identity in positive even degrees; its augmentation to R induces an isomorphism on H0, and its positive homology vanishes. The augmentation of RV(U∙) therefore induces H0≅colim⁡RV=R, and the augmented column is acyclic. Summing over the direct summands, the column Gp(U∙)→colim⁡Gp is acyclic in positive degrees, with H0=colim⁡Gp.

3.1F3step 2.1step 2.2

The roof and its quasi-isomorphisms. The augmentations of steps 2.1 and 2.2 give maps of complexes F(U∙)←T→colim⁡G∙, hence a roof in D(R). Both maps are quasi-isomorphisms by finite-diagonal elimination: the cone of the map to F(U∙) is, up to shift and sign, the total of the horizontally augmented rows. In a total cycle, the component of largest q is a horizontal cycle; exactness of the row in step 2.1 supplies a horizontal lift. Subtract its total boundary, eliminating that component and introducing terms only at q−1, and repeat down to q=0. This proves the cone acyclic. For the second map use the vertically augmented columns and eliminate the component of largest p by step 2.2, introducing terms only at p−1. The augmented indices have lower bound −1, and each degree has finitely many bidegrees, so both eliminations terminate.

4.1F1F4step 3.1∎

Identification with the derived colimit, canonically. By [F1] the complex colim⁡G∙ computes Lcolim⁡CopF. Composing the two quasi-isomorphisms of step 3.1 identifies F(U∙) with it in D(R). Two choices of projective resolution are compared by comparison chain maps lifting the identity, and the resulting roofs agree by [F4] and its uniqueness statement, so the identification is canonical: it does not depend on the supplied replacement, and it is natural in F because comparison lifts are natural and unique up to homotopy. The contraction choices of step 2.2 were used only to obtain the quasi-isomorphisms and do not enter the resulting canonical isomorphism.

Depends on

Used by

Dependency tree · two levels

21 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