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 complex is exact at n exactly when its nth homology is zero
Statement
Let be a chain complex in an abelian category and let . Then is exact at degree if and only if is a zero object.
Facts & Assumptions
Given: A chain complex and an integer .
Exactness at degree means that the canonical map is an isomorphism (Exactness of a complex at a degree and acyclic complexes).
The homology object is the cokernel of (Homology object of a chain complex).
In an abelian category, a morphism is epic exactly when its cokernel is zero (In an abelian category, monic means zero kernel and epic means zero cokernel).
In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).
Proof
Assume is exact at degree . Then [L1] says is an isomorphism, hence in particular epic. By [L2] and [L3], the cokernel of , namely , is therefore zero.
Conversely, assume is zero. By [L2], the cokernel of is zero, so [L3] makes epic. The map is monic because it factors the monic image inclusion of through the monic cycle inclusion. Hence [L4] makes an isomorphism, and [L1] says that is exact at degree .
Depends on
Used by
Dependency tree · two levels
15 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, §2.7 (standard reference, not scraped)