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.
Lifting a morphism from an exact complex into an injective resolution
Statement
Assume the Axiom of Dependent Choice. Let be a coaugmented cochain complex in an abelian category that is exact at every displayed term, and let be a coaugmented cochain complex whose terms are all injective (Injective object, Cochain complex in an abelian category).
Then for every morphism there is a coaugmentation-preserving cochain map , that is and for all (Chain map, A graded morphism of chain complexes); and any two such cochain maps are cochain-homotopic (A chain homotopy).
Facts & Assumptions
An object is injective when every morphism out of a subobject extends over the inclusion (Injective object).
In an abelian category, the canonical map is an isomorphism. Consequently, if vanishes on , the cokernel universal property factors uniquely through and hence through (Abelian category).
A cochain map is a family of morphisms commuting with the differentials, and a cochain homotopy satisfies in the cochain indexing (Chain map, A chain homotopy, Cochain complex in an abelian category).
In ZF, AC implies DC (AC implies DC implies countable choice).
Proof
Given: The Axiom of Dependent Choice, the two coaugmented complexes, and a morphism .
By exactness at the map has zero kernel, so it is a monomorphism; the composite is a morphism out of that subobject into the injective object , so by [F1] there is with . This starts a recursion in degree .
Suppose has been constructed with for (for take the coaugmentation identity of step 1.1). The composite kills the kernel of , which by exactness at is the image of ; hence factors as through the image of by [F2]. By exactness at the image of is the kernel of , so the inclusion is a monomorphism; since is injective, [F1] extends to , and because both sides agree on the quotient . [F1, F2, step 1.1, construct]
By step 2.1 one may choose an extension for every ; the recursion produces a coaugmentation-preserving cochain map , since the identities of step 1.1 and step 2.1 are exactly and . The construction makes one choice of extension in each degree , and the assumed DC, also implied by AC via [F4], ensures that an infinite sequence of nonempty choices of this recursive shape exists; hence the lift exists. [F3, F4, step 2.1]
For the uniqueness, let be coaugmentation-preserving cochain maps and put , so that is a cochain map with . I claim inductively that there are morphisms for , with for , satisfying : for this says , and since kills the kernel of (which equals the image of ) it factors through the image of by [F2], and that factorization extends to by injectivity of [F1]; given , one computes that kills the image of (using the displayed identity in degree and the cochain identity for ), hence factors through the image of , and again [F1] extends it over the inclusion , giving . [F1, F2, F3, step 3.1]
The homotopy identities produced in step 4.1 require one choice in each degree, which the assumed DC provides; the sequence is a cochain homotopy from to in the sense of [F3], so any two coaugmentation-preserving lifts are cochain-homotopic. [F3, F4, step 4.1] ∎
Depends on
Used by
Dependency tree · two levels
24 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
- The Stacks Project, Derived Categories, Section 13.18: Injective resolutions (tags 013P, 013R) (standard reference, not scraped)