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.
A morphism has a comparison extension between the supplied injective resolutions
Statement
Assume the Axiom of Dependent Choice.
Let be a supplied injective resolution datum on a class in an abelian category. For every morphism with , there exists a coaugmentation-preserving cochain map extending .
Facts & Assumptions
Given: A morphism with .
The datum supplies specific injective resolutions and (Supplied injective resolution data).
Assuming Dependent Choice, injective comparison maps exist for morphisms between chosen injective resolutions (Injective comparison maps exist).
Proof
By [L1], the objects and come with chosen injective resolutions.
Apply [L2] to and the resolutions from step 1.1. The resulting coaugmentation-preserving cochain map is the required comparison extension.
Depends on
Used by
- The right derived map relative to supplied resolution data Definition
- The induced cohomology map is independent of the chosen injective comparison extension Lemma
- Change-of-injective-resolution isomorphisms satisfy identity and cocycle laws Proposition
- Derived functors are well defined relative to supplied resolution data Remark
- Right derived functors relative to supplied data are additive functors Theorem
- Two supplied injective resolution data define naturally isomorphic right derived functors Theorem
Dependency tree · two levels
6 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
- Joseph J. Rotman, An Introduction to Homological Algebra, 2nd ed. (standard reference, not scraped)