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.
The category of complexes in an additive category is additive
Statement
Let denote the category whose objects are \mathbb Z-graded objects of equipped with differentials satisfying , and whose morphisms are chain maps. If is an additive category, then is an additive category.
Facts & Assumptions
Given: An additive category .
An additive category has a zero object and finite biproducts (Additive category).
A biproduct is a common product-coproduct object (Biproduct).
A chain map is a degreewise family commuting with the differentials (Chain map).
Proof
Since is additive, [L1] includes the preadditive structure that supplies zero morphisms, so the displayed chain-complex condition is meaningful in . The zero object of from [L1] therefore gives the zero complex, which is a zero object of because every chain map to or from it is forced degreewise.
For chain complexes and , let using the biproducts from [L1]. Define the differential by . Then , so this is a chain complex, and the degreewise injections and projections are chain maps. By [L2], they make a biproduct in .
Addition of chain maps is defined degreewise on the additive hom-groups of , and the chain-map equation is preserved because composition is bilinear. Together with steps 1.1 and 1.2, [L1] shows that is additive.
Depends on
Used by
Dependency tree · two levels
9 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
- Charles A. Weibel, Chapter 1 of An Introduction to Homological Algebra (standard reference, not scraped)
- Romyar Sharifi, Homological Algebra, Proposition 2.7.5 (standard reference, not scraped)