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.
FALSE: every infinite coproduct of complexes has homology equal to the coproduct of their homologies
Statement
In every abelian category, whenever an infinite coproduct of chain complexes exists, its homology is the coproduct of the homologies.
Facts & Assumptions
Given: An abelian category with small coproducts and a family of monomorphisms .
There exist abelian categories with small coproducts that do not satisfy AB4.
AB4 means that every small coproduct of monomorphisms is again monic (The axioms AB4 and AB4*).
Degreewise coproducts of complexes, when they exist, are computed degreewise (Products and coproducts of complexes are degreewise when they exist and preserve differentials).
A complex is exact at degree exactly when its th homology is zero (A complex is exact at n exactly when its nth homology is zero).
In an abelian category, a morphism is monic exactly when its kernel is zero (In an abelian category, monic means zero kernel and epic means zero cokernel).
Refutation
For each , form the two-term complex with in degree and in degree . Because is monic, [L4] gives , so [L3] implies for every .
If the statement were true, then by [L2] the coproduct complex would satisfy Its degree- differential is exactly , so [L3] and [L4] would force to be monic. By [L1], that would make every abelian category with small coproducts satisfy AB4.
This contradicts [A1]. Therefore the statement is false.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Charles A. Weibel, An Introduction to Homological Algebra, Appendix A.4 (standard reference, not scraped)