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.
Cartan-Eilenberg injective resolution of a bounded-below complex
Definition
Let be a cochain complex in an abelian category, with for . We use commuting arrows and , with and . A Cartan–Eilenberg injective resolution is this bicomplex, zero for or , and an augmentation satisfying and , with the following data.
Write , and . The induced vertical complexes, with the augmentations induced by , are injective resolutions of , , and , respectively: In particular every displayed unaugmented term is injective. The sequences and and their augmentation squares are part of the compatibility. Require these two sequences to be split exact in each bidegree; splittings need not commute with and are not distinguished data.
For comparison with Homological double complex, set and twist the vertical arrow by , as in Commuting versus anticommuting double complex conventions. The cohomological version of Direct sum total complex of a double complex is therefore The identity follows from the two square-zero identities and cancellation of the mixed terms. Only occur. Replacing by makes the support first quadrant and shifts total degree by ; the signed differential is the displayed one with the original .
This definition asks for supplied resolution data and makes no existence or choice claim. The zero bicomplex resolves the zero complex. A complex concentrated in one degree may use a single column resolving that object. Empty diagonals are zero; a one-term diagonal is that term. The lower bound may be negative.
Depends on
Used by
Dependency tree · two levels
13 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
- Weibel, Homological Algebra, Section 5.7 (standard reference, not scraped)
- Sharifi, Homological Algebra, Section 4.3 (standard reference, not scraped)